./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-67.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-67.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 acedb713d8fb6ee88e504476b1a8afa9aad0050a29ab1fa7a298d11252db5c53 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:42:39,394 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:42:39,473 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:42:39,481 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:42:39,481 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:42:39,507 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:42:39,508 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:42:39,508 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:42:39,509 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:42:39,509 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:42:39,509 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:42:39,509 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:42:39,510 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:42:39,510 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:42:39,510 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:42:39,510 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:42:39,510 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:42:39,511 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:42:39,511 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:42:39,511 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:42:39,511 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:42:39,511 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:42:39,511 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:42:39,511 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:42:39,511 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:42:39,512 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:42:39,512 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:42:39,512 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:42:39,512 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:42:39,512 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:42:39,512 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:42:39,512 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:42:39,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:42:39,512 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:42:39,512 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:42:39,512 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:42:39,512 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:42:39,512 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:42:39,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:42:39,512 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:42:39,512 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:42:39,512 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:42:39,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:42:39,512 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 -> acedb713d8fb6ee88e504476b1a8afa9aad0050a29ab1fa7a298d11252db5c53 [2025-03-08 16:42:39,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:42:39,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:42:39,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:42:39,776 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:42:39,776 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:42:39,778 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-67.i [2025-03-08 16:42:40,943 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d9f1aed0/271defff9919444c9e581f19f40a364a/FLAGd9ac5ae40 [2025-03-08 16:42:41,193 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:42:41,193 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-67.i [2025-03-08 16:42:41,199 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d9f1aed0/271defff9919444c9e581f19f40a364a/FLAGd9ac5ae40 [2025-03-08 16:42:41,212 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d9f1aed0/271defff9919444c9e581f19f40a364a [2025-03-08 16:42:41,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:42:41,215 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:42:41,216 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:42:41,216 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:42:41,219 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:42:41,220 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:42:41" (1/1) ... [2025-03-08 16:42:41,221 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b877be0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:41, skipping insertion in model container [2025-03-08 16:42:41,222 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:42:41" (1/1) ... [2025-03-08 16:42:41,234 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:42:41,333 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-67.i[916,929] [2025-03-08 16:42:41,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:42:41,371 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:42:41,379 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-67.i[916,929] [2025-03-08 16:42:41,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:42:41,416 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:42:41,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:41 WrapperNode [2025-03-08 16:42:41,418 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:42:41,419 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:42:41,419 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:42:41,419 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:42:41,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:41" (1/1) ... [2025-03-08 16:42:41,433 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:41" (1/1) ... [2025-03-08 16:42:41,461 INFO L138 Inliner]: procedures = 29, calls = 141, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 430 [2025-03-08 16:42:41,461 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:42:41,462 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:42:41,462 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:42:41,462 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:42:41,468 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:41" (1/1) ... [2025-03-08 16:42:41,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:41" (1/1) ... [2025-03-08 16:42:41,473 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:41" (1/1) ... [2025-03-08 16:42:41,493 INFO L175 MemorySlicer]: Split 106 memory accesses to 13 slices as follows [2, 6, 14, 10, 14, 16, 10, 6, 7, 3, 10, 3, 5]. 15 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 1, 1, 1, 2, 1, 4, 1, 1, 1, 1, 1, 1]. [2025-03-08 16:42:41,493 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:41" (1/1) ... [2025-03-08 16:42:41,493 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:41" (1/1) ... [2025-03-08 16:42:41,506 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:41" (1/1) ... [2025-03-08 16:42:41,508 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:41" (1/1) ... [2025-03-08 16:42:41,510 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:41" (1/1) ... [2025-03-08 16:42:41,512 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:41" (1/1) ... [2025-03-08 16:42:41,520 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:42:41,520 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:42:41,521 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:42:41,521 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:42:41,521 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:41" (1/1) ... [2025-03-08 16:42:41,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:42:41,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:42:41,559 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-08 16:42:41,562 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-08 16:42:41,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:42:41,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-08 16:42:41,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-08 16:42:41,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-08 16:42:41,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-08 16:42:41,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-08 16:42:41,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-08 16:42:41,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-08 16:42:41,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-03-08 16:42:41,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-03-08 16:42:41,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-03-08 16:42:41,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-03-08 16:42:41,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2025-03-08 16:42:41,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2025-03-08 16:42:41,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 16:42:41,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 16:42:41,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 16:42:41,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 16:42:41,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 16:42:41,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 16:42:41,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 16:42:41,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 16:42:41,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 16:42:41,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 16:42:41,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 16:42:41,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-08 16:42:41,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-08 16:42:41,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-08 16:42:41,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-08 16:42:41,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-08 16:42:41,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-08 16:42:41,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-08 16:42:41,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-08 16:42:41,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-08 16:42:41,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-03-08 16:42:41,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-03-08 16:42:41,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-03-08 16:42:41,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-03-08 16:42:41,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2025-03-08 16:42:41,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2025-03-08 16:42:41,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 16:42:41,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 16:42:41,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 16:42:41,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 16:42:41,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 16:42:41,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 16:42:41,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 16:42:41,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 16:42:41,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 16:42:41,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 16:42:41,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 16:42:41,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-08 16:42:41,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-08 16:42:41,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-08 16:42:41,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-08 16:42:41,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-08 16:42:41,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-08 16:42:41,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-08 16:42:41,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-08 16:42:41,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-08 16:42:41,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-03-08 16:42:41,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-03-08 16:42:41,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-03-08 16:42:41,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-03-08 16:42:41,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2025-03-08 16:42:41,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2025-03-08 16:42:41,591 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:42:41,591 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:42:41,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:42:41,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 16:42:41,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 16:42:41,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 16:42:41,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 16:42:41,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 16:42:41,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 16:42:41,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 16:42:41,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 16:42:41,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 16:42:41,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 16:42:41,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 16:42:41,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 16:42:41,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:42:41,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:42:41,773 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:42:41,776 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:42:42,169 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L106: havoc property_#t~ite62#1;havoc property_#t~mem61#1;havoc property_#t~mem59#1;havoc property_#t~mem60#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~bitwise65#1;havoc property_#t~mem66#1;havoc property_#t~ite73#1;havoc property_#t~mem70#1;havoc property_#t~mem67#1;havoc property_#t~ite69#1;havoc property_#t~mem68#1;havoc property_#t~mem72#1;havoc property_#t~mem71#1;havoc property_#t~short74#1;havoc property_#t~mem75#1;havoc property_#t~ite96#1;havoc property_#t~mem79#1;havoc property_#t~mem76#1;havoc property_#t~ite78#1;havoc property_#t~mem77#1;havoc property_#t~mem82#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite95#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite91#1;havoc property_#t~mem88#1;havoc property_#t~mem85#1;havoc property_#t~ite87#1;havoc property_#t~mem86#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~mem94#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~short97#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~short100#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~short103#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~short106#1; [2025-03-08 16:42:42,205 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2025-03-08 16:42:42,205 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:42:42,216 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:42:42,216 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:42:42,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:42:42 BoogieIcfgContainer [2025-03-08 16:42:42,216 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:42:42,219 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:42:42,219 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:42:42,222 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:42:42,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:42:41" (1/3) ... [2025-03-08 16:42:42,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50318fc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:42:42, skipping insertion in model container [2025-03-08 16:42:42,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:41" (2/3) ... [2025-03-08 16:42:42,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50318fc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:42:42, skipping insertion in model container [2025-03-08 16:42:42,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:42:42" (3/3) ... [2025-03-08 16:42:42,225 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-67.i [2025-03-08 16:42:42,236 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:42:42,237 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-67.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:42:42,294 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:42:42,304 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;@7d27f1af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:42:42,305 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:42:42,308 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 78 states have internal predecessors, (107), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 16:42:42,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 16:42:42,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:42,317 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:42:42,317 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:42,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:42,322 INFO L85 PathProgramCache]: Analyzing trace with hash 179817647, now seen corresponding path program 1 times [2025-03-08 16:42:42,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:42,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310843504] [2025-03-08 16:42:42,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:42,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:42,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 16:42:42,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 16:42:42,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:42,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:42,596 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-08 16:42:42,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:42,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310843504] [2025-03-08 16:42:42,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310843504] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:42:42,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591926640] [2025-03-08 16:42:42,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:42,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:42:42,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:42:42,604 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-08 16:42:42,605 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-08 16:42:42,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 16:42:42,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 16:42:42,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:42,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:42,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:42:42,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:42:42,895 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-08 16:42:42,895 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:42:42,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591926640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:42,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:42:42,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:42:42,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281245469] [2025-03-08 16:42:42,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:42,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:42:42,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:42,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:42:42,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:42:42,925 INFO L87 Difference]: Start difference. First operand has 92 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 78 states have internal predecessors, (107), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:42:42,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:42,946 INFO L93 Difference]: Finished difference Result 178 states and 269 transitions. [2025-03-08 16:42:42,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:42:42,948 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2025-03-08 16:42:42,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:42,954 INFO L225 Difference]: With dead ends: 178 [2025-03-08 16:42:42,955 INFO L226 Difference]: Without dead ends: 89 [2025-03-08 16:42:42,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 105 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-08 16:42:42,962 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:42,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:42:42,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-08 16:42:42,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-08 16:42:42,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 75 states have (on average 1.36) internal successors, (102), 75 states have internal predecessors, (102), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 16:42:42,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 126 transitions. [2025-03-08 16:42:42,998 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 126 transitions. Word has length 104 [2025-03-08 16:42:42,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:42,998 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 126 transitions. [2025-03-08 16:42:42,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:42:42,999 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 126 transitions. [2025-03-08 16:42:43,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 16:42:43,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:43,001 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:42:43,009 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-08 16:42:43,202 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-08 16:42:43,202 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:43,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:43,203 INFO L85 PathProgramCache]: Analyzing trace with hash 797578585, now seen corresponding path program 1 times [2025-03-08 16:42:43,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:43,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574897731] [2025-03-08 16:42:43,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:43,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:43,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 16:42:43,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 16:42:43,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:43,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:43,483 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:42:43,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:43,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574897731] [2025-03-08 16:42:43,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574897731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:43,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:42:43,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:42:43,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881433222] [2025-03-08 16:42:43,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:43,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:42:43,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:43,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:42:43,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:42:43,485 INFO L87 Difference]: Start difference. First operand 89 states and 126 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:42:43,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:43,519 INFO L93 Difference]: Finished difference Result 177 states and 252 transitions. [2025-03-08 16:42:43,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:42:43,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2025-03-08 16:42:43,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:43,524 INFO L225 Difference]: With dead ends: 177 [2025-03-08 16:42:43,525 INFO L226 Difference]: Without dead ends: 91 [2025-03-08 16:42:43,525 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-08 16:42:43,546 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:43,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:42:43,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-08 16:42:43,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-08 16:42:43,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 77 states have internal predecessors, (104), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 16:42:43,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2025-03-08 16:42:43,560 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 128 transitions. Word has length 104 [2025-03-08 16:42:43,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:43,561 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 128 transitions. [2025-03-08 16:42:43,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:42:43,562 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 128 transitions. [2025-03-08 16:42:43,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 16:42:43,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:43,563 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:42:43,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:42:43,563 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:43,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:43,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1313711784, now seen corresponding path program 1 times [2025-03-08 16:42:43,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:43,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863411011] [2025-03-08 16:42:43,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:43,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:43,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 16:42:43,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 16:42:43,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:43,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:43,722 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:42:43,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:43,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863411011] [2025-03-08 16:42:43,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863411011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:43,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:42:43,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:42:43,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120290503] [2025-03-08 16:42:43,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:43,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:42:43,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:43,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:42:43,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:42:43,725 INFO L87 Difference]: Start difference. First operand 91 states and 128 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:42:43,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:43,762 INFO L93 Difference]: Finished difference Result 182 states and 257 transitions. [2025-03-08 16:42:43,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:42:43,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2025-03-08 16:42:43,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:43,766 INFO L225 Difference]: With dead ends: 182 [2025-03-08 16:42:43,766 INFO L226 Difference]: Without dead ends: 94 [2025-03-08 16:42:43,767 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-08 16:42:43,767 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 1 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:43,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 352 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:42:43,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-08 16:42:43,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2025-03-08 16:42:43,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 79 states have internal predecessors, (106), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 16:42:43,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2025-03-08 16:42:43,775 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 130 transitions. Word has length 104 [2025-03-08 16:42:43,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:43,775 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 130 transitions. [2025-03-08 16:42:43,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:42:43,775 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2025-03-08 16:42:43,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 16:42:43,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:43,776 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:42:43,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:42:43,777 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:43,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:43,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1173801049, now seen corresponding path program 1 times [2025-03-08 16:42:43,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:43,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867590787] [2025-03-08 16:42:43,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:43,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:43,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 16:42:43,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 16:42:43,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:43,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:43,902 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:42:43,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:43,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867590787] [2025-03-08 16:42:43,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867590787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:43,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:42:43,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:42:43,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815348579] [2025-03-08 16:42:43,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:43,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:42:43,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:43,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:42:43,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:42:43,906 INFO L87 Difference]: Start difference. First operand 93 states and 130 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:42:43,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:43,948 INFO L93 Difference]: Finished difference Result 186 states and 261 transitions. [2025-03-08 16:42:43,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:42:43,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2025-03-08 16:42:43,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:43,950 INFO L225 Difference]: With dead ends: 186 [2025-03-08 16:42:43,951 INFO L226 Difference]: Without dead ends: 96 [2025-03-08 16:42:43,952 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-08 16:42:43,953 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 1 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:43,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 353 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:42:43,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-08 16:42:43,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2025-03-08 16:42:43,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 81 states have internal predecessors, (108), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 16:42:43,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2025-03-08 16:42:43,961 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 104 [2025-03-08 16:42:43,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:43,961 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2025-03-08 16:42:43,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:42:43,962 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2025-03-08 16:42:43,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 16:42:43,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:43,963 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:42:43,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:42:43,963 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:43,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:43,963 INFO L85 PathProgramCache]: Analyzing trace with hash 2061304730, now seen corresponding path program 1 times [2025-03-08 16:42:43,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:43,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318297428] [2025-03-08 16:42:43,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:43,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:43,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 16:42:44,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 16:42:44,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:44,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:44,112 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:42:44,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:44,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318297428] [2025-03-08 16:42:44,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318297428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:44,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:42:44,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:42:44,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910426735] [2025-03-08 16:42:44,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:44,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:42:44,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:44,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:42:44,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:42:44,114 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:42:44,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:44,148 INFO L93 Difference]: Finished difference Result 190 states and 265 transitions. [2025-03-08 16:42:44,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:42:44,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2025-03-08 16:42:44,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:44,150 INFO L225 Difference]: With dead ends: 190 [2025-03-08 16:42:44,152 INFO L226 Difference]: Without dead ends: 98 [2025-03-08 16:42:44,153 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-08 16:42:44,153 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 1 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:44,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 355 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:42:44,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-08 16:42:44,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2025-03-08 16:42:44,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.3253012048192772) internal successors, (110), 83 states have internal predecessors, (110), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 16:42:44,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 134 transitions. [2025-03-08 16:42:44,161 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 134 transitions. Word has length 104 [2025-03-08 16:42:44,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:44,161 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 134 transitions. [2025-03-08 16:42:44,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:42:44,161 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 134 transitions. [2025-03-08 16:42:44,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 16:42:44,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:44,162 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:42:44,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 16:42:44,163 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:44,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:44,165 INFO L85 PathProgramCache]: Analyzing trace with hash 2062228251, now seen corresponding path program 1 times [2025-03-08 16:42:44,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:44,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594607976] [2025-03-08 16:42:44,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:44,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:44,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 16:42:44,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 16:42:44,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:44,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:47,958 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:42:47,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:47,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594607976] [2025-03-08 16:42:47,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594607976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:47,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:42:47,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 16:42:47,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544336065] [2025-03-08 16:42:47,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:47,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 16:42:47,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:47,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 16:42:47,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:42:47,961 INFO L87 Difference]: Start difference. First operand 97 states and 134 transitions. Second operand has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 16:42:49,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:49,265 INFO L93 Difference]: Finished difference Result 306 states and 422 transitions. [2025-03-08 16:42:49,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 16:42:49,267 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 104 [2025-03-08 16:42:49,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:49,268 INFO L225 Difference]: With dead ends: 306 [2025-03-08 16:42:49,268 INFO L226 Difference]: Without dead ends: 212 [2025-03-08 16:42:49,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2025-03-08 16:42:49,270 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 647 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:49,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 843 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:42:49,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-08 16:42:49,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 119. [2025-03-08 16:42:49,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 104 states have (on average 1.3461538461538463) internal successors, (140), 104 states have internal predecessors, (140), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 16:42:49,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 164 transitions. [2025-03-08 16:42:49,288 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 164 transitions. Word has length 104 [2025-03-08 16:42:49,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:49,289 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 164 transitions. [2025-03-08 16:42:49,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 16:42:49,290 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 164 transitions. [2025-03-08 16:42:49,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 16:42:49,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:49,292 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:42:49,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 16:42:49,292 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:49,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:49,293 INFO L85 PathProgramCache]: Analyzing trace with hash -987974564, now seen corresponding path program 1 times [2025-03-08 16:42:49,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:49,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947710053] [2025-03-08 16:42:49,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:49,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:49,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 16:42:49,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 16:42:49,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:49,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:49,347 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:42:49,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:49,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947710053] [2025-03-08 16:42:49,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947710053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:49,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:42:49,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:42:49,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864730393] [2025-03-08 16:42:49,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:49,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:42:49,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:49,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:42:49,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:42:49,348 INFO L87 Difference]: Start difference. First operand 119 states and 164 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:42:49,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:49,371 INFO L93 Difference]: Finished difference Result 273 states and 374 transitions. [2025-03-08 16:42:49,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:42:49,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2025-03-08 16:42:49,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:49,373 INFO L225 Difference]: With dead ends: 273 [2025-03-08 16:42:49,373 INFO L226 Difference]: Without dead ends: 157 [2025-03-08 16:42:49,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:42:49,373 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 61 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:49,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 307 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:42:49,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-08 16:42:49,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 117. [2025-03-08 16:42:49,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 102 states have (on average 1.3333333333333333) internal successors, (136), 102 states have internal predecessors, (136), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 16:42:49,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 160 transitions. [2025-03-08 16:42:49,389 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 160 transitions. Word has length 104 [2025-03-08 16:42:49,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:49,389 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 160 transitions. [2025-03-08 16:42:49,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:42:49,389 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 160 transitions. [2025-03-08 16:42:49,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 16:42:49,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:49,390 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:42:49,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 16:42:49,390 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:49,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:49,391 INFO L85 PathProgramCache]: Analyzing trace with hash 359284052, now seen corresponding path program 1 times [2025-03-08 16:42:49,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:49,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242345166] [2025-03-08 16:42:49,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:49,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:49,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 16:42:49,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 16:42:49,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:49,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:49,712 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:42:49,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:49,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242345166] [2025-03-08 16:42:49,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242345166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:49,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:42:49,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:42:49,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396087269] [2025-03-08 16:42:49,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:49,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:42:49,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:49,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:42:49,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:42:49,714 INFO L87 Difference]: Start difference. First operand 117 states and 160 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:42:49,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:49,871 INFO L93 Difference]: Finished difference Result 311 states and 423 transitions. [2025-03-08 16:42:49,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:42:49,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2025-03-08 16:42:49,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:49,878 INFO L225 Difference]: With dead ends: 311 [2025-03-08 16:42:49,878 INFO L226 Difference]: Without dead ends: 197 [2025-03-08 16:42:49,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-08 16:42:49,879 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 71 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:49,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 609 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:42:49,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-08 16:42:49,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2025-03-08 16:42:49,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 173 states have (on average 1.3352601156069364) internal successors, (231), 174 states have internal predecessors, (231), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:42:49,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 263 transitions. [2025-03-08 16:42:49,910 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 263 transitions. Word has length 108 [2025-03-08 16:42:49,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:49,910 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 263 transitions. [2025-03-08 16:42:49,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:42:49,911 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 263 transitions. [2025-03-08 16:42:49,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 16:42:49,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:49,912 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:42:49,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 16:42:49,912 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:49,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:49,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1243435402, now seen corresponding path program 1 times [2025-03-08 16:42:49,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:49,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576408446] [2025-03-08 16:42:49,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:49,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:49,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 16:42:49,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 16:42:49,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:49,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:50,092 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:42:50,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:50,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576408446] [2025-03-08 16:42:50,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576408446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:50,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:42:50,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:42:50,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357985307] [2025-03-08 16:42:50,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:50,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:42:50,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:50,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:42:50,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:42:50,094 INFO L87 Difference]: Start difference. First operand 194 states and 263 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:42:50,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:50,263 INFO L93 Difference]: Finished difference Result 454 states and 620 transitions. [2025-03-08 16:42:50,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:42:50,263 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2025-03-08 16:42:50,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:50,266 INFO L225 Difference]: With dead ends: 454 [2025-03-08 16:42:50,266 INFO L226 Difference]: Without dead ends: 263 [2025-03-08 16:42:50,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:42:50,267 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 64 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:50,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1007 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:42:50,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-08 16:42:50,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 225. [2025-03-08 16:42:50,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 204 states have (on average 1.3627450980392157) internal successors, (278), 205 states have internal predecessors, (278), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:42:50,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 310 transitions. [2025-03-08 16:42:50,277 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 310 transitions. Word has length 110 [2025-03-08 16:42:50,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:50,277 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 310 transitions. [2025-03-08 16:42:50,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:42:50,278 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 310 transitions. [2025-03-08 16:42:50,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 16:42:50,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:50,278 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:42:50,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 16:42:50,279 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:50,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:50,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1320168470, now seen corresponding path program 1 times [2025-03-08 16:42:50,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:50,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573238250] [2025-03-08 16:42:50,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:50,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:50,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 16:42:50,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 16:42:50,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:50,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:50,453 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:42:50,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:50,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573238250] [2025-03-08 16:42:50,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573238250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:50,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:42:50,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:42:50,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616506464] [2025-03-08 16:42:50,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:50,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:42:50,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:50,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:42:50,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:42:50,455 INFO L87 Difference]: Start difference. First operand 225 states and 310 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:42:50,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:50,608 INFO L93 Difference]: Finished difference Result 504 states and 695 transitions. [2025-03-08 16:42:50,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:42:50,610 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2025-03-08 16:42:50,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:50,611 INFO L225 Difference]: With dead ends: 504 [2025-03-08 16:42:50,611 INFO L226 Difference]: Without dead ends: 282 [2025-03-08 16:42:50,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:42:50,612 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 54 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:50,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 776 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:42:50,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-08 16:42:50,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 251. [2025-03-08 16:42:50,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 230 states have (on average 1.373913043478261) internal successors, (316), 231 states have internal predecessors, (316), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:42:50,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 348 transitions. [2025-03-08 16:42:50,625 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 348 transitions. Word has length 110 [2025-03-08 16:42:50,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:50,625 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 348 transitions. [2025-03-08 16:42:50,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:42:50,625 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 348 transitions. [2025-03-08 16:42:50,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 16:42:50,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:50,628 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:42:50,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 16:42:50,628 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:50,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:50,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1374438448, now seen corresponding path program 1 times [2025-03-08 16:42:50,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:50,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641665831] [2025-03-08 16:42:50,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:50,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:50,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 16:42:50,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 16:42:50,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:50,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:50,746 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:42:50,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:50,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641665831] [2025-03-08 16:42:50,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641665831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:50,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:42:50,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:42:50,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692585980] [2025-03-08 16:42:50,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:50,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:42:50,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:50,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:42:50,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:42:50,748 INFO L87 Difference]: Start difference. First operand 251 states and 348 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:42:50,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:50,836 INFO L93 Difference]: Finished difference Result 582 states and 798 transitions. [2025-03-08 16:42:50,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:42:50,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2025-03-08 16:42:50,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:50,839 INFO L225 Difference]: With dead ends: 582 [2025-03-08 16:42:50,840 INFO L226 Difference]: Without dead ends: 334 [2025-03-08 16:42:50,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:42:50,841 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 68 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:50,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 603 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:42:50,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-03-08 16:42:50,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 251. [2025-03-08 16:42:50,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 230 states have (on average 1.3652173913043477) internal successors, (314), 231 states have internal predecessors, (314), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:42:50,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 346 transitions. [2025-03-08 16:42:50,855 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 346 transitions. Word has length 111 [2025-03-08 16:42:50,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:50,855 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 346 transitions. [2025-03-08 16:42:50,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:42:50,856 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 346 transitions. [2025-03-08 16:42:50,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 16:42:50,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:50,856 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:42:50,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 16:42:50,856 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:50,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:50,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1571640991, now seen corresponding path program 1 times [2025-03-08 16:42:50,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:50,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513599806] [2025-03-08 16:42:50,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:50,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:50,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 16:42:50,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 16:42:50,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:50,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:50,963 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:42:50,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:42:50,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513599806] [2025-03-08 16:42:50,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513599806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:50,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:42:50,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:42:50,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65548867] [2025-03-08 16:42:50,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:50,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:42:50,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:42:50,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:42:50,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:42:50,965 INFO L87 Difference]: Start difference. First operand 251 states and 346 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:42:51,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:51,045 INFO L93 Difference]: Finished difference Result 578 states and 789 transitions. [2025-03-08 16:42:51,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:42:51,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2025-03-08 16:42:51,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:51,047 INFO L225 Difference]: With dead ends: 578 [2025-03-08 16:42:51,047 INFO L226 Difference]: Without dead ends: 330 [2025-03-08 16:42:51,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:42:51,048 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 65 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:51,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 516 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:42:51,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-08 16:42:51,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 250. [2025-03-08 16:42:51,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 229 states have (on average 1.3580786026200873) internal successors, (311), 230 states have internal predecessors, (311), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 16:42:51,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 343 transitions. [2025-03-08 16:42:51,060 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 343 transitions. Word has length 111 [2025-03-08 16:42:51,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:51,060 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 343 transitions. [2025-03-08 16:42:51,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:42:51,061 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 343 transitions. [2025-03-08 16:42:51,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 16:42:51,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:51,064 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:42:51,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 16:42:51,065 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:51,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:51,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1337768121, now seen corresponding path program 1 times [2025-03-08 16:42:51,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:42:51,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767437661] [2025-03-08 16:42:51,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:51,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:42:51,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 16:42:51,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 16:42:51,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:51,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 16:42:51,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2119582042] [2025-03-08 16:42:51,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:51,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:42:51,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:42:51,137 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:42:51,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 16:42:51,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 16:42:51,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 16:42:51,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:51,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:42:51,613 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 16:42:51,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 16:42:51,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 16:42:51,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:51,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:42:52,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 16:42:52,001 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 16:42:52,002 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 16:42:52,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 16:42:52,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 16:42:52,207 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:42:52,339 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 16:42:52,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:42:52 BoogieIcfgContainer [2025-03-08 16:42:52,342 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 16:42:52,343 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 16:42:52,343 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 16:42:52,343 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 16:42:52,343 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:42:42" (3/4) ... [2025-03-08 16:42:52,345 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 16:42:52,346 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 16:42:52,346 INFO L158 Benchmark]: Toolchain (without parser) took 11131.42ms. Allocated memory was 167.8MB in the beginning and 310.4MB in the end (delta: 142.6MB). Free memory was 129.1MB in the beginning and 150.4MB in the end (delta: -21.3MB). Peak memory consumption was 121.7MB. Max. memory is 16.1GB. [2025-03-08 16:42:52,346 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:42:52,347 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.44ms. Allocated memory is still 167.8MB. Free memory was 129.1MB in the beginning and 115.4MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 16:42:52,347 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.51ms. Allocated memory is still 167.8MB. Free memory was 115.4MB in the beginning and 112.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:42:52,347 INFO L158 Benchmark]: Boogie Preprocessor took 58.23ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 108.4MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:42:52,347 INFO L158 Benchmark]: IcfgBuilder took 696.05ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 73.4MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 16:42:52,347 INFO L158 Benchmark]: TraceAbstraction took 10123.29ms. Allocated memory was 167.8MB in the beginning and 310.4MB in the end (delta: 142.6MB). Free memory was 72.6MB in the beginning and 150.4MB in the end (delta: -77.9MB). Peak memory consumption was 71.4MB. Max. memory is 16.1GB. [2025-03-08 16:42:52,348 INFO L158 Benchmark]: Witness Printer took 3.05ms. Allocated memory is still 310.4MB. Free memory is still 150.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:42:52,349 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.36ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 202.44ms. Allocated memory is still 167.8MB. Free memory was 129.1MB in the beginning and 115.4MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.51ms. Allocated memory is still 167.8MB. Free memory was 115.4MB in the beginning and 112.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.23ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 108.4MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 696.05ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 73.4MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10123.29ms. Allocated memory was 167.8MB in the beginning and 310.4MB in the end (delta: 142.6MB). Free memory was 72.6MB in the beginning and 150.4MB in the end (delta: -77.9MB). Peak memory consumption was 71.4MB. Max. memory is 16.1GB. * Witness Printer took 3.05ms. Allocated memory is still 310.4MB. Free memory is still 150.4MB. 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 shiftRight at line 106, overapproximation of shiftRight at line 56, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 98. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 2; [L22] signed short int var_1_1 = 2; [L23] signed short int* var_1_1_Pointer = &(var_1_1); [L24] signed short int var_1_4 = -64; [L24] signed short int var_1_4 = -64; [L25] signed short int* var_1_4_Pointer = &(var_1_4); [L26] signed short int var_1_5 = 256; [L26] signed short int var_1_5 = 256; [L27] signed short int* var_1_5_Pointer = &(var_1_5); [L28] unsigned short int var_1_6 = 128; [L28] unsigned short int var_1_6 = 128; [L29] unsigned short int* var_1_6_Pointer = &(var_1_6); [L30] unsigned short int var_1_7 = 256; [L30] unsigned short int var_1_7 = 256; [L31] unsigned short int* var_1_7_Pointer = &(var_1_7); [L32] signed long int var_1_8 = 50; [L32] signed long int var_1_8 = 50; [L33] signed long int* var_1_8_Pointer = &(var_1_8); [L34] unsigned char var_1_9 = 0; [L34] unsigned char var_1_9 = 0; [L35] unsigned char* var_1_9_Pointer = &(var_1_9); [L36] signed long int var_1_10 = -4; [L36] signed long int var_1_10 = -4; [L37] signed long int* var_1_10_Pointer = &(var_1_10); [L38] float var_1_11 = 15.125; [L38] float var_1_11 = 15.125; [L39] float* var_1_11_Pointer = &(var_1_11); [L40] float var_1_12 = 0.9; [L40] float var_1_12 = 0.9; [L41] float* var_1_12_Pointer = &(var_1_12); [L42] double var_1_13 = 25.875; [L42] double var_1_13 = 25.875; [L43] double* var_1_13_Pointer = &(var_1_13); [L44] unsigned short int var_1_14 = 50; [L44] unsigned short int var_1_14 = 50; [L45] unsigned short int* var_1_14_Pointer = &(var_1_14); [L46] signed short int last_1_var_1_1 = 2; [L47] unsigned short int last_1_var_1_6 = 128; [L48] signed long int last_1_var_1_8 = 50; VAL [isInitial=0, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L101] EXPR \read(var_1_1) [L101] last_1_var_1_1 = var_1_1 [L102] EXPR \read(var_1_6) [L102] last_1_var_1_6 = var_1_6 [L103] EXPR \read(var_1_8) [L103] last_1_var_1_8 = var_1_8 [L113] RET updateLastVariables() [L114] CALL updateVariables() [L81] var_1_4 = __VERIFIER_nondet_short() [L82] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] CALL assume_abort_if_not(var_1_4 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] RET assume_abort_if_not(var_1_4 >= -16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] CALL assume_abort_if_not(var_1_4 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] RET assume_abort_if_not(var_1_4 <= 16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] var_1_5 = __VERIFIER_nondet_short() [L85] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] CALL assume_abort_if_not(var_1_5 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] RET assume_abort_if_not(var_1_5 >= -16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] var_1_7 = __VERIFIER_nondet_ushort() [L88] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] var_1_9 = __VERIFIER_nondet_uchar() [L91] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] var_1_10 = __VERIFIER_nondet_long() [L94] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] CALL assume_abort_if_not(var_1_10 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] RET assume_abort_if_not(var_1_10 >= -2147483648) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] CALL assume_abort_if_not(var_1_10 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] RET assume_abort_if_not(var_1_10 != 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] var_1_12 = __VERIFIER_nondet_float() [L98] EXPR \read(var_1_12) [L98] EXPR var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] EXPR var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F [L98] EXPR \read(var_1_12) [L98] EXPR var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] EXPR (var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] EXPR (var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L114] RET updateVariables() [L115] CALL step() [L52] COND TRUE ! (last_1_var_1_6 <= last_1_var_1_1) [L53] EXPR \read(*var_1_4_Pointer) [L53] EXPR \read(*var_1_5_Pointer) [L53] (*(var_1_1_Pointer)) = ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))) [L55] EXPR \read(*var_1_4_Pointer) [L55] signed long int stepLocal_0 = 1 * (*(var_1_4_Pointer)); [L56] EXPR \read(*var_1_1_Pointer) [L56] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L56] EXPR (*(var_1_1_Pointer)) >> (*(var_1_5_Pointer)) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, stepLocal_0=254, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L56] COND TRUE ((*(var_1_1_Pointer)) >> (*(var_1_5_Pointer))) > stepLocal_0 [L57] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L57] EXPR (((42286 - (*(var_1_7_Pointer)))) > (0)) ? ((42286 - (*(var_1_7_Pointer)))) : (0) [L57] EXPR \read(*var_1_7_Pointer) [L57] EXPR (((42286 - (*(var_1_7_Pointer)))) > (0)) ? ((42286 - (*(var_1_7_Pointer)))) : (0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L57] (*(var_1_6_Pointer)) = (((((42286 - (*(var_1_7_Pointer)))) > (0)) ? ((42286 - (*(var_1_7_Pointer)))) : (0))) [L61] EXPR \read(*var_1_12_Pointer) [L61] (*(var_1_11_Pointer)) = (*(var_1_12_Pointer)) [L62] EXPR \read(*var_1_12_Pointer) [L62] (*(var_1_13_Pointer)) = (*(var_1_12_Pointer)) [L63] EXPR \read(*var_1_7_Pointer) [L63] (*(var_1_14_Pointer)) = (*(var_1_7_Pointer)) [L64] EXPR \read(*var_1_4_Pointer) [L64] EXPR \read(*var_1_10_Pointer) [L64] signed long int stepLocal_2 = (*(var_1_4_Pointer)) / (*(var_1_10_Pointer)); [L65] EXPR \read(*var_1_7_Pointer) [L65] unsigned short int stepLocal_1 = (*(var_1_7_Pointer)); [L66] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L66] COND FALSE !((*(var_1_9_Pointer))) [L69] EXPR \read(*var_1_14_Pointer) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L69] COND FALSE !((*(var_1_14_Pointer)) > stepLocal_2) [L76] EXPR \read(*var_1_6_Pointer) [L76] EXPR \read(*var_1_5_Pointer) [L76] (*(var_1_8_Pointer)) = ((*(var_1_6_Pointer)) + (*(var_1_5_Pointer))) [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR (! (last_1_var_1_6 <= last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) : 1 [L106] EXPR \read(*var_1_1_Pointer) [L106] EXPR \read(*var_1_4_Pointer) [L106] EXPR \read(*var_1_5_Pointer) [L106] EXPR (! (last_1_var_1_6 <= last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) : 1 VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR ((! (last_1_var_1_6 <= last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) : 1) && ((((*(var_1_1_Pointer)) >> (*(var_1_5_Pointer))) > (1 * (*(var_1_4_Pointer)))) ? ((*(var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(var_1_7_Pointer)))) > (0)) ? ((42286 - (*(var_1_7_Pointer)))) : (0))))) : ((*(var_1_6_Pointer)) == ((unsigned short int) (*(var_1_7_Pointer))))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR ((! (last_1_var_1_6 <= last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) : 1) && ((((*(var_1_1_Pointer)) >> (*(var_1_5_Pointer))) > (1 * (*(var_1_4_Pointer)))) ? ((*(var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(var_1_7_Pointer)))) > (0)) ? ((42286 - (*(var_1_7_Pointer)))) : (0))))) : ((*(var_1_6_Pointer)) == ((unsigned short int) (*(var_1_7_Pointer))))) [L106] EXPR \read(*var_1_1_Pointer) [L106] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (*(var_1_1_Pointer)) >> (*(var_1_5_Pointer)) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (((*(var_1_1_Pointer)) >> (*(var_1_5_Pointer))) > (1 * (*(var_1_4_Pointer)))) ? ((*(var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(var_1_7_Pointer)))) > (0)) ? ((42286 - (*(var_1_7_Pointer)))) : (0))))) : ((*(var_1_6_Pointer)) == ((unsigned short int) (*(var_1_7_Pointer)))) [L106] EXPR \read(*var_1_6_Pointer) [L106] EXPR \read(*var_1_7_Pointer) [L106] EXPR (((*(var_1_1_Pointer)) >> (*(var_1_5_Pointer))) > (1 * (*(var_1_4_Pointer)))) ? ((*(var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(var_1_7_Pointer)))) > (0)) ? ((42286 - (*(var_1_7_Pointer)))) : (0))))) : ((*(var_1_6_Pointer)) == ((unsigned short int) (*(var_1_7_Pointer)))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR ((! (last_1_var_1_6 <= last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) : 1) && ((((*(var_1_1_Pointer)) >> (*(var_1_5_Pointer))) > (1 * (*(var_1_4_Pointer)))) ? ((*(var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(var_1_7_Pointer)))) > (0)) ? ((42286 - (*(var_1_7_Pointer)))) : (0))))) : ((*(var_1_6_Pointer)) == ((unsigned short int) (*(var_1_7_Pointer))))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (((! (last_1_var_1_6 <= last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) : 1) && ((((*(var_1_1_Pointer)) >> (*(var_1_5_Pointer))) > (1 * (*(var_1_4_Pointer)))) ? ((*(var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(var_1_7_Pointer)))) > (0)) ? ((42286 - (*(var_1_7_Pointer)))) : (0))))) : ((*(var_1_6_Pointer)) == ((unsigned short int) (*(var_1_7_Pointer)))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed long int) (((((*(var_1_6_Pointer))) < (last_1_var_1_8)) ? ((*(var_1_6_Pointer))) : (last_1_var_1_8))))) : (((*(var_1_14_Pointer)) > ((*(var_1_4_Pointer)) / (*(var_1_10_Pointer)))) ? (((*(var_1_7_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (((((*(var_1_4_Pointer))) < (100)) ? ((*(var_1_4_Pointer))) : (100))))) : ((*(var_1_8_Pointer)) == ((signed long int) (last_1_var_1_8 - (*(var_1_7_Pointer)))))) : ((*(var_1_8_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + (*(var_1_5_Pointer))))))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (((! (last_1_var_1_6 <= last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) : 1) && ((((*(var_1_1_Pointer)) >> (*(var_1_5_Pointer))) > (1 * (*(var_1_4_Pointer)))) ? ((*(var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(var_1_7_Pointer)))) > (0)) ? ((42286 - (*(var_1_7_Pointer)))) : (0))))) : ((*(var_1_6_Pointer)) == ((unsigned short int) (*(var_1_7_Pointer)))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed long int) (((((*(var_1_6_Pointer))) < (last_1_var_1_8)) ? ((*(var_1_6_Pointer))) : (last_1_var_1_8))))) : (((*(var_1_14_Pointer)) > ((*(var_1_4_Pointer)) / (*(var_1_10_Pointer)))) ? (((*(var_1_7_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (((((*(var_1_4_Pointer))) < (100)) ? ((*(var_1_4_Pointer))) : (100))))) : ((*(var_1_8_Pointer)) == ((signed long int) (last_1_var_1_8 - (*(var_1_7_Pointer)))))) : ((*(var_1_8_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + (*(var_1_5_Pointer))))))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR ((((! (last_1_var_1_6 <= last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) : 1) && ((((*(var_1_1_Pointer)) >> (*(var_1_5_Pointer))) > (1 * (*(var_1_4_Pointer)))) ? ((*(var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(var_1_7_Pointer)))) > (0)) ? ((42286 - (*(var_1_7_Pointer)))) : (0))))) : ((*(var_1_6_Pointer)) == ((unsigned short int) (*(var_1_7_Pointer)))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed long int) (((((*(var_1_6_Pointer))) < (last_1_var_1_8)) ? ((*(var_1_6_Pointer))) : (last_1_var_1_8))))) : (((*(var_1_14_Pointer)) > ((*(var_1_4_Pointer)) / (*(var_1_10_Pointer)))) ? (((*(var_1_7_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (((((*(var_1_4_Pointer))) < (100)) ? ((*(var_1_4_Pointer))) : (100))))) : ((*(var_1_8_Pointer)) == ((signed long int) (last_1_var_1_8 - (*(var_1_7_Pointer)))))) : ((*(var_1_8_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + (*(var_1_5_Pointer)))))))) && ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer)))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR ((((! (last_1_var_1_6 <= last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) : 1) && ((((*(var_1_1_Pointer)) >> (*(var_1_5_Pointer))) > (1 * (*(var_1_4_Pointer)))) ? ((*(var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(var_1_7_Pointer)))) > (0)) ? ((42286 - (*(var_1_7_Pointer)))) : (0))))) : ((*(var_1_6_Pointer)) == ((unsigned short int) (*(var_1_7_Pointer)))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed long int) (((((*(var_1_6_Pointer))) < (last_1_var_1_8)) ? ((*(var_1_6_Pointer))) : (last_1_var_1_8))))) : (((*(var_1_14_Pointer)) > ((*(var_1_4_Pointer)) / (*(var_1_10_Pointer)))) ? (((*(var_1_7_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (((((*(var_1_4_Pointer))) < (100)) ? ((*(var_1_4_Pointer))) : (100))))) : ((*(var_1_8_Pointer)) == ((signed long int) (last_1_var_1_8 - (*(var_1_7_Pointer)))))) : ((*(var_1_8_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + (*(var_1_5_Pointer)))))))) && ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer)))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (((((! (last_1_var_1_6 <= last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) : 1) && ((((*(var_1_1_Pointer)) >> (*(var_1_5_Pointer))) > (1 * (*(var_1_4_Pointer)))) ? ((*(var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(var_1_7_Pointer)))) > (0)) ? ((42286 - (*(var_1_7_Pointer)))) : (0))))) : ((*(var_1_6_Pointer)) == ((unsigned short int) (*(var_1_7_Pointer)))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed long int) (((((*(var_1_6_Pointer))) < (last_1_var_1_8)) ? ((*(var_1_6_Pointer))) : (last_1_var_1_8))))) : (((*(var_1_14_Pointer)) > ((*(var_1_4_Pointer)) / (*(var_1_10_Pointer)))) ? (((*(var_1_7_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (((((*(var_1_4_Pointer))) < (100)) ? ((*(var_1_4_Pointer))) : (100))))) : ((*(var_1_8_Pointer)) == ((signed long int) (last_1_var_1_8 - (*(var_1_7_Pointer)))))) : ((*(var_1_8_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + (*(var_1_5_Pointer)))))))) && ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) && ((*(var_1_13_Pointer)) == ((double) (*(var_1_12_Pointer)))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (((((! (last_1_var_1_6 <= last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) : 1) && ((((*(var_1_1_Pointer)) >> (*(var_1_5_Pointer))) > (1 * (*(var_1_4_Pointer)))) ? ((*(var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(var_1_7_Pointer)))) > (0)) ? ((42286 - (*(var_1_7_Pointer)))) : (0))))) : ((*(var_1_6_Pointer)) == ((unsigned short int) (*(var_1_7_Pointer)))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed long int) (((((*(var_1_6_Pointer))) < (last_1_var_1_8)) ? ((*(var_1_6_Pointer))) : (last_1_var_1_8))))) : (((*(var_1_14_Pointer)) > ((*(var_1_4_Pointer)) / (*(var_1_10_Pointer)))) ? (((*(var_1_7_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (((((*(var_1_4_Pointer))) < (100)) ? ((*(var_1_4_Pointer))) : (100))))) : ((*(var_1_8_Pointer)) == ((signed long int) (last_1_var_1_8 - (*(var_1_7_Pointer)))))) : ((*(var_1_8_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + (*(var_1_5_Pointer)))))))) && ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) && ((*(var_1_13_Pointer)) == ((double) (*(var_1_12_Pointer)))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR ((((((! (last_1_var_1_6 <= last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) : 1) && ((((*(var_1_1_Pointer)) >> (*(var_1_5_Pointer))) > (1 * (*(var_1_4_Pointer)))) ? ((*(var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(var_1_7_Pointer)))) > (0)) ? ((42286 - (*(var_1_7_Pointer)))) : (0))))) : ((*(var_1_6_Pointer)) == ((unsigned short int) (*(var_1_7_Pointer)))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed long int) (((((*(var_1_6_Pointer))) < (last_1_var_1_8)) ? ((*(var_1_6_Pointer))) : (last_1_var_1_8))))) : (((*(var_1_14_Pointer)) > ((*(var_1_4_Pointer)) / (*(var_1_10_Pointer)))) ? (((*(var_1_7_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (((((*(var_1_4_Pointer))) < (100)) ? ((*(var_1_4_Pointer))) : (100))))) : ((*(var_1_8_Pointer)) == ((signed long int) (last_1_var_1_8 - (*(var_1_7_Pointer)))))) : ((*(var_1_8_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + (*(var_1_5_Pointer)))))))) && ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) && ((*(var_1_13_Pointer)) == ((double) (*(var_1_12_Pointer))))) && ((*(var_1_14_Pointer)) == ((unsigned short int) (*(var_1_7_Pointer)))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR ((((((! (last_1_var_1_6 <= last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) : 1) && ((((*(var_1_1_Pointer)) >> (*(var_1_5_Pointer))) > (1 * (*(var_1_4_Pointer)))) ? ((*(var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(var_1_7_Pointer)))) > (0)) ? ((42286 - (*(var_1_7_Pointer)))) : (0))))) : ((*(var_1_6_Pointer)) == ((unsigned short int) (*(var_1_7_Pointer)))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed long int) (((((*(var_1_6_Pointer))) < (last_1_var_1_8)) ? ((*(var_1_6_Pointer))) : (last_1_var_1_8))))) : (((*(var_1_14_Pointer)) > ((*(var_1_4_Pointer)) / (*(var_1_10_Pointer)))) ? (((*(var_1_7_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (((((*(var_1_4_Pointer))) < (100)) ? ((*(var_1_4_Pointer))) : (100))))) : ((*(var_1_8_Pointer)) == ((signed long int) (last_1_var_1_8 - (*(var_1_7_Pointer)))))) : ((*(var_1_8_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + (*(var_1_5_Pointer)))))))) && ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) && ((*(var_1_13_Pointer)) == ((double) (*(var_1_12_Pointer))))) && ((*(var_1_14_Pointer)) == ((unsigned short int) (*(var_1_7_Pointer)))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106-L107] return ((((((! (last_1_var_1_6 <= last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))))) : 1) && ((((*(var_1_1_Pointer)) >> (*(var_1_5_Pointer))) > (1 * (*(var_1_4_Pointer)))) ? ((*(var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(var_1_7_Pointer)))) > (0)) ? ((42286 - (*(var_1_7_Pointer)))) : (0))))) : ((*(var_1_6_Pointer)) == ((unsigned short int) (*(var_1_7_Pointer)))))) && ((*(var_1_9_Pointer)) ? ((*(var_1_8_Pointer)) == ((signed long int) (((((*(var_1_6_Pointer))) < (last_1_var_1_8)) ? ((*(var_1_6_Pointer))) : (last_1_var_1_8))))) : (((*(var_1_14_Pointer)) > ((*(var_1_4_Pointer)) / (*(var_1_10_Pointer)))) ? (((*(var_1_7_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (((((*(var_1_4_Pointer))) < (100)) ? ((*(var_1_4_Pointer))) : (100))))) : ((*(var_1_8_Pointer)) == ((signed long int) (last_1_var_1_8 - (*(var_1_7_Pointer)))))) : ((*(var_1_8_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + (*(var_1_5_Pointer)))))))) && ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) && ((*(var_1_13_Pointer)) == ((double) (*(var_1_12_Pointer))))) && ((*(var_1_14_Pointer)) == ((unsigned short int) (*(var_1_7_Pointer)))) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 143 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.9s, OverallIterations: 13, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1033 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1033 mSDsluCounter, 6200 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4535 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1138 IncrementalHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 1665 mSDtfsCounter, 1138 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=251occurred in iteration=10, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 371 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1606 NumberOfCodeBlocks, 1606 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1369 ConstructedInterpolants, 0 QuantifiedInterpolants, 5330 SizeOfPredicates, 0 NumberOfNonLiveVariables, 513 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 3410/3432 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-08 16:42:52,372 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-67.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 acedb713d8fb6ee88e504476b1a8afa9aad0050a29ab1fa7a298d11252db5c53 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:42:54,359 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:42:54,459 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 16:42:54,465 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:42:54,466 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:42:54,495 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:42:54,496 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:42:54,496 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:42:54,497 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:42:54,497 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:42:54,497 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:42:54,498 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:42:54,498 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:42:54,498 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:42:54,498 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:42:54,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:42:54,499 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:42:54,499 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:42:54,499 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:42:54,499 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:42:54,499 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:42:54,499 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:42:54,499 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:42:54,499 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 16:42:54,499 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 16:42:54,499 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 16:42:54,499 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:42:54,499 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:42:54,499 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:42:54,499 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:42:54,499 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:42:54,499 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:42:54,501 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:42:54,501 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:42:54,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:42:54,501 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:42:54,502 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:42:54,502 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:42:54,502 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:42:54,502 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 16:42:54,502 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 16:42:54,502 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:42:54,502 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:42:54,502 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:42:54,502 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:42:54,503 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 -> acedb713d8fb6ee88e504476b1a8afa9aad0050a29ab1fa7a298d11252db5c53 [2025-03-08 16:42:54,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:42:54,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:42:54,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:42:54,806 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:42:54,807 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:42:54,809 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-67.i [2025-03-08 16:42:56,057 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86bd8f542/f089168bcf9a45129e4d6a6aecd09076/FLAG1b2a9aa8d [2025-03-08 16:42:56,272 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:42:56,273 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-67.i [2025-03-08 16:42:56,280 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86bd8f542/f089168bcf9a45129e4d6a6aecd09076/FLAG1b2a9aa8d [2025-03-08 16:42:56,301 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86bd8f542/f089168bcf9a45129e4d6a6aecd09076 [2025-03-08 16:42:56,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:42:56,305 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:42:56,306 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:42:56,307 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:42:56,310 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:42:56,311 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:42:56" (1/1) ... [2025-03-08 16:42:56,312 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c3d1436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:56, skipping insertion in model container [2025-03-08 16:42:56,312 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:42:56" (1/1) ... [2025-03-08 16:42:56,328 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:42:56,462 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-67.i[916,929] [2025-03-08 16:42:56,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:42:56,542 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:42:56,549 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-67.i[916,929] [2025-03-08 16:42:56,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:42:56,590 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:42:56,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:56 WrapperNode [2025-03-08 16:42:56,591 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:42:56,592 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:42:56,592 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:42:56,592 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:42:56,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:56" (1/1) ... [2025-03-08 16:42:56,606 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:56" (1/1) ... [2025-03-08 16:42:56,636 INFO L138 Inliner]: procedures = 39, calls = 141, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 413 [2025-03-08 16:42:56,636 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:42:56,637 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:42:56,637 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:42:56,637 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:42:56,645 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:56" (1/1) ... [2025-03-08 16:42:56,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:56" (1/1) ... [2025-03-08 16:42:56,654 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:56" (1/1) ... [2025-03-08 16:42:56,686 INFO L175 MemorySlicer]: Split 106 memory accesses to 13 slices as follows [2, 6, 14, 10, 14, 16, 10, 6, 7, 3, 10, 3, 5]. 15 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 1, 1, 1, 2, 1, 4, 1, 1, 1, 1, 1, 1]. [2025-03-08 16:42:56,686 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:56" (1/1) ... [2025-03-08 16:42:56,686 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:56" (1/1) ... [2025-03-08 16:42:56,716 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:56" (1/1) ... [2025-03-08 16:42:56,721 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:56" (1/1) ... [2025-03-08 16:42:56,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:56" (1/1) ... [2025-03-08 16:42:56,735 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:56" (1/1) ... [2025-03-08 16:42:56,744 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:42:56,744 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:42:56,744 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:42:56,749 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:42:56,750 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:56" (1/1) ... [2025-03-08 16:42:56,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:42:56,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:42:56,783 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-08 16:42:56,789 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-08 16:42:56,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:42:56,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-08 16:42:56,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-08 16:42:56,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-08 16:42:56,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-08 16:42:56,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-08 16:42:56,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-03-08 16:42:56,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-03-08 16:42:56,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2025-03-08 16:42:56,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2025-03-08 16:42:56,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2025-03-08 16:42:56,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2025-03-08 16:42:56,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2025-03-08 16:42:56,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2025-03-08 16:42:56,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-08 16:42:56,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-08 16:42:56,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-08 16:42:56,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-08 16:42:56,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-08 16:42:56,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-03-08 16:42:56,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-03-08 16:42:56,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2025-03-08 16:42:56,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2025-03-08 16:42:56,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2025-03-08 16:42:56,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2025-03-08 16:42:56,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2025-03-08 16:42:56,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2025-03-08 16:42:56,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-08 16:42:56,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-08 16:42:56,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-08 16:42:56,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-08 16:42:56,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-08 16:42:56,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-08 16:42:56,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-08 16:42:56,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-03-08 16:42:56,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-03-08 16:42:56,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-03-08 16:42:56,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-03-08 16:42:56,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-03-08 16:42:56,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2025-03-08 16:42:56,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-08 16:42:56,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-08 16:42:56,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-08 16:42:56,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-08 16:42:56,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-08 16:42:56,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-08 16:42:56,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-03-08 16:42:56,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2025-03-08 16:42:56,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2025-03-08 16:42:56,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2025-03-08 16:42:56,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2025-03-08 16:42:56,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2025-03-08 16:42:56,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2025-03-08 16:42:56,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 16:42:56,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 16:42:56,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-08 16:42:56,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-08 16:42:56,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-08 16:42:56,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-08 16:42:56,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-08 16:42:56,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-03-08 16:42:56,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-03-08 16:42:56,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-03-08 16:42:56,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-03-08 16:42:56,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-03-08 16:42:56,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2025-03-08 16:42:56,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-08 16:42:56,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-08 16:42:56,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-08 16:42:56,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-08 16:42:56,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-08 16:42:56,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-08 16:42:56,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-08 16:42:56,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-03-08 16:42:56,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-03-08 16:42:56,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-03-08 16:42:56,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2025-03-08 16:42:56,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2025-03-08 16:42:56,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2025-03-08 16:42:56,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-08 16:42:56,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-08 16:42:56,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-08 16:42:56,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-08 16:42:56,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-08 16:42:56,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-08 16:42:56,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-03-08 16:42:56,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2025-03-08 16:42:56,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2025-03-08 16:42:56,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2025-03-08 16:42:56,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2025-03-08 16:42:56,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2025-03-08 16:42:56,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2025-03-08 16:42:56,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-08 16:42:56,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-08 16:42:56,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-08 16:42:56,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-08 16:42:56,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-08 16:42:56,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-03-08 16:42:56,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-03-08 16:42:56,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2025-03-08 16:42:56,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2025-03-08 16:42:56,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2025-03-08 16:42:56,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2025-03-08 16:42:56,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2025-03-08 16:42:56,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2025-03-08 16:42:56,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-08 16:42:56,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-08 16:42:56,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-08 16:42:56,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-08 16:42:56,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-08 16:42:56,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-08 16:42:56,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-08 16:42:56,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-03-08 16:42:56,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-03-08 16:42:56,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-03-08 16:42:56,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2025-03-08 16:42:56,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2025-03-08 16:42:56,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2025-03-08 16:42:56,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-08 16:42:56,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-08 16:42:56,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-08 16:42:56,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-08 16:42:56,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-08 16:42:56,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-08 16:42:56,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-03-08 16:42:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2025-03-08 16:42:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2025-03-08 16:42:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2025-03-08 16:42:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2025-03-08 16:42:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2025-03-08 16:42:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2025-03-08 16:42:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-08 16:42:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-08 16:42:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-08 16:42:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-08 16:42:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-08 16:42:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-08 16:42:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-03-08 16:42:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2025-03-08 16:42:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2025-03-08 16:42:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2025-03-08 16:42:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2025-03-08 16:42:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2025-03-08 16:42:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2025-03-08 16:42:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-08 16:42:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-08 16:42:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-08 16:42:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-08 16:42:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-08 16:42:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-08 16:42:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-03-08 16:42:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2025-03-08 16:42:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2025-03-08 16:42:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2025-03-08 16:42:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2025-03-08 16:42:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2025-03-08 16:42:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2025-03-08 16:42:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:42:56,820 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:42:56,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:42:56,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:42:56,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-08 16:42:56,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-08 16:42:56,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-08 16:42:56,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-08 16:42:56,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-08 16:42:56,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-08 16:42:56,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-08 16:42:56,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-03-08 16:42:56,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-03-08 16:42:56,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-03-08 16:42:56,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-03-08 16:42:56,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-03-08 16:42:56,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2025-03-08 16:42:56,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-08 16:42:56,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-08 16:42:56,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-08 16:42:56,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-08 16:42:56,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-08 16:42:56,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-08 16:42:56,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-03-08 16:42:56,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2025-03-08 16:42:56,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2025-03-08 16:42:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2025-03-08 16:42:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2025-03-08 16:42:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2025-03-08 16:42:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2025-03-08 16:42:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-08 16:42:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-08 16:42:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-08 16:42:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-08 16:42:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-08 16:42:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-08 16:42:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-03-08 16:42:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-03-08 16:42:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2025-03-08 16:42:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2025-03-08 16:42:56,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2025-03-08 16:42:56,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2025-03-08 16:42:56,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2025-03-08 16:42:57,052 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:42:57,054 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:42:57,726 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L106: havoc property_#t~ite61#1;havoc property_#t~mem60#1;havoc property_#t~mem58#1;havoc property_#t~mem59#1;havoc property_#t~mem62#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~ite71#1;havoc property_#t~mem68#1;havoc property_#t~mem65#1;havoc property_#t~ite67#1;havoc property_#t~mem66#1;havoc property_#t~mem70#1;havoc property_#t~mem69#1;havoc property_#t~short72#1;havoc property_#t~mem73#1;havoc property_#t~ite94#1;havoc property_#t~mem77#1;havoc property_#t~mem74#1;havoc property_#t~ite76#1;havoc property_#t~mem75#1;havoc property_#t~mem80#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~ite93#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~ite89#1;havoc property_#t~mem86#1;havoc property_#t~mem83#1;havoc property_#t~ite85#1;havoc property_#t~mem84#1;havoc property_#t~mem88#1;havoc property_#t~mem87#1;havoc property_#t~mem92#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~short95#1;havoc property_#t~mem97#1;havoc property_#t~mem96#1;havoc property_#t~short98#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~short101#1;havoc property_#t~mem103#1;havoc property_#t~mem102#1;havoc property_#t~short104#1; [2025-03-08 16:42:57,766 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2025-03-08 16:42:57,766 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:42:57,777 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:42:57,777 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:42:57,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:42:57 BoogieIcfgContainer [2025-03-08 16:42:57,777 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:42:57,779 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:42:57,779 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:42:57,783 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:42:57,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:42:56" (1/3) ... [2025-03-08 16:42:57,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cdbf877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:42:57, skipping insertion in model container [2025-03-08 16:42:57,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:56" (2/3) ... [2025-03-08 16:42:57,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cdbf877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:42:57, skipping insertion in model container [2025-03-08 16:42:57,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:42:57" (3/3) ... [2025-03-08 16:42:57,786 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-67.i [2025-03-08 16:42:57,798 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:42:57,799 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-67.i that has 2 procedures, 87 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:42:57,846 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:42:57,854 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;@1425679a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:42:57,854 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:42:57,858 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 73 states have internal predecessors, (100), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 16:42:57,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 16:42:57,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:57,865 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:42:57,865 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:57,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:57,870 INFO L85 PathProgramCache]: Analyzing trace with hash -2035901142, now seen corresponding path program 1 times [2025-03-08 16:42:57,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:42:57,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [354517327] [2025-03-08 16:42:57,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:57,882 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-08 16:42:57,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:42:57,885 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-08 16:42:57,886 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-08 16:42:58,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 16:42:58,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 16:42:58,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:58,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:58,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:42:58,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:42:58,337 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-08 16:42:58,337 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:42:58,337 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:42:58,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [354517327] [2025-03-08 16:42:58,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [354517327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:58,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:42:58,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 16:42:58,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413418042] [2025-03-08 16:42:58,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:58,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:42:58,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:42:58,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:42:58,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:42:58,360 INFO L87 Difference]: Start difference. First operand has 87 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 73 states have internal predecessors, (100), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:42:58,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:58,380 INFO L93 Difference]: Finished difference Result 168 states and 255 transitions. [2025-03-08 16:42:58,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:42:58,382 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2025-03-08 16:42:58,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:58,387 INFO L225 Difference]: With dead ends: 168 [2025-03-08 16:42:58,387 INFO L226 Difference]: Without dead ends: 84 [2025-03-08 16:42:58,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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-08 16:42:58,393 INFO L435 NwaCegarLoop]: 119 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, 119 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-08 16:42:58,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:42:58,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-08 16:42:58,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-03-08 16:42:58,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 70 states have internal predecessors, (95), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 16:42:58,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2025-03-08 16:42:58,428 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 119 transitions. Word has length 103 [2025-03-08 16:42:58,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:58,429 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 119 transitions. [2025-03-08 16:42:58,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:42:58,429 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 119 transitions. [2025-03-08 16:42:58,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 16:42:58,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:58,432 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:42:58,442 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-08 16:42:58,633 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-08 16:42:58,633 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:58,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:58,634 INFO L85 PathProgramCache]: Analyzing trace with hash -76310720, now seen corresponding path program 1 times [2025-03-08 16:42:58,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:42:58,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [751404792] [2025-03-08 16:42:58,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:58,634 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-08 16:42:58,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:42:58,637 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-08 16:42:58,638 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-08 16:42:58,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 16:42:59,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 16:42:59,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:59,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:59,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 16:42:59,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:42:59,081 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:42:59,081 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:42:59,081 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:42:59,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [751404792] [2025-03-08 16:42:59,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [751404792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:59,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:42:59,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:42:59,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306854245] [2025-03-08 16:42:59,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:59,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:42:59,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:42:59,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:42:59,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:42:59,084 INFO L87 Difference]: Start difference. First operand 84 states and 119 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:42:59,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:59,142 INFO L93 Difference]: Finished difference Result 170 states and 242 transitions. [2025-03-08 16:42:59,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:42:59,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-03-08 16:42:59,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:59,144 INFO L225 Difference]: With dead ends: 170 [2025-03-08 16:42:59,145 INFO L226 Difference]: Without dead ends: 89 [2025-03-08 16:42:59,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 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-08 16:42:59,146 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 1 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 440 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-08 16:42:59,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 440 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:42:59,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-08 16:42:59,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2025-03-08 16:42:59,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 74 states have (on average 1.337837837837838) internal successors, (99), 74 states have internal predecessors, (99), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 16:42:59,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 123 transitions. [2025-03-08 16:42:59,161 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 123 transitions. Word has length 103 [2025-03-08 16:42:59,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:59,162 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 123 transitions. [2025-03-08 16:42:59,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:42:59,163 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 123 transitions. [2025-03-08 16:42:59,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 16:42:59,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:59,164 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:42:59,172 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-08 16:42:59,364 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-08 16:42:59,364 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:42:59,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:42:59,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1883765183, now seen corresponding path program 1 times [2025-03-08 16:42:59,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:42:59,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1985841770] [2025-03-08 16:42:59,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:42:59,365 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-08 16:42:59,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:42:59,367 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-08 16:42:59,369 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-08 16:42:59,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 16:42:59,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 16:42:59,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:42:59,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:42:59,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 16:42:59,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:42:59,725 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:42:59,725 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:42:59,725 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:42:59,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1985841770] [2025-03-08 16:42:59,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1985841770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:42:59,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:42:59,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:42:59,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453548231] [2025-03-08 16:42:59,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:42:59,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:42:59,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:42:59,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:42:59,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:42:59,726 INFO L87 Difference]: Start difference. First operand 88 states and 123 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:42:59,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:42:59,976 INFO L93 Difference]: Finished difference Result 176 states and 247 transitions. [2025-03-08 16:42:59,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:42:59,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-03-08 16:42:59,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:42:59,978 INFO L225 Difference]: With dead ends: 176 [2025-03-08 16:42:59,978 INFO L226 Difference]: Without dead ends: 91 [2025-03-08 16:42:59,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 98 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-08 16:42:59,979 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 540 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.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:42:59,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 540 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:42:59,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-08 16:42:59,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2025-03-08 16:42:59,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 76 states have internal predecessors, (101), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 16:42:59,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 125 transitions. [2025-03-08 16:42:59,985 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 125 transitions. Word has length 103 [2025-03-08 16:42:59,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:42:59,986 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 125 transitions. [2025-03-08 16:42:59,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:42:59,986 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 125 transitions. [2025-03-08 16:42:59,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 16:42:59,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:42:59,990 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:00,001 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-08 16:43:00,190 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-08 16:43:00,190 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:43:00,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:43:00,191 INFO L85 PathProgramCache]: Analyzing trace with hash -996261502, now seen corresponding path program 1 times [2025-03-08 16:43:00,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:43:00,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [535289146] [2025-03-08 16:43:00,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:43:00,192 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-08 16:43:00,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:43:00,194 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-08 16:43:00,196 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-08 16:43:00,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 16:43:00,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 16:43:00,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:43:00,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:43:00,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 16:43:00,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:43:00,506 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:43:00,506 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:43:00,506 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:43:00,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [535289146] [2025-03-08 16:43:00,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [535289146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:43:00,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:43:00,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:43:00,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885266867] [2025-03-08 16:43:00,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:43:00,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:43:00,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:43:00,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:43:00,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:43:00,507 INFO L87 Difference]: Start difference. First operand 90 states and 125 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:43:00,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:43:00,615 INFO L93 Difference]: Finished difference Result 180 states and 251 transitions. [2025-03-08 16:43:00,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:43:00,616 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-03-08 16:43:00,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:43:00,617 INFO L225 Difference]: With dead ends: 180 [2025-03-08 16:43:00,617 INFO L226 Difference]: Without dead ends: 93 [2025-03-08 16:43:00,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 97 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-08 16:43:00,618 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 1 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 641 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:43:00,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 641 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:43:00,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-08 16:43:00,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2025-03-08 16:43:00,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 78 states have internal predecessors, (103), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 16:43:00,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 127 transitions. [2025-03-08 16:43:00,626 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 127 transitions. Word has length 103 [2025-03-08 16:43:00,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:43:00,626 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 127 transitions. [2025-03-08 16:43:00,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:43:00,627 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 127 transitions. [2025-03-08 16:43:00,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 16:43:00,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:43:00,628 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:00,636 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-08 16:43:00,828 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-08 16:43:00,828 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:43:00,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:43:00,829 INFO L85 PathProgramCache]: Analyzing trace with hash -995337981, now seen corresponding path program 1 times [2025-03-08 16:43:00,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:43:00,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [921906029] [2025-03-08 16:43:00,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:43:00,830 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-08 16:43:00,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:43:00,832 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-08 16:43:00,833 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-08 16:43:00,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 16:43:01,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 16:43:01,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:43:01,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:43:01,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-08 16:43:01,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:43:02,933 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 27 treesize of output 23 [2025-03-08 16:43:03,351 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 126 treesize of output 102 [2025-03-08 16:43:03,358 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 86 [2025-03-08 16:43:03,364 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 76 treesize of output 60 [2025-03-08 16:43:03,469 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 12 proven. 140 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 16:43:03,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:43:03,905 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:43:03,905 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:43:03,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [921906029] [2025-03-08 16:43:03,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [921906029] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:43:03,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:43:03,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [25] total 30 [2025-03-08 16:43:03,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122088725] [2025-03-08 16:43:03,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:43:03,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:43:03,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:43:03,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:43:03,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=769, Unknown=0, NotChecked=0, Total=870 [2025-03-08 16:43:03,907 INFO L87 Difference]: Start difference. First operand 92 states and 127 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:43:04,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:43:04,327 INFO L93 Difference]: Finished difference Result 237 states and 328 transitions. [2025-03-08 16:43:04,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:43:04,328 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-03-08 16:43:04,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:43:04,330 INFO L225 Difference]: With dead ends: 237 [2025-03-08 16:43:04,330 INFO L226 Difference]: Without dead ends: 148 [2025-03-08 16:43:04,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2025-03-08 16:43:04,331 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 120 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:43:04,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 538 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:43:04,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-08 16:43:04,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 108. [2025-03-08 16:43:04,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.351063829787234) internal successors, (127), 94 states have internal predecessors, (127), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 16:43:04,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 151 transitions. [2025-03-08 16:43:04,336 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 151 transitions. Word has length 103 [2025-03-08 16:43:04,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:43:04,337 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 151 transitions. [2025-03-08 16:43:04,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:43:04,337 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 151 transitions. [2025-03-08 16:43:04,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 16:43:04,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:43:04,340 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:04,349 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 (6)] Forceful destruction successful, exit code 0 [2025-03-08 16:43:04,541 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-08 16:43:04,541 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:43:04,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:43:04,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1261573026, now seen corresponding path program 1 times [2025-03-08 16:43:04,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:43:04,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939903900] [2025-03-08 16:43:04,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:43:04,542 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-08 16:43:04,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:43:04,544 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-08 16:43:04,545 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-08 16:43:04,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 16:43:04,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 16:43:04,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:43:04,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:43:04,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 16:43:04,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:43:04,830 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-08 16:43:04,840 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-08 16:43:05,190 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:43:05,190 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:43:05,191 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:43:05,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939903900] [2025-03-08 16:43:05,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939903900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:43:05,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:43:05,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:43:05,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784144961] [2025-03-08 16:43:05,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:43:05,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:43:05,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:43:05,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:43:05,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:43:05,192 INFO L87 Difference]: Start difference. First operand 108 states and 151 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:43:05,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:43:05,359 INFO L93 Difference]: Finished difference Result 301 states and 421 transitions. [2025-03-08 16:43:05,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:43:05,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-03-08 16:43:05,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:43:05,361 INFO L225 Difference]: With dead ends: 301 [2025-03-08 16:43:05,361 INFO L226 Difference]: Without dead ends: 196 [2025-03-08 16:43:05,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:43:05,362 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 96 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:43:05,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 326 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:43:05,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-08 16:43:05,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 159. [2025-03-08 16:43:05,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 132 states have (on average 1.3257575757575757) internal successors, (175), 132 states have internal predecessors, (175), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 16:43:05,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 223 transitions. [2025-03-08 16:43:05,375 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 223 transitions. Word has length 103 [2025-03-08 16:43:05,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:43:05,375 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 223 transitions. [2025-03-08 16:43:05,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:43:05,376 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 223 transitions. [2025-03-08 16:43:05,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-08 16:43:05,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:43:05,377 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:05,385 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 (7)] Forceful destruction successful, exit code 0 [2025-03-08 16:43:05,577 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-08 16:43:05,577 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:43:05,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:43:05,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1856971363, now seen corresponding path program 1 times [2025-03-08 16:43:05,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:43:05,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144887601] [2025-03-08 16:43:05,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:43:05,579 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-08 16:43:05,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:43:05,582 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-08 16:43:05,591 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-08 16:43:05,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 16:43:05,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 16:43:05,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:43:05,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:43:05,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 16:43:05,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:43:06,173 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-08 16:43:06,246 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-08 16:43:06,249 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-08 16:43:06,282 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 158 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-08 16:43:06,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:43:06,366 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:43:06,366 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:43:06,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144887601] [2025-03-08 16:43:06,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144887601] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:43:06,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:43:06,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 13 [2025-03-08 16:43:06,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897293289] [2025-03-08 16:43:06,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:43:06,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:43:06,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:43:06,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:43:06,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:43:06,367 INFO L87 Difference]: Start difference. First operand 159 states and 223 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:43:06,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:43:06,710 INFO L93 Difference]: Finished difference Result 351 states and 491 transitions. [2025-03-08 16:43:06,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:43:06,711 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2025-03-08 16:43:06,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:43:06,712 INFO L225 Difference]: With dead ends: 351 [2025-03-08 16:43:06,712 INFO L226 Difference]: Without dead ends: 246 [2025-03-08 16:43:06,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 197 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-08 16:43:06,713 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 70 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:43:06,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 588 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:43:06,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-03-08 16:43:06,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 243. [2025-03-08 16:43:06,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 211 states have (on average 1.3459715639810426) internal successors, (284), 212 states have internal predecessors, (284), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 16:43:06,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 340 transitions. [2025-03-08 16:43:06,732 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 340 transitions. Word has length 105 [2025-03-08 16:43:06,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:43:06,733 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 340 transitions. [2025-03-08 16:43:06,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:43:06,733 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 340 transitions. [2025-03-08 16:43:06,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 16:43:06,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:43:06,735 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:06,744 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 (8)] Forceful destruction successful, exit code 0 [2025-03-08 16:43:06,936 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-08 16:43:06,936 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:43:06,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:43:06,937 INFO L85 PathProgramCache]: Analyzing trace with hash 741043359, now seen corresponding path program 1 times [2025-03-08 16:43:06,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:43:06,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841991161] [2025-03-08 16:43:06,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:43:06,937 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:43:06,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:43:06,939 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-08 16:43:06,939 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-08 16:43:07,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 16:43:07,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 16:43:07,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:43:07,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:43:07,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 16:43:07,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:43:07,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2025-03-08 16:43:08,334 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 55 treesize of output 43 [2025-03-08 16:43:08,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 56 treesize of output 40 [2025-03-08 16:43:08,345 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 39 treesize of output 27 [2025-03-08 16:43:08,498 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-08 16:43:08,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:43:08,954 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:43:08,954 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:43:08,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841991161] [2025-03-08 16:43:08,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [841991161] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:43:08,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:43:08,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [18] total 24 [2025-03-08 16:43:08,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678876812] [2025-03-08 16:43:08,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:43:08,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:43:08,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:43:08,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:43:08,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2025-03-08 16:43:08,955 INFO L87 Difference]: Start difference. First operand 243 states and 340 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:43:09,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:43:09,726 INFO L93 Difference]: Finished difference Result 455 states and 633 transitions. [2025-03-08 16:43:09,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:43:09,727 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2025-03-08 16:43:09,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:43:09,729 INFO L225 Difference]: With dead ends: 455 [2025-03-08 16:43:09,729 INFO L226 Difference]: Without dead ends: 276 [2025-03-08 16:43:09,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2025-03-08 16:43:09,730 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 137 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:43:09,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 760 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 16:43:09,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-03-08 16:43:09,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 246. [2025-03-08 16:43:09,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 214 states have (on average 1.341121495327103) internal successors, (287), 215 states have internal predecessors, (287), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 16:43:09,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 343 transitions. [2025-03-08 16:43:09,741 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 343 transitions. Word has length 107 [2025-03-08 16:43:09,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:43:09,741 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 343 transitions. [2025-03-08 16:43:09,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:43:09,741 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 343 transitions. [2025-03-08 16:43:09,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 16:43:09,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:43:09,742 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:09,756 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-08 16:43:09,942 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-08 16:43:09,942 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:43:09,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:43:09,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1802493471, now seen corresponding path program 1 times [2025-03-08 16:43:09,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:43:09,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1447712805] [2025-03-08 16:43:09,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:43:09,943 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-08 16:43:09,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:43:09,945 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-08 16:43:09,946 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-08 16:43:10,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 16:43:10,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 16:43:10,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:43:10,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:43:10,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 16:43:10,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:43:10,865 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 33 treesize of output 25 [2025-03-08 16:43:10,869 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 29 treesize of output 21 [2025-03-08 16:43:10,871 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 43 treesize of output 27 [2025-03-08 16:43:11,440 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-08 16:43:11,440 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:43:11,806 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:43:11,806 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:43:11,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1447712805] [2025-03-08 16:43:11,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1447712805] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:43:11,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:43:11,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2025-03-08 16:43:11,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645195297] [2025-03-08 16:43:11,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:43:11,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:43:11,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:43:11,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:43:11,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2025-03-08 16:43:11,807 INFO L87 Difference]: Start difference. First operand 246 states and 343 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:43:12,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:43:12,252 INFO L93 Difference]: Finished difference Result 425 states and 590 transitions. [2025-03-08 16:43:12,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:43:12,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2025-03-08 16:43:12,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:43:12,255 INFO L225 Difference]: With dead ends: 425 [2025-03-08 16:43:12,257 INFO L226 Difference]: Without dead ends: 243 [2025-03-08 16:43:12,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-03-08 16:43:12,258 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 49 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:43:12,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 428 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:43:12,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-08 16:43:12,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2025-03-08 16:43:12,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 209 states have (on average 1.3349282296650717) internal successors, (279), 210 states have internal predecessors, (279), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 16:43:12,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 335 transitions. [2025-03-08 16:43:12,271 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 335 transitions. Word has length 107 [2025-03-08 16:43:12,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:43:12,272 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 335 transitions. [2025-03-08 16:43:12,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:43:12,273 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 335 transitions. [2025-03-08 16:43:12,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 16:43:12,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:43:12,274 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:12,282 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-08 16:43:12,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-08 16:43:12,474 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:43:12,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:43:12,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1176324959, now seen corresponding path program 1 times [2025-03-08 16:43:12,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:43:12,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [551714770] [2025-03-08 16:43:12,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:43:12,476 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-08 16:43:12,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:43:12,477 INFO L229 MonitoredProcess]: Starting monitored process 11 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-08 16:43:12,479 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 (11)] Waiting until timeout for monitored process [2025-03-08 16:43:12,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 16:43:12,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 16:43:12,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:43:12,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:43:12,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 16:43:12,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:43:12,897 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 22 treesize of output 18 [2025-03-08 16:43:12,947 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-08 16:43:12,961 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 28 treesize of output 20 [2025-03-08 16:43:13,024 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-08 16:43:13,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:43:13,170 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:43:13,170 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:43:13,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [551714770] [2025-03-08 16:43:13,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [551714770] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:43:13,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:43:13,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 14 [2025-03-08 16:43:13,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930109861] [2025-03-08 16:43:13,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:43:13,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:43:13,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:43:13,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:43:13,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:43:13,171 INFO L87 Difference]: Start difference. First operand 241 states and 335 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:43:13,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:43:13,918 INFO L93 Difference]: Finished difference Result 512 states and 707 transitions. [2025-03-08 16:43:13,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:43:13,918 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2025-03-08 16:43:13,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:43:13,920 INFO L225 Difference]: With dead ends: 512 [2025-03-08 16:43:13,920 INFO L226 Difference]: Without dead ends: 335 [2025-03-08 16:43:13,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 203 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-03-08 16:43:13,921 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 73 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:43:13,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 1100 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 16:43:13,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-03-08 16:43:13,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 288. [2025-03-08 16:43:13,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 256 states have (on average 1.35546875) internal successors, (347), 257 states have internal predecessors, (347), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 16:43:13,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 403 transitions. [2025-03-08 16:43:13,933 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 403 transitions. Word has length 109 [2025-03-08 16:43:13,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:43:13,934 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 403 transitions. [2025-03-08 16:43:13,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:43:13,934 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 403 transitions. [2025-03-08 16:43:13,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 16:43:13,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:43:13,935 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:13,945 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 (11)] Forceful destruction successful, exit code 0 [2025-03-08 16:43:14,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-08 16:43:14,136 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:43:14,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:43:14,136 INFO L85 PathProgramCache]: Analyzing trace with hash 331226850, now seen corresponding path program 1 times [2025-03-08 16:43:14,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:43:14,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [937134337] [2025-03-08 16:43:14,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:43:14,136 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-08 16:43:14,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:43:14,138 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-08 16:43:14,140 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-08 16:43:14,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 16:43:14,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 16:43:14,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:43:14,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:43:14,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 16:43:14,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:43:14,512 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-08 16:43:14,684 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-08 16:43:14,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:43:14,813 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:43:14,813 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:43:14,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [937134337] [2025-03-08 16:43:14,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [937134337] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:43:14,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:43:14,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-03-08 16:43:14,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292382733] [2025-03-08 16:43:14,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:43:14,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:43:14,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:43:14,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:43:14,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:43:14,814 INFO L87 Difference]: Start difference. First operand 288 states and 403 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:43:15,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:43:15,124 INFO L93 Difference]: Finished difference Result 551 states and 760 transitions. [2025-03-08 16:43:15,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:43:15,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2025-03-08 16:43:15,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:43:15,127 INFO L225 Difference]: With dead ends: 551 [2025-03-08 16:43:15,127 INFO L226 Difference]: Without dead ends: 338 [2025-03-08 16:43:15,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:43:15,127 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 68 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:43:15,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 518 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:43:15,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-03-08 16:43:15,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 291. [2025-03-08 16:43:15,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 258 states have (on average 1.3488372093023255) internal successors, (348), 259 states have internal predecessors, (348), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 16:43:15,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 404 transitions. [2025-03-08 16:43:15,147 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 404 transitions. Word has length 109 [2025-03-08 16:43:15,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:43:15,147 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 404 transitions. [2025-03-08 16:43:15,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:43:15,148 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 404 transitions. [2025-03-08 16:43:15,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 16:43:15,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:43:15,148 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:15,157 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-08 16:43:15,349 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-08 16:43:15,349 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:43:15,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:43:15,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1041432994, now seen corresponding path program 1 times [2025-03-08 16:43:15,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:43:15,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [773871831] [2025-03-08 16:43:15,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:43:15,350 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-08 16:43:15,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:43:15,354 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-08 16:43:15,355 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-08 16:43:15,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 16:43:15,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 16:43:15,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:43:15,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:43:15,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 16:43:15,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:43:15,730 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 22 treesize of output 14 [2025-03-08 16:43:15,750 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-08 16:43:15,750 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:43:15,850 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:43:15,850 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:43:15,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [773871831] [2025-03-08 16:43:15,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [773871831] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:43:15,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:43:15,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-03-08 16:43:15,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234398008] [2025-03-08 16:43:15,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:43:15,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:43:15,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:43:15,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:43:15,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:43:15,851 INFO L87 Difference]: Start difference. First operand 291 states and 404 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:43:16,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:43:16,108 INFO L93 Difference]: Finished difference Result 510 states and 704 transitions. [2025-03-08 16:43:16,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:43:16,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2025-03-08 16:43:16,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:43:16,110 INFO L225 Difference]: With dead ends: 510 [2025-03-08 16:43:16,110 INFO L226 Difference]: Without dead ends: 298 [2025-03-08 16:43:16,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:43:16,111 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 124 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:43:16,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 432 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:43:16,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-03-08 16:43:16,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 251. [2025-03-08 16:43:16,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 222 states have (on average 1.3558558558558558) internal successors, (301), 222 states have internal predecessors, (301), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 16:43:16,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 349 transitions. [2025-03-08 16:43:16,119 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 349 transitions. Word has length 109 [2025-03-08 16:43:16,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:43:16,119 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 349 transitions. [2025-03-08 16:43:16,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:43:16,120 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 349 transitions. [2025-03-08 16:43:16,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 16:43:16,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:43:16,120 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:16,130 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-08 16:43:16,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-08 16:43:16,321 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:43:16,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:43:16,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1745982493, now seen corresponding path program 1 times [2025-03-08 16:43:16,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:43:16,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [624506362] [2025-03-08 16:43:16,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:43:16,322 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-08 16:43:16,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:43:16,324 INFO L229 MonitoredProcess]: Starting monitored process 14 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-08 16:43:16,325 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 (14)] Waiting until timeout for monitored process [2025-03-08 16:43:16,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 16:43:16,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 16:43:16,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:43:16,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:43:16,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 16:43:16,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:43:16,622 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-08 16:43:16,643 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-08 16:43:16,688 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:43:16,688 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:43:16,688 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:43:16,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [624506362] [2025-03-08 16:43:16,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [624506362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:43:16,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:43:16,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:43:16,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539557677] [2025-03-08 16:43:16,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:43:16,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:43:16,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:43:16,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:43:16,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:43:16,690 INFO L87 Difference]: Start difference. First operand 251 states and 349 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:43:17,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:43:17,061 INFO L93 Difference]: Finished difference Result 510 states and 704 transitions. [2025-03-08 16:43:17,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:43:17,061 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2025-03-08 16:43:17,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:43:17,063 INFO L225 Difference]: With dead ends: 510 [2025-03-08 16:43:17,063 INFO L226 Difference]: Without dead ends: 338 [2025-03-08 16:43:17,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:43:17,063 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 109 mSDsluCounter, 1335 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1551 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:43:17,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1551 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:43:17,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-03-08 16:43:17,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 250. [2025-03-08 16:43:17,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 221 states have (on average 1.3574660633484164) internal successors, (300), 221 states have internal predecessors, (300), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 16:43:17,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 348 transitions. [2025-03-08 16:43:17,080 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 348 transitions. Word has length 109 [2025-03-08 16:43:17,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:43:17,081 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 348 transitions. [2025-03-08 16:43:17,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:43:17,081 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 348 transitions. [2025-03-08 16:43:17,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 16:43:17,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:43:17,082 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:17,096 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 (14)] Ended with exit code 0 [2025-03-08 16:43:17,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-08 16:43:17,283 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:43:17,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:43:17,283 INFO L85 PathProgramCache]: Analyzing trace with hash 880294963, now seen corresponding path program 1 times [2025-03-08 16:43:17,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:43:17,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230805530] [2025-03-08 16:43:17,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:43:17,284 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-08 16:43:17,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:43:17,286 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-08 16:43:17,287 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-08 16:43:17,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 16:43:17,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 16:43:17,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:43:17,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:43:17,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 16:43:17,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:43:17,735 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-08 16:43:17,750 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-08 16:43:17,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 54 treesize of output 42 [2025-03-08 16:43:17,911 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-08 16:43:17,955 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-08 16:43:17,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:43:18,246 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:43:18,246 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:43:18,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230805530] [2025-03-08 16:43:18,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [230805530] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:43:18,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:43:18,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 19 [2025-03-08 16:43:18,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716416698] [2025-03-08 16:43:18,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:43:18,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:43:18,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:43:18,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:43:18,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2025-03-08 16:43:18,247 INFO L87 Difference]: Start difference. First operand 250 states and 348 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:43:18,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:43:18,521 INFO L93 Difference]: Finished difference Result 255 states and 353 transitions. [2025-03-08 16:43:18,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:43:18,522 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2025-03-08 16:43:18,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:43:18,523 INFO L225 Difference]: With dead ends: 255 [2025-03-08 16:43:18,523 INFO L226 Difference]: Without dead ends: 253 [2025-03-08 16:43:18,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2025-03-08 16:43:18,524 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 238 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:43:18,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 655 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:43:18,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-08 16:43:18,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2025-03-08 16:43:18,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 224 states have (on average 1.3526785714285714) internal successors, (303), 224 states have internal predecessors, (303), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 16:43:18,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 351 transitions. [2025-03-08 16:43:18,532 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 351 transitions. Word has length 109 [2025-03-08 16:43:18,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:43:18,533 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 351 transitions. [2025-03-08 16:43:18,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:43:18,533 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 351 transitions. [2025-03-08 16:43:18,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 16:43:18,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:43:18,534 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:18,550 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-08 16:43:18,738 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-08 16:43:18,738 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:43:18,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:43:18,738 INFO L85 PathProgramCache]: Analyzing trace with hash 881218484, now seen corresponding path program 1 times [2025-03-08 16:43:18,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:43:18,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2036896856] [2025-03-08 16:43:18,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:43:18,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-08 16:43:18,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:43:18,740 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-08 16:43:18,741 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-08 16:43:18,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 16:43:19,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 16:43:19,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:43:19,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:43:19,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 16:43:19,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:43:19,916 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 18 treesize of output 19 [2025-03-08 16:43:23,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:43:23,698 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 156 treesize of output 86 [2025-03-08 16:43:23,701 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 167 treesize of output 107 [2025-03-08 16:43:23,981 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 16:43:23,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:43:31,722 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:43:31,722 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:43:31,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2036896856] [2025-03-08 16:43:31,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2036896856] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:43:31,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:43:31,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 13 [2025-03-08 16:43:31,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808698947] [2025-03-08 16:43:31,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:43:31,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:43:31,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:43:31,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:43:31,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:43:31,723 INFO L87 Difference]: Start difference. First operand 253 states and 351 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:43:39,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:43:39,232 INFO L93 Difference]: Finished difference Result 431 states and 596 transitions. [2025-03-08 16:43:39,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:43:39,239 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2025-03-08 16:43:39,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:43:39,240 INFO L225 Difference]: With dead ends: 431 [2025-03-08 16:43:39,240 INFO L226 Difference]: Without dead ends: 257 [2025-03-08 16:43:39,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 203 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-03-08 16:43:39,241 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 85 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-08 16:43:39,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 735 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-08 16:43:39,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-08 16:43:39,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2025-03-08 16:43:39,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 227 states have (on average 1.3436123348017621) internal successors, (305), 227 states have internal predecessors, (305), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 16:43:39,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 353 transitions. [2025-03-08 16:43:39,250 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 353 transitions. Word has length 109 [2025-03-08 16:43:39,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:43:39,251 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 353 transitions. [2025-03-08 16:43:39,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:43:39,251 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 353 transitions. [2025-03-08 16:43:39,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 16:43:39,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:43:39,252 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:39,266 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 (16)] Forceful destruction successful, exit code 0 [2025-03-08 16:43:39,452 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-08 16:43:39,453 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:43:39,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:43:39,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1768722165, now seen corresponding path program 1 times [2025-03-08 16:43:39,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:43:39,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [632235109] [2025-03-08 16:43:39,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:43:39,454 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-08 16:43:39,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:43:39,455 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-08 16:43:39,457 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-08 16:43:39,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 16:43:39,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 16:43:39,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:43:39,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:43:39,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 16:43:39,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:43:40,277 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-08 16:43:40,422 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 125 treesize of output 89 [2025-03-08 16:43:40,424 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 137 treesize of output 77 [2025-03-08 16:43:40,461 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 16:43:40,461 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:43:40,575 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:43:40,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [632235109] [2025-03-08 16:43:40,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [632235109] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:43:40,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1161197584] [2025-03-08 16:43:40,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:43:40,576 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 16:43:40,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 16:43:40,595 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 16:43:40,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2025-03-08 16:43:40,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 16:43:41,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 16:43:41,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:43:41,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:43:41,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 16:43:41,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:43:42,509 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-08 16:43:42,946 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-08 16:43:43,230 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 125 treesize of output 89 [2025-03-08 16:43:43,233 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 137 treesize of output 77 [2025-03-08 16:43:43,244 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 16:43:43,244 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:43:43,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1161197584] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:43:43,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:43:43,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2025-03-08 16:43:43,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689088609] [2025-03-08 16:43:43,352 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 16:43:43,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 16:43:43,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:43:43,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 16:43:43,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-03-08 16:43:43,353 INFO L87 Difference]: Start difference. First operand 257 states and 353 transitions. Second operand has 16 states, 16 states have (on average 6.375) internal successors, (102), 15 states have internal predecessors, (102), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-08 16:43:44,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:43:44,634 INFO L93 Difference]: Finished difference Result 655 states and 899 transitions. [2025-03-08 16:43:44,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 16:43:44,635 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.375) internal successors, (102), 15 states have internal predecessors, (102), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 109 [2025-03-08 16:43:44,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:43:44,637 INFO L225 Difference]: With dead ends: 655 [2025-03-08 16:43:44,637 INFO L226 Difference]: Without dead ends: 477 [2025-03-08 16:43:44,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 261 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2025-03-08 16:43:44,638 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 476 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 16:43:44,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 1074 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 16:43:44,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-03-08 16:43:44,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 426. [2025-03-08 16:43:44,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 392 states have (on average 1.3826530612244898) internal successors, (542), 392 states have internal predecessors, (542), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 16:43:44,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 594 transitions. [2025-03-08 16:43:44,659 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 594 transitions. Word has length 109 [2025-03-08 16:43:44,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:43:44,659 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 594 transitions. [2025-03-08 16:43:44,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.375) internal successors, (102), 15 states have internal predecessors, (102), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-08 16:43:44,659 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 594 transitions. [2025-03-08 16:43:44,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 16:43:44,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:43:44,660 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:44,672 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-08 16:43:44,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2025-03-08 16:43:45,061 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,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-08 16:43:45,061 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:43:45,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:43:45,061 INFO L85 PathProgramCache]: Analyzing trace with hash -38732298, now seen corresponding path program 1 times [2025-03-08 16:43:45,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:43:45,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [8184729] [2025-03-08 16:43:45,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:43:45,062 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-08 16:43:45,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:43:45,064 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-08 16:43:45,065 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-08 16:43:45,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 16:43:45,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 16:43:45,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:43:45,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:43:45,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 16:43:45,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:43:45,447 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 25 treesize of output 21 [2025-03-08 16:43:45,538 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-03-08 16:43:45,538 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:43:45,619 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:43:45,619 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:43:45,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [8184729] [2025-03-08 16:43:45,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [8184729] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:43:45,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:43:45,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 10 [2025-03-08 16:43:45,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603323465] [2025-03-08 16:43:45,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:43:45,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:43:45,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:43:45,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:43:45,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:43:45,620 INFO L87 Difference]: Start difference. First operand 426 states and 594 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:43:45,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:43:45,946 INFO L93 Difference]: Finished difference Result 889 states and 1217 transitions. [2025-03-08 16:43:45,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:43:45,947 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2025-03-08 16:43:45,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:43:45,949 INFO L225 Difference]: With dead ends: 889 [2025-03-08 16:43:45,949 INFO L226 Difference]: Without dead ends: 587 [2025-03-08 16:43:45,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:43:45,949 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 50 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:43:45,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 645 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:43:45,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-03-08 16:43:45,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 584. [2025-03-08 16:43:45,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 547 states have (on average 1.3436928702010968) internal successors, (735), 548 states have internal predecessors, (735), 28 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 16:43:45,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 791 transitions. [2025-03-08 16:43:45,976 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 791 transitions. Word has length 109 [2025-03-08 16:43:45,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:43:45,977 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 791 transitions. [2025-03-08 16:43:45,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:43:45,977 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 791 transitions. [2025-03-08 16:43:45,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 16:43:45,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:43:45,978 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:45,992 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-08 16:43:46,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-08 16:43:46,179 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:43:46,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:43:46,179 INFO L85 PathProgramCache]: Analyzing trace with hash -861978439, now seen corresponding path program 1 times [2025-03-08 16:43:46,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:43:46,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1090347881] [2025-03-08 16:43:46,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:43:46,179 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-08 16:43:46,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:43:46,181 INFO L229 MonitoredProcess]: Starting monitored process 20 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-08 16:43:46,182 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 (20)] Waiting until timeout for monitored process [2025-03-08 16:43:46,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 16:43:46,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 16:43:46,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:43:46,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:43:46,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 16:43:46,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:43:46,706 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 4 proven. 152 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-08 16:43:46,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:43:46,794 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:43:46,795 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:43:46,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1090347881] [2025-03-08 16:43:46,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1090347881] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:43:46,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:43:46,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2025-03-08 16:43:46,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595113496] [2025-03-08 16:43:46,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:43:46,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:43:46,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:43:46,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:43:46,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:43:46,796 INFO L87 Difference]: Start difference. First operand 584 states and 791 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:43:46,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:43:46,982 INFO L93 Difference]: Finished difference Result 1193 states and 1595 transitions. [2025-03-08 16:43:46,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:43:46,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2025-03-08 16:43:46,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:43:46,985 INFO L225 Difference]: With dead ends: 1193 [2025-03-08 16:43:46,985 INFO L226 Difference]: Without dead ends: 745 [2025-03-08 16:43:46,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:43:46,986 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 116 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:43:46,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 325 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:43:46,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2025-03-08 16:43:47,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 742. [2025-03-08 16:43:47,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 696 states have (on average 1.3132183908045978) internal successors, (914), 698 states have internal predecessors, (914), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 16:43:47,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 982 transitions. [2025-03-08 16:43:47,009 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 982 transitions. Word has length 109 [2025-03-08 16:43:47,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:43:47,009 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 982 transitions. [2025-03-08 16:43:47,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:43:47,009 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 982 transitions. [2025-03-08 16:43:47,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 16:43:47,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:43:47,010 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:47,019 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 (20)] Ended with exit code 0 [2025-03-08 16:43:47,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-08 16:43:47,211 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:43:47,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:43:47,211 INFO L85 PathProgramCache]: Analyzing trace with hash -893441132, now seen corresponding path program 1 times [2025-03-08 16:43:47,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:43:47,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672843099] [2025-03-08 16:43:47,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:43:47,212 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-08 16:43:47,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:43:47,213 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-08 16:43:47,215 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-08 16:43:47,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 16:43:47,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 16:43:47,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:43:47,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:43:47,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:43:47,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:43:47,511 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 16:43:47,511 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:43:47,511 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:43:47,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672843099] [2025-03-08 16:43:47,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672843099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:43:47,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:43:47,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:43:47,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681978712] [2025-03-08 16:43:47,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:43:47,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:43:47,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:43:47,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:43:47,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:43:47,512 INFO L87 Difference]: Start difference. First operand 742 states and 982 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:43:47,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:43:47,549 INFO L93 Difference]: Finished difference Result 1387 states and 1837 transitions. [2025-03-08 16:43:47,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:43:47,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2025-03-08 16:43:47,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:43:47,552 INFO L225 Difference]: With dead ends: 1387 [2025-03-08 16:43:47,552 INFO L226 Difference]: Without dead ends: 742 [2025-03-08 16:43:47,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 106 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-08 16:43:47,553 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 343 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-08 16:43:47,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 343 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:43:47,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2025-03-08 16:43:47,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 742. [2025-03-08 16:43:47,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 696 states have (on average 1.3103448275862069) internal successors, (912), 698 states have internal predecessors, (912), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 16:43:47,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 980 transitions. [2025-03-08 16:43:47,576 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 980 transitions. Word has length 109 [2025-03-08 16:43:47,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:43:47,576 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 980 transitions. [2025-03-08 16:43:47,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 16:43:47,576 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 980 transitions. [2025-03-08 16:43:47,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 16:43:47,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:43:47,577 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:43:47,588 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-08 16:43:47,778 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-08 16:43:47,778 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:43:47,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:43:47,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1424344891, now seen corresponding path program 1 times [2025-03-08 16:43:47,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:43:47,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1935859186] [2025-03-08 16:43:47,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:43:47,779 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-08 16:43:47,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:43:47,781 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-08 16:43:47,782 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-08 16:43:47,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 16:43:48,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 16:43:48,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:43:48,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:43:48,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 16:43:48,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:43:48,369 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-08 16:43:48,402 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-08 16:43:50,091 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 22 [2025-03-08 16:43:50,094 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 25 treesize of output 17 [2025-03-08 16:43:50,098 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 31 treesize of output 19 [2025-03-08 16:43:50,884 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 158 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-08 16:43:50,884 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:43:57,441 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:43:57,442 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:43:57,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1935859186] [2025-03-08 16:43:57,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1935859186] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:43:57,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:43:57,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2025-03-08 16:43:57,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302182681] [2025-03-08 16:43:57,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:43:57,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:43:57,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:43:57,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:43:57,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=200, Unknown=1, NotChecked=0, Total=240 [2025-03-08 16:43:57,443 INFO L87 Difference]: Start difference. First operand 742 states and 980 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:44:01,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:01,034 INFO L93 Difference]: Finished difference Result 1334 states and 1763 transitions. [2025-03-08 16:44:01,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:44:01,042 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2025-03-08 16:44:01,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:01,044 INFO L225 Difference]: With dead ends: 1334 [2025-03-08 16:44:01,044 INFO L226 Difference]: Without dead ends: 744 [2025-03-08 16:44:01,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=53, Invalid=252, Unknown=1, NotChecked=0, Total=306 [2025-03-08 16:44:01,046 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 122 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:01,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 463 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 16:44:01,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2025-03-08 16:44:01,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 742. [2025-03-08 16:44:01,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 696 states have (on average 1.3074712643678161) internal successors, (910), 698 states have internal predecessors, (910), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 16:44:01,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 978 transitions. [2025-03-08 16:44:01,071 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 978 transitions. Word has length 110 [2025-03-08 16:44:01,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:01,072 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 978 transitions. [2025-03-08 16:44:01,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:44:01,072 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 978 transitions. [2025-03-08 16:44:01,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 16:44:01,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:01,073 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:01,086 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-08 16:44:01,275 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-08 16:44:01,275 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:01,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:01,276 INFO L85 PathProgramCache]: Analyzing trace with hash 30023219, now seen corresponding path program 1 times [2025-03-08 16:44:01,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:44:01,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [678802076] [2025-03-08 16:44:01,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:01,276 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-08 16:44:01,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:44:01,280 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-08 16:44:01,281 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-08 16:44:01,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 16:44:01,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 16:44:01,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:01,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:01,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 16:44:01,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:44:02,156 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-08 16:44:02,196 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 4 proven. 152 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-08 16:44:02,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:44:02,376 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:44:02,376 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:44:02,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [678802076] [2025-03-08 16:44:02,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [678802076] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:44:02,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:44:02,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2025-03-08 16:44:02,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387905582] [2025-03-08 16:44:02,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:02,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:44:02,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:44:02,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:44:02,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:44:02,377 INFO L87 Difference]: Start difference. First operand 742 states and 978 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:44:02,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:02,626 INFO L93 Difference]: Finished difference Result 1327 states and 1745 transitions. [2025-03-08 16:44:02,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:44:02,627 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2025-03-08 16:44:02,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:02,629 INFO L225 Difference]: With dead ends: 1327 [2025-03-08 16:44:02,629 INFO L226 Difference]: Without dead ends: 737 [2025-03-08 16:44:02,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:44:02,631 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 51 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:02,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 526 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:44:02,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2025-03-08 16:44:02,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 686. [2025-03-08 16:44:02,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 647 states have (on average 1.312210200927357) internal successors, (849), 648 states have internal predecessors, (849), 28 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 16:44:02,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 905 transitions. [2025-03-08 16:44:02,653 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 905 transitions. Word has length 110 [2025-03-08 16:44:02,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:02,653 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 905 transitions. [2025-03-08 16:44:02,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:44:02,653 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 905 transitions. [2025-03-08 16:44:02,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 16:44:02,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:02,654 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:02,667 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-08 16:44:02,855 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-08 16:44:02,855 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:02,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:02,856 INFO L85 PathProgramCache]: Analyzing trace with hash -793222922, now seen corresponding path program 1 times [2025-03-08 16:44:02,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:44:02,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [783027166] [2025-03-08 16:44:02,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:02,856 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-08 16:44:02,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:44:02,858 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-08 16:44:02,859 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-08 16:44:02,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 16:44:03,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 16:44:03,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:03,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:03,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 16:44:03,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:44:03,182 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-08 16:44:03,229 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-08 16:44:03,243 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 19 treesize of output 11 [2025-03-08 16:44:03,302 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:44:03,302 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:44:03,302 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:44:03,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [783027166] [2025-03-08 16:44:03,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [783027166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:03,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:44:03,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:44:03,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747277288] [2025-03-08 16:44:03,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:03,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:44:03,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:44:03,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:44:03,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:44:03,303 INFO L87 Difference]: Start difference. First operand 686 states and 905 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:44:04,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:04,061 INFO L93 Difference]: Finished difference Result 1456 states and 1900 transitions. [2025-03-08 16:44:04,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:44:04,064 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2025-03-08 16:44:04,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:04,067 INFO L225 Difference]: With dead ends: 1456 [2025-03-08 16:44:04,067 INFO L226 Difference]: Without dead ends: 922 [2025-03-08 16:44:04,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:44:04,069 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 89 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:04,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 1314 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 16:44:04,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2025-03-08 16:44:04,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 812. [2025-03-08 16:44:04,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 773 states have (on average 1.2949547218628719) internal successors, (1001), 774 states have internal predecessors, (1001), 28 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 16:44:04,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1057 transitions. [2025-03-08 16:44:04,096 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1057 transitions. Word has length 110 [2025-03-08 16:44:04,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:04,096 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1057 transitions. [2025-03-08 16:44:04,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:44:04,096 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1057 transitions. [2025-03-08 16:44:04,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 16:44:04,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:04,097 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:04,107 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-08 16:44:04,297 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-08 16:44:04,298 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:04,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:04,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1086625929, now seen corresponding path program 1 times [2025-03-08 16:44:04,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:44:04,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1463387332] [2025-03-08 16:44:04,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:04,299 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-08 16:44:04,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:44:04,301 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-08 16:44:04,302 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-08 16:44:04,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 16:44:04,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 16:44:04,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:04,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:04,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 16:44:04,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:44:05,285 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-08 16:44:05,288 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-08 16:44:05,548 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-08 16:44:05,605 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 158 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-08 16:44:05,605 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:44:05,776 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:44:05,777 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:44:05,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1463387332] [2025-03-08 16:44:05,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1463387332] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:44:05,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:44:05,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2025-03-08 16:44:05,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209523770] [2025-03-08 16:44:05,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:05,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:44:05,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:44:05,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:44:05,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:44:05,778 INFO L87 Difference]: Start difference. First operand 812 states and 1057 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:44:05,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:05,976 INFO L93 Difference]: Finished difference Result 1478 states and 1923 transitions. [2025-03-08 16:44:05,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:44:05,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2025-03-08 16:44:05,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:05,979 INFO L225 Difference]: With dead ends: 1478 [2025-03-08 16:44:05,979 INFO L226 Difference]: Without dead ends: 836 [2025-03-08 16:44:05,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:44:05,981 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 52 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:05,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 375 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:44:05,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2025-03-08 16:44:05,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 812. [2025-03-08 16:44:06,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 773 states have (on average 1.2923673997412677) internal successors, (999), 774 states have internal predecessors, (999), 28 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 16:44:06,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1055 transitions. [2025-03-08 16:44:06,002 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1055 transitions. Word has length 110 [2025-03-08 16:44:06,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:06,002 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1055 transitions. [2025-03-08 16:44:06,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:44:06,002 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1055 transitions. [2025-03-08 16:44:06,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 16:44:06,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:06,003 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:06,013 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-08 16:44:06,203 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-08 16:44:06,204 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:06,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:06,204 INFO L85 PathProgramCache]: Analyzing trace with hash -860229675, now seen corresponding path program 1 times [2025-03-08 16:44:06,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:44:06,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [933603047] [2025-03-08 16:44:06,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:06,205 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-08 16:44:06,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:44:06,207 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-08 16:44:06,208 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-08 16:44:06,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 16:44:06,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 16:44:06,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:06,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:06,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 16:44:06,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:44:07,113 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-08 16:44:07,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 13 treesize of output 9 [2025-03-08 16:44:07,387 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 28 treesize of output 16 [2025-03-08 16:44:07,429 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 158 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-08 16:44:07,429 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:44:07,587 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:44:07,587 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:44:07,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [933603047] [2025-03-08 16:44:07,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [933603047] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:44:07,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:44:07,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2025-03-08 16:44:07,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139487296] [2025-03-08 16:44:07,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:07,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:44:07,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:44:07,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:44:07,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:44:07,588 INFO L87 Difference]: Start difference. First operand 812 states and 1055 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:44:07,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:07,733 INFO L93 Difference]: Finished difference Result 1484 states and 1927 transitions. [2025-03-08 16:44:07,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:44:07,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2025-03-08 16:44:07,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:07,736 INFO L225 Difference]: With dead ends: 1484 [2025-03-08 16:44:07,736 INFO L226 Difference]: Without dead ends: 842 [2025-03-08 16:44:07,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:44:07,738 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 28 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:07,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 466 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:44:07,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2025-03-08 16:44:07,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 812. [2025-03-08 16:44:07,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 773 states have (on average 1.2897800776196637) internal successors, (997), 774 states have internal predecessors, (997), 28 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 16:44:07,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1053 transitions. [2025-03-08 16:44:07,759 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1053 transitions. Word has length 110 [2025-03-08 16:44:07,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:07,759 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1053 transitions. [2025-03-08 16:44:07,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:44:07,759 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1053 transitions. [2025-03-08 16:44:07,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 16:44:07,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:07,760 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:07,770 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-08 16:44:07,961 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-08 16:44:07,962 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:07,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:07,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1153632682, now seen corresponding path program 1 times [2025-03-08 16:44:07,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:44:07,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1825321737] [2025-03-08 16:44:07,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:07,962 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-08 16:44:07,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:44:07,964 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-08 16:44:07,966 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-08 16:44:08,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 16:44:08,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 16:44:08,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:08,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:08,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 16:44:08,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:44:08,794 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-03-08 16:44:08,794 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 1 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 16:44:09,008 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 16:44:09,008 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:44:09,008 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:44:09,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1825321737] [2025-03-08 16:44:09,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1825321737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:44:09,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:44:09,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:44:09,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760862536] [2025-03-08 16:44:09,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:44:09,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 16:44:09,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:44:09,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 16:44:09,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:44:09,009 INFO L87 Difference]: Start difference. First operand 812 states and 1053 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:44:09,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:44:09,879 INFO L93 Difference]: Finished difference Result 1760 states and 2304 transitions. [2025-03-08 16:44:09,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:44:09,879 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2025-03-08 16:44:09,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:44:09,883 INFO L225 Difference]: With dead ends: 1760 [2025-03-08 16:44:09,883 INFO L226 Difference]: Without dead ends: 1118 [2025-03-08 16:44:09,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2025-03-08 16:44:09,884 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 150 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:44:09,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 1181 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 16:44:09,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2025-03-08 16:44:09,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1056. [2025-03-08 16:44:09,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 999 states have (on average 1.2872872872872874) internal successors, (1286), 1000 states have internal predecessors, (1286), 41 states have call successors, (41), 15 states have call predecessors, (41), 15 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-08 16:44:09,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1368 transitions. [2025-03-08 16:44:09,920 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1368 transitions. Word has length 110 [2025-03-08 16:44:09,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:44:09,920 INFO L471 AbstractCegarLoop]: Abstraction has 1056 states and 1368 transitions. [2025-03-08 16:44:09,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 16:44:09,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1368 transitions. [2025-03-08 16:44:09,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 16:44:09,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:44:09,921 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:44:09,933 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 (27)] Forceful destruction successful, exit code 0 [2025-03-08 16:44:10,124 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 [2025-03-08 16:44:10,124 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:44:10,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:44:10,124 INFO L85 PathProgramCache]: Analyzing trace with hash -867267689, now seen corresponding path program 1 times [2025-03-08 16:44:10,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:44:10,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [665443892] [2025-03-08 16:44:10,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:44:10,125 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-08 16:44:10,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:44:10,128 INFO L229 MonitoredProcess]: Starting monitored process 28 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-08 16:44:10,129 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 (28)] Waiting until timeout for monitored process [2025-03-08 16:44:10,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 16:44:10,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 16:44:10,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:44:10,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:44:10,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 16:44:10,494 INFO L279 TraceCheckSpWp]: Computing forward predicates...