./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-48.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-p_file-48.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 e8bf74309a8b022d6e645ae6ad00767c20272f1d55203a857771147b8948c784 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:29:09,427 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:29:09,476 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:29:09,483 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:29:09,483 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:29:09,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:29:09,502 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:29:09,502 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:29:09,503 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:29:09,503 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:29:09,504 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:29:09,504 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:29:09,504 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:29:09,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:29:09,504 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:29:09,505 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:29:09,505 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:29:09,505 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:29:09,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:29:09,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:29:09,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:29:09,505 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:29:09,505 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:29:09,505 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:29:09,505 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:29:09,505 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:29:09,506 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:29:09,506 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:29:09,506 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:29:09,506 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:29:09,506 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:29:09,506 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:29:09,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:29:09,506 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:29:09,506 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:29:09,506 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:29:09,507 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:29:09,507 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:29:09,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:29:09,507 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:29:09,507 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:29:09,507 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:29:09,507 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:29:09,507 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 -> e8bf74309a8b022d6e645ae6ad00767c20272f1d55203a857771147b8948c784 [2025-03-04 01:29:09,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:29:09,821 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:29:09,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:29:09,823 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:29:09,823 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:29:09,825 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-48.i [2025-03-04 01:29:10,914 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d6d90e27/eec1d980a44d4baa9ba9ea7ebc7e15f4/FLAG83d990496 [2025-03-04 01:29:11,126 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:29:11,128 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-48.i [2025-03-04 01:29:11,136 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d6d90e27/eec1d980a44d4baa9ba9ea7ebc7e15f4/FLAG83d990496 [2025-03-04 01:29:11,150 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d6d90e27/eec1d980a44d4baa9ba9ea7ebc7e15f4 [2025-03-04 01:29:11,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:29:11,154 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:29:11,155 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:29:11,156 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:29:11,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:29:11,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:29:11" (1/1) ... [2025-03-04 01:29:11,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bdb7764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:11, skipping insertion in model container [2025-03-04 01:29:11,160 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:29:11" (1/1) ... [2025-03-04 01:29:11,177 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:29:11,290 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-p_file-48.i[916,929] [2025-03-04 01:29:11,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:29:11,362 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:29:11,371 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-p_file-48.i[916,929] [2025-03-04 01:29:11,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:29:11,426 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:29:11,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:11 WrapperNode [2025-03-04 01:29:11,428 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:29:11,429 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:29:11,429 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:29:11,429 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:29:11,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:11" (1/1) ... [2025-03-04 01:29:11,445 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:11" (1/1) ... [2025-03-04 01:29:11,468 INFO L138 Inliner]: procedures = 29, calls = 194, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 547 [2025-03-04 01:29:11,469 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:29:11,469 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:29:11,469 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:29:11,469 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:29:11,476 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:11" (1/1) ... [2025-03-04 01:29:11,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:11" (1/1) ... [2025-03-04 01:29:11,480 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:11" (1/1) ... [2025-03-04 01:29:11,498 INFO L175 MemorySlicer]: Split 143 memory accesses to 20 slices as follows [2, 7, 8, 10, 8, 8, 12, 6, 8, 10, 6, 10, 8, 7, 8, 6, 8, 3, 5, 3]. 8 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 23 writes are split as follows [0, 3, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1]. [2025-03-04 01:29:11,498 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:11" (1/1) ... [2025-03-04 01:29:11,499 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:11" (1/1) ... [2025-03-04 01:29:11,512 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:11" (1/1) ... [2025-03-04 01:29:11,518 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:11" (1/1) ... [2025-03-04 01:29:11,523 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:11" (1/1) ... [2025-03-04 01:29:11,531 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:11" (1/1) ... [2025-03-04 01:29:11,540 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:29:11,541 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:29:11,541 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:29:11,541 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:29:11,544 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:11" (1/1) ... [2025-03-04 01:29:11,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:29:11,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:29:11,570 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-04 01:29:11,576 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-04 01:29:11,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:29:11,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:29:11,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:29:11,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:29:11,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:29:11,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:29:11,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 01:29:11,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 01:29:11,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 01:29:11,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 01:29:11,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 01:29:11,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 01:29:11,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 01:29:11,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 01:29:11,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 01:29:11,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 01:29:11,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-04 01:29:11,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-04 01:29:11,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-04 01:29:11,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-04 01:29:11,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-04 01:29:11,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 01:29:11,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 01:29:11,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 01:29:11,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-04 01:29:11,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-04 01:29:11,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-04 01:29:11,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-04 01:29:11,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-03-04 01:29:11,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-03-04 01:29:11,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-03-04 01:29:11,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-03-04 01:29:11,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2025-03-04 01:29:11,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2025-03-04 01:29:11,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2025-03-04 01:29:11,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2025-03-04 01:29:11,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2025-03-04 01:29:11,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#16 [2025-03-04 01:29:11,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#17 [2025-03-04 01:29:11,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#18 [2025-03-04 01:29:11,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#19 [2025-03-04 01:29:11,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-04 01:29:11,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-04 01:29:11,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-04 01:29:11,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-04 01:29:11,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-04 01:29:11,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-04 01:29:11,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-04 01:29:11,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-03-04 01:29:11,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-03-04 01:29:11,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-03-04 01:29:11,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-03-04 01:29:11,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2025-03-04 01:29:11,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2025-03-04 01:29:11,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2025-03-04 01:29:11,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2025-03-04 01:29:11,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2025-03-04 01:29:11,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#16 [2025-03-04 01:29:11,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#17 [2025-03-04 01:29:11,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#18 [2025-03-04 01:29:11,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#19 [2025-03-04 01:29:11,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:29:11,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:29:11,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:29:11,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:29:11,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:29:11,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 01:29:11,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 01:29:11,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 01:29:11,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 01:29:11,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 01:29:11,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 01:29:11,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 01:29:11,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 01:29:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 01:29:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 01:29:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-04 01:29:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-04 01:29:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-04 01:29:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-04 01:29:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-04 01:29:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-04 01:29:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-04 01:29:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-04 01:29:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-04 01:29:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-04 01:29:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-04 01:29:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-04 01:29:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-03-04 01:29:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-03-04 01:29:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-03-04 01:29:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-03-04 01:29:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2025-03-04 01:29:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2025-03-04 01:29:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2025-03-04 01:29:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2025-03-04 01:29:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2025-03-04 01:29:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#16 [2025-03-04 01:29:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#17 [2025-03-04 01:29:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#18 [2025-03-04 01:29:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#19 [2025-03-04 01:29:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:29:11,600 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:29:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:29:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:29:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:29:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:29:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:29:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 01:29:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 01:29:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 01:29:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 01:29:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 01:29:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 01:29:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 01:29:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 01:29:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 01:29:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 01:29:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-04 01:29:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-04 01:29:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-04 01:29:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-04 01:29:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-04 01:29:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:29:11,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:29:11,793 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:29:11,794 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:29:12,226 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L130: havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite108#1;havoc property_#t~mem100#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~ite105#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~mem109#1;havoc property_#t~ite123#1;havoc property_#t~ite122#1;havoc property_#t~mem113#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~mem119#1;havoc property_#t~short124#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~ite133#1;havoc property_#t~mem130#1;havoc property_#t~mem129#1;havoc property_#t~mem132#1;havoc property_#t~mem131#1;havoc property_#t~short134#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~short137#1;havoc property_#t~mem139#1;havoc property_#t~mem138#1;havoc property_#t~short140#1;havoc property_#t~mem141#1;havoc property_#t~short142#1; [2025-03-04 01:29:12,272 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-03-04 01:29:12,273 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:29:12,283 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:29:12,283 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:29:12,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:29:12 BoogieIcfgContainer [2025-03-04 01:29:12,283 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:29:12,285 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:29:12,285 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:29:12,289 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:29:12,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:29:11" (1/3) ... [2025-03-04 01:29:12,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1773b3ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:29:12, skipping insertion in model container [2025-03-04 01:29:12,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:11" (2/3) ... [2025-03-04 01:29:12,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1773b3ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:29:12, skipping insertion in model container [2025-03-04 01:29:12,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:29:12" (3/3) ... [2025-03-04 01:29:12,291 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-48.i [2025-03-04 01:29:12,301 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:29:12,302 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-48.i that has 2 procedures, 117 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:29:12,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:29:12,355 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;@264bdb2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:29:12,355 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:29:12,359 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 94 states have internal predecessors, (129), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:29:12,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 01:29:12,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:12,372 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:12,372 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:12,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:12,376 INFO L85 PathProgramCache]: Analyzing trace with hash -2069252283, now seen corresponding path program 1 times [2025-03-04 01:29:12,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:29:12,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146851086] [2025-03-04 01:29:12,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:12,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:29:12,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:29:12,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:29:12,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:12,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:12,732 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-04 01:29:12,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:29:12,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146851086] [2025-03-04 01:29:12,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146851086] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:29:12,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008674956] [2025-03-04 01:29:12,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:12,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:29:12,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:29:12,736 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-04 01:29:12,738 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-04 01:29:12,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:29:13,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:29:13,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:13,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:13,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:29:13,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:13,052 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-04 01:29:13,052 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:29:13,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008674956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:29:13,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:29:13,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:29:13,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233560675] [2025-03-04 01:29:13,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:13,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:29:13,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:29:13,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:29:13,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:29:13,074 INFO L87 Difference]: Start difference. First operand has 117 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 94 states have internal predecessors, (129), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:29:13,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:13,092 INFO L93 Difference]: Finished difference Result 228 states and 358 transitions. [2025-03-04 01:29:13,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:29:13,094 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2025-03-04 01:29:13,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:13,098 INFO L225 Difference]: With dead ends: 228 [2025-03-04 01:29:13,098 INFO L226 Difference]: Without dead ends: 114 [2025-03-04 01:29:13,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 169 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-04 01:29:13,102 INFO L435 NwaCegarLoop]: 164 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, 164 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-04 01:29:13,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:29:13,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-04 01:29:13,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-03-04 01:29:13,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:29:13,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2025-03-04 01:29:13,137 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 168 [2025-03-04 01:29:13,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:13,138 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2025-03-04 01:29:13,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:29:13,138 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2025-03-04 01:29:13,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 01:29:13,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:13,142 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:13,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 01:29:13,342 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-04 01:29:13,342 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:13,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:13,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1137364116, now seen corresponding path program 1 times [2025-03-04 01:29:13,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:29:13,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811350039] [2025-03-04 01:29:13,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:13,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:29:13,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:29:13,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:29:13,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:13,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:13,657 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:29:13,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:29:13,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811350039] [2025-03-04 01:29:13,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811350039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:29:13,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:29:13,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:29:13,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2862879] [2025-03-04 01:29:13,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:13,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:29:13,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:29:13,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:29:13,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:29:13,659 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:29:13,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:13,703 INFO L93 Difference]: Finished difference Result 228 states and 329 transitions. [2025-03-04 01:29:13,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:29:13,704 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2025-03-04 01:29:13,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:13,705 INFO L225 Difference]: With dead ends: 228 [2025-03-04 01:29:13,707 INFO L226 Difference]: Without dead ends: 117 [2025-03-04 01:29:13,707 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-04 01:29:13,708 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 1 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:13,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 472 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:29:13,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-04 01:29:13,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2025-03-04 01:29:13,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:29:13,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 166 transitions. [2025-03-04 01:29:13,718 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 166 transitions. Word has length 168 [2025-03-04 01:29:13,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:13,719 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 166 transitions. [2025-03-04 01:29:13,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:29:13,719 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 166 transitions. [2025-03-04 01:29:13,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 01:29:13,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:13,721 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:13,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:29:13,722 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:13,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:13,722 INFO L85 PathProgramCache]: Analyzing trace with hash -670090347, now seen corresponding path program 1 times [2025-03-04 01:29:13,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:29:13,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493393971] [2025-03-04 01:29:13,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:13,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:29:13,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:29:13,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:29:13,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:13,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:13,892 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:29:13,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:29:13,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493393971] [2025-03-04 01:29:13,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493393971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:29:13,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:29:13,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:29:13,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651507538] [2025-03-04 01:29:13,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:13,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:29:13,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:29:13,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:29:13,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:29:13,893 INFO L87 Difference]: Start difference. First operand 116 states and 166 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:29:13,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:13,929 INFO L93 Difference]: Finished difference Result 232 states and 333 transitions. [2025-03-04 01:29:13,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:29:13,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2025-03-04 01:29:13,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:13,933 INFO L225 Difference]: With dead ends: 232 [2025-03-04 01:29:13,933 INFO L226 Difference]: Without dead ends: 119 [2025-03-04 01:29:13,933 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-04 01:29:13,934 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 1 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:13,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 473 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:29:13,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-04 01:29:13,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2025-03-04 01:29:13,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 95 states have (on average 1.3263157894736841) internal successors, (126), 95 states have internal predecessors, (126), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:29:13,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 168 transitions. [2025-03-04 01:29:13,945 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 168 transitions. Word has length 168 [2025-03-04 01:29:13,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:13,946 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 168 transitions. [2025-03-04 01:29:13,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:29:13,946 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 168 transitions. [2025-03-04 01:29:13,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 01:29:13,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:13,950 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:13,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:29:13,950 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:13,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:13,950 INFO L85 PathProgramCache]: Analyzing trace with hash 217413334, now seen corresponding path program 1 times [2025-03-04 01:29:13,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:29:13,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808758614] [2025-03-04 01:29:13,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:13,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:29:13,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:29:14,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:29:14,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:14,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:14,133 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:29:14,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:29:14,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808758614] [2025-03-04 01:29:14,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808758614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:29:14,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:29:14,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:29:14,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176513134] [2025-03-04 01:29:14,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:14,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:29:14,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:29:14,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:29:14,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:29:14,137 INFO L87 Difference]: Start difference. First operand 118 states and 168 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:29:14,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:14,160 INFO L93 Difference]: Finished difference Result 236 states and 337 transitions. [2025-03-04 01:29:14,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:29:14,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2025-03-04 01:29:14,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:14,163 INFO L225 Difference]: With dead ends: 236 [2025-03-04 01:29:14,163 INFO L226 Difference]: Without dead ends: 121 [2025-03-04 01:29:14,163 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-04 01:29:14,163 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 1 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:14,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 475 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:29:14,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-04 01:29:14,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2025-03-04 01:29:14,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 97 states have (on average 1.3195876288659794) internal successors, (128), 97 states have internal predecessors, (128), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:29:14,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 170 transitions. [2025-03-04 01:29:14,172 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 170 transitions. Word has length 168 [2025-03-04 01:29:14,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:14,173 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 170 transitions. [2025-03-04 01:29:14,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:29:14,173 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 170 transitions. [2025-03-04 01:29:14,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 01:29:14,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:14,174 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:14,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:29:14,175 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:14,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:14,175 INFO L85 PathProgramCache]: Analyzing trace with hash 218336855, now seen corresponding path program 1 times [2025-03-04 01:29:14,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:29:14,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059780042] [2025-03-04 01:29:14,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:14,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:29:14,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:29:14,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:29:14,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:14,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:14,847 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:29:14,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:29:14,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059780042] [2025-03-04 01:29:14,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059780042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:29:14,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:29:14,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:29:14,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105888447] [2025-03-04 01:29:14,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:14,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:29:14,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:29:14,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:29:14,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:29:14,849 INFO L87 Difference]: Start difference. First operand 120 states and 170 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-04 01:29:14,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:14,970 INFO L93 Difference]: Finished difference Result 237 states and 337 transitions. [2025-03-04 01:29:14,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:29:14,971 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 168 [2025-03-04 01:29:14,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:14,973 INFO L225 Difference]: With dead ends: 237 [2025-03-04 01:29:14,973 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 01:29:14,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:29:14,974 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 129 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:14,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 418 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:29:14,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 01:29:14,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-03-04 01:29:14,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 97 states have (on average 1.309278350515464) internal successors, (127), 97 states have internal predecessors, (127), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:29:14,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 169 transitions. [2025-03-04 01:29:14,986 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 169 transitions. Word has length 168 [2025-03-04 01:29:14,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:14,987 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 169 transitions. [2025-03-04 01:29:14,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-04 01:29:14,988 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 169 transitions. [2025-03-04 01:29:14,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 01:29:14,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:14,989 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:14,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:29:14,990 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:14,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:14,990 INFO L85 PathProgramCache]: Analyzing trace with hash -626135016, now seen corresponding path program 1 times [2025-03-04 01:29:14,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:29:14,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846545079] [2025-03-04 01:29:14,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:14,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:29:15,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:29:15,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:29:15,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:15,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:29:15,114 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:29:15,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:29:15,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:29:15,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:15,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:29:15,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:29:15,304 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:29:15,305 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:29:15,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:29:15,308 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-04 01:29:15,505 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:29:15,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:29:15 BoogieIcfgContainer [2025-03-04 01:29:15,510 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:29:15,511 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:29:15,511 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:29:15,511 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:29:15,512 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:29:12" (3/4) ... [2025-03-04 01:29:15,514 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:29:15,515 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:29:15,515 INFO L158 Benchmark]: Toolchain (without parser) took 4361.13ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 122.6MB in the beginning and 61.6MB in the end (delta: 61.0MB). Peak memory consumption was 91.5MB. Max. memory is 16.1GB. [2025-03-04 01:29:15,516 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:29:15,516 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.57ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 107.4MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:29:15,516 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.31ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 103.7MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:29:15,517 INFO L158 Benchmark]: Boogie Preprocessor took 71.03ms. Allocated memory is still 167.8MB. Free memory was 103.7MB in the beginning and 97.8MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:29:15,517 INFO L158 Benchmark]: IcfgBuilder took 742.42ms. Allocated memory is still 167.8MB. Free memory was 97.8MB in the beginning and 52.4MB in the end (delta: 45.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-04 01:29:15,517 INFO L158 Benchmark]: TraceAbstraction took 3225.26ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 52.0MB in the beginning and 61.7MB in the end (delta: -9.7MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2025-03-04 01:29:15,517 INFO L158 Benchmark]: Witness Printer took 3.87ms. Allocated memory is still 201.3MB. Free memory was 61.7MB in the beginning and 61.6MB in the end (delta: 60.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:29:15,518 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.21ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 272.57ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 107.4MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.31ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 103.7MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 71.03ms. Allocated memory is still 167.8MB. Free memory was 103.7MB in the beginning and 97.8MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 742.42ms. Allocated memory is still 167.8MB. Free memory was 97.8MB in the beginning and 52.4MB in the end (delta: 45.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3225.26ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 52.0MB in the beginning and 61.7MB in the end (delta: -9.7MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * Witness Printer took 3.87ms. Allocated memory is still 201.3MB. Free memory was 61.7MB in the beginning and 61.6MB in the end (delta: 60.0kB). There was no memory consumed. 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 64, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryFLOATComparisonOperation at line 96. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 32.8; [L22] float var_1_1 = 32.8; [L23] float* var_1_1_Pointer = &(var_1_1); [L24] float var_1_2 = 255.675; [L24] float var_1_2 = 255.675; [L25] float* var_1_2_Pointer = &(var_1_2); [L26] float var_1_3 = 5.5; [L26] float var_1_3 = 5.5; [L27] float* var_1_3_Pointer = &(var_1_3); [L28] float var_1_4 = 128.75; [L28] float var_1_4 = 128.75; [L29] float* var_1_4_Pointer = &(var_1_4); [L30] float var_1_5 = 4.5; [L30] float var_1_5 = 4.5; [L31] float* var_1_5_Pointer = &(var_1_5); [L32] float var_1_6 = 9.25; [L32] float var_1_6 = 9.25; [L33] float* var_1_6_Pointer = &(var_1_6); [L34] unsigned char var_1_7 = 5; [L34] unsigned char var_1_7 = 5; [L35] unsigned char* var_1_7_Pointer = &(var_1_7); [L36] unsigned char var_1_11 = 200; [L36] unsigned char var_1_11 = 200; [L37] unsigned char* var_1_11_Pointer = &(var_1_11); [L38] unsigned char var_1_12 = 8; [L38] unsigned char var_1_12 = 8; [L39] unsigned char* var_1_12_Pointer = &(var_1_12); [L40] unsigned char var_1_13 = 4; [L40] unsigned char var_1_13 = 4; [L41] unsigned char* var_1_13_Pointer = &(var_1_13); [L42] unsigned char var_1_14 = 100; [L42] unsigned char var_1_14 = 100; [L43] unsigned char* var_1_14_Pointer = &(var_1_14); [L44] unsigned char var_1_15 = 64; [L44] unsigned char var_1_15 = 64; [L45] unsigned char* var_1_15_Pointer = &(var_1_15); [L46] unsigned char var_1_16 = 1; [L46] unsigned char var_1_16 = 1; [L47] unsigned char* var_1_16_Pointer = &(var_1_16); [L48] unsigned char var_1_17 = 200; [L48] unsigned char var_1_17 = 200; [L49] unsigned char* var_1_17_Pointer = &(var_1_17); [L50] unsigned char var_1_18 = 2; [L50] unsigned char var_1_18 = 2; [L51] unsigned char* var_1_18_Pointer = &(var_1_18); [L52] unsigned char var_1_19 = 0; [L52] unsigned char var_1_19 = 0; [L53] unsigned char* var_1_19_Pointer = &(var_1_19); [L54] unsigned long int var_1_20 = 1; [L54] unsigned long int var_1_20 = 1; [L55] unsigned long int* var_1_20_Pointer = &(var_1_20); [L56] signed long int var_1_21 = 64; [L56] signed long int var_1_21 = 64; [L57] signed long int* var_1_21_Pointer = &(var_1_21); [L58] unsigned char var_1_22 = 100; [L58] unsigned char var_1_22 = 100; [L59] unsigned char* var_1_22_Pointer = &(var_1_22); [L60] unsigned char last_1_var_1_7 = 5; VAL [isInitial=0, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L134] isInitial = 1 [L135] FCALL initially() [L136] COND TRUE 1 [L137] CALL updateLastVariables() [L127] EXPR \read(var_1_7) [L127] last_1_var_1_7 = var_1_7 [L137] RET updateLastVariables() [L138] CALL updateVariables() [L91] var_1_2 = __VERIFIER_nondet_float() [L92] EXPR \read(var_1_2) [L92] EXPR var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L92] EXPR var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F [L92] EXPR \read(var_1_2) [L92] EXPR var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L92] EXPR (var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L92] EXPR (var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L92] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L92] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L93] var_1_3 = __VERIFIER_nondet_float() [L94] EXPR \read(var_1_3) [L94] EXPR var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L94] EXPR var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F [L94] EXPR \read(var_1_3) [L94] EXPR var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L94] EXPR (var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L94] EXPR (var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L94] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L94] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L95] var_1_4 = __VERIFIER_nondet_float() [L96] EXPR \read(var_1_4) [L96] EXPR var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L96] EXPR var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F [L96] EXPR \read(var_1_4) [L96] EXPR var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L96] EXPR (var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L96] EXPR (var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L96] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L96] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L97] var_1_5 = __VERIFIER_nondet_float() [L98] EXPR \read(var_1_5) [L98] EXPR var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L98] EXPR var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F [L98] EXPR \read(var_1_5) [L98] EXPR var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L98] EXPR (var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L98] EXPR (var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L98] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L98] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L99] var_1_6 = __VERIFIER_nondet_float() [L100] EXPR \read(var_1_6) [L100] EXPR var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L100] EXPR var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F [L100] EXPR \read(var_1_6) [L100] EXPR var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L100] EXPR (var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L100] EXPR (var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L100] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L100] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L101] var_1_11 = __VERIFIER_nondet_uchar() [L102] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L102] CALL assume_abort_if_not(var_1_11 >= 190) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L102] RET assume_abort_if_not(var_1_11 >= 190) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L103] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L103] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L103] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L104] var_1_12 = __VERIFIER_nondet_uchar() [L105] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L105] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L105] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L106] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L106] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L106] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L107] var_1_13 = __VERIFIER_nondet_uchar() [L108] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L108] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L108] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L109] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L109] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L109] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L110] var_1_14 = __VERIFIER_nondet_uchar() [L111] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L111] CALL assume_abort_if_not(var_1_14 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L111] RET assume_abort_if_not(var_1_14 >= 63) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L112] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L112] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L112] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L113] var_1_15 = __VERIFIER_nondet_uchar() [L114] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L114] CALL assume_abort_if_not(var_1_15 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L114] RET assume_abort_if_not(var_1_15 >= 63) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L115] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L115] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L115] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L116] var_1_17 = __VERIFIER_nondet_uchar() [L117] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L117] CALL assume_abort_if_not(var_1_17 >= 191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L117] RET assume_abort_if_not(var_1_17 >= 191) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L118] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L118] CALL assume_abort_if_not(var_1_17 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L118] RET assume_abort_if_not(var_1_17 <= 255) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L119] var_1_18 = __VERIFIER_nondet_uchar() [L120] EXPR \read(var_1_18) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L120] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L120] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L121] EXPR \read(var_1_18) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L121] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L121] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L122] var_1_19 = __VERIFIER_nondet_uchar() [L123] EXPR \read(var_1_19) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L123] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L123] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L124] EXPR \read(var_1_19) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L124] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L124] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L138] RET updateVariables() [L139] CALL step() [L64] EXPR \read(*var_1_2_Pointer) [L64] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L64] COND FALSE !((*(var_1_2_Pointer)) <= (*(var_1_3_Pointer))) [L71] EXPR \read(*var_1_6_Pointer) [L71] (*(var_1_1_Pointer)) = (*(var_1_6_Pointer)) [L73] EXPR \read(*var_1_14_Pointer) [L73] (*(var_1_20_Pointer)) = (*(var_1_14_Pointer)) [L74] EXPR \read(*var_1_17_Pointer) [L74] (*(var_1_21_Pointer)) = (*(var_1_17_Pointer)) [L75] (*(var_1_22_Pointer)) = 4 [L76] EXPR \read(*var_1_21_Pointer) [L76] signed long int stepLocal_0 = (*(var_1_21_Pointer)); [L77] EXPR \read(*var_1_17_Pointer) [L77] EXPR \read(*var_1_12_Pointer) [L77] EXPR \read(*var_1_18_Pointer) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L77] COND FALSE !((((*(var_1_17_Pointer)) - (*(var_1_12_Pointer))) - (8 + (*(var_1_18_Pointer)))) > stepLocal_0) [L80] EXPR \read(*var_1_19_Pointer) [L80] (*(var_1_16_Pointer)) = (*(var_1_19_Pointer)) [L82] EXPR \read(*var_1_16_Pointer) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L82] COND FALSE !((*(var_1_16_Pointer))) [L139] RET step() [L140] CALL, EXPR property() [L130] EXPR \read(*var_1_2_Pointer) [L130] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L130] EXPR ((*(var_1_2_Pointer)) <= (*(var_1_3_Pointer))) ? (((*(var_1_3_Pointer)) < (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))) + 1.395f)) ? ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer)))) [L130] EXPR \read(*var_1_1_Pointer) [L130] EXPR \read(*var_1_6_Pointer) [L130] EXPR ((*(var_1_2_Pointer)) <= (*(var_1_3_Pointer))) ? (((*(var_1_3_Pointer)) < (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))) + 1.395f)) ? ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer)))) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L130] EXPR (((*(var_1_2_Pointer)) <= (*(var_1_3_Pointer))) ? (((*(var_1_3_Pointer)) < (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))) + 1.395f)) ? ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) && ((*(var_1_16_Pointer)) ? ((last_1_var_1_7 != last_1_var_1_7) ? ((*(var_1_7_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) - (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))) : ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) - ((((((*(var_1_14_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_15_Pointer))))) - (*(var_1_12_Pointer))))))) : 1) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L130] EXPR (((*(var_1_2_Pointer)) <= (*(var_1_3_Pointer))) ? (((*(var_1_3_Pointer)) < (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))) + 1.395f)) ? ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) && ((*(var_1_16_Pointer)) ? ((last_1_var_1_7 != last_1_var_1_7) ? ((*(var_1_7_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) - (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))) : ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) - ((((((*(var_1_14_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_15_Pointer))))) - (*(var_1_12_Pointer))))))) : 1) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L130] EXPR ((((*(var_1_2_Pointer)) <= (*(var_1_3_Pointer))) ? (((*(var_1_3_Pointer)) < (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))) + 1.395f)) ? ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) && ((*(var_1_16_Pointer)) ? ((last_1_var_1_7 != last_1_var_1_7) ? ((*(var_1_7_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) - (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))) : ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) - ((((((*(var_1_14_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_15_Pointer))))) - (*(var_1_12_Pointer))))))) : 1)) && (((((*(var_1_17_Pointer)) - (*(var_1_12_Pointer))) - (8 + (*(var_1_18_Pointer)))) > (*(var_1_21_Pointer))) ? ((*(var_1_16_Pointer)) == ((unsigned char) (! (*(var_1_19_Pointer))))) : ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_19_Pointer))))) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L130] EXPR ((((*(var_1_2_Pointer)) <= (*(var_1_3_Pointer))) ? (((*(var_1_3_Pointer)) < (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))) + 1.395f)) ? ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) && ((*(var_1_16_Pointer)) ? ((last_1_var_1_7 != last_1_var_1_7) ? ((*(var_1_7_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) - (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))) : ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) - ((((((*(var_1_14_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_15_Pointer))))) - (*(var_1_12_Pointer))))))) : 1)) && (((((*(var_1_17_Pointer)) - (*(var_1_12_Pointer))) - (8 + (*(var_1_18_Pointer)))) > (*(var_1_21_Pointer))) ? ((*(var_1_16_Pointer)) == ((unsigned char) (! (*(var_1_19_Pointer))))) : ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_19_Pointer))))) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L130] EXPR (((((*(var_1_2_Pointer)) <= (*(var_1_3_Pointer))) ? (((*(var_1_3_Pointer)) < (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))) + 1.395f)) ? ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) && ((*(var_1_16_Pointer)) ? ((last_1_var_1_7 != last_1_var_1_7) ? ((*(var_1_7_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) - (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))) : ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) - ((((((*(var_1_14_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_15_Pointer))))) - (*(var_1_12_Pointer))))))) : 1)) && (((((*(var_1_17_Pointer)) - (*(var_1_12_Pointer))) - (8 + (*(var_1_18_Pointer)))) > (*(var_1_21_Pointer))) ? ((*(var_1_16_Pointer)) == ((unsigned char) (! (*(var_1_19_Pointer))))) : ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_19_Pointer)))))) && ((*(var_1_20_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer)))) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L130] EXPR (((((*(var_1_2_Pointer)) <= (*(var_1_3_Pointer))) ? (((*(var_1_3_Pointer)) < (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))) + 1.395f)) ? ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) && ((*(var_1_16_Pointer)) ? ((last_1_var_1_7 != last_1_var_1_7) ? ((*(var_1_7_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) - (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))) : ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) - ((((((*(var_1_14_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_15_Pointer))))) - (*(var_1_12_Pointer))))))) : 1)) && (((((*(var_1_17_Pointer)) - (*(var_1_12_Pointer))) - (8 + (*(var_1_18_Pointer)))) > (*(var_1_21_Pointer))) ? ((*(var_1_16_Pointer)) == ((unsigned char) (! (*(var_1_19_Pointer))))) : ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_19_Pointer)))))) && ((*(var_1_20_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer)))) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L130] EXPR ((((((*(var_1_2_Pointer)) <= (*(var_1_3_Pointer))) ? (((*(var_1_3_Pointer)) < (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))) + 1.395f)) ? ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) && ((*(var_1_16_Pointer)) ? ((last_1_var_1_7 != last_1_var_1_7) ? ((*(var_1_7_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) - (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))) : ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) - ((((((*(var_1_14_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_15_Pointer))))) - (*(var_1_12_Pointer))))))) : 1)) && (((((*(var_1_17_Pointer)) - (*(var_1_12_Pointer))) - (8 + (*(var_1_18_Pointer)))) > (*(var_1_21_Pointer))) ? ((*(var_1_16_Pointer)) == ((unsigned char) (! (*(var_1_19_Pointer))))) : ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_19_Pointer)))))) && ((*(var_1_20_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && ((*(var_1_21_Pointer)) == ((signed long int) (*(var_1_17_Pointer)))) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L130] EXPR ((((((*(var_1_2_Pointer)) <= (*(var_1_3_Pointer))) ? (((*(var_1_3_Pointer)) < (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))) + 1.395f)) ? ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) && ((*(var_1_16_Pointer)) ? ((last_1_var_1_7 != last_1_var_1_7) ? ((*(var_1_7_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) - (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))) : ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) - ((((((*(var_1_14_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_15_Pointer))))) - (*(var_1_12_Pointer))))))) : 1)) && (((((*(var_1_17_Pointer)) - (*(var_1_12_Pointer))) - (8 + (*(var_1_18_Pointer)))) > (*(var_1_21_Pointer))) ? ((*(var_1_16_Pointer)) == ((unsigned char) (! (*(var_1_19_Pointer))))) : ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_19_Pointer)))))) && ((*(var_1_20_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && ((*(var_1_21_Pointer)) == ((signed long int) (*(var_1_17_Pointer)))) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L130] EXPR (((((((*(var_1_2_Pointer)) <= (*(var_1_3_Pointer))) ? (((*(var_1_3_Pointer)) < (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))) + 1.395f)) ? ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) && ((*(var_1_16_Pointer)) ? ((last_1_var_1_7 != last_1_var_1_7) ? ((*(var_1_7_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) - (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))) : ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) - ((((((*(var_1_14_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_15_Pointer))))) - (*(var_1_12_Pointer))))))) : 1)) && (((((*(var_1_17_Pointer)) - (*(var_1_12_Pointer))) - (8 + (*(var_1_18_Pointer)))) > (*(var_1_21_Pointer))) ? ((*(var_1_16_Pointer)) == ((unsigned char) (! (*(var_1_19_Pointer))))) : ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_19_Pointer)))))) && ((*(var_1_20_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && ((*(var_1_21_Pointer)) == ((signed long int) (*(var_1_17_Pointer))))) && ((*(var_1_22_Pointer)) == ((unsigned char) 4)) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L130] EXPR (((((((*(var_1_2_Pointer)) <= (*(var_1_3_Pointer))) ? (((*(var_1_3_Pointer)) < (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))) + 1.395f)) ? ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) && ((*(var_1_16_Pointer)) ? ((last_1_var_1_7 != last_1_var_1_7) ? ((*(var_1_7_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) - (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))) : ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) - ((((((*(var_1_14_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_15_Pointer))))) - (*(var_1_12_Pointer))))))) : 1)) && (((((*(var_1_17_Pointer)) - (*(var_1_12_Pointer))) - (8 + (*(var_1_18_Pointer)))) > (*(var_1_21_Pointer))) ? ((*(var_1_16_Pointer)) == ((unsigned char) (! (*(var_1_19_Pointer))))) : ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_19_Pointer)))))) && ((*(var_1_20_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && ((*(var_1_21_Pointer)) == ((signed long int) (*(var_1_17_Pointer))))) && ((*(var_1_22_Pointer)) == ((unsigned char) 4)) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L130-L131] return (((((((*(var_1_2_Pointer)) <= (*(var_1_3_Pointer))) ? (((*(var_1_3_Pointer)) < (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))) + 1.395f)) ? ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) && ((*(var_1_16_Pointer)) ? ((last_1_var_1_7 != last_1_var_1_7) ? ((*(var_1_7_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) - (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))) : ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) - ((((((*(var_1_14_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_15_Pointer))))) - (*(var_1_12_Pointer))))))) : 1)) && (((((*(var_1_17_Pointer)) - (*(var_1_12_Pointer))) - (8 + (*(var_1_18_Pointer)))) > (*(var_1_21_Pointer))) ? ((*(var_1_16_Pointer)) == ((unsigned char) (! (*(var_1_19_Pointer))))) : ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_19_Pointer)))))) && ((*(var_1_20_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && ((*(var_1_21_Pointer)) == ((signed long int) (*(var_1_17_Pointer))))) && ((*(var_1_22_Pointer)) == ((unsigned char) 4)) ; [L140] RET, EXPR property() [L140] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 117 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 6, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 132 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 132 mSDsluCounter, 2002 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1200 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 118 IncrementalHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 802 mSDtfsCounter, 118 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 191 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=4, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1176 NumberOfCodeBlocks, 1176 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1002 ConstructedInterpolants, 0 QuantifiedInterpolants, 1256 SizeOfPredicates, 0 NumberOfNonLiveVariables, 762 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 5000/5040 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-04 01:29:15,537 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-p_file-48.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 e8bf74309a8b022d6e645ae6ad00767c20272f1d55203a857771147b8948c784 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:29:17,394 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:29:17,468 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:29:17,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:29:17,472 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:29:17,496 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:29:17,496 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:29:17,496 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:29:17,497 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:29:17,497 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:29:17,497 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:29:17,498 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:29:17,498 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:29:17,498 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:29:17,498 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:29:17,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:29:17,498 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:29:17,498 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:29:17,499 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:29:17,499 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:29:17,499 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:29:17,499 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:29:17,499 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:29:17,499 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:29:17,499 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:29:17,499 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:29:17,499 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:29:17,499 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:29:17,500 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:29:17,500 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:29:17,500 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:29:17,500 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:29:17,500 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:29:17,500 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:29:17,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:29:17,501 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:29:17,501 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:29:17,501 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:29:17,501 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:29:17,501 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:29:17,501 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:29:17,501 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:29:17,501 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:29:17,501 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:29:17,501 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:29:17,501 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 -> e8bf74309a8b022d6e645ae6ad00767c20272f1d55203a857771147b8948c784 [2025-03-04 01:29:17,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:29:17,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:29:17,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:29:17,753 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:29:17,753 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:29:17,755 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-48.i [2025-03-04 01:29:18,910 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e3c539c9/e790abb8803849e3969e7e08a2ef103c/FLAGd60519c70 [2025-03-04 01:29:19,150 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:29:19,151 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-48.i [2025-03-04 01:29:19,158 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e3c539c9/e790abb8803849e3969e7e08a2ef103c/FLAGd60519c70 [2025-03-04 01:29:19,491 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e3c539c9/e790abb8803849e3969e7e08a2ef103c [2025-03-04 01:29:19,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:29:19,494 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:29:19,495 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:29:19,495 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:29:19,497 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:29:19,498 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:29:19" (1/1) ... [2025-03-04 01:29:19,498 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5072f377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:19, skipping insertion in model container [2025-03-04 01:29:19,499 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:29:19" (1/1) ... [2025-03-04 01:29:19,515 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:29:19,612 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-p_file-48.i[916,929] [2025-03-04 01:29:19,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:29:19,677 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:29:19,685 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-p_file-48.i[916,929] [2025-03-04 01:29:19,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:29:19,721 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:29:19,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:19 WrapperNode [2025-03-04 01:29:19,723 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:29:19,723 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:29:19,723 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:29:19,724 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:29:19,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:19" (1/1) ... [2025-03-04 01:29:19,738 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:19" (1/1) ... [2025-03-04 01:29:19,759 INFO L138 Inliner]: procedures = 33, calls = 194, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 547 [2025-03-04 01:29:19,760 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:29:19,760 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:29:19,760 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:29:19,760 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:29:19,766 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:19" (1/1) ... [2025-03-04 01:29:19,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:19" (1/1) ... [2025-03-04 01:29:19,770 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:19" (1/1) ... [2025-03-04 01:29:19,788 INFO L175 MemorySlicer]: Split 143 memory accesses to 20 slices as follows [2, 7, 8, 10, 8, 8, 12, 6, 8, 10, 6, 10, 8, 7, 8, 6, 8, 3, 5, 3]. 8 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 23 writes are split as follows [0, 3, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1]. [2025-03-04 01:29:19,788 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:19" (1/1) ... [2025-03-04 01:29:19,788 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:19" (1/1) ... [2025-03-04 01:29:19,804 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:19" (1/1) ... [2025-03-04 01:29:19,806 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:19" (1/1) ... [2025-03-04 01:29:19,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:19" (1/1) ... [2025-03-04 01:29:19,817 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:19" (1/1) ... [2025-03-04 01:29:19,827 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:29:19,828 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:29:19,828 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:29:19,828 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:29:19,829 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:19" (1/1) ... [2025-03-04 01:29:19,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:29:19,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:29:19,857 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-04 01:29:19,861 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-04 01:29:19,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:29:19,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:29:19,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:29:19,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 01:29:19,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-04 01:29:19,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-04 01:29:19,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-04 01:29:19,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-04 01:29:19,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-03-04 01:29:19,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-03-04 01:29:19,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-03-04 01:29:19,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-03-04 01:29:19,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-03-04 01:29:19,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2025-03-04 01:29:19,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2025-03-04 01:29:19,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2025-03-04 01:29:19,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2025-03-04 01:29:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#16 [2025-03-04 01:29:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#17 [2025-03-04 01:29:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#18 [2025-03-04 01:29:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#19 [2025-03-04 01:29:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:29:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:29:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 01:29:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-04 01:29:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-04 01:29:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-04 01:29:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-04 01:29:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-03-04 01:29:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-03-04 01:29:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-03-04 01:29:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-03-04 01:29:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-03-04 01:29:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2025-03-04 01:29:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2025-03-04 01:29:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2025-03-04 01:29:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2025-03-04 01:29:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#16 [2025-03-04 01:29:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#17 [2025-03-04 01:29:19,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#18 [2025-03-04 01:29:19,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#19 [2025-03-04 01:29:19,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-04 01:29:19,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-04 01:29:19,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-04 01:29:19,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-04 01:29:19,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-04 01:29:19,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-04 01:29:19,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-04 01:29:19,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-03-04 01:29:19,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-03-04 01:29:19,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-03-04 01:29:19,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2025-03-04 01:29:19,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2025-03-04 01:29:19,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2025-03-04 01:29:19,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2025-03-04 01:29:19,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2025-03-04 01:29:19,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#15 [2025-03-04 01:29:19,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#16 [2025-03-04 01:29:19,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#17 [2025-03-04 01:29:19,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#18 [2025-03-04 01:29:19,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#19 [2025-03-04 01:29:19,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-04 01:29:19,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-04 01:29:19,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-04 01:29:19,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-04 01:29:19,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-04 01:29:19,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-04 01:29:19,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-03-04 01:29:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2025-03-04 01:29:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2025-03-04 01:29:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2025-03-04 01:29:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2025-03-04 01:29:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2025-03-04 01:29:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2025-03-04 01:29:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2025-03-04 01:29:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2025-03-04 01:29:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#15 [2025-03-04 01:29:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#16 [2025-03-04 01:29:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#17 [2025-03-04 01:29:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#18 [2025-03-04 01:29:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#19 [2025-03-04 01:29:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 01:29:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 01:29:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-04 01:29:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-04 01:29:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-04 01:29:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-04 01:29:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-04 01:29:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-03-04 01:29:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-03-04 01:29:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-03-04 01:29:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2025-03-04 01:29:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2025-03-04 01:29:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2025-03-04 01:29:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2025-03-04 01:29:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2025-03-04 01:29:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#15 [2025-03-04 01:29:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#16 [2025-03-04 01:29:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#17 [2025-03-04 01:29:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#18 [2025-03-04 01:29:19,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#19 [2025-03-04 01:29:19,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-04 01:29:19,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-04 01:29:19,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-04 01:29:19,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-04 01:29:19,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-04 01:29:19,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-04 01:29:19,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-03-04 01:29:19,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2025-03-04 01:29:19,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2025-03-04 01:29:19,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2025-03-04 01:29:19,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2025-03-04 01:29:19,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2025-03-04 01:29:19,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2025-03-04 01:29:19,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2025-03-04 01:29:19,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2025-03-04 01:29:19,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#15 [2025-03-04 01:29:19,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#16 [2025-03-04 01:29:19,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#17 [2025-03-04 01:29:19,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#18 [2025-03-04 01:29:19,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#19 [2025-03-04 01:29:19,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-04 01:29:19,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-04 01:29:19,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-04 01:29:19,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-04 01:29:19,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-04 01:29:19,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-04 01:29:19,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-03-04 01:29:19,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2025-03-04 01:29:19,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2025-03-04 01:29:19,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2025-03-04 01:29:19,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2025-03-04 01:29:19,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2025-03-04 01:29:19,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2025-03-04 01:29:19,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2025-03-04 01:29:19,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2025-03-04 01:29:19,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#15 [2025-03-04 01:29:19,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#16 [2025-03-04 01:29:19,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#17 [2025-03-04 01:29:19,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#18 [2025-03-04 01:29:19,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#19 [2025-03-04 01:29:19,891 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:29:19,891 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:29:19,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:29:19,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:29:19,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:29:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:29:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-04 01:29:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-04 01:29:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-04 01:29:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-04 01:29:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-04 01:29:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-03-04 01:29:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-03-04 01:29:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-03-04 01:29:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-03-04 01:29:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-03-04 01:29:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2025-03-04 01:29:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2025-03-04 01:29:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2025-03-04 01:29:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2025-03-04 01:29:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#16 [2025-03-04 01:29:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#17 [2025-03-04 01:29:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#18 [2025-03-04 01:29:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#19 [2025-03-04 01:29:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 01:29:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 01:29:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-04 01:29:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-04 01:29:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-04 01:29:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-04 01:29:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-03-04 01:29:19,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-03-04 01:29:19,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2025-03-04 01:29:19,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2025-03-04 01:29:19,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2025-03-04 01:29:19,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2025-03-04 01:29:19,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2025-03-04 01:29:19,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2025-03-04 01:29:19,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2025-03-04 01:29:19,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#15 [2025-03-04 01:29:19,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#16 [2025-03-04 01:29:19,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#17 [2025-03-04 01:29:19,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#18 [2025-03-04 01:29:19,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#19 [2025-03-04 01:29:20,151 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:29:20,153 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:29:21,413 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L130: havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite108#1;havoc property_#t~mem100#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~ite105#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~mem109#1;havoc property_#t~ite123#1;havoc property_#t~ite122#1;havoc property_#t~mem113#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~mem119#1;havoc property_#t~short124#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~ite133#1;havoc property_#t~mem130#1;havoc property_#t~mem129#1;havoc property_#t~mem132#1;havoc property_#t~mem131#1;havoc property_#t~short134#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~short137#1;havoc property_#t~mem139#1;havoc property_#t~mem138#1;havoc property_#t~short140#1;havoc property_#t~mem141#1;havoc property_#t~short142#1; [2025-03-04 01:29:21,450 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-03-04 01:29:21,450 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:29:21,458 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:29:21,459 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:29:21,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:29:21 BoogieIcfgContainer [2025-03-04 01:29:21,459 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:29:21,461 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:29:21,461 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:29:21,464 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:29:21,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:29:19" (1/3) ... [2025-03-04 01:29:21,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a681022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:29:21, skipping insertion in model container [2025-03-04 01:29:21,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:29:19" (2/3) ... [2025-03-04 01:29:21,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a681022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:29:21, skipping insertion in model container [2025-03-04 01:29:21,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:29:21" (3/3) ... [2025-03-04 01:29:21,466 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-48.i [2025-03-04 01:29:21,476 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:29:21,477 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-48.i that has 2 procedures, 117 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:29:21,521 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:29:21,528 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;@656117d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:29:21,528 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:29:21,531 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 94 states have internal predecessors, (129), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:29:21,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 01:29:21,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:21,539 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:21,539 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:21,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:21,543 INFO L85 PathProgramCache]: Analyzing trace with hash -2069252283, now seen corresponding path program 1 times [2025-03-04 01:29:21,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:29:21,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2121611695] [2025-03-04 01:29:21,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:21,551 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-04 01:29:21,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:29:21,553 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-04 01:29:21,555 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-04 01:29:21,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:29:21,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:29:21,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:21,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:21,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:29:21,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:21,987 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 724 trivial. 0 not checked. [2025-03-04 01:29:21,988 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:29:21,989 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:29:21,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2121611695] [2025-03-04 01:29:21,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2121611695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:29:21,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:29:21,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:29:21,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752053265] [2025-03-04 01:29:21,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:21,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:29:21,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:29:22,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:29:22,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:29:22,008 INFO L87 Difference]: Start difference. First operand has 117 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 94 states have internal predecessors, (129), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:29:22,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:22,035 INFO L93 Difference]: Finished difference Result 228 states and 358 transitions. [2025-03-04 01:29:22,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:29:22,036 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2025-03-04 01:29:22,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:22,040 INFO L225 Difference]: With dead ends: 228 [2025-03-04 01:29:22,041 INFO L226 Difference]: Without dead ends: 114 [2025-03-04 01:29:22,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 167 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-04 01:29:22,044 INFO L435 NwaCegarLoop]: 164 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, 164 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-04 01:29:22,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:29:22,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-04 01:29:22,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-03-04 01:29:22,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:29:22,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2025-03-04 01:29:22,076 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 168 [2025-03-04 01:29:22,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:22,076 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2025-03-04 01:29:22,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:29:22,076 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2025-03-04 01:29:22,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 01:29:22,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:22,078 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:22,087 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-04 01:29:22,279 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-04 01:29:22,279 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:22,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:22,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1137364116, now seen corresponding path program 1 times [2025-03-04 01:29:22,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:29:22,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [859669536] [2025-03-04 01:29:22,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:22,281 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-04 01:29:22,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:29:22,283 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-04 01:29:22,284 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-04 01:29:22,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:29:22,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:29:22,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:22,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:22,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 01:29:22,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:23,464 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 51 treesize of output 38 [2025-03-04 01:29:23,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:29:23,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 51 [2025-03-04 01:29:23,483 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 40 treesize of output 28 [2025-03-04 01:29:23,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 4 [2025-03-04 01:29:23,516 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 17 treesize of output 9 [2025-03-04 01:29:23,529 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:29:23,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:29:23,567 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 40 treesize of output 36 [2025-03-04 01:29:23,570 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 01:29:23,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:29:23,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 52 [2025-03-04 01:29:23,729 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-03-04 01:29:23,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 20 treesize of output 19 [2025-03-04 01:29:24,047 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-04 01:29:24,048 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:29:24,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [859669536] [2025-03-04 01:29:24,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [859669536] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:29:24,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:29:24,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 14 [2025-03-04 01:29:24,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817529104] [2025-03-04 01:29:24,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:24,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:29:24,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:29:24,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:29:24,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:29:24,049 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 2 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:29:24,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:24,691 INFO L93 Difference]: Finished difference Result 348 states and 496 transitions. [2025-03-04 01:29:24,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:29:24,692 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 2 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2025-03-04 01:29:24,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:24,694 INFO L225 Difference]: With dead ends: 348 [2025-03-04 01:29:24,694 INFO L226 Difference]: Without dead ends: 237 [2025-03-04 01:29:24,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 324 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2025-03-04 01:29:24,696 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 1009 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1009 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:24,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1009 Valid, 527 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:29:24,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-04 01:29:24,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 120. [2025-03-04 01:29:24,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 96 states have (on average 1.3229166666666667) internal successors, (127), 96 states have internal predecessors, (127), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:29:24,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 169 transitions. [2025-03-04 01:29:24,717 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 169 transitions. Word has length 168 [2025-03-04 01:29:24,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:24,717 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 169 transitions. [2025-03-04 01:29:24,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 2 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:29:24,717 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 169 transitions. [2025-03-04 01:29:24,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 01:29:24,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:24,719 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:24,728 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-04 01:29:24,921 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-04 01:29:24,921 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:24,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:24,922 INFO L85 PathProgramCache]: Analyzing trace with hash 292892245, now seen corresponding path program 1 times [2025-03-04 01:29:24,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:29:24,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292433329] [2025-03-04 01:29:24,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:24,922 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-04 01:29:24,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:29:24,925 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-04 01:29:24,926 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-04 01:29:25,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:29:25,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:29:25,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:25,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:25,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:29:25,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:25,317 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:29:25,318 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:29:25,318 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:29:25,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292433329] [2025-03-04 01:29:25,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292433329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:29:25,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:29:25,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:29:25,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959218749] [2025-03-04 01:29:25,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:25,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:29:25,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:29:25,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:29:25,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:29:25,319 INFO L87 Difference]: Start difference. First operand 120 states and 169 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:29:25,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:25,361 INFO L93 Difference]: Finished difference Result 242 states and 342 transitions. [2025-03-04 01:29:25,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:29:25,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2025-03-04 01:29:25,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:25,364 INFO L225 Difference]: With dead ends: 242 [2025-03-04 01:29:25,364 INFO L226 Difference]: Without dead ends: 125 [2025-03-04 01:29:25,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:29:25,365 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 1 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:25,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 620 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:29:25,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-04 01:29:25,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2025-03-04 01:29:25,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 100 states have (on average 1.31) internal successors, (131), 100 states have internal predecessors, (131), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:29:25,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 173 transitions. [2025-03-04 01:29:25,382 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 173 transitions. Word has length 168 [2025-03-04 01:29:25,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:25,383 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 173 transitions. [2025-03-04 01:29:25,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:29:25,383 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 173 transitions. [2025-03-04 01:29:25,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 01:29:25,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:25,384 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:25,394 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-04 01:29:25,585 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-04 01:29:25,585 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:25,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:25,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1514562218, now seen corresponding path program 1 times [2025-03-04 01:29:25,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:29:25,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [812452573] [2025-03-04 01:29:25,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:25,586 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-04 01:29:25,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:29:25,588 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-04 01:29:25,589 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-04 01:29:25,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:29:25,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:29:25,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:25,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:25,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:29:25,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:25,973 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:29:25,973 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:29:25,973 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:29:25,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [812452573] [2025-03-04 01:29:25,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [812452573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:29:25,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:29:25,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:29:25,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136133926] [2025-03-04 01:29:25,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:25,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:29:25,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:29:25,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:29:25,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:29:25,975 INFO L87 Difference]: Start difference. First operand 124 states and 173 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:29:26,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:26,032 INFO L93 Difference]: Finished difference Result 248 states and 347 transitions. [2025-03-04 01:29:26,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:29:26,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2025-03-04 01:29:26,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:26,034 INFO L225 Difference]: With dead ends: 248 [2025-03-04 01:29:26,034 INFO L226 Difference]: Without dead ends: 127 [2025-03-04 01:29:26,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:29:26,035 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:26,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 765 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:29:26,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-04 01:29:26,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2025-03-04 01:29:26,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 102 states have (on average 1.303921568627451) internal successors, (133), 102 states have internal predecessors, (133), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:29:26,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 175 transitions. [2025-03-04 01:29:26,050 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 175 transitions. Word has length 168 [2025-03-04 01:29:26,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:26,051 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 175 transitions. [2025-03-04 01:29:26,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:29:26,051 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 175 transitions. [2025-03-04 01:29:26,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 01:29:26,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:26,052 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:26,062 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-04 01:29:26,253 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-04 01:29:26,253 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:26,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:26,254 INFO L85 PathProgramCache]: Analyzing trace with hash -627058537, now seen corresponding path program 1 times [2025-03-04 01:29:26,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:29:26,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1580169603] [2025-03-04 01:29:26,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:26,254 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-04 01:29:26,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:29:26,256 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-04 01:29:26,257 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-04 01:29:26,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:29:26,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:29:26,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:26,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:26,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 01:29:26,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:26,626 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:29:26,626 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:29:26,626 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:29:26,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1580169603] [2025-03-04 01:29:26,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1580169603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:29:26,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:29:26,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:29:26,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332070809] [2025-03-04 01:29:26,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:26,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:29:26,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:29:26,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:29:26,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:29:26,627 INFO L87 Difference]: Start difference. First operand 126 states and 175 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:29:26,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:26,680 INFO L93 Difference]: Finished difference Result 252 states and 351 transitions. [2025-03-04 01:29:26,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:29:26,686 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2025-03-04 01:29:26,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:26,688 INFO L225 Difference]: With dead ends: 252 [2025-03-04 01:29:26,688 INFO L226 Difference]: Without dead ends: 129 [2025-03-04 01:29:26,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:29:26,690 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 1 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:26,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 911 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:29:26,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-04 01:29:26,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2025-03-04 01:29:26,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 104 states have (on average 1.2980769230769231) internal successors, (135), 104 states have internal predecessors, (135), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:29:26,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 177 transitions. [2025-03-04 01:29:26,705 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 177 transitions. Word has length 168 [2025-03-04 01:29:26,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:26,705 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 177 transitions. [2025-03-04 01:29:26,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:29:26,706 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 177 transitions. [2025-03-04 01:29:26,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 01:29:26,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:26,707 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:26,716 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-04 01:29:26,907 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-04 01:29:26,907 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:26,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:26,908 INFO L85 PathProgramCache]: Analyzing trace with hash -626135016, now seen corresponding path program 1 times [2025-03-04 01:29:26,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:29:26,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1564956873] [2025-03-04 01:29:26,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:26,908 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-04 01:29:26,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:29:26,910 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-04 01:29:26,911 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-04 01:29:27,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:29:27,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:29:27,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:27,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:27,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:29:27,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:27,309 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 77 treesize of output 41 [2025-03-04 01:29:27,327 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2025-03-04 01:29:27,327 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:29:27,327 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:29:27,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1564956873] [2025-03-04 01:29:27,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1564956873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:29:27,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:29:27,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:29:27,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043811265] [2025-03-04 01:29:27,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:27,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:29:27,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:29:27,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:29:27,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:29:27,331 INFO L87 Difference]: Start difference. First operand 128 states and 177 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:29:28,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:28,714 INFO L93 Difference]: Finished difference Result 254 states and 352 transitions. [2025-03-04 01:29:28,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:29:28,719 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2025-03-04 01:29:28,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:28,720 INFO L225 Difference]: With dead ends: 254 [2025-03-04 01:29:28,720 INFO L226 Difference]: Without dead ends: 129 [2025-03-04 01:29:28,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:29:28,721 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 144 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:28,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 502 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 01:29:28,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-04 01:29:28,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2025-03-04 01:29:28,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 104 states have (on average 1.2884615384615385) internal successors, (134), 104 states have internal predecessors, (134), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:29:28,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 176 transitions. [2025-03-04 01:29:28,730 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 176 transitions. Word has length 168 [2025-03-04 01:29:28,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:28,730 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 176 transitions. [2025-03-04 01:29:28,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:29:28,731 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 176 transitions. [2025-03-04 01:29:28,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-04 01:29:28,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:28,732 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:28,743 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-04 01:29:28,933 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-04 01:29:28,933 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:28,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:28,933 INFO L85 PathProgramCache]: Analyzing trace with hash -2030294794, now seen corresponding path program 1 times [2025-03-04 01:29:28,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:29:28,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910334230] [2025-03-04 01:29:28,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:28,934 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-04 01:29:28,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:29:28,936 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-04 01:29:28,937 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-04 01:29:29,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-04 01:29:29,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-04 01:29:29,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:29,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:29,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:29:29,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:29,339 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 77 treesize of output 41 [2025-03-04 01:29:29,356 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2025-03-04 01:29:29,356 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:29:29,356 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:29:29,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1910334230] [2025-03-04 01:29:29,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1910334230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:29:29,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:29:29,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:29:29,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702961034] [2025-03-04 01:29:29,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:29,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:29:29,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:29:29,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:29:29,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:29:29,358 INFO L87 Difference]: Start difference. First operand 128 states and 176 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:29:30,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:30,663 INFO L93 Difference]: Finished difference Result 254 states and 350 transitions. [2025-03-04 01:29:30,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:29:30,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 170 [2025-03-04 01:29:30,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:30,669 INFO L225 Difference]: With dead ends: 254 [2025-03-04 01:29:30,669 INFO L226 Difference]: Without dead ends: 129 [2025-03-04 01:29:30,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:29:30,670 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 134 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:30,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 501 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 01:29:30,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-04 01:29:30,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2025-03-04 01:29:30,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 104 states have (on average 1.2788461538461537) internal successors, (133), 104 states have internal predecessors, (133), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:29:30,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 175 transitions. [2025-03-04 01:29:30,676 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 175 transitions. Word has length 170 [2025-03-04 01:29:30,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:30,677 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 175 transitions. [2025-03-04 01:29:30,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:29:30,677 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 175 transitions. [2025-03-04 01:29:30,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-04 01:29:30,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:30,678 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:30,688 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-04 01:29:30,878 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-04 01:29:30,879 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:30,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:30,879 INFO L85 PathProgramCache]: Analyzing trace with hash 803810521, now seen corresponding path program 1 times [2025-03-04 01:29:30,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:29:30,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228921141] [2025-03-04 01:29:30,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:30,880 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-04 01:29:30,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:29:30,881 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-04 01:29:30,882 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-04 01:29:31,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 01:29:31,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 01:29:31,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:31,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:31,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:29:31,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:31,205 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2025-03-04 01:29:31,205 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:29:31,205 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:29:31,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228921141] [2025-03-04 01:29:31,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [228921141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:29:31,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:29:31,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:29:31,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713390194] [2025-03-04 01:29:31,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:31,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:29:31,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:29:31,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:29:31,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:29:31,206 INFO L87 Difference]: Start difference. First operand 128 states and 175 transitions. Second operand has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-04 01:29:31,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:31,347 INFO L93 Difference]: Finished difference Result 259 states and 354 transitions. [2025-03-04 01:29:31,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:29:31,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) Word has length 172 [2025-03-04 01:29:31,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:31,349 INFO L225 Difference]: With dead ends: 259 [2025-03-04 01:29:31,349 INFO L226 Difference]: Without dead ends: 132 [2025-03-04 01:29:31,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:29:31,349 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 1 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:31,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 639 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:29:31,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-04 01:29:31,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 128. [2025-03-04 01:29:31,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 104 states have (on average 1.2692307692307692) internal successors, (132), 104 states have internal predecessors, (132), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:29:31,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 174 transitions. [2025-03-04 01:29:31,364 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 174 transitions. Word has length 172 [2025-03-04 01:29:31,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:31,364 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 174 transitions. [2025-03-04 01:29:31,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-04 01:29:31,364 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 174 transitions. [2025-03-04 01:29:31,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-04 01:29:31,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:31,366 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:31,377 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-04 01:29:31,566 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-04 01:29:31,566 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:31,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:31,567 INFO L85 PathProgramCache]: Analyzing trace with hash -2043149928, now seen corresponding path program 1 times [2025-03-04 01:29:31,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:29:31,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [870001994] [2025-03-04 01:29:31,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:31,567 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-04 01:29:31,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:29:31,569 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-04 01:29:31,570 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-04 01:29:31,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 01:29:31,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 01:29:31,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:31,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:31,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 01:29:31,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:32,736 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-04 01:29:32,817 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 128 treesize of output 92 [2025-03-04 01:29:32,820 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 140 treesize of output 80 [2025-03-04 01:29:32,868 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2025-03-04 01:29:32,868 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:29:32,999 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:29:32,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [870001994] [2025-03-04 01:29:33,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [870001994] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:29:33,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [850286965] [2025-03-04 01:29:33,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:33,000 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:29:33,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:29:33,003 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:29:33,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2025-03-04 01:29:33,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 01:29:34,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 01:29:34,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:34,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:34,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 01:29:34,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:35,007 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-04 01:29:36,157 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-04 01:29:36,287 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 128 treesize of output 92 [2025-03-04 01:29:36,289 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 140 treesize of output 80 [2025-03-04 01:29:36,303 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2025-03-04 01:29:36,303 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:29:36,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [850286965] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:29:36,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:29:36,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2025-03-04 01:29:36,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016626955] [2025-03-04 01:29:36,363 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:29:36,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 01:29:36,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:29:36,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 01:29:36,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:29:36,364 INFO L87 Difference]: Start difference. First operand 128 states and 174 transitions. Second operand has 16 states, 16 states have (on average 8.25) internal successors, (132), 15 states have internal predecessors, (132), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2025-03-04 01:29:39,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:39,730 INFO L93 Difference]: Finished difference Result 381 states and 517 transitions. [2025-03-04 01:29:39,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:29:39,733 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 8.25) internal successors, (132), 15 states have internal predecessors, (132), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) Word has length 172 [2025-03-04 01:29:39,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:39,734 INFO L225 Difference]: With dead ends: 381 [2025-03-04 01:29:39,734 INFO L226 Difference]: Without dead ends: 256 [2025-03-04 01:29:39,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 371 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=129, Invalid=521, Unknown=0, NotChecked=0, Total=650 [2025-03-04 01:29:39,735 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 697 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:39,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 1162 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-04 01:29:39,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-04 01:29:39,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 253. [2025-03-04 01:29:39,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 205 states have (on average 1.2634146341463415) internal successors, (259), 206 states have internal predecessors, (259), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 01:29:39,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 343 transitions. [2025-03-04 01:29:39,751 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 343 transitions. Word has length 172 [2025-03-04 01:29:39,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:39,752 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 343 transitions. [2025-03-04 01:29:39,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.25) internal successors, (132), 15 states have internal predecessors, (132), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2025-03-04 01:29:39,752 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 343 transitions. [2025-03-04 01:29:39,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-04 01:29:39,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:39,753 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:39,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2025-03-04 01:29:39,962 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 (10)] Ended with exit code 0 [2025-03-04 01:29:40,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /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-04 01:29:40,154 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:40,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:40,154 INFO L85 PathProgramCache]: Analyzing trace with hash -112919079, now seen corresponding path program 1 times [2025-03-04 01:29:40,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:29:40,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1457514728] [2025-03-04 01:29:40,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:40,154 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-04 01:29:40,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:29:40,156 INFO L229 MonitoredProcess]: Starting monitored process 12 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-04 01:29:40,157 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 (12)] Waiting until timeout for monitored process [2025-03-04 01:29:40,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 01:29:40,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 01:29:40,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:40,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:40,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:29:40,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:40,460 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2025-03-04 01:29:40,460 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:29:40,460 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:29:40,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1457514728] [2025-03-04 01:29:40,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1457514728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:29:40,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:29:40,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:29:40,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028238185] [2025-03-04 01:29:40,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:40,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:29:40,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:29:40,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:29:40,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:29:40,463 INFO L87 Difference]: Start difference. First operand 253 states and 343 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:29:40,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:40,511 INFO L93 Difference]: Finished difference Result 503 states and 683 transitions. [2025-03-04 01:29:40,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:29:40,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 172 [2025-03-04 01:29:40,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:40,513 INFO L225 Difference]: With dead ends: 503 [2025-03-04 01:29:40,514 INFO L226 Difference]: Without dead ends: 253 [2025-03-04 01:29:40,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 169 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-04 01:29:40,515 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:40,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 469 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:29:40,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-04 01:29:40,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2025-03-04 01:29:40,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 205 states have (on average 1.2585365853658537) internal successors, (258), 206 states have internal predecessors, (258), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 01:29:40,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 342 transitions. [2025-03-04 01:29:40,535 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 342 transitions. Word has length 172 [2025-03-04 01:29:40,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:40,536 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 342 transitions. [2025-03-04 01:29:40,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:29:40,536 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 342 transitions. [2025-03-04 01:29:40,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-04 01:29:40,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:40,537 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:40,547 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 (12)] Ended with exit code 0 [2025-03-04 01:29:40,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-04 01:29:40,738 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:40,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:40,738 INFO L85 PathProgramCache]: Analyzing trace with hash 288183414, now seen corresponding path program 1 times [2025-03-04 01:29:40,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:29:40,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852716626] [2025-03-04 01:29:40,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:40,739 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-04 01:29:40,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:29:40,742 INFO L229 MonitoredProcess]: Starting monitored process 13 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-04 01:29:40,743 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 (13)] Waiting until timeout for monitored process [2025-03-04 01:29:40,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-04 01:29:41,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 01:29:41,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:41,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:41,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 01:29:41,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:41,881 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-04 01:29:41,945 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 128 treesize of output 92 [2025-03-04 01:29:41,954 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 138 treesize of output 78 [2025-03-04 01:29:41,992 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 16 proven. 320 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2025-03-04 01:29:41,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:29:42,082 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:29:42,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852716626] [2025-03-04 01:29:42,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852716626] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:29:42,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1455748480] [2025-03-04 01:29:42,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:42,082 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:29:42,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:29:42,084 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:29:42,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2025-03-04 01:29:42,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-04 01:29:43,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 01:29:43,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:43,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:43,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 01:29:43,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:44,016 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-04 01:29:45,265 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-04 01:29:45,398 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 128 treesize of output 92 [2025-03-04 01:29:45,399 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 138 treesize of output 78 [2025-03-04 01:29:45,414 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 16 proven. 320 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2025-03-04 01:29:45,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:29:45,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1455748480] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:29:45,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:29:45,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2025-03-04 01:29:45,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022438838] [2025-03-04 01:29:45,477 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:29:45,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 01:29:45,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:29:45,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 01:29:45,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2025-03-04 01:29:45,478 INFO L87 Difference]: Start difference. First operand 253 states and 342 transitions. Second operand has 22 states, 20 states have (on average 7.1) internal successors, (142), 19 states have internal predecessors, (142), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 4 states have call predecessors, (42), 6 states have call successors, (42) [2025-03-04 01:29:49,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:49,975 INFO L93 Difference]: Finished difference Result 668 states and 901 transitions. [2025-03-04 01:29:49,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 01:29:49,976 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 7.1) internal successors, (142), 19 states have internal predecessors, (142), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 4 states have call predecessors, (42), 6 states have call successors, (42) Word has length 174 [2025-03-04 01:29:49,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:49,978 INFO L225 Difference]: With dead ends: 668 [2025-03-04 01:29:49,978 INFO L226 Difference]: Without dead ends: 418 [2025-03-04 01:29:49,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 369 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=301, Invalid=1259, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 01:29:49,980 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 531 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 1465 SdHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:49,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 1465 Invalid, 1267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-04 01:29:49,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-03-04 01:29:50,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 320. [2025-03-04 01:29:50,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 251 states have (on average 1.247011952191235) internal successors, (313), 254 states have internal predecessors, (313), 61 states have call successors, (61), 7 states have call predecessors, (61), 7 states have return successors, (61), 58 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-04 01:29:50,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 435 transitions. [2025-03-04 01:29:50,006 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 435 transitions. Word has length 174 [2025-03-04 01:29:50,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:50,009 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 435 transitions. [2025-03-04 01:29:50,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 7.1) internal successors, (142), 19 states have internal predecessors, (142), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 4 states have call predecessors, (42), 6 states have call successors, (42) [2025-03-04 01:29:50,010 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 435 transitions. [2025-03-04 01:29:50,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-04 01:29:50,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:50,011 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:50,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2025-03-04 01:29:50,221 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 (13)] Ended with exit code 0 [2025-03-04 01:29:50,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /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-04 01:29:50,412 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:50,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:50,412 INFO L85 PathProgramCache]: Analyzing trace with hash 73354261, now seen corresponding path program 1 times [2025-03-04 01:29:50,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:29:50,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2053748550] [2025-03-04 01:29:50,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:50,413 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-04 01:29:50,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:29:50,415 INFO L229 MonitoredProcess]: Starting monitored process 15 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-04 01:29:50,415 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 (15)] Waiting until timeout for monitored process [2025-03-04 01:29:50,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-04 01:29:50,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 01:29:50,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:50,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:50,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:29:50,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:50,751 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2025-03-04 01:29:50,751 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:29:50,751 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:29:50,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2053748550] [2025-03-04 01:29:50,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2053748550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:29:50,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:29:50,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:29:50,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091363981] [2025-03-04 01:29:50,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:50,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:29:50,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:29:50,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:29:50,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:29:50,752 INFO L87 Difference]: Start difference. First operand 320 states and 435 transitions. Second operand has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-04 01:29:50,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:50,935 INFO L93 Difference]: Finished difference Result 502 states and 675 transitions. [2025-03-04 01:29:50,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:29:50,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) Word has length 174 [2025-03-04 01:29:50,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:50,937 INFO L225 Difference]: With dead ends: 502 [2025-03-04 01:29:50,937 INFO L226 Difference]: Without dead ends: 208 [2025-03-04 01:29:50,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:29:50,938 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 1 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:50,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 639 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:29:50,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-03-04 01:29:50,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 202. [2025-03-04 01:29:50,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 156 states have (on average 1.2307692307692308) internal successors, (192), 158 states have internal predecessors, (192), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:29:50,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 272 transitions. [2025-03-04 01:29:50,955 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 272 transitions. Word has length 174 [2025-03-04 01:29:50,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:50,956 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 272 transitions. [2025-03-04 01:29:50,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-04 01:29:50,956 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 272 transitions. [2025-03-04 01:29:50,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-04 01:29:50,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:50,959 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:50,970 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 (15)] Ended with exit code 0 [2025-03-04 01:29:51,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-04 01:29:51,160 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:51,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:51,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1958467920, now seen corresponding path program 1 times [2025-03-04 01:29:51,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:29:51,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1419958059] [2025-03-04 01:29:51,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:51,161 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-04 01:29:51,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:29:51,162 INFO L229 MonitoredProcess]: Starting monitored process 16 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-04 01:29:51,163 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 (16)] Waiting until timeout for monitored process [2025-03-04 01:29:51,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-04 01:29:51,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 01:29:51,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:51,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:51,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:29:51,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:51,534 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:29:51,534 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:29:51,534 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:29:51,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1419958059] [2025-03-04 01:29:51,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1419958059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:29:51,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:29:51,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:29:51,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036493925] [2025-03-04 01:29:51,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:51,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:29:51,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:29:51,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:29:51,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:29:51,535 INFO L87 Difference]: Start difference. First operand 202 states and 272 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:29:51,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:51,568 INFO L93 Difference]: Finished difference Result 375 states and 503 transitions. [2025-03-04 01:29:51,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:29:51,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 174 [2025-03-04 01:29:51,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:51,570 INFO L225 Difference]: With dead ends: 375 [2025-03-04 01:29:51,571 INFO L226 Difference]: Without dead ends: 205 [2025-03-04 01:29:51,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:29:51,572 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:51,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 611 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:29:51,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-04 01:29:51,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2025-03-04 01:29:51,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 159 states have (on average 1.2264150943396226) internal successors, (195), 161 states have internal predecessors, (195), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:29:51,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 275 transitions. [2025-03-04 01:29:51,587 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 275 transitions. Word has length 174 [2025-03-04 01:29:51,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:51,588 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 275 transitions. [2025-03-04 01:29:51,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:29:51,588 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 275 transitions. [2025-03-04 01:29:51,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-04 01:29:51,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:51,589 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:51,601 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 (16)] Ended with exit code 0 [2025-03-04 01:29:51,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-04 01:29:51,790 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:51,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:51,790 INFO L85 PathProgramCache]: Analyzing trace with hash -471487818, now seen corresponding path program 1 times [2025-03-04 01:29:51,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:29:51,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207438400] [2025-03-04 01:29:51,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:51,791 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-04 01:29:51,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:29:51,793 INFO L229 MonitoredProcess]: Starting monitored process 17 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-04 01:29:51,794 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 (17)] Waiting until timeout for monitored process [2025-03-04 01:29:51,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-04 01:29:52,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 01:29:52,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:52,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:52,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 01:29:52,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:53,102 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 110 treesize of output 62 [2025-03-04 01:29:53,106 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 50 treesize of output 26 [2025-03-04 01:29:53,163 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:29:53,163 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:29:53,163 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:29:53,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207438400] [2025-03-04 01:29:53,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1207438400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:29:53,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:29:53,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:29:53,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952703190] [2025-03-04 01:29:53,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:53,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:29:53,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:29:53,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:29:53,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:29:53,164 INFO L87 Difference]: Start difference. First operand 205 states and 275 transitions. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 9 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:29:57,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:57,085 INFO L93 Difference]: Finished difference Result 618 states and 822 transitions. [2025-03-04 01:29:57,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:29:57,091 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 9 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 174 [2025-03-04 01:29:57,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:57,093 INFO L225 Difference]: With dead ends: 618 [2025-03-04 01:29:57,093 INFO L226 Difference]: Without dead ends: 445 [2025-03-04 01:29:57,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:29:57,094 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 424 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 43 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:57,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 858 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 498 Invalid, 3 Unknown, 0 Unchecked, 3.6s Time] [2025-03-04 01:29:57,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2025-03-04 01:29:57,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 357. [2025-03-04 01:29:57,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 266 states have (on average 1.2105263157894737) internal successors, (322), 270 states have internal predecessors, (322), 80 states have call successors, (80), 10 states have call predecessors, (80), 10 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-04 01:29:57,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 482 transitions. [2025-03-04 01:29:57,131 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 482 transitions. Word has length 174 [2025-03-04 01:29:57,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:57,132 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 482 transitions. [2025-03-04 01:29:57,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 9 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:29:57,132 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 482 transitions. [2025-03-04 01:29:57,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-04 01:29:57,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:57,133 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:57,145 INFO L540 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 (17)] Forceful destruction successful, exit code 0 [2025-03-04 01:29:57,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-04 01:29:57,334 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:57,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:57,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1721025975, now seen corresponding path program 1 times [2025-03-04 01:29:57,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:29:57,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363976290] [2025-03-04 01:29:57,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:57,335 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-04 01:29:57,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:29:57,336 INFO L229 MonitoredProcess]: Starting monitored process 18 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-04 01:29:57,337 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 (18)] Waiting until timeout for monitored process [2025-03-04 01:29:57,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-04 01:29:57,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 01:29:57,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:57,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:57,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:29:57,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:57,687 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:29:57,687 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:29:57,688 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:29:57,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363976290] [2025-03-04 01:29:57,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1363976290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:29:57,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:29:57,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:29:57,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840313716] [2025-03-04 01:29:57,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:57,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:29:57,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:29:57,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:29:57,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:29:57,688 INFO L87 Difference]: Start difference. First operand 357 states and 482 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:29:57,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:57,733 INFO L93 Difference]: Finished difference Result 680 states and 916 transitions. [2025-03-04 01:29:57,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:29:57,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 174 [2025-03-04 01:29:57,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:57,736 INFO L225 Difference]: With dead ends: 680 [2025-03-04 01:29:57,736 INFO L226 Difference]: Without dead ends: 357 [2025-03-04 01:29:57,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 171 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-04 01:29:57,738 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:57,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 467 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:29:57,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-04 01:29:57,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2025-03-04 01:29:57,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 266 states have (on average 1.2030075187969924) internal successors, (320), 270 states have internal predecessors, (320), 80 states have call successors, (80), 10 states have call predecessors, (80), 10 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-04 01:29:57,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 480 transitions. [2025-03-04 01:29:57,780 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 480 transitions. Word has length 174 [2025-03-04 01:29:57,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:57,780 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 480 transitions. [2025-03-04 01:29:57,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:29:57,780 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 480 transitions. [2025-03-04 01:29:57,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-04 01:29:57,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:57,781 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:29:57,794 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 (18)] Ended with exit code 0 [2025-03-04 01:29:57,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-04 01:29:57,986 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:57,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:57,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1977694796, now seen corresponding path program 1 times [2025-03-04 01:29:57,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:29:57,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [589026367] [2025-03-04 01:29:57,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:57,987 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-04 01:29:57,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:29:57,989 INFO L229 MonitoredProcess]: Starting monitored process 19 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-04 01:29:57,990 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 (19)] Waiting until timeout for monitored process [2025-03-04 01:29:58,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-04 01:29:58,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-04 01:29:58,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:58,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:58,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 01:29:58,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:59,143 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-04 01:29:59,208 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 128 treesize of output 92 [2025-03-04 01:29:59,210 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 140 treesize of output 80 [2025-03-04 01:29:59,256 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2025-03-04 01:29:59,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:29:59,364 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:29:59,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [589026367] [2025-03-04 01:29:59,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [589026367] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:29:59,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [181826865] [2025-03-04 01:29:59,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:59,364 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:29:59,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:29:59,366 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:29:59,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2025-03-04 01:29:59,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-04 01:30:01,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-04 01:30:01,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:30:01,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:30:01,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 01:30:01,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:30:01,730 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-04 01:30:02,748 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-04 01:30:02,876 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 128 treesize of output 92 [2025-03-04 01:30:02,878 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 140 treesize of output 80 [2025-03-04 01:30:02,894 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2025-03-04 01:30:02,894 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:30:02,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [181826865] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:30:02,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:30:02,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2025-03-04 01:30:02,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430240820] [2025-03-04 01:30:02,977 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:30:02,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 01:30:02,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:30:02,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 01:30:02,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:30:02,978 INFO L87 Difference]: Start difference. First operand 357 states and 480 transitions. Second operand has 17 states, 17 states have (on average 8.058823529411764) internal successors, (137), 16 states have internal predecessors, (137), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2025-03-04 01:30:05,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:30:08,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:30:08,273 INFO L93 Difference]: Finished difference Result 803 states and 1068 transitions. [2025-03-04 01:30:08,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:30:08,274 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.058823529411764) internal successors, (137), 16 states have internal predecessors, (137), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) Word has length 175 [2025-03-04 01:30:08,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:30:08,276 INFO L225 Difference]: With dead ends: 803 [2025-03-04 01:30:08,276 INFO L226 Difference]: Without dead ends: 502 [2025-03-04 01:30:08,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 381 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2025-03-04 01:30:08,277 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 432 mSDsluCounter, 1193 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1356 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-04 01:30:08,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 1356 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-03-04 01:30:08,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-03-04 01:30:08,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 393. [2025-03-04 01:30:08,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 296 states have (on average 1.2094594594594594) internal successors, (358), 298 states have internal predecessors, (358), 84 states have call successors, (84), 12 states have call predecessors, (84), 12 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-04 01:30:08,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 526 transitions. [2025-03-04 01:30:08,308 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 526 transitions. Word has length 175 [2025-03-04 01:30:08,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:30:08,308 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 526 transitions. [2025-03-04 01:30:08,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.058823529411764) internal successors, (137), 16 states have internal predecessors, (137), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2025-03-04 01:30:08,309 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 526 transitions. [2025-03-04 01:30:08,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-04 01:30:08,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:30:08,310 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:30:08,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2025-03-04 01:30:08,521 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 (19)] Ended with exit code 0 [2025-03-04 01:30:08,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /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-04 01:30:08,711 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:30:08,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:30:08,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1045607093, now seen corresponding path program 1 times [2025-03-04 01:30:08,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:30:08,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868037786] [2025-03-04 01:30:08,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:30:08,712 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-04 01:30:08,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:30:08,714 INFO L229 MonitoredProcess]: Starting monitored process 21 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-04 01:30:08,714 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 (21)] Waiting until timeout for monitored process [2025-03-04 01:30:08,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 01:30:09,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 01:30:09,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:30:09,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:30:09,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 01:30:09,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:30:09,485 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 17 treesize of output 13 [2025-03-04 01:30:09,558 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 90 treesize of output 70 [2025-03-04 01:30:09,561 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 84 treesize of output 64 [2025-03-04 01:30:09,592 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:30:09,592 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:30:09,754 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:30:09,754 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:30:09,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1868037786] [2025-03-04 01:30:09,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1868037786] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:30:09,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:30:09,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 12 [2025-03-04 01:30:09,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855117721] [2025-03-04 01:30:09,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:30:09,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:30:09,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:30:09,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:30:09,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:30:09,755 INFO L87 Difference]: Start difference. First operand 393 states and 526 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:30:09,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:30:09,937 INFO L93 Difference]: Finished difference Result 1010 states and 1348 transitions. [2025-03-04 01:30:09,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:30:09,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 176 [2025-03-04 01:30:09,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:30:09,943 INFO L225 Difference]: With dead ends: 1010 [2025-03-04 01:30:09,943 INFO L226 Difference]: Without dead ends: 673 [2025-03-04 01:30:09,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:30:09,944 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 137 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:30:09,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1157 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:30:09,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-03-04 01:30:09,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 599. [2025-03-04 01:30:09,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 458 states have (on average 1.2117903930131004) internal successors, (555), 462 states have internal predecessors, (555), 122 states have call successors, (122), 18 states have call predecessors, (122), 18 states have return successors, (122), 118 states have call predecessors, (122), 122 states have call successors, (122) [2025-03-04 01:30:09,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 799 transitions. [2025-03-04 01:30:09,997 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 799 transitions. Word has length 176 [2025-03-04 01:30:09,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:30:09,997 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 799 transitions. [2025-03-04 01:30:09,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:30:09,997 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 799 transitions. [2025-03-04 01:30:09,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-04 01:30:09,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:30:09,999 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:30:10,009 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 (21)] Ended with exit code 0 [2025-03-04 01:30:10,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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-04 01:30:10,200 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:30:10,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:30:10,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1964634354, now seen corresponding path program 1 times [2025-03-04 01:30:10,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:30:10,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [369979739] [2025-03-04 01:30:10,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:30:10,200 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-04 01:30:10,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:30:10,202 INFO L229 MonitoredProcess]: Starting monitored process 22 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-04 01:30:10,203 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 (22)] Waiting until timeout for monitored process [2025-03-04 01:30:10,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 01:30:10,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 01:30:10,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:30:10,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:30:10,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 01:30:10,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:30:11,653 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 17 treesize of output 13 [2025-03-04 01:30:11,732 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 18 treesize of output 10 [2025-03-04 01:30:11,737 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 21 treesize of output 13 [2025-03-04 01:30:11,738 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 27 treesize of output 15 [2025-03-04 01:30:11,772 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 4 proven. 408 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2025-03-04 01:30:11,772 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:30:11,992 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:30:11,992 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:30:11,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [369979739] [2025-03-04 01:30:11,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [369979739] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:30:11,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:30:11,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [14] total 17 [2025-03-04 01:30:11,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448355169] [2025-03-04 01:30:11,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:30:11,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:30:11,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:30:11,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:30:11,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:30:11,993 INFO L87 Difference]: Start difference. First operand 599 states and 799 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:30:12,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:30:12,227 INFO L93 Difference]: Finished difference Result 1277 states and 1694 transitions. [2025-03-04 01:30:12,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:30:12,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 176 [2025-03-04 01:30:12,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:30:12,231 INFO L225 Difference]: With dead ends: 1277 [2025-03-04 01:30:12,232 INFO L226 Difference]: Without dead ends: 734 [2025-03-04 01:30:12,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:30:12,233 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 121 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:30:12,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 586 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:30:12,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2025-03-04 01:30:12,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 730. [2025-03-04 01:30:12,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 537 states have (on average 1.1843575418994414) internal successors, (636), 543 states have internal predecessors, (636), 166 states have call successors, (166), 26 states have call predecessors, (166), 26 states have return successors, (166), 160 states have call predecessors, (166), 166 states have call successors, (166) [2025-03-04 01:30:12,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 968 transitions. [2025-03-04 01:30:12,310 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 968 transitions. Word has length 176 [2025-03-04 01:30:12,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:30:12,310 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 968 transitions. [2025-03-04 01:30:12,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:30:12,311 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 968 transitions. [2025-03-04 01:30:12,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-04 01:30:12,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:30:12,312 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:30:12,321 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 (22)] Ended with exit code 0 [2025-03-04 01:30:12,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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-04 01:30:12,513 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:30:12,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:30:12,513 INFO L85 PathProgramCache]: Analyzing trace with hash -916524374, now seen corresponding path program 1 times [2025-03-04 01:30:12,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:30:12,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [772686899] [2025-03-04 01:30:12,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:30:12,513 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-04 01:30:12,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:30:12,520 INFO L229 MonitoredProcess]: Starting monitored process 23 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-04 01:30:12,521 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 (23)] Waiting until timeout for monitored process [2025-03-04 01:30:12,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 01:30:12,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 01:30:12,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:30:12,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:30:12,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 01:30:12,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:30:12,936 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-04 01:30:12,962 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 34 treesize of output 22 [2025-03-04 01:30:12,978 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:30:12,978 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:30:12,978 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:30:12,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [772686899] [2025-03-04 01:30:12,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [772686899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:30:12,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:30:12,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:30:12,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465411179] [2025-03-04 01:30:12,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:30:12,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:30:12,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:30:12,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:30:12,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:30:12,979 INFO L87 Difference]: Start difference. First operand 730 states and 968 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:30:13,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:30:13,139 INFO L93 Difference]: Finished difference Result 835 states and 1096 transitions. [2025-03-04 01:30:13,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:30:13,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 176 [2025-03-04 01:30:13,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:30:13,144 INFO L225 Difference]: With dead ends: 835 [2025-03-04 01:30:13,144 INFO L226 Difference]: Without dead ends: 833 [2025-03-04 01:30:13,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 171 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-04 01:30:13,145 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 140 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:30:13,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1161 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:30:13,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-03-04 01:30:13,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 568. [2025-03-04 01:30:13,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 401 states have (on average 1.1620947630922693) internal successors, (466), 405 states have internal predecessors, (466), 144 states have call successors, (144), 22 states have call predecessors, (144), 22 states have return successors, (144), 140 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-04 01:30:13,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 754 transitions. [2025-03-04 01:30:13,252 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 754 transitions. Word has length 176 [2025-03-04 01:30:13,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:30:13,253 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 754 transitions. [2025-03-04 01:30:13,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:30:13,253 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 754 transitions. [2025-03-04 01:30:13,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-04 01:30:13,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:30:13,255 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:30:13,265 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 (23)] Ended with exit code 0 [2025-03-04 01:30:13,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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-04 01:30:13,456 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:30:13,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:30:13,456 INFO L85 PathProgramCache]: Analyzing trace with hash -915600853, now seen corresponding path program 1 times [2025-03-04 01:30:13,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:30:13,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1793968676] [2025-03-04 01:30:13,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:30:13,457 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-04 01:30:13,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:30:13,459 INFO L229 MonitoredProcess]: Starting monitored process 24 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-04 01:30:13,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 (24)] Waiting until timeout for monitored process [2025-03-04 01:30:13,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 01:30:13,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 01:30:13,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:30:13,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:30:13,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 01:30:13,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:30:14,116 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 17 treesize of output 13 [2025-03-04 01:30:14,165 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:30:14,165 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:30:14,235 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:30:14,236 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:30:14,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1793968676] [2025-03-04 01:30:14,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1793968676] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:30:14,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:30:14,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2025-03-04 01:30:14,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077718048] [2025-03-04 01:30:14,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:30:14,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:30:14,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:30:14,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:30:14,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:30:14,237 INFO L87 Difference]: Start difference. First operand 568 states and 754 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:30:14,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:30:14,352 INFO L93 Difference]: Finished difference Result 924 states and 1215 transitions. [2025-03-04 01:30:14,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:30:14,353 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 176 [2025-03-04 01:30:14,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:30:14,356 INFO L225 Difference]: With dead ends: 924 [2025-03-04 01:30:14,356 INFO L226 Difference]: Without dead ends: 568 [2025-03-04 01:30:14,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:30:14,357 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 116 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:30:14,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 820 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:30:14,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-03-04 01:30:14,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2025-03-04 01:30:14,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 401 states have (on average 1.1596009975062345) internal successors, (465), 405 states have internal predecessors, (465), 144 states have call successors, (144), 22 states have call predecessors, (144), 22 states have return successors, (144), 140 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-04 01:30:14,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 753 transitions. [2025-03-04 01:30:14,433 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 753 transitions. Word has length 176 [2025-03-04 01:30:14,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:30:14,433 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 753 transitions. [2025-03-04 01:30:14,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:30:14,435 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 753 transitions. [2025-03-04 01:30:14,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-04 01:30:14,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:30:14,436 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:30:14,447 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 (24)] Ended with exit code 0 [2025-03-04 01:30:14,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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-04 01:30:14,637 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:30:14,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:30:14,638 INFO L85 PathProgramCache]: Analyzing trace with hash -28097172, now seen corresponding path program 1 times [2025-03-04 01:30:14,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:30:14,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [608004917] [2025-03-04 01:30:14,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:30:14,638 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-04 01:30:14,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:30:14,640 INFO L229 MonitoredProcess]: Starting monitored process 25 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-04 01:30:14,642 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 (25)] Waiting until timeout for monitored process [2025-03-04 01:30:14,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 01:30:15,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 01:30:15,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:30:15,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:30:15,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 01:30:15,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:30:15,275 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 17 treesize of output 13 [2025-03-04 01:30:15,312 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 440 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-03-04 01:30:15,313 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:30:15,382 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:30:15,382 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:30:15,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [608004917] [2025-03-04 01:30:15,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [608004917] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:30:15,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:30:15,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2025-03-04 01:30:15,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690609794] [2025-03-04 01:30:15,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:30:15,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:30:15,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:30:15,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:30:15,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:30:15,383 INFO L87 Difference]: Start difference. First operand 568 states and 753 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:30:15,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:30:15,505 INFO L93 Difference]: Finished difference Result 940 states and 1225 transitions. [2025-03-04 01:30:15,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:30:15,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 176 [2025-03-04 01:30:15,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:30:15,508 INFO L225 Difference]: With dead ends: 940 [2025-03-04 01:30:15,508 INFO L226 Difference]: Without dead ends: 584 [2025-03-04 01:30:15,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:30:15,510 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 106 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:30:15,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 774 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:30:15,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2025-03-04 01:30:15,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2025-03-04 01:30:15,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 413 states have (on average 1.152542372881356) internal successors, (476), 417 states have internal predecessors, (476), 144 states have call successors, (144), 26 states have call predecessors, (144), 26 states have return successors, (144), 140 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-04 01:30:15,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 764 transitions. [2025-03-04 01:30:15,582 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 764 transitions. Word has length 176 [2025-03-04 01:30:15,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:30:15,583 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 764 transitions. [2025-03-04 01:30:15,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:30:15,583 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 764 transitions. [2025-03-04 01:30:15,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-04 01:30:15,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:30:15,584 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:30:15,596 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 (25)] Ended with exit code 0 [2025-03-04 01:30:15,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /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-04 01:30:15,785 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:30:15,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:30:15,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1835551635, now seen corresponding path program 1 times [2025-03-04 01:30:15,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:30:15,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1904463514] [2025-03-04 01:30:15,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:30:15,786 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-04 01:30:15,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:30:15,787 INFO L229 MonitoredProcess]: Starting monitored process 26 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-04 01:30:15,788 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 (26)] Waiting until timeout for monitored process [2025-03-04 01:30:15,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 01:30:16,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 01:30:16,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:30:16,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:30:16,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 01:30:16,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:30:16,542 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 17 treesize of output 13 [2025-03-04 01:30:16,593 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 54 treesize of output 42 [2025-03-04 01:30:16,595 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 54 treesize of output 34 [2025-03-04 01:30:16,625 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:30:16,626 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:30:16,740 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:30:16,740 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:30:16,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1904463514] [2025-03-04 01:30:16,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1904463514] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:30:16,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:30:16,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 13 [2025-03-04 01:30:16,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858441819] [2025-03-04 01:30:16,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:30:16,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:30:16,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:30:16,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:30:16,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:30:16,741 INFO L87 Difference]: Start difference. First operand 584 states and 764 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:30:16,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:30:16,933 INFO L93 Difference]: Finished difference Result 1268 states and 1630 transitions. [2025-03-04 01:30:16,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:30:16,934 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 176 [2025-03-04 01:30:16,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:30:16,937 INFO L225 Difference]: With dead ends: 1268 [2025-03-04 01:30:16,937 INFO L226 Difference]: Without dead ends: 896 [2025-03-04 01:30:16,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:30:16,939 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 132 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:30:16,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1160 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:30:16,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2025-03-04 01:30:17,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 622. [2025-03-04 01:30:17,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 451 states have (on average 1.164079822616408) internal successors, (525), 455 states have internal predecessors, (525), 144 states have call successors, (144), 26 states have call predecessors, (144), 26 states have return successors, (144), 140 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-04 01:30:17,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 813 transitions. [2025-03-04 01:30:17,052 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 813 transitions. Word has length 176 [2025-03-04 01:30:17,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:30:17,053 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 813 transitions. [2025-03-04 01:30:17,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:30:17,053 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 813 transitions. [2025-03-04 01:30:17,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-04 01:30:17,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:30:17,054 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:30:17,064 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 (26)] Ended with exit code 0 [2025-03-04 01:30:17,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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-04 01:30:17,255 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:30:17,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:30:17,255 INFO L85 PathProgramCache]: Analyzing trace with hash 813142702, now seen corresponding path program 1 times [2025-03-04 01:30:17,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:30:17,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [608063367] [2025-03-04 01:30:17,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:30:17,256 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-04 01:30:17,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:30:17,257 INFO L229 MonitoredProcess]: Starting monitored process 27 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-04 01:30:17,259 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 (27)] Waiting until timeout for monitored process [2025-03-04 01:30:17,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-04 01:30:17,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-04 01:30:17,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:30:17,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:30:17,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 01:30:17,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:30:18,432 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-04 01:30:18,502 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 128 treesize of output 92 [2025-03-04 01:30:18,503 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 138 treesize of output 78 [2025-03-04 01:30:18,550 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 16 proven. 320 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2025-03-04 01:30:18,551 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:30:18,654 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:30:18,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [608063367] [2025-03-04 01:30:18,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [608063367] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:30:18,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [13257796] [2025-03-04 01:30:18,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:30:18,654 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:30:18,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:30:18,656 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:30:18,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2025-03-04 01:30:18,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-04 01:30:20,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-04 01:30:20,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:30:20,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:30:20,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 01:30:20,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:30:20,850 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-04 01:30:22,152 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-04 01:30:22,293 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 128 treesize of output 92 [2025-03-04 01:30:22,295 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 138 treesize of output 78 [2025-03-04 01:30:22,310 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 16 proven. 320 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2025-03-04 01:30:22,310 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:30:22,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [13257796] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:30:22,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:30:22,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 24 [2025-03-04 01:30:22,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093068528] [2025-03-04 01:30:22,380 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:30:22,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 01:30:22,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:30:22,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 01:30:22,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2025-03-04 01:30:22,381 INFO L87 Difference]: Start difference. First operand 622 states and 813 transitions. Second operand has 25 states, 23 states have (on average 6.391304347826087) internal successors, (147), 22 states have internal predecessors, (147), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 4 states have call predecessors, (42), 6 states have call successors, (42) [2025-03-04 01:30:27,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:30:27,441 INFO L93 Difference]: Finished difference Result 1206 states and 1539 transitions. [2025-03-04 01:30:27,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 01:30:27,442 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 6.391304347826087) internal successors, (147), 22 states have internal predecessors, (147), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 4 states have call predecessors, (42), 6 states have call successors, (42) Word has length 177 [2025-03-04 01:30:27,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:30:27,444 INFO L225 Difference]: With dead ends: 1206 [2025-03-04 01:30:27,445 INFO L226 Difference]: Without dead ends: 796 [2025-03-04 01:30:27,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 377 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=421, Invalid=2129, Unknown=0, NotChecked=0, Total=2550 [2025-03-04 01:30:27,446 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 495 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 1499 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 1763 SdHoareTripleChecker+Invalid, 1580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:30:27,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 1763 Invalid, 1580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1499 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-04 01:30:27,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2025-03-04 01:30:27,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 525. [2025-03-04 01:30:27,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 380 states have (on average 1.1605263157894736) internal successors, (441), 386 states have internal predecessors, (441), 124 states have call successors, (124), 20 states have call predecessors, (124), 20 states have return successors, (124), 118 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-04 01:30:27,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 689 transitions. [2025-03-04 01:30:27,518 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 689 transitions. Word has length 177 [2025-03-04 01:30:27,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:30:27,518 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 689 transitions. [2025-03-04 01:30:27,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 6.391304347826087) internal successors, (147), 22 states have internal predecessors, (147), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 4 states have call predecessors, (42), 6 states have call successors, (42) [2025-03-04 01:30:27,519 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 689 transitions. [2025-03-04 01:30:27,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-04 01:30:27,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:30:27,520 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:30:27,533 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 (27)] Ended with exit code 0 [2025-03-04 01:30:27,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2025-03-04 01:30:27,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /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,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-04 01:30:27,921 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:30:27,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:30:27,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1738831693, now seen corresponding path program 1 times [2025-03-04 01:30:27,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:30:27,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1886764871] [2025-03-04 01:30:27,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:30:27,921 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-04 01:30:27,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:30:27,923 INFO L229 MonitoredProcess]: Starting monitored process 29 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-04 01:30:27,924 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 (29)] Waiting until timeout for monitored process [2025-03-04 01:30:28,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-04 01:30:28,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-04 01:30:28,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:30:28,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:30:28,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 01:30:28,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:30:28,641 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 27 treesize of output 19 [2025-03-04 01:30:28,643 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 13 treesize of output 9 [2025-03-04 01:30:28,679 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 18 treesize of output 10 [2025-03-04 01:30:28,697 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:30:28,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:30:28,810 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-03-04 01:30:28,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 20 treesize of output 19 [2025-03-04 01:30:29,024 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-04 01:30:29,024 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:30:29,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1886764871] [2025-03-04 01:30:29,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1886764871] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:30:29,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:30:29,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 14 [2025-03-04 01:30:29,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585321836] [2025-03-04 01:30:29,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:30:29,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:30:29,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:30:29,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:30:29,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:30:29,025 INFO L87 Difference]: Start difference. First operand 525 states and 689 transitions. Second operand has 9 states, 8 states have (on average 9.875) internal successors, (79), 9 states have internal predecessors, (79), 2 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:30:29,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:30:29,436 INFO L93 Difference]: Finished difference Result 1075 states and 1386 transitions. [2025-03-04 01:30:29,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:30:29,436 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.875) internal successors, (79), 9 states have internal predecessors, (79), 2 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 178 [2025-03-04 01:30:29,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:30:29,439 INFO L225 Difference]: With dead ends: 1075 [2025-03-04 01:30:29,439 INFO L226 Difference]: Without dead ends: 762 [2025-03-04 01:30:29,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 344 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2025-03-04 01:30:29,440 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 336 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:30:29,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 671 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:30:29,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2025-03-04 01:30:29,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 518. [2025-03-04 01:30:29,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 373 states have (on average 1.155495978552279) internal successors, (431), 379 states have internal predecessors, (431), 124 states have call successors, (124), 20 states have call predecessors, (124), 20 states have return successors, (124), 118 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-04 01:30:29,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 679 transitions. [2025-03-04 01:30:29,506 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 679 transitions. Word has length 178 [2025-03-04 01:30:29,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:30:29,507 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 679 transitions. [2025-03-04 01:30:29,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.875) internal successors, (79), 9 states have internal predecessors, (79), 2 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:30:29,507 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 679 transitions. [2025-03-04 01:30:29,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-04 01:30:29,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:30:29,508 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:30:29,518 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 (29)] Ended with exit code 0 [2025-03-04 01:30:29,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /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-04 01:30:29,708 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:30:29,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:30:29,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1593425824, now seen corresponding path program 1 times [2025-03-04 01:30:29,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:30:29,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [198395961] [2025-03-04 01:30:29,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:30:29,709 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-04 01:30:29,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:30:29,711 INFO L229 MonitoredProcess]: Starting monitored process 30 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-04 01:30:29,712 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 (30)] Waiting until timeout for monitored process [2025-03-04 01:30:29,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-04 01:30:30,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-04 01:30:30,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:30:30,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:30:30,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 01:30:30,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:30:30,464 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 51 treesize of output 38 [2025-03-04 01:30:30,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:30:30,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 51 [2025-03-04 01:30:30,469 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 40 treesize of output 28 [2025-03-04 01:30:30,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 4 [2025-03-04 01:30:30,499 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 17 treesize of output 9 [2025-03-04 01:30:30,508 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:30:30,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:30:30,545 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 40 treesize of output 36 [2025-03-04 01:30:30,547 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 01:30:30,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:30:30,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 52 [2025-03-04 01:30:30,644 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-03-04 01:30:30,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 20 treesize of output 19 [2025-03-04 01:30:30,839 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-04 01:30:30,839 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:30:30,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [198395961] [2025-03-04 01:30:30,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [198395961] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:30:30,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:30:30,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 14 [2025-03-04 01:30:30,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288835847] [2025-03-04 01:30:30,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:30:30,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:30:30,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:30:30,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:30:30,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:30:30,840 INFO L87 Difference]: Start difference. First operand 518 states and 679 transitions. Second operand has 9 states, 8 states have (on average 10.0) internal successors, (80), 9 states have internal predecessors, (80), 2 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:30:31,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:30:31,301 INFO L93 Difference]: Finished difference Result 1065 states and 1372 transitions. [2025-03-04 01:30:31,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:30:31,301 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.0) internal successors, (80), 9 states have internal predecessors, (80), 2 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 179 [2025-03-04 01:30:31,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:30:31,304 INFO L225 Difference]: With dead ends: 1065 [2025-03-04 01:30:31,304 INFO L226 Difference]: Without dead ends: 759 [2025-03-04 01:30:31,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 346 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2025-03-04 01:30:31,305 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 936 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:30:31,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 468 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:30:31,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2025-03-04 01:30:31,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 515. [2025-03-04 01:30:31,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 370 states have (on average 1.154054054054054) internal successors, (427), 376 states have internal predecessors, (427), 124 states have call successors, (124), 20 states have call predecessors, (124), 20 states have return successors, (124), 118 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-04 01:30:31,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 675 transitions. [2025-03-04 01:30:31,372 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 675 transitions. Word has length 179 [2025-03-04 01:30:31,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:30:31,372 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 675 transitions. [2025-03-04 01:30:31,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.0) internal successors, (80), 9 states have internal predecessors, (80), 2 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:30:31,372 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 675 transitions. [2025-03-04 01:30:31,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-04 01:30:31,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:30:31,373 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:30:31,384 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 (30)] Ended with exit code 0 [2025-03-04 01:30:31,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /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-04 01:30:31,574 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:30:31,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:30:31,575 INFO L85 PathProgramCache]: Analyzing trace with hash -731409626, now seen corresponding path program 1 times [2025-03-04 01:30:31,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:30:31,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1900985379] [2025-03-04 01:30:31,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:30:31,575 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-04 01:30:31,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:30:31,577 INFO L229 MonitoredProcess]: Starting monitored process 31 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-04 01:30:31,577 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 (31)] Waiting until timeout for monitored process [2025-03-04 01:30:31,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-04 01:30:31,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-04 01:30:31,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:30:31,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:30:32,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-04 01:30:32,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:30:35,454 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 27 treesize of output 15 [2025-03-04 01:30:35,640 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 37 treesize of output 33 [2025-03-04 01:30:35,855 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 51 treesize of output 39 [2025-03-04 01:30:35,858 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 38 treesize of output 30 [2025-03-04 01:30:35,973 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 56 treesize of output 40 [2025-03-04 01:30:36,082 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 102 treesize of output 82 [2025-03-04 01:30:36,274 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 24 proven. 706 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-04 01:30:36,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:30:36,833 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:30:36,833 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:30:36,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1900985379] [2025-03-04 01:30:36,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1900985379] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:30:36,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:30:36,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [39] total 47 [2025-03-04 01:30:36,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167238267] [2025-03-04 01:30:36,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:30:36,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:30:36,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:30:36,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:30:36,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=2023, Unknown=0, NotChecked=0, Total=2162 [2025-03-04 01:30:36,835 INFO L87 Difference]: Start difference. First operand 515 states and 675 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:30:37,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:30:37,494 INFO L93 Difference]: Finished difference Result 983 states and 1255 transitions. [2025-03-04 01:30:37,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:30:37,495 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 181 [2025-03-04 01:30:37,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:30:37,498 INFO L225 Difference]: With dead ends: 983 [2025-03-04 01:30:37,498 INFO L226 Difference]: Without dead ends: 680 [2025-03-04 01:30:37,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=170, Invalid=2692, Unknown=0, NotChecked=0, Total=2862 [2025-03-04 01:30:37,499 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 93 mSDsluCounter, 1788 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 2010 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:30:37,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 2010 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:30:37,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2025-03-04 01:30:37,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 656. [2025-03-04 01:30:37,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 497 states have (on average 1.1690140845070423) internal successors, (581), 505 states have internal predecessors, (581), 134 states have call successors, (134), 24 states have call predecessors, (134), 24 states have return successors, (134), 126 states have call predecessors, (134), 134 states have call successors, (134) [2025-03-04 01:30:37,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 849 transitions. [2025-03-04 01:30:37,578 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 849 transitions. Word has length 181 [2025-03-04 01:30:37,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:30:37,578 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 849 transitions. [2025-03-04 01:30:37,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:30:37,578 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 849 transitions. [2025-03-04 01:30:37,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-04 01:30:37,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:30:37,580 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:30:37,595 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 (31)] Ended with exit code 0 [2025-03-04 01:30:37,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /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-04 01:30:37,781 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:30:37,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:30:37,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1241943803, now seen corresponding path program 1 times [2025-03-04 01:30:37,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:30:37,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [557540234] [2025-03-04 01:30:37,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:30:37,782 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-04 01:30:37,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:30:37,785 INFO L229 MonitoredProcess]: Starting monitored process 32 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-04 01:30:37,786 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 (32)] Waiting until timeout for monitored process [2025-03-04 01:30:37,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-04 01:30:38,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-04 01:30:38,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:30:38,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:30:38,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 01:30:38,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:30:39,431 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 42 treesize of output 26 [2025-03-04 01:30:39,433 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 20 treesize of output 12 [2025-03-04 01:30:39,470 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 509 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 01:30:39,470 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:30:39,616 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:30:39,616 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:30:39,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [557540234] [2025-03-04 01:30:39,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [557540234] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:30:39,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:30:39,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [19] total 23 [2025-03-04 01:30:39,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11755596] [2025-03-04 01:30:39,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:30:39,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:30:39,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:30:39,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:30:39,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2025-03-04 01:30:39,617 INFO L87 Difference]: Start difference. First operand 656 states and 849 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:30:39,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:30:39,789 INFO L93 Difference]: Finished difference Result 1195 states and 1514 transitions. [2025-03-04 01:30:39,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:30:39,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 181 [2025-03-04 01:30:39,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:30:39,792 INFO L225 Difference]: With dead ends: 1195 [2025-03-04 01:30:39,792 INFO L226 Difference]: Without dead ends: 751 [2025-03-04 01:30:39,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2025-03-04 01:30:39,793 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 104 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:30:39,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 638 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:30:39,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2025-03-04 01:30:39,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 615. [2025-03-04 01:30:39,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 474 states have (on average 1.1729957805907174) internal successors, (556), 480 states have internal predecessors, (556), 116 states have call successors, (116), 24 states have call predecessors, (116), 24 states have return successors, (116), 110 states have call predecessors, (116), 116 states have call successors, (116) [2025-03-04 01:30:39,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 788 transitions. [2025-03-04 01:30:39,869 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 788 transitions. Word has length 181 [2025-03-04 01:30:39,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:30:39,869 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 788 transitions. [2025-03-04 01:30:39,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:30:39,869 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 788 transitions. [2025-03-04 01:30:39,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-04 01:30:39,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:30:39,870 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:30:39,880 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 (32)] Ended with exit code 0 [2025-03-04 01:30:40,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /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-04 01:30:40,071 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:30:40,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:30:40,071 INFO L85 PathProgramCache]: Analyzing trace with hash -798416379, now seen corresponding path program 1 times [2025-03-04 01:30:40,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:30:40,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419105146] [2025-03-04 01:30:40,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:30:40,072 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-04 01:30:40,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:30:40,073 INFO L229 MonitoredProcess]: Starting monitored process 33 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-04 01:30:40,075 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 (33)] Waiting until timeout for monitored process [2025-03-04 01:30:40,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-04 01:30:40,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-04 01:30:40,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:30:40,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:30:40,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 01:30:40,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:30:41,716 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 34 treesize of output 22 [2025-03-04 01:30:41,718 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 30 treesize of output 18 [2025-03-04 01:30:41,755 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 509 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-04 01:30:41,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:30:41,893 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:30:41,893 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:30:41,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419105146] [2025-03-04 01:30:41,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [419105146] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:30:41,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:30:41,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [19] total 23 [2025-03-04 01:30:41,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082261536] [2025-03-04 01:30:41,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:30:41,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:30:41,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:30:41,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:30:41,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2025-03-04 01:30:41,894 INFO L87 Difference]: Start difference. First operand 615 states and 788 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:30:42,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:30:42,066 INFO L93 Difference]: Finished difference Result 1223 states and 1554 transitions. [2025-03-04 01:30:42,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:30:42,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 181 [2025-03-04 01:30:42,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:30:42,070 INFO L225 Difference]: With dead ends: 1223 [2025-03-04 01:30:42,070 INFO L226 Difference]: Without dead ends: 796 [2025-03-04 01:30:42,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2025-03-04 01:30:42,071 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 103 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:30:42,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 787 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:30:42,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2025-03-04 01:30:42,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 615. [2025-03-04 01:30:42,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 474 states have (on average 1.1708860759493671) internal successors, (555), 480 states have internal predecessors, (555), 116 states have call successors, (116), 24 states have call predecessors, (116), 24 states have return successors, (116), 110 states have call predecessors, (116), 116 states have call successors, (116) [2025-03-04 01:30:42,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 787 transitions. [2025-03-04 01:30:42,149 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 787 transitions. Word has length 181 [2025-03-04 01:30:42,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:30:42,149 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 787 transitions. [2025-03-04 01:30:42,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:30:42,149 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 787 transitions. [2025-03-04 01:30:42,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-04 01:30:42,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:30:42,150 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:30:42,160 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 (33)] Ended with exit code 0 [2025-03-04 01:30:42,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /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-04 01:30:42,351 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:30:42,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:30:42,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1308950556, now seen corresponding path program 1 times [2025-03-04 01:30:42,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:30:42,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [989402481] [2025-03-04 01:30:42,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:30:42,352 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-04 01:30:42,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:30:42,354 INFO L229 MonitoredProcess]: Starting monitored process 34 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-04 01:30:42,354 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 (34)] Waiting until timeout for monitored process [2025-03-04 01:30:42,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-04 01:30:42,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-04 01:30:42,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:30:42,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:30:42,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 01:30:42,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:30:43,979 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 37 treesize of output 33 [2025-03-04 01:30:44,033 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 51 treesize of output 39 [2025-03-04 01:30:44,035 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 38 treesize of output 30 [2025-03-04 01:30:44,070 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 36 treesize of output 28 [2025-03-04 01:30:44,114 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 92 treesize of output 76 [2025-03-04 01:30:44,181 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 1 proven. 627 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2025-03-04 01:30:44,182 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:30:44,489 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:30:44,489 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:30:44,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [989402481] [2025-03-04 01:30:44,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [989402481] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:30:44,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:30:44,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [18] total 26 [2025-03-04 01:30:44,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075299355] [2025-03-04 01:30:44,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:30:44,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:30:44,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:30:44,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:30:44,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2025-03-04 01:30:44,490 INFO L87 Difference]: Start difference. First operand 615 states and 787 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:30:45,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:30:45,105 INFO L93 Difference]: Finished difference Result 1167 states and 1474 transitions. [2025-03-04 01:30:45,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:30:45,106 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 181 [2025-03-04 01:30:45,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:30:45,108 INFO L225 Difference]: With dead ends: 1167 [2025-03-04 01:30:45,109 INFO L226 Difference]: Without dead ends: 740 [2025-03-04 01:30:45,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 01:30:45,110 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 87 mSDsluCounter, 1860 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 2092 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:30:45,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 2092 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:30:45,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2025-03-04 01:30:45,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 716. [2025-03-04 01:30:45,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 561 states have (on average 1.1800356506238858) internal successors, (662), 569 states have internal predecessors, (662), 126 states have call successors, (126), 28 states have call predecessors, (126), 28 states have return successors, (126), 118 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-04 01:30:45,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 914 transitions. [2025-03-04 01:30:45,198 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 914 transitions. Word has length 181 [2025-03-04 01:30:45,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:30:45,198 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 914 transitions. [2025-03-04 01:30:45,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:30:45,198 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 914 transitions. [2025-03-04 01:30:45,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-04 01:30:45,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:30:45,199 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:30:45,209 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 (34)] Ended with exit code 0 [2025-03-04 01:30:45,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /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-04 01:30:45,400 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:30:45,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:30:45,401 INFO L85 PathProgramCache]: Analyzing trace with hash 546429795, now seen corresponding path program 1 times [2025-03-04 01:30:45,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:30:45,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [283133782] [2025-03-04 01:30:45,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:30:45,401 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-04 01:30:45,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:30:45,403 INFO L229 MonitoredProcess]: Starting monitored process 35 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-04 01:30:45,404 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 (35)] Waiting until timeout for monitored process [2025-03-04 01:30:45,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-04 01:30:45,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-04 01:30:45,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:30:45,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:30:45,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 01:30:45,834 INFO L279 TraceCheckSpWp]: Computing forward predicates...