./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-39.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-39.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d2a0584d4779790e33dcddf636884f56e9964183aa5c7648270a93d40ce062b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:23:18,069 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:23:18,120 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:23:18,125 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:23:18,128 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:23:18,147 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:23:18,147 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:23:18,147 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:23:18,148 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:23:18,149 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:23:18,149 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:23:18,149 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:23:18,150 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:23:18,150 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:23:18,150 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:23:18,150 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:23:18,150 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:23:18,151 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:23:18,151 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:23:18,151 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:23:18,151 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:23:18,151 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:23:18,151 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:23:18,151 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:23:18,151 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:23:18,151 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:23:18,151 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:23:18,151 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:23:18,151 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:23:18,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:23:18,152 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:23:18,152 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:23:18,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:23:18,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:23:18,152 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:23:18,152 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:23:18,152 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:23:18,152 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:23:18,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:23:18,152 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:23:18,153 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:23:18,153 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:23:18,153 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:23:18,153 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d2a0584d4779790e33dcddf636884f56e9964183aa5c7648270a93d40ce062b0 [2025-03-17 05:23:18,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:23:18,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:23:18,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:23:18,450 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:23:18,450 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:23:18,451 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-39.i [2025-03-17 05:23:19,732 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb66d735d/b1d16c0a9d0b4e94a3deb6e98b1528a8/FLAG593ee149b [2025-03-17 05:23:20,051 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:23:20,055 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-39.i [2025-03-17 05:23:20,064 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb66d735d/b1d16c0a9d0b4e94a3deb6e98b1528a8/FLAG593ee149b [2025-03-17 05:23:20,332 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb66d735d/b1d16c0a9d0b4e94a3deb6e98b1528a8 [2025-03-17 05:23:20,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:23:20,335 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:23:20,336 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:23:20,336 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:23:20,339 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:23:20,340 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:23:20" (1/1) ... [2025-03-17 05:23:20,342 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c79ba62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:20, skipping insertion in model container [2025-03-17 05:23:20,342 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:23:20" (1/1) ... [2025-03-17 05:23:20,359 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:23:20,461 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-39.i[916,929] [2025-03-17 05:23:20,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:23:20,514 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:23:20,521 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-39.i[916,929] [2025-03-17 05:23:20,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:23:20,562 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:23:20,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:20 WrapperNode [2025-03-17 05:23:20,563 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:23:20,564 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:23:20,564 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:23:20,564 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:23:20,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:20" (1/1) ... [2025-03-17 05:23:20,581 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:20" (1/1) ... [2025-03-17 05:23:20,614 INFO L138 Inliner]: procedures = 29, calls = 191, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 601 [2025-03-17 05:23:20,614 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:23:20,615 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:23:20,615 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:23:20,615 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:23:20,621 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:20" (1/1) ... [2025-03-17 05:23:20,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:20" (1/1) ... [2025-03-17 05:23:20,626 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:20" (1/1) ... [2025-03-17 05:23:20,640 INFO L175 MemorySlicer]: Split 160 memory accesses to 5 slices as follows [2, 32, 22, 97, 7]. 61 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 3, 3, 5, 1]. The 16 writes are split as follows [0, 3, 7, 5, 1]. [2025-03-17 05:23:20,643 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:20" (1/1) ... [2025-03-17 05:23:20,643 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:20" (1/1) ... [2025-03-17 05:23:20,661 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:20" (1/1) ... [2025-03-17 05:23:20,662 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:20" (1/1) ... [2025-03-17 05:23:20,665 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:20" (1/1) ... [2025-03-17 05:23:20,666 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:20" (1/1) ... [2025-03-17 05:23:20,676 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:23:20,677 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:23:20,677 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:23:20,677 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:23:20,679 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:20" (1/1) ... [2025-03-17 05:23:20,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:23:20,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:23:20,708 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:23:20,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:23:20,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:23:20,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:23:20,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:23:20,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:23:20,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:23:20,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-17 05:23:20,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:23:20,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:23:20,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:23:20,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:23:20,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:23:20,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:23:20,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:23:20,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:23:20,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:23:20,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-17 05:23:20,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:23:20,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:23:20,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:23:20,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:23:20,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:23:20,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:23:20,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:23:20,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:23:20,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:23:20,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-17 05:23:20,741 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:23:20,741 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:23:20,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:23:20,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:23:20,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:23:20,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:23:20,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:23:20,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:23:20,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:23:20,890 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:23:20,893 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:23:21,446 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L89: havoc property_#t~mem113#1;havoc property_#t~mem106#1;havoc property_#t~mem112#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~ite111#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite131#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~ite122#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~mem123#1;havoc property_#t~ite128#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~mem127#1;havoc property_#t~mem126#1;havoc property_#t~mem130#1;havoc property_#t~mem129#1;havoc property_#t~short132#1;havoc property_#t~mem136#1;havoc property_#t~mem133#1;havoc property_#t~mem134#1;havoc property_#t~bitwise135#1;havoc property_#t~mem137#1;havoc property_#t~ite176#1;havoc property_#t~mem138#1;havoc property_#t~mem139#1;havoc property_#t~mem142#1;havoc property_#t~mem140#1;havoc property_#t~mem141#1;havoc property_#t~ite173#1;havoc property_#t~mem170#1;havoc property_#t~mem148#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~ite147#1;havoc property_#t~mem145#1;havoc property_#t~mem146#1;havoc property_#t~ite155#1;havoc property_#t~mem149#1;havoc property_#t~mem150#1;havoc property_#t~mem151#1;havoc property_#t~ite154#1;havoc property_#t~mem152#1;havoc property_#t~mem153#1;havoc property_#t~ite169#1;havoc property_#t~mem161#1;havoc property_#t~mem156#1;havoc property_#t~mem157#1;havoc property_#t~ite160#1;havoc property_#t~mem158#1;havoc property_#t~mem159#1;havoc property_#t~ite168#1;havoc property_#t~mem162#1;havoc property_#t~mem163#1;havoc property_#t~mem164#1;havoc property_#t~ite167#1;havoc property_#t~mem165#1;havoc property_#t~mem166#1;havoc property_#t~mem172#1;havoc property_#t~mem171#1;havoc property_#t~mem175#1;havoc property_#t~mem174#1;havoc property_#t~short177#1; [2025-03-17 05:23:21,483 INFO L? ?]: Removed 186 outVars from TransFormulas that were not future-live. [2025-03-17 05:23:21,483 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:23:21,499 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:23:21,499 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:23:21,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:23:21 BoogieIcfgContainer [2025-03-17 05:23:21,499 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:23:21,502 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:23:21,502 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:23:21,507 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:23:21,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:23:20" (1/3) ... [2025-03-17 05:23:21,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56225b8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:23:21, skipping insertion in model container [2025-03-17 05:23:21,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:20" (2/3) ... [2025-03-17 05:23:21,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56225b8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:23:21, skipping insertion in model container [2025-03-17 05:23:21,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:23:21" (3/3) ... [2025-03-17 05:23:21,510 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-39.i [2025-03-17 05:23:21,524 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:23:21,526 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-39.i that has 2 procedures, 114 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:23:21,594 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:23:21,610 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@f243cdd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:23:21,610 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:23:21,614 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 96 states have internal predecessors, (138), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:23:21,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 05:23:21,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:21,627 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:21,627 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:21,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:21,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1061202756, now seen corresponding path program 1 times [2025-03-17 05:23:21,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:21,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287805979] [2025-03-17 05:23:21,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:21,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:21,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 05:23:21,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 05:23:21,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:21,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:21,924 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 05:23:21,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:21,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287805979] [2025-03-17 05:23:21,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287805979] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:23:21,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574628768] [2025-03-17 05:23:21,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:21,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:23:21,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:23:21,932 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:23:21,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:23:22,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 05:23:22,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 05:23:22,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:22,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:22,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:23:22,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:22,253 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 05:23:22,256 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:23:22,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574628768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:22,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:23:22,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:23:22,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979409310] [2025-03-17 05:23:22,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:22,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:23:22,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:22,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:23:22,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:23:22,286 INFO L87 Difference]: Start difference. First operand has 114 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 96 states have internal predecessors, (138), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:23:22,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:22,317 INFO L93 Difference]: Finished difference Result 225 states and 354 transitions. [2025-03-17 05:23:22,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:23:22,320 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 124 [2025-03-17 05:23:22,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:22,326 INFO L225 Difference]: With dead ends: 225 [2025-03-17 05:23:22,327 INFO L226 Difference]: Without dead ends: 112 [2025-03-17 05:23:22,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:23:22,333 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:22,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:23:22,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-17 05:23:22,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-17 05:23:22,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 94 states have (on average 1.425531914893617) internal successors, (134), 94 states have internal predecessors, (134), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:23:22,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 166 transitions. [2025-03-17 05:23:22,372 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 166 transitions. Word has length 124 [2025-03-17 05:23:22,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:22,372 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 166 transitions. [2025-03-17 05:23:22,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:23:22,373 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 166 transitions. [2025-03-17 05:23:22,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 05:23:22,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:22,376 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:22,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:23:22,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:23:22,581 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:22,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:22,583 INFO L85 PathProgramCache]: Analyzing trace with hash -820556694, now seen corresponding path program 1 times [2025-03-17 05:23:22,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:22,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566652239] [2025-03-17 05:23:22,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:22,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:22,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 05:23:22,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 05:23:22,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:22,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:22,871 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:23:22,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:22,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566652239] [2025-03-17 05:23:22,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566652239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:22,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:22,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:23:22,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302992370] [2025-03-17 05:23:22,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:22,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:23:22,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:22,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:23:22,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:23:22,876 INFO L87 Difference]: Start difference. First operand 112 states and 166 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:23:22,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:22,922 INFO L93 Difference]: Finished difference Result 225 states and 334 transitions. [2025-03-17 05:23:22,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:23:22,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 124 [2025-03-17 05:23:22,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:22,925 INFO L225 Difference]: With dead ends: 225 [2025-03-17 05:23:22,925 INFO L226 Difference]: Without dead ends: 114 [2025-03-17 05:23:22,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:23:22,926 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:22,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 475 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:23:22,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-17 05:23:22,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-03-17 05:23:22,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 96 states have (on average 1.4166666666666667) internal successors, (136), 96 states have internal predecessors, (136), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:23:22,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 168 transitions. [2025-03-17 05:23:22,941 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 168 transitions. Word has length 124 [2025-03-17 05:23:22,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:22,944 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 168 transitions. [2025-03-17 05:23:22,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:23:22,945 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 168 transitions. [2025-03-17 05:23:22,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 05:23:22,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:22,946 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:22,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:23:22,946 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:22,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:22,946 INFO L85 PathProgramCache]: Analyzing trace with hash 463354473, now seen corresponding path program 1 times [2025-03-17 05:23:22,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:22,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158732757] [2025-03-17 05:23:22,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:22,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:22,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 05:23:23,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 05:23:23,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:23,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:26,092 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:23:26,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:26,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158732757] [2025-03-17 05:23:26,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158732757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:26,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:26,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 05:23:26,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150443132] [2025-03-17 05:23:26,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:26,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 05:23:26,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:26,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 05:23:26,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:23:26,095 INFO L87 Difference]: Start difference. First operand 114 states and 168 transitions. Second operand has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 14 states have internal predecessors, (47), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:23:27,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:27,742 INFO L93 Difference]: Finished difference Result 422 states and 616 transitions. [2025-03-17 05:23:27,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 05:23:27,744 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 14 states have internal predecessors, (47), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 124 [2025-03-17 05:23:27,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:27,746 INFO L225 Difference]: With dead ends: 422 [2025-03-17 05:23:27,746 INFO L226 Difference]: Without dead ends: 309 [2025-03-17 05:23:27,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:23:27,747 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 329 mSDsluCounter, 1424 mSDsCounter, 0 mSdLazyCounter, 1194 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1576 SdHoareTripleChecker+Invalid, 1222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:27,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1576 Invalid, 1222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1194 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 05:23:27,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-03-17 05:23:27,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 275. [2025-03-17 05:23:27,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 242 states have (on average 1.4297520661157024) internal successors, (346), 244 states have internal predecessors, (346), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 05:23:27,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 402 transitions. [2025-03-17 05:23:27,783 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 402 transitions. Word has length 124 [2025-03-17 05:23:27,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:27,784 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 402 transitions. [2025-03-17 05:23:27,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 14 states have internal predecessors, (47), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:23:27,784 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 402 transitions. [2025-03-17 05:23:27,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 05:23:27,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:27,789 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:27,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:23:27,790 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:27,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:27,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1344099990, now seen corresponding path program 1 times [2025-03-17 05:23:27,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:27,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533259134] [2025-03-17 05:23:27,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:27,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:27,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 05:23:27,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 05:23:27,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:27,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:28,452 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:23:28,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:28,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533259134] [2025-03-17 05:23:28,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533259134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:28,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:28,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:23:28,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868738905] [2025-03-17 05:23:28,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:28,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:23:28,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:28,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:23:28,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:23:28,455 INFO L87 Difference]: Start difference. First operand 275 states and 402 transitions. Second operand has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:23:28,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:28,834 INFO L93 Difference]: Finished difference Result 636 states and 930 transitions. [2025-03-17 05:23:28,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:23:28,835 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 124 [2025-03-17 05:23:28,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:28,838 INFO L225 Difference]: With dead ends: 636 [2025-03-17 05:23:28,838 INFO L226 Difference]: Without dead ends: 362 [2025-03-17 05:23:28,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:23:28,839 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 124 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:28,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 737 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:23:28,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-03-17 05:23:28,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 278. [2025-03-17 05:23:28,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 245 states have (on average 1.4244897959183673) internal successors, (349), 247 states have internal predecessors, (349), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 05:23:28,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 405 transitions. [2025-03-17 05:23:28,873 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 405 transitions. Word has length 124 [2025-03-17 05:23:28,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:28,874 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 405 transitions. [2025-03-17 05:23:28,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:23:28,874 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 405 transitions. [2025-03-17 05:23:28,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 05:23:28,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:28,875 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:28,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:23:28,876 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:28,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:28,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1816664170, now seen corresponding path program 1 times [2025-03-17 05:23:28,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:28,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107116744] [2025-03-17 05:23:28,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:28,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:28,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 05:23:28,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 05:23:28,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:28,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:29,547 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:23:29,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:29,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107116744] [2025-03-17 05:23:29,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107116744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:29,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:29,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:23:29,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299490683] [2025-03-17 05:23:29,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:29,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:23:29,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:29,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:23:29,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:23:29,548 INFO L87 Difference]: Start difference. First operand 278 states and 405 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:23:29,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:29,873 INFO L93 Difference]: Finished difference Result 563 states and 815 transitions. [2025-03-17 05:23:29,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:23:29,875 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 124 [2025-03-17 05:23:29,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:29,877 INFO L225 Difference]: With dead ends: 563 [2025-03-17 05:23:29,877 INFO L226 Difference]: Without dead ends: 286 [2025-03-17 05:23:29,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:23:29,878 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 124 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:29,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 735 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:23:29,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-03-17 05:23:29,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 219. [2025-03-17 05:23:29,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 191 states have (on average 1.4083769633507854) internal successors, (269), 192 states have internal predecessors, (269), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 05:23:29,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 315 transitions. [2025-03-17 05:23:29,901 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 315 transitions. Word has length 124 [2025-03-17 05:23:29,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:29,902 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 315 transitions. [2025-03-17 05:23:29,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:23:29,903 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 315 transitions. [2025-03-17 05:23:29,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 05:23:29,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:29,904 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:29,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:23:29,904 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:29,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:29,905 INFO L85 PathProgramCache]: Analyzing trace with hash 9209707, now seen corresponding path program 1 times [2025-03-17 05:23:29,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:29,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691399005] [2025-03-17 05:23:29,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:29,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:29,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 05:23:29,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 05:23:29,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:29,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:30,983 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:23:30,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:30,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691399005] [2025-03-17 05:23:30,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691399005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:30,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:30,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:23:30,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587598138] [2025-03-17 05:23:30,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:30,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:23:30,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:30,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:23:30,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:23:30,986 INFO L87 Difference]: Start difference. First operand 219 states and 315 transitions. Second operand has 10 states, 8 states have (on average 5.875) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-17 05:23:31,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:31,772 INFO L93 Difference]: Finished difference Result 503 states and 723 transitions. [2025-03-17 05:23:31,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:23:31,773 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.875) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 124 [2025-03-17 05:23:31,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:31,775 INFO L225 Difference]: With dead ends: 503 [2025-03-17 05:23:31,775 INFO L226 Difference]: Without dead ends: 285 [2025-03-17 05:23:31,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:23:31,776 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 122 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:31,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 1601 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:23:31,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-03-17 05:23:31,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 221. [2025-03-17 05:23:31,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 193 states have (on average 1.4041450777202074) internal successors, (271), 194 states have internal predecessors, (271), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 05:23:31,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 317 transitions. [2025-03-17 05:23:31,802 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 317 transitions. Word has length 124 [2025-03-17 05:23:31,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:31,802 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 317 transitions. [2025-03-17 05:23:31,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.875) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-17 05:23:31,803 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 317 transitions. [2025-03-17 05:23:31,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:23:31,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:31,804 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:31,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:23:31,804 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:31,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:31,805 INFO L85 PathProgramCache]: Analyzing trace with hash 542999640, now seen corresponding path program 1 times [2025-03-17 05:23:31,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:31,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017502206] [2025-03-17 05:23:31,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:31,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:31,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:23:31,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:23:31,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:31,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:33,312 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 05:23:33,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:33,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017502206] [2025-03-17 05:23:33,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017502206] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:23:33,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545579012] [2025-03-17 05:23:33,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:33,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:23:33,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:23:33,319 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:23:33,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 05:23:33,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:23:33,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:23:33,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:33,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:33,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-17 05:23:33,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:33,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 100 [2025-03-17 05:23:34,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:23:34,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 131 treesize of output 47 [2025-03-17 05:23:34,109 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 213 proven. 12 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-03-17 05:23:34,109 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:23:34,682 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:23:34,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545579012] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:23:34,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:23:34,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16, 13] total 29 [2025-03-17 05:23:34,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568301279] [2025-03-17 05:23:34,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:34,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:23:34,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:34,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:23:34,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2025-03-17 05:23:34,683 INFO L87 Difference]: Start difference. First operand 221 states and 317 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:23:35,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:35,342 INFO L93 Difference]: Finished difference Result 532 states and 762 transitions. [2025-03-17 05:23:35,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:23:35,344 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 125 [2025-03-17 05:23:35,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:35,346 INFO L225 Difference]: With dead ends: 532 [2025-03-17 05:23:35,346 INFO L226 Difference]: Without dead ends: 312 [2025-03-17 05:23:35,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=137, Invalid=919, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 05:23:35,347 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 227 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:35,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 971 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:23:35,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-03-17 05:23:35,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 234. [2025-03-17 05:23:35,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 206 states have (on average 1.4174757281553398) internal successors, (292), 207 states have internal predecessors, (292), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 05:23:35,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 338 transitions. [2025-03-17 05:23:35,373 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 338 transitions. Word has length 125 [2025-03-17 05:23:35,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:35,374 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 338 transitions. [2025-03-17 05:23:35,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:23:35,374 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 338 transitions. [2025-03-17 05:23:35,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 05:23:35,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:35,375 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:35,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 05:23:35,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-17 05:23:35,576 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:35,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:35,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1642620064, now seen corresponding path program 1 times [2025-03-17 05:23:35,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:35,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125275231] [2025-03-17 05:23:35,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:35,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:35,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 05:23:35,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 05:23:35,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:35,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:35,807 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:23:35,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:35,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125275231] [2025-03-17 05:23:35,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125275231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:35,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:35,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:23:35,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780245343] [2025-03-17 05:23:35,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:35,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:23:35,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:35,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:23:35,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:23:35,810 INFO L87 Difference]: Start difference. First operand 234 states and 338 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:23:36,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:36,102 INFO L93 Difference]: Finished difference Result 566 states and 814 transitions. [2025-03-17 05:23:36,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:23:36,105 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2025-03-17 05:23:36,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:36,108 INFO L225 Difference]: With dead ends: 566 [2025-03-17 05:23:36,108 INFO L226 Difference]: Without dead ends: 333 [2025-03-17 05:23:36,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:23:36,110 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 117 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:36,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 750 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:23:36,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-17 05:23:36,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 256. [2025-03-17 05:23:36,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 228 states have (on average 1.4210526315789473) internal successors, (324), 229 states have internal predecessors, (324), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 05:23:36,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 370 transitions. [2025-03-17 05:23:36,138 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 370 transitions. Word has length 126 [2025-03-17 05:23:36,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:36,139 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 370 transitions. [2025-03-17 05:23:36,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:23:36,139 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 370 transitions. [2025-03-17 05:23:36,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 05:23:36,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:36,140 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:36,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:23:36,141 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:36,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:36,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1745012184, now seen corresponding path program 1 times [2025-03-17 05:23:36,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:36,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098157606] [2025-03-17 05:23:36,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:36,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:36,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 05:23:36,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 05:23:36,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:36,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:37,055 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:23:37,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:37,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098157606] [2025-03-17 05:23:37,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098157606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:37,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:37,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:23:37,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072506938] [2025-03-17 05:23:37,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:37,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:23:37,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:37,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:23:37,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:23:37,057 INFO L87 Difference]: Start difference. First operand 256 states and 370 transitions. Second operand has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:23:37,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:37,875 INFO L93 Difference]: Finished difference Result 659 states and 944 transitions. [2025-03-17 05:23:37,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:23:37,876 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 127 [2025-03-17 05:23:37,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:37,878 INFO L225 Difference]: With dead ends: 659 [2025-03-17 05:23:37,878 INFO L226 Difference]: Without dead ends: 404 [2025-03-17 05:23:37,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:23:37,879 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 128 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:37,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1263 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:23:37,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-03-17 05:23:37,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 257. [2025-03-17 05:23:37,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 229 states have (on average 1.4192139737991267) internal successors, (325), 230 states have internal predecessors, (325), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 05:23:37,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 371 transitions. [2025-03-17 05:23:37,907 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 371 transitions. Word has length 127 [2025-03-17 05:23:37,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:37,908 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 371 transitions. [2025-03-17 05:23:37,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:23:37,908 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 371 transitions. [2025-03-17 05:23:37,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 05:23:37,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:37,910 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:37,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:23:37,910 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:37,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:37,910 INFO L85 PathProgramCache]: Analyzing trace with hash 660066383, now seen corresponding path program 1 times [2025-03-17 05:23:37,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:37,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686295301] [2025-03-17 05:23:37,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:37,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:37,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 05:23:37,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 05:23:37,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:37,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:38,019 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:23:38,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:38,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686295301] [2025-03-17 05:23:38,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686295301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:38,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:38,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:23:38,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547038728] [2025-03-17 05:23:38,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:38,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:23:38,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:38,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:23:38,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:23:38,025 INFO L87 Difference]: Start difference. First operand 257 states and 371 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:23:38,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:38,325 INFO L93 Difference]: Finished difference Result 596 states and 854 transitions. [2025-03-17 05:23:38,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:23:38,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2025-03-17 05:23:38,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:38,328 INFO L225 Difference]: With dead ends: 596 [2025-03-17 05:23:38,328 INFO L226 Difference]: Without dead ends: 340 [2025-03-17 05:23:38,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:23:38,329 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 129 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:38,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 493 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:23:38,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-03-17 05:23:38,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 337. [2025-03-17 05:23:38,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 295 states have (on average 1.3966101694915254) internal successors, (412), 297 states have internal predecessors, (412), 34 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:23:38,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 480 transitions. [2025-03-17 05:23:38,360 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 480 transitions. Word has length 129 [2025-03-17 05:23:38,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:38,361 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 480 transitions. [2025-03-17 05:23:38,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:23:38,362 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 480 transitions. [2025-03-17 05:23:38,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:23:38,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:38,366 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:38,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:23:38,367 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:38,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:38,367 INFO L85 PathProgramCache]: Analyzing trace with hash 749137251, now seen corresponding path program 1 times [2025-03-17 05:23:38,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:38,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827854102] [2025-03-17 05:23:38,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:38,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:38,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:23:38,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:23:38,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:38,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:38,510 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:23:38,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:38,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827854102] [2025-03-17 05:23:38,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827854102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:38,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:38,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:23:38,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9598409] [2025-03-17 05:23:38,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:38,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:23:38,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:38,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:23:38,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:23:38,512 INFO L87 Difference]: Start difference. First operand 337 states and 480 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:23:38,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:38,870 INFO L93 Difference]: Finished difference Result 673 states and 954 transitions. [2025-03-17 05:23:38,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:23:38,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 130 [2025-03-17 05:23:38,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:38,873 INFO L225 Difference]: With dead ends: 673 [2025-03-17 05:23:38,873 INFO L226 Difference]: Without dead ends: 337 [2025-03-17 05:23:38,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:23:38,875 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 120 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:38,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 536 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:23:38,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-03-17 05:23:38,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 334. [2025-03-17 05:23:38,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 291 states have (on average 1.388316151202749) internal successors, (404), 293 states have internal predecessors, (404), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:23:38,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 472 transitions. [2025-03-17 05:23:38,908 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 472 transitions. Word has length 130 [2025-03-17 05:23:38,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:38,909 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 472 transitions. [2025-03-17 05:23:38,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:23:38,909 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 472 transitions. [2025-03-17 05:23:38,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:23:38,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:38,911 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:38,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:23:38,911 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:38,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:38,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1416434361, now seen corresponding path program 1 times [2025-03-17 05:23:38,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:38,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103707167] [2025-03-17 05:23:38,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:38,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:38,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:23:38,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:23:38,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:38,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:39,168 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:23:39,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:39,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103707167] [2025-03-17 05:23:39,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103707167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:39,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:39,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:23:39,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553154719] [2025-03-17 05:23:39,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:39,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:23:39,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:39,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:23:39,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:23:39,171 INFO L87 Difference]: Start difference. First operand 334 states and 472 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:23:39,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:39,479 INFO L93 Difference]: Finished difference Result 588 states and 815 transitions. [2025-03-17 05:23:39,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:23:39,479 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 130 [2025-03-17 05:23:39,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:39,483 INFO L225 Difference]: With dead ends: 588 [2025-03-17 05:23:39,484 INFO L226 Difference]: Without dead ends: 586 [2025-03-17 05:23:39,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:23:39,485 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 101 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:39,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 1028 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:23:39,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-03-17 05:23:39,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 392. [2025-03-17 05:23:39,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 349 states have (on average 1.3581661891117478) internal successors, (474), 351 states have internal predecessors, (474), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:23:39,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 542 transitions. [2025-03-17 05:23:39,527 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 542 transitions. Word has length 130 [2025-03-17 05:23:39,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:39,528 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 542 transitions. [2025-03-17 05:23:39,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:23:39,528 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 542 transitions. [2025-03-17 05:23:39,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:23:39,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:39,530 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:39,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:23:39,530 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:39,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:39,531 INFO L85 PathProgramCache]: Analyzing trace with hash -286734346, now seen corresponding path program 1 times [2025-03-17 05:23:39,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:39,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107497204] [2025-03-17 05:23:39,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:39,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:39,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:23:39,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:23:39,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:39,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:40,308 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:23:40,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:40,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107497204] [2025-03-17 05:23:40,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107497204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:40,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:40,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:23:40,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203217195] [2025-03-17 05:23:40,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:40,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:23:40,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:40,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:23:40,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:23:40,310 INFO L87 Difference]: Start difference. First operand 392 states and 542 transitions. Second operand has 11 states, 10 states have (on average 5.4) internal successors, (54), 11 states have internal predecessors, (54), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:23:41,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:41,055 INFO L93 Difference]: Finished difference Result 913 states and 1267 transitions. [2025-03-17 05:23:41,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:23:41,056 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 11 states have internal predecessors, (54), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2025-03-17 05:23:41,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:41,058 INFO L225 Difference]: With dead ends: 913 [2025-03-17 05:23:41,058 INFO L226 Difference]: Without dead ends: 522 [2025-03-17 05:23:41,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:23:41,061 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 317 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1320 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:41,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1320 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:23:41,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-03-17 05:23:41,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 433. [2025-03-17 05:23:41,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 390 states have (on average 1.3692307692307693) internal successors, (534), 392 states have internal predecessors, (534), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:23:41,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 602 transitions. [2025-03-17 05:23:41,091 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 602 transitions. Word has length 131 [2025-03-17 05:23:41,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:41,092 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 602 transitions. [2025-03-17 05:23:41,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 11 states have internal predecessors, (54), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:23:41,094 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 602 transitions. [2025-03-17 05:23:41,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 05:23:41,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:41,095 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:41,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 05:23:41,095 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:41,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:41,096 INFO L85 PathProgramCache]: Analyzing trace with hash 482771684, now seen corresponding path program 1 times [2025-03-17 05:23:41,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:41,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043018887] [2025-03-17 05:23:41,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:41,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:41,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 05:23:41,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 05:23:41,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:41,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:41,192 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:23:41,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:41,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043018887] [2025-03-17 05:23:41,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043018887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:41,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:41,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:23:41,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542339179] [2025-03-17 05:23:41,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:41,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:23:41,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:41,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:23:41,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:23:41,194 INFO L87 Difference]: Start difference. First operand 433 states and 602 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:23:41,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:41,427 INFO L93 Difference]: Finished difference Result 1153 states and 1599 transitions. [2025-03-17 05:23:41,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:23:41,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2025-03-17 05:23:41,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:41,430 INFO L225 Difference]: With dead ends: 1153 [2025-03-17 05:23:41,431 INFO L226 Difference]: Without dead ends: 721 [2025-03-17 05:23:41,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:23:41,432 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 109 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:41,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 408 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:23:41,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2025-03-17 05:23:41,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 502. [2025-03-17 05:23:41,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 459 states have (on average 1.363834422657952) internal successors, (626), 461 states have internal predecessors, (626), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:23:41,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 694 transitions. [2025-03-17 05:23:41,467 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 694 transitions. Word has length 132 [2025-03-17 05:23:41,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:41,467 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 694 transitions. [2025-03-17 05:23:41,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:23:41,468 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 694 transitions. [2025-03-17 05:23:41,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 05:23:41,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:41,469 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:41,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 05:23:41,469 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:41,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:41,470 INFO L85 PathProgramCache]: Analyzing trace with hash 87214172, now seen corresponding path program 1 times [2025-03-17 05:23:41,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:41,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524172983] [2025-03-17 05:23:41,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:41,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:41,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 05:23:41,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 05:23:41,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:41,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:42,017 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:23:42,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:42,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524172983] [2025-03-17 05:23:42,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524172983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:42,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:42,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:23:42,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126760508] [2025-03-17 05:23:42,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:42,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:23:42,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:42,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:23:42,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:23:42,019 INFO L87 Difference]: Start difference. First operand 502 states and 694 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:23:42,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:42,594 INFO L93 Difference]: Finished difference Result 1044 states and 1441 transitions. [2025-03-17 05:23:42,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:23:42,596 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2025-03-17 05:23:42,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:42,602 INFO L225 Difference]: With dead ends: 1044 [2025-03-17 05:23:42,602 INFO L226 Difference]: Without dead ends: 543 [2025-03-17 05:23:42,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:23:42,604 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 204 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:42,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1023 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:23:42,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-03-17 05:23:42,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 504. [2025-03-17 05:23:42,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 461 states have (on average 1.3622559652928417) internal successors, (628), 463 states have internal predecessors, (628), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:23:42,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 696 transitions. [2025-03-17 05:23:42,643 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 696 transitions. Word has length 132 [2025-03-17 05:23:42,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:42,644 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 696 transitions. [2025-03-17 05:23:42,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:23:42,644 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 696 transitions. [2025-03-17 05:23:42,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 05:23:42,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:42,646 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:42,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 05:23:42,646 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:42,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:42,647 INFO L85 PathProgramCache]: Analyzing trace with hash 825640223, now seen corresponding path program 1 times [2025-03-17 05:23:42,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:42,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192430434] [2025-03-17 05:23:42,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:42,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:42,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 05:23:42,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 05:23:42,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:42,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:42,799 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:23:42,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:42,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192430434] [2025-03-17 05:23:42,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192430434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:42,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:42,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:23:42,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631928115] [2025-03-17 05:23:42,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:42,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:23:42,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:42,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:23:42,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:23:42,800 INFO L87 Difference]: Start difference. First operand 504 states and 696 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:23:43,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:43,052 INFO L93 Difference]: Finished difference Result 1141 states and 1571 transitions. [2025-03-17 05:23:43,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:23:43,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2025-03-17 05:23:43,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:43,055 INFO L225 Difference]: With dead ends: 1141 [2025-03-17 05:23:43,055 INFO L226 Difference]: Without dead ends: 638 [2025-03-17 05:23:43,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:23:43,056 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 110 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:43,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 716 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:23:43,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2025-03-17 05:23:43,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 338. [2025-03-17 05:23:43,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 317 states have (on average 1.362776025236593) internal successors, (432), 317 states have internal predecessors, (432), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:23:43,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 464 transitions. [2025-03-17 05:23:43,075 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 464 transitions. Word has length 132 [2025-03-17 05:23:43,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:43,075 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 464 transitions. [2025-03-17 05:23:43,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:23:43,075 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 464 transitions. [2025-03-17 05:23:43,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 05:23:43,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:43,077 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:43,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 05:23:43,077 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:43,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:43,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1878333038, now seen corresponding path program 1 times [2025-03-17 05:23:43,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:43,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863966648] [2025-03-17 05:23:43,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:43,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:43,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 05:23:43,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 05:23:43,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:43,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:43,298 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:23:43,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:43,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863966648] [2025-03-17 05:23:43,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863966648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:43,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:43,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:23:43,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404219055] [2025-03-17 05:23:43,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:43,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:23:43,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:43,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:23:43,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:23:43,302 INFO L87 Difference]: Start difference. First operand 338 states and 464 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:23:43,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:43,653 INFO L93 Difference]: Finished difference Result 891 states and 1222 transitions. [2025-03-17 05:23:43,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:23:43,654 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2025-03-17 05:23:43,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:43,657 INFO L225 Difference]: With dead ends: 891 [2025-03-17 05:23:43,657 INFO L226 Difference]: Without dead ends: 554 [2025-03-17 05:23:43,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:23:43,658 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 119 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:43,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1207 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:23:43,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-03-17 05:23:43,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 551. [2025-03-17 05:23:43,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 518 states have (on average 1.3571428571428572) internal successors, (703), 519 states have internal predecessors, (703), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-17 05:23:43,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 753 transitions. [2025-03-17 05:23:43,688 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 753 transitions. Word has length 133 [2025-03-17 05:23:43,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:43,688 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 753 transitions. [2025-03-17 05:23:43,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:23:43,688 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 753 transitions. [2025-03-17 05:23:43,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 05:23:43,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:43,689 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:43,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 05:23:43,690 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:43,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:43,690 INFO L85 PathProgramCache]: Analyzing trace with hash 609179795, now seen corresponding path program 1 times [2025-03-17 05:23:43,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:43,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670585295] [2025-03-17 05:23:43,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:43,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:43,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 05:23:43,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 05:23:43,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:43,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:23:43,739 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:23:43,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 05:23:43,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 05:23:43,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:43,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:23:43,848 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:23:43,848 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:23:43,849 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:23:43,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 05:23:43,856 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:43,948 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:23:43,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:23:43 BoogieIcfgContainer [2025-03-17 05:23:43,952 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:23:43,953 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:23:43,953 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:23:43,953 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:23:43,973 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:23:21" (3/4) ... [2025-03-17 05:23:43,981 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:23:43,982 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:23:43,983 INFO L158 Benchmark]: Toolchain (without parser) took 23647.28ms. Allocated memory was 142.6MB in the beginning and 838.9MB in the end (delta: 696.3MB). Free memory was 104.5MB in the beginning and 796.6MB in the end (delta: -692.1MB). Peak memory consumption was 408.3MB. Max. memory is 16.1GB. [2025-03-17 05:23:43,983 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory was 126.7MB in the beginning and 126.4MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:23:43,983 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.08ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 89.6MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:23:43,983 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.84ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 85.6MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:23:43,984 INFO L158 Benchmark]: Boogie Preprocessor took 61.25ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 81.2MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:23:43,985 INFO L158 Benchmark]: IcfgBuilder took 822.74ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 45.6MB in the end (delta: 35.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 05:23:43,986 INFO L158 Benchmark]: TraceAbstraction took 22450.24ms. Allocated memory was 142.6MB in the beginning and 696.3MB in the end (delta: 553.6MB). Free memory was 44.6MB in the beginning and 257.4MB in the end (delta: -212.8MB). Peak memory consumption was 339.6MB. Max. memory is 16.1GB. [2025-03-17 05:23:43,986 INFO L158 Benchmark]: Witness Printer took 28.85ms. Allocated memory was 696.3MB in the beginning and 838.9MB in the end (delta: 142.6MB). Free memory was 257.4MB in the beginning and 796.6MB in the end (delta: -539.2MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2025-03-17 05:23:43,988 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory was 126.7MB in the beginning and 126.4MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.08ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 89.6MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.84ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 85.6MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 61.25ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 81.2MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 822.74ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 45.6MB in the end (delta: 35.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 22450.24ms. Allocated memory was 142.6MB in the beginning and 696.3MB in the end (delta: 553.6MB). Free memory was 44.6MB in the beginning and 257.4MB in the end (delta: -212.8MB). Peak memory consumption was 339.6MB. Max. memory is 16.1GB. * Witness Printer took 28.85ms. Allocated memory was 696.3MB in the beginning and 838.9MB in the end (delta: 142.6MB). Free memory was 257.4MB in the beginning and 796.6MB in the end (delta: -539.2MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 61, overapproximation of someBinaryFLOATComparisonOperation at line 63, overapproximation of someBinaryFLOATComparisonOperation at line 61, overapproximation of someBinaryFLOATComparisonOperation at line 65, overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someBinaryFLOATComparisonOperation at line 39, overapproximation of someBinaryFLOATComparisonOperation at line 63, overapproximation of someBinaryFLOATComparisonOperation at line 39, overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someBinaryFLOATComparisonOperation at line 65, overapproximation of someUnaryFLOAToperation at line 89, overapproximation of someUnaryFLOAToperation at line 39. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] float float_Array_0[3] = { 1.75, 7.8, 1.1 }; [L22-L24] float float_Array_0[3] = { 1.75, 7.8, 1.1 }; [L22-L24] float float_Array_0[3] = { 1.75, 7.8, 1.1 }; [L22-L24] float float_Array_0[3] = { 1.75, 7.8, 1.1 }; [L25-L27] signed long int signed_long_int_Array_0[3] = { 1230482582, 32, 5 }; [L25-L27] signed long int signed_long_int_Array_0[3] = { 1230482582, 32, 5 }; [L25-L27] signed long int signed_long_int_Array_0[3] = { 1230482582, 32, 5 }; [L25-L27] signed long int signed_long_int_Array_0[3] = { 1230482582, 32, 5 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 32, 10, 1000, 0, -5 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 32, 10, 1000, 0, -5 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 32, 10, 1000, 0, -5 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 32, 10, 1000, 0, -5 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 32, 10, 1000, 0, -5 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 32, 10, 1000, 0, -5 }; [L31-L33] unsigned char unsigned_char_Array_0[1] = { 64 }; [L31-L33] unsigned char unsigned_char_Array_0[1] = { 64 }; [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] FCALL updateLastVariables() [L97] CALL updateVariables() [L60] float_Array_0[0] = __VERIFIER_nondet_float() [L61] EXPR float_Array_0[0] [L61] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L61] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L61] EXPR float_Array_0[0] [L61] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L61] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L61] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L61] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L61] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L62] float_Array_0[1] = __VERIFIER_nondet_float() [L63] EXPR float_Array_0[1] [L63] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L63] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F [L63] EXPR float_Array_0[1] [L63] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L63] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L63] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L63] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L63] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L64] float_Array_0[2] = __VERIFIER_nondet_float() [L65] EXPR float_Array_0[2] [L65] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L65] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F [L65] EXPR float_Array_0[2] [L65] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L65] EXPR (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L65] EXPR (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L65] CALL assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L65] RET assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L66] signed_long_int_Array_0[0] = __VERIFIER_nondet_long() [L67] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L67] CALL assume_abort_if_not(signed_long_int_Array_0[0] >= 1073741823) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L67] RET assume_abort_if_not(signed_long_int_Array_0[0] >= 1073741823) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L68] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L68] CALL assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L68] RET assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L69] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L70] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L70] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L70] RET assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L71] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L71] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L71] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L72] signed_short_int_Array_0[1] = __VERIFIER_nondet_short() [L73] EXPR signed_short_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L73] CALL assume_abort_if_not(signed_short_int_Array_0[1] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L73] RET assume_abort_if_not(signed_short_int_Array_0[1] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L74] EXPR signed_short_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L74] CALL assume_abort_if_not(signed_short_int_Array_0[1] <= 16383) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L74] RET assume_abort_if_not(signed_short_int_Array_0[1] <= 16383) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] signed_short_int_Array_0[2] = __VERIFIER_nondet_short() [L76] EXPR signed_short_int_Array_0[2] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L76] CALL assume_abort_if_not(signed_short_int_Array_0[2] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L76] RET assume_abort_if_not(signed_short_int_Array_0[2] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] EXPR signed_short_int_Array_0[2] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] CALL assume_abort_if_not(signed_short_int_Array_0[2] <= 16383) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] RET assume_abort_if_not(signed_short_int_Array_0[2] <= 16383) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] signed_short_int_Array_0[3] = __VERIFIER_nondet_short() [L79] EXPR signed_short_int_Array_0[3] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L79] CALL assume_abort_if_not(signed_short_int_Array_0[3] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L79] RET assume_abort_if_not(signed_short_int_Array_0[3] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] EXPR signed_short_int_Array_0[3] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] CALL assume_abort_if_not(signed_short_int_Array_0[3] <= 16383) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] RET assume_abort_if_not(signed_short_int_Array_0[3] <= 16383) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L82] EXPR unsigned_char_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR unsigned_char_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L84] EXPR unsigned_char_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L84] CALL assume_abort_if_not(unsigned_char_Array_0[0] != 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L84] RET assume_abort_if_not(unsigned_char_Array_0[0] != 0) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L97] RET updateVariables() [L98] CALL step() [L37] EXPR signed_short_int_Array_0[3] [L37] EXPR signed_short_int_Array_0[2] [L37] EXPR signed_short_int_Array_0[1] [L37] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L37] EXPR ((signed_short_int_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[1]) : (signed_short_int_Array_0[0]) [L37] EXPR signed_short_int_Array_0[1] [L37] EXPR ((signed_short_int_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[1]) : (signed_short_int_Array_0[0]) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L37] signed_short_int_Array_0[4] = ((((((16) > (4)) ? (16) : (4))) + signed_short_int_Array_0[3]) - (signed_short_int_Array_0[2] + ((((signed_short_int_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[1]) : (signed_short_int_Array_0[0]))))) [L38] EXPR signed_short_int_Array_0[3] [L38] EXPR signed_short_int_Array_0[4] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L38] COND TRUE signed_short_int_Array_0[3] >= signed_short_int_Array_0[4] [L39] EXPR float_Array_0[2] [L39] EXPR float_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L39] EXPR ((float_Array_0[2] + float_Array_0[1]) < 0 ) ? -(float_Array_0[2] + float_Array_0[1]) : (float_Array_0[2] + float_Array_0[1]) [L39] EXPR float_Array_0[2] [L39] EXPR float_Array_0[1] [L39] EXPR ((float_Array_0[2] + float_Array_0[1]) < 0 ) ? -(float_Array_0[2] + float_Array_0[1]) : (float_Array_0[2] + float_Array_0[1]) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L39] EXPR float_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L39] COND TRUE ((((float_Array_0[2] + float_Array_0[1]) < 0 ) ? -(float_Array_0[2] + float_Array_0[1]) : (float_Array_0[2] + float_Array_0[1]))) < float_Array_0[0] [L40] EXPR signed_short_int_Array_0[2] [L40] signed_long_int_Array_0[2] = signed_short_int_Array_0[2] [L47] EXPR signed_long_int_Array_0[2] [L47] EXPR signed_short_int_Array_0[1] [L47] EXPR signed_short_int_Array_0[3] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L47] EXPR signed_short_int_Array_0[1] << signed_short_int_Array_0[3] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L47] signed long int stepLocal_1 = signed_long_int_Array_0[2] + (signed_short_int_Array_0[1] << signed_short_int_Array_0[3]); [L48] EXPR signed_short_int_Array_0[3] [L48] EXPR signed_long_int_Array_0[0] [L48] EXPR signed_short_int_Array_0[0] [L48] signed long int stepLocal_0 = signed_short_int_Array_0[3] - (signed_long_int_Array_0[0] - signed_short_int_Array_0[0]); [L49] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L49] COND FALSE !(stepLocal_1 != signed_short_int_Array_0[0]) [L56] EXPR signed_short_int_Array_0[3] [L56] signed_long_int_Array_0[1] = signed_short_int_Array_0[3] [L98] RET step() [L99] CALL, EXPR property() [L89] EXPR signed_short_int_Array_0[4] [L89] EXPR signed_short_int_Array_0[3] [L89] EXPR signed_short_int_Array_0[2] [L89] EXPR signed_short_int_Array_0[1] [L89] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] EXPR ((signed_short_int_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[1]) : (signed_short_int_Array_0[0]) [L89] EXPR signed_short_int_Array_0[1] [L89] EXPR ((signed_short_int_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[1]) : (signed_short_int_Array_0[0]) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] EXPR (signed_short_int_Array_0[4] == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + signed_short_int_Array_0[3]) - (signed_short_int_Array_0[2] + ((((signed_short_int_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[1]) : (signed_short_int_Array_0[0]))))))) && ((signed_short_int_Array_0[3] >= signed_short_int_Array_0[4]) ? ((((((float_Array_0[2] + float_Array_0[1]) < 0 ) ? -(float_Array_0[2] + float_Array_0[1]) : (float_Array_0[2] + float_Array_0[1]))) < float_Array_0[0]) ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[2])) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[4]))) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[1]))) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] EXPR (signed_short_int_Array_0[4] == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + signed_short_int_Array_0[3]) - (signed_short_int_Array_0[2] + ((((signed_short_int_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[1]) : (signed_short_int_Array_0[0]))))))) && ((signed_short_int_Array_0[3] >= signed_short_int_Array_0[4]) ? ((((((float_Array_0[2] + float_Array_0[1]) < 0 ) ? -(float_Array_0[2] + float_Array_0[1]) : (float_Array_0[2] + float_Array_0[1]))) < float_Array_0[0]) ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[2])) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[4]))) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[1]))) [L89] EXPR signed_short_int_Array_0[3] [L89] EXPR signed_short_int_Array_0[4] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] EXPR (signed_short_int_Array_0[3] >= signed_short_int_Array_0[4]) ? ((((((float_Array_0[2] + float_Array_0[1]) < 0 ) ? -(float_Array_0[2] + float_Array_0[1]) : (float_Array_0[2] + float_Array_0[1]))) < float_Array_0[0]) ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[2])) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[4]))) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[1])) [L89] EXPR float_Array_0[2] [L89] EXPR float_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] EXPR ((float_Array_0[2] + float_Array_0[1]) < 0 ) ? -(float_Array_0[2] + float_Array_0[1]) : (float_Array_0[2] + float_Array_0[1]) [L89] EXPR float_Array_0[2] [L89] EXPR float_Array_0[1] [L89] EXPR ((float_Array_0[2] + float_Array_0[1]) < 0 ) ? -(float_Array_0[2] + float_Array_0[1]) : (float_Array_0[2] + float_Array_0[1]) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] EXPR float_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] EXPR (((((float_Array_0[2] + float_Array_0[1]) < 0 ) ? -(float_Array_0[2] + float_Array_0[1]) : (float_Array_0[2] + float_Array_0[1]))) < float_Array_0[0]) ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[2])) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[4])) [L89] EXPR signed_long_int_Array_0[2] [L89] EXPR signed_short_int_Array_0[4] [L89] EXPR (((((float_Array_0[2] + float_Array_0[1]) < 0 ) ? -(float_Array_0[2] + float_Array_0[1]) : (float_Array_0[2] + float_Array_0[1]))) < float_Array_0[0]) ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[2])) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[4])) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] EXPR (signed_short_int_Array_0[3] >= signed_short_int_Array_0[4]) ? ((((((float_Array_0[2] + float_Array_0[1]) < 0 ) ? -(float_Array_0[2] + float_Array_0[1]) : (float_Array_0[2] + float_Array_0[1]))) < float_Array_0[0]) ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[2])) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[4]))) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[1])) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] EXPR (signed_short_int_Array_0[4] == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + signed_short_int_Array_0[3]) - (signed_short_int_Array_0[2] + ((((signed_short_int_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[1]) : (signed_short_int_Array_0[0]))))))) && ((signed_short_int_Array_0[3] >= signed_short_int_Array_0[4]) ? ((((((float_Array_0[2] + float_Array_0[1]) < 0 ) ? -(float_Array_0[2] + float_Array_0[1]) : (float_Array_0[2] + float_Array_0[1]))) < float_Array_0[0]) ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[2])) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[4]))) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[1]))) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] EXPR ((signed_short_int_Array_0[4] == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + signed_short_int_Array_0[3]) - (signed_short_int_Array_0[2] + ((((signed_short_int_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[1]) : (signed_short_int_Array_0[0]))))))) && ((signed_short_int_Array_0[3] >= signed_short_int_Array_0[4]) ? ((((((float_Array_0[2] + float_Array_0[1]) < 0 ) ? -(float_Array_0[2] + float_Array_0[1]) : (float_Array_0[2] + float_Array_0[1]))) < float_Array_0[0]) ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[2])) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[4]))) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[1])))) && (((signed_long_int_Array_0[2] + (signed_short_int_Array_0[1] << signed_short_int_Array_0[3])) != signed_short_int_Array_0[0]) ? (((signed_short_int_Array_0[2] / unsigned_char_Array_0[0]) < (signed_short_int_Array_0[3] - (signed_long_int_Array_0[0] - signed_short_int_Array_0[0]))) ? (signed_long_int_Array_0[1] == ((signed long int) ((((-256) < (((((signed_short_int_Array_0[1]) < (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))) ? (signed_short_int_Array_0[1]) : (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3])))))))) ? (-256) : (((((signed_short_int_Array_0[1]) < (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))) ? (signed_short_int_Array_0[1]) : (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))))))))) : (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[1]))) : (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[3]))) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] EXPR ((signed_short_int_Array_0[4] == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + signed_short_int_Array_0[3]) - (signed_short_int_Array_0[2] + ((((signed_short_int_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[1]) : (signed_short_int_Array_0[0]))))))) && ((signed_short_int_Array_0[3] >= signed_short_int_Array_0[4]) ? ((((((float_Array_0[2] + float_Array_0[1]) < 0 ) ? -(float_Array_0[2] + float_Array_0[1]) : (float_Array_0[2] + float_Array_0[1]))) < float_Array_0[0]) ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[2])) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[4]))) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[1])))) && (((signed_long_int_Array_0[2] + (signed_short_int_Array_0[1] << signed_short_int_Array_0[3])) != signed_short_int_Array_0[0]) ? (((signed_short_int_Array_0[2] / unsigned_char_Array_0[0]) < (signed_short_int_Array_0[3] - (signed_long_int_Array_0[0] - signed_short_int_Array_0[0]))) ? (signed_long_int_Array_0[1] == ((signed long int) ((((-256) < (((((signed_short_int_Array_0[1]) < (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))) ? (signed_short_int_Array_0[1]) : (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3])))))))) ? (-256) : (((((signed_short_int_Array_0[1]) < (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))) ? (signed_short_int_Array_0[1]) : (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))))))))) : (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[1]))) : (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[3]))) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89-L90] return ((signed_short_int_Array_0[4] == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + signed_short_int_Array_0[3]) - (signed_short_int_Array_0[2] + ((((signed_short_int_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_short_int_Array_0[1]) : (signed_short_int_Array_0[0]))))))) && ((signed_short_int_Array_0[3] >= signed_short_int_Array_0[4]) ? ((((((float_Array_0[2] + float_Array_0[1]) < 0 ) ? -(float_Array_0[2] + float_Array_0[1]) : (float_Array_0[2] + float_Array_0[1]))) < float_Array_0[0]) ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[2])) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[4]))) : (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[1])))) && (((signed_long_int_Array_0[2] + (signed_short_int_Array_0[1] << signed_short_int_Array_0[3])) != signed_short_int_Array_0[0]) ? (((signed_short_int_Array_0[2] / unsigned_char_Array_0[0]) < (signed_short_int_Array_0[3] - (signed_long_int_Array_0[0] - signed_short_int_Array_0[0]))) ? (signed_long_int_Array_0[1] == ((signed long int) ((((-256) < (((((signed_short_int_Array_0[1]) < (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))) ? (signed_short_int_Array_0[1]) : (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3])))))))) ? (-256) : (((((signed_short_int_Array_0[1]) < (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))) ? (signed_short_int_Array_0[1]) : (((((signed_short_int_Array_0[0]) > (signed_short_int_Array_0[3])) ? (signed_short_int_Array_0[0]) : (signed_short_int_Array_0[3]))))))))))) : (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[1]))) : (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[3]))) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L19] reach_error() VAL [float_Array_0={4:0}, isInitial=1, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 114 locations, 186 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.3s, OverallIterations: 18, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2391 SdHoareTripleChecker+Valid, 6.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2380 mSDsluCounter, 15003 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11976 mSDsCounter, 123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8339 IncrementalHoareTripleChecker+Invalid, 8462 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 123 mSolverCounterUnsat, 3027 mSDtfsCounter, 8339 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 602 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=551occurred in iteration=17, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 1401 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 11.3s InterpolantComputationTime, 2553 NumberOfCodeBlocks, 2553 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2525 ConstructedInterpolants, 0 QuantifiedInterpolants, 11126 SizeOfPredicates, 5 NumberOfNonLiveVariables, 888 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 20 InterpolantComputations, 17 PerfectInterpolantSequences, 9546/9600 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 05:23:44,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-39.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d2a0584d4779790e33dcddf636884f56e9964183aa5c7648270a93d40ce062b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:23:46,312 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:23:46,406 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:23:46,414 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:23:46,415 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:23:46,440 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:23:46,441 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:23:46,442 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:23:46,442 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:23:46,442 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:23:46,443 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:23:46,443 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:23:46,443 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:23:46,443 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:23:46,444 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:23:46,444 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:23:46,444 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:23:46,444 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:23:46,444 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:23:46,444 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:23:46,444 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:23:46,445 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:23:46,445 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:23:46,445 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:23:46,445 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:23:46,445 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:23:46,445 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:23:46,445 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:23:46,445 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:23:46,445 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:23:46,445 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:23:46,446 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:23:46,446 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:23:46,446 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:23:46,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:23:46,446 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:23:46,446 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:23:46,446 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:23:46,447 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:23:46,447 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:23:46,447 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:23:46,447 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:23:46,447 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:23:46,447 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:23:46,447 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:23:46,447 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d2a0584d4779790e33dcddf636884f56e9964183aa5c7648270a93d40ce062b0 [2025-03-17 05:23:46,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:23:46,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:23:46,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:23:46,748 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:23:46,749 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:23:46,753 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-39.i [2025-03-17 05:23:48,129 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85c5af7f0/024e286c596449e89da0ea1662993e66/FLAG74c4f8554 [2025-03-17 05:23:48,374 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:23:48,375 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-39.i [2025-03-17 05:23:48,381 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85c5af7f0/024e286c596449e89da0ea1662993e66/FLAG74c4f8554 [2025-03-17 05:23:48,398 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85c5af7f0/024e286c596449e89da0ea1662993e66 [2025-03-17 05:23:48,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:23:48,402 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:23:48,403 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:23:48,405 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:23:48,408 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:23:48,408 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:23:48" (1/1) ... [2025-03-17 05:23:48,409 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21dbcec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:48, skipping insertion in model container [2025-03-17 05:23:48,409 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:23:48" (1/1) ... [2025-03-17 05:23:48,426 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:23:48,537 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-39.i[916,929] [2025-03-17 05:23:48,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:23:48,613 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:23:48,627 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-39.i[916,929] [2025-03-17 05:23:48,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:23:48,703 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:23:48,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:48 WrapperNode [2025-03-17 05:23:48,704 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:23:48,705 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:23:48,705 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:23:48,705 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:23:48,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:48" (1/1) ... [2025-03-17 05:23:48,727 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:48" (1/1) ... [2025-03-17 05:23:48,779 INFO L138 Inliner]: procedures = 36, calls = 191, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 583 [2025-03-17 05:23:48,779 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:23:48,780 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:23:48,780 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:23:48,780 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:23:48,796 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:48" (1/1) ... [2025-03-17 05:23:48,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:48" (1/1) ... [2025-03-17 05:23:48,808 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:48" (1/1) ... [2025-03-17 05:23:48,829 INFO L175 MemorySlicer]: Split 160 memory accesses to 5 slices as follows [2, 32, 22, 97, 7]. 61 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 3, 3, 5, 1]. The 16 writes are split as follows [0, 3, 7, 5, 1]. [2025-03-17 05:23:48,830 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:48" (1/1) ... [2025-03-17 05:23:48,830 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:48" (1/1) ... [2025-03-17 05:23:48,852 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:48" (1/1) ... [2025-03-17 05:23:48,854 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:48" (1/1) ... [2025-03-17 05:23:48,858 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:48" (1/1) ... [2025-03-17 05:23:48,860 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:48" (1/1) ... [2025-03-17 05:23:48,865 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:23:48,866 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:23:48,867 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:23:48,867 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:23:48,868 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:48" (1/1) ... [2025-03-17 05:23:48,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:23:48,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:23:48,900 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:23:48,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:23:48,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:23:48,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:23:48,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:23:48,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 05:23:48,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-17 05:23:48,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-17 05:23:48,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-17 05:23:48,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-17 05:23:48,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-17 05:23:48,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-17 05:23:48,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-17 05:23:48,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:23:48,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:23:48,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 05:23:48,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-17 05:23:48,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-17 05:23:48,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-17 05:23:48,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-17 05:23:48,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-17 05:23:48,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-17 05:23:48,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-17 05:23:48,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 05:23:48,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 05:23:48,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-17 05:23:48,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-17 05:23:48,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-17 05:23:48,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 05:23:48,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 05:23:48,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-17 05:23:48,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-17 05:23:48,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-17 05:23:48,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 05:23:48,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 05:23:48,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-17 05:23:48,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-17 05:23:48,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-17 05:23:48,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 05:23:48,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 05:23:48,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-17 05:23:48,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-17 05:23:48,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-17 05:23:48,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-17 05:23:48,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-17 05:23:48,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-17 05:23:48,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-17 05:23:48,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-17 05:23:48,931 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:23:48,931 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:23:48,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:23:48,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:23:48,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:23:48,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:23:48,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-17 05:23:48,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-17 05:23:48,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-17 05:23:48,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 05:23:48,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 05:23:48,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-17 05:23:48,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-17 05:23:48,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-17 05:23:48,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 05:23:48,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 05:23:48,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-17 05:23:48,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-17 05:23:48,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-17 05:23:49,113 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:23:49,115 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:23:50,387 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L89: havoc property_#t~mem112#1;havoc property_#t~mem105#1;havoc property_#t~mem111#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite130#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite121#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~mem122#1;havoc property_#t~ite127#1;havoc property_#t~mem124#1;havoc property_#t~mem123#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short131#1;havoc property_#t~mem134#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~mem135#1;havoc property_#t~ite174#1;havoc property_#t~mem136#1;havoc property_#t~mem137#1;havoc property_#t~mem140#1;havoc property_#t~mem138#1;havoc property_#t~mem139#1;havoc property_#t~ite171#1;havoc property_#t~mem168#1;havoc property_#t~mem146#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~ite145#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~ite153#1;havoc property_#t~mem147#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~ite152#1;havoc property_#t~mem150#1;havoc property_#t~mem151#1;havoc property_#t~ite167#1;havoc property_#t~mem159#1;havoc property_#t~mem154#1;havoc property_#t~mem155#1;havoc property_#t~ite158#1;havoc property_#t~mem156#1;havoc property_#t~mem157#1;havoc property_#t~ite166#1;havoc property_#t~mem160#1;havoc property_#t~mem161#1;havoc property_#t~mem162#1;havoc property_#t~ite165#1;havoc property_#t~mem163#1;havoc property_#t~mem164#1;havoc property_#t~mem170#1;havoc property_#t~mem169#1;havoc property_#t~mem173#1;havoc property_#t~mem172#1;havoc property_#t~short175#1; [2025-03-17 05:23:50,449 INFO L? ?]: Removed 186 outVars from TransFormulas that were not future-live. [2025-03-17 05:23:50,450 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:23:50,458 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:23:50,459 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:23:50,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:23:50 BoogieIcfgContainer [2025-03-17 05:23:50,459 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:23:50,462 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:23:50,462 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:23:50,466 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:23:50,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:23:48" (1/3) ... [2025-03-17 05:23:50,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@454ba1b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:23:50, skipping insertion in model container [2025-03-17 05:23:50,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:48" (2/3) ... [2025-03-17 05:23:50,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@454ba1b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:23:50, skipping insertion in model container [2025-03-17 05:23:50,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:23:50" (3/3) ... [2025-03-17 05:23:50,469 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-39.i [2025-03-17 05:23:50,480 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:23:50,481 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-39.i that has 2 procedures, 108 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:23:50,521 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:23:50,534 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@59048fd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:23:50,535 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:23:50,539 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 89 states have (on average 1.4606741573033708) internal successors, (130), 90 states have internal predecessors, (130), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:23:50,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-17 05:23:50,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:50,554 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:50,554 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:50,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:50,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1750247534, now seen corresponding path program 1 times [2025-03-17 05:23:50,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:23:50,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [176577893] [2025-03-17 05:23:50,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:50,577 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:23:50,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:23:50,584 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:23:50,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 05:23:50,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 05:23:50,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 05:23:50,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:50,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:50,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:23:50,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:50,957 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2025-03-17 05:23:50,957 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:23:50,958 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:23:50,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [176577893] [2025-03-17 05:23:50,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [176577893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:50,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:50,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:23:50,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923431290] [2025-03-17 05:23:50,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:50,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:23:50,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:23:50,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:23:50,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:23:50,985 INFO L87 Difference]: Start difference. First operand has 108 states, 89 states have (on average 1.4606741573033708) internal successors, (130), 90 states have internal predecessors, (130), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:23:51,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:51,009 INFO L93 Difference]: Finished difference Result 213 states and 338 transitions. [2025-03-17 05:23:51,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:23:51,014 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 122 [2025-03-17 05:23:51,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:51,020 INFO L225 Difference]: With dead ends: 213 [2025-03-17 05:23:51,020 INFO L226 Difference]: Without dead ends: 106 [2025-03-17 05:23:51,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:23:51,026 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:51,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:23:51,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-17 05:23:51,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-03-17 05:23:51,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 88 states have (on average 1.4318181818181819) internal successors, (126), 88 states have internal predecessors, (126), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:23:51,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 158 transitions. [2025-03-17 05:23:51,068 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 158 transitions. Word has length 122 [2025-03-17 05:23:51,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:51,069 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 158 transitions. [2025-03-17 05:23:51,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:23:51,070 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 158 transitions. [2025-03-17 05:23:51,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-17 05:23:51,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:51,074 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:51,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 05:23:51,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:23:51,275 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:51,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:51,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1499161280, now seen corresponding path program 1 times [2025-03-17 05:23:51,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:23:51,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1055129078] [2025-03-17 05:23:51,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:51,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:23:51,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:23:51,279 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:23:51,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 05:23:51,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 05:23:51,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 05:23:51,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:51,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:51,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:23:51,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:51,640 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:23:51,640 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:23:51,640 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:23:51,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1055129078] [2025-03-17 05:23:51,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1055129078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:51,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:51,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:23:51,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493638067] [2025-03-17 05:23:51,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:51,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:23:51,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:23:51,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:23:51,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:23:51,643 INFO L87 Difference]: Start difference. First operand 106 states and 158 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:23:51,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:51,711 INFO L93 Difference]: Finished difference Result 213 states and 318 transitions. [2025-03-17 05:23:51,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:23:51,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 122 [2025-03-17 05:23:51,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:51,717 INFO L225 Difference]: With dead ends: 213 [2025-03-17 05:23:51,717 INFO L226 Difference]: Without dead ends: 108 [2025-03-17 05:23:51,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:23:51,719 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:51,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 458 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:23:51,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-17 05:23:51,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-17 05:23:51,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 90 states have internal predecessors, (128), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:23:51,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 160 transitions. [2025-03-17 05:23:51,734 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 160 transitions. Word has length 122 [2025-03-17 05:23:51,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:51,734 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 160 transitions. [2025-03-17 05:23:51,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:23:51,734 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 160 transitions. [2025-03-17 05:23:51,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-17 05:23:51,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:51,736 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:51,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 05:23:51,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:23:51,936 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:51,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:51,937 INFO L85 PathProgramCache]: Analyzing trace with hash -102004767, now seen corresponding path program 1 times [2025-03-17 05:23:51,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:23:51,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1583961081] [2025-03-17 05:23:51,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:51,937 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:23:51,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:23:51,940 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:23:51,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 05:23:52,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 05:23:52,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 05:23:52,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:52,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:52,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-17 05:23:52,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:52,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-17 05:23:52,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2025-03-17 05:23:53,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 45 [2025-03-17 05:23:54,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 48 [2025-03-17 05:23:57,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 90 [2025-03-17 05:23:58,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2025-03-17 05:23:58,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2025-03-17 05:23:59,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:23:59,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 202 treesize of output 88 [2025-03-17 05:24:00,439 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 356 proven. 72 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-17 05:24:00,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:24:04,208 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:24:04,208 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:24:04,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1583961081] [2025-03-17 05:24:04,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1583961081] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:24:04,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:24:04,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [46] total 54 [2025-03-17 05:24:04,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873452288] [2025-03-17 05:24:04,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:04,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:24:04,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:24:04,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:24:04,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=2401, Unknown=0, NotChecked=0, Total=2862 [2025-03-17 05:24:04,211 INFO L87 Difference]: Start difference. First operand 108 states and 160 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:24:12,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:12,916 INFO L93 Difference]: Finished difference Result 391 states and 576 transitions. [2025-03-17 05:24:12,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:24:12,918 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 122 [2025-03-17 05:24:12,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:12,921 INFO L225 Difference]: With dead ends: 391 [2025-03-17 05:24:12,921 INFO L226 Difference]: Without dead ends: 284 [2025-03-17 05:24:12,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1098 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=526, Invalid=3134, Unknown=0, NotChecked=0, Total=3660 [2025-03-17 05:24:12,925 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 509 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:12,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 1057 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-17 05:24:12,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-03-17 05:24:12,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 190. [2025-03-17 05:24:12,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 166 states have (on average 1.4457831325301205) internal successors, (240), 167 states have internal predecessors, (240), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 05:24:12,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 282 transitions. [2025-03-17 05:24:12,949 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 282 transitions. Word has length 122 [2025-03-17 05:24:12,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:12,950 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 282 transitions. [2025-03-17 05:24:12,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:24:12,950 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 282 transitions. [2025-03-17 05:24:12,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-17 05:24:12,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:12,952 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:12,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-17 05:24:13,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:24:13,153 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:13,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:13,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1909459230, now seen corresponding path program 1 times [2025-03-17 05:24:13,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:24:13,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1313798875] [2025-03-17 05:24:13,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:13,155 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:24:13,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:24:13,157 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:24:13,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 05:24:13,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 05:24:13,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 05:24:13,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:13,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:13,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-17 05:24:13,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:13,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:24:13,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2025-03-17 05:24:14,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:24:14,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 41 [2025-03-17 05:24:14,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:24:14,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 51 [2025-03-17 05:24:15,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:24:15,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 46 [2025-03-17 05:24:15,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2025-03-17 05:24:15,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2025-03-17 05:24:15,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:24:15,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 44 [2025-03-17 05:24:15,653 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 307 proven. 84 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-03-17 05:24:15,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:24:16,181 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:24:16,181 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:24:16,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1313798875] [2025-03-17 05:24:16,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1313798875] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:24:16,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:24:16,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [26] total 32 [2025-03-17 05:24:16,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504023207] [2025-03-17 05:24:16,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:16,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:24:16,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:24:16,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:24:16,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=820, Unknown=0, NotChecked=0, Total=992 [2025-03-17 05:24:16,183 INFO L87 Difference]: Start difference. First operand 190 states and 282 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:24:17,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:17,953 INFO L93 Difference]: Finished difference Result 525 states and 773 transitions. [2025-03-17 05:24:17,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:24:17,954 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 122 [2025-03-17 05:24:17,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:17,957 INFO L225 Difference]: With dead ends: 525 [2025-03-17 05:24:17,957 INFO L226 Difference]: Without dead ends: 336 [2025-03-17 05:24:17,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=204, Invalid=986, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 05:24:17,958 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 621 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:17,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 776 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 05:24:17,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-03-17 05:24:17,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 195. [2025-03-17 05:24:17,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 171 states have (on average 1.4444444444444444) internal successors, (247), 172 states have internal predecessors, (247), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 05:24:17,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 289 transitions. [2025-03-17 05:24:17,974 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 289 transitions. Word has length 122 [2025-03-17 05:24:17,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:17,974 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 289 transitions. [2025-03-17 05:24:17,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:24:17,974 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 289 transitions. [2025-03-17 05:24:17,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-17 05:24:17,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:17,976 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:17,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-17 05:24:18,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:24:18,177 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:18,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:18,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1405547042, now seen corresponding path program 1 times [2025-03-17 05:24:18,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:24:18,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [846727746] [2025-03-17 05:24:18,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:18,178 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:24:18,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:24:18,182 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:24:18,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-17 05:24:18,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 05:24:18,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 05:24:18,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:18,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:18,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-17 05:24:18,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:18,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:24:18,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2025-03-17 05:24:19,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:24:19,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 41 [2025-03-17 05:24:19,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 41 [2025-03-17 05:24:20,844 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:24:20,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 62 [2025-03-17 05:24:20,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2025-03-17 05:24:21,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2025-03-17 05:24:21,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:24:21,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 136 treesize of output 60 [2025-03-17 05:24:21,688 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 339 proven. 78 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-17 05:24:21,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:24:22,309 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:24:22,309 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:24:22,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [846727746] [2025-03-17 05:24:22,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [846727746] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:24:22,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:24:22,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [33] total 39 [2025-03-17 05:24:22,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989891179] [2025-03-17 05:24:22,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:22,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:24:22,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:24:22,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:24:22,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1234, Unknown=0, NotChecked=0, Total=1482 [2025-03-17 05:24:22,310 INFO L87 Difference]: Start difference. First operand 195 states and 289 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:24:24,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:24,220 INFO L93 Difference]: Finished difference Result 571 states and 835 transitions. [2025-03-17 05:24:24,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:24:24,223 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 122 [2025-03-17 05:24:24,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:24,229 INFO L225 Difference]: With dead ends: 571 [2025-03-17 05:24:24,229 INFO L226 Difference]: Without dead ends: 377 [2025-03-17 05:24:24,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 204 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=280, Invalid=1442, Unknown=0, NotChecked=0, Total=1722 [2025-03-17 05:24:24,231 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 504 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:24,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 908 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 05:24:24,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-17 05:24:24,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 124. [2025-03-17 05:24:24,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.3904761904761904) internal successors, (146), 105 states have internal predecessors, (146), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:24:24,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 178 transitions. [2025-03-17 05:24:24,248 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 178 transitions. Word has length 122 [2025-03-17 05:24:24,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:24,249 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 178 transitions. [2025-03-17 05:24:24,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:24:24,249 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 178 transitions. [2025-03-17 05:24:24,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-17 05:24:24,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:24,251 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:24,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-17 05:24:24,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:24:24,455 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:24,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:24,455 INFO L85 PathProgramCache]: Analyzing trace with hash -401907421, now seen corresponding path program 1 times [2025-03-17 05:24:24,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:24:24,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1005563817] [2025-03-17 05:24:24,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:24,456 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:24:24,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:24:24,458 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:24:24,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-17 05:24:24,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 05:24:24,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 05:24:24,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:24,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:24,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 05:24:24,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:24,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:24:24,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-17 05:24:24,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-17 05:24:24,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2025-03-17 05:24:25,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 71 [2025-03-17 05:24:25,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:24:25,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 130 treesize of output 56 [2025-03-17 05:24:26,031 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 336 proven. 12 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-03-17 05:24:26,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:24:26,994 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:24:26,994 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:24:26,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1005563817] [2025-03-17 05:24:26,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1005563817] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:24:26,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:24:26,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 21 [2025-03-17 05:24:26,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897288103] [2025-03-17 05:24:26,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:26,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:24:26,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:24:26,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:24:26,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:24:26,996 INFO L87 Difference]: Start difference. First operand 124 states and 178 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:24:29,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:29,232 INFO L93 Difference]: Finished difference Result 326 states and 471 transitions. [2025-03-17 05:24:29,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:24:29,233 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 122 [2025-03-17 05:24:29,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:29,237 INFO L225 Difference]: With dead ends: 326 [2025-03-17 05:24:29,237 INFO L226 Difference]: Without dead ends: 203 [2025-03-17 05:24:29,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2025-03-17 05:24:29,238 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 220 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:29,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1216 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-17 05:24:29,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-17 05:24:29,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 138. [2025-03-17 05:24:29,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 119 states have (on average 1.4201680672268908) internal successors, (169), 119 states have internal predecessors, (169), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:24:29,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 201 transitions. [2025-03-17 05:24:29,245 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 201 transitions. Word has length 122 [2025-03-17 05:24:29,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:29,245 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 201 transitions. [2025-03-17 05:24:29,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:24:29,245 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 201 transitions. [2025-03-17 05:24:29,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-17 05:24:29,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:29,247 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:29,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-17 05:24:29,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:24:29,447 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:29,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:29,448 INFO L85 PathProgramCache]: Analyzing trace with hash 192114779, now seen corresponding path program 1 times [2025-03-17 05:24:29,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:24:29,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1010980950] [2025-03-17 05:24:29,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:29,448 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:24:29,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:24:29,450 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:24:29,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-17 05:24:29,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 05:24:29,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 05:24:29,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:29,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:29,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 05:24:29,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:29,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-17 05:24:29,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-17 05:24:29,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2025-03-17 05:24:30,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 64 [2025-03-17 05:24:30,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:24:30,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 134 treesize of output 56 [2025-03-17 05:24:30,959 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 336 proven. 12 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-03-17 05:24:30,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:24:32,041 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:24:32,041 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:24:32,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1010980950] [2025-03-17 05:24:32,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1010980950] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:24:32,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:24:32,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 21 [2025-03-17 05:24:32,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982080553] [2025-03-17 05:24:32,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:32,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:24:32,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:24:32,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:24:32,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:24:32,042 INFO L87 Difference]: Start difference. First operand 138 states and 201 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:24:34,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:34,579 INFO L93 Difference]: Finished difference Result 364 states and 528 transitions. [2025-03-17 05:24:34,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:24:34,580 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 123 [2025-03-17 05:24:34,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:34,582 INFO L225 Difference]: With dead ends: 364 [2025-03-17 05:24:34,582 INFO L226 Difference]: Without dead ends: 227 [2025-03-17 05:24:34,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2025-03-17 05:24:34,583 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 121 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:34,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1041 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-17 05:24:34,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-17 05:24:34,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 222. [2025-03-17 05:24:34,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 194 states have (on average 1.4278350515463918) internal successors, (277), 195 states have internal predecessors, (277), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 05:24:34,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 323 transitions. [2025-03-17 05:24:34,593 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 323 transitions. Word has length 123 [2025-03-17 05:24:34,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:34,594 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 323 transitions. [2025-03-17 05:24:34,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:24:34,594 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 323 transitions. [2025-03-17 05:24:34,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-17 05:24:34,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:34,596 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:34,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-17 05:24:34,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:24:34,797 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:34,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:34,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1615339684, now seen corresponding path program 1 times [2025-03-17 05:24:34,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:24:34,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [734739904] [2025-03-17 05:24:34,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:34,798 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:24:34,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:24:34,800 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:24:34,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-17 05:24:34,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 05:24:35,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 05:24:35,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:35,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:35,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 05:24:35,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:35,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:24:35,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2025-03-17 05:24:35,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:24:35,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 47 [2025-03-17 05:24:35,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:24:35,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 50 [2025-03-17 05:24:36,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:24:36,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 47 [2025-03-17 05:24:36,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:24:36,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 30 [2025-03-17 05:24:36,649 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 267 proven. 84 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2025-03-17 05:24:36,649 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:24:36,888 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:24:36,888 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:24:36,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [734739904] [2025-03-17 05:24:36,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [734739904] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:24:36,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:24:36,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [22] total 25 [2025-03-17 05:24:36,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531724196] [2025-03-17 05:24:36,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:36,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:24:36,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:24:36,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:24:36,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2025-03-17 05:24:36,889 INFO L87 Difference]: Start difference. First operand 222 states and 323 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:24:37,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:37,370 INFO L93 Difference]: Finished difference Result 523 states and 763 transitions. [2025-03-17 05:24:37,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:24:37,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 123 [2025-03-17 05:24:37,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:37,374 INFO L225 Difference]: With dead ends: 523 [2025-03-17 05:24:37,374 INFO L226 Difference]: Without dead ends: 302 [2025-03-17 05:24:37,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2025-03-17 05:24:37,377 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 220 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:37,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 380 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:24:37,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-03-17 05:24:37,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 237. [2025-03-17 05:24:37,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 209 states have (on average 1.4401913875598087) internal successors, (301), 210 states have internal predecessors, (301), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 05:24:37,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 347 transitions. [2025-03-17 05:24:37,389 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 347 transitions. Word has length 123 [2025-03-17 05:24:37,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:37,390 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 347 transitions. [2025-03-17 05:24:37,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:24:37,390 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 347 transitions. [2025-03-17 05:24:37,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-17 05:24:37,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:37,391 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:37,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-03-17 05:24:37,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:24:37,592 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:37,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:37,592 INFO L85 PathProgramCache]: Analyzing trace with hash -318419398, now seen corresponding path program 1 times [2025-03-17 05:24:37,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:24:37,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [369274499] [2025-03-17 05:24:37,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:37,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:24:37,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:24:37,595 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:24:37,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-17 05:24:37,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 05:24:38,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 05:24:38,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:38,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:38,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-17 05:24:38,059 INFO L279 TraceCheckSpWp]: Computing forward predicates...