./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/fold-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/fold-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5e803a3547be3620dc8dbbd84c6dab2896bff52984e7e41a97c3a64196bed15a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 14:39:41,165 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 14:39:41,218 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 14:39:41,223 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 14:39:41,224 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 14:39:41,237 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 14:39:41,238 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 14:39:41,238 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 14:39:41,238 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 14:39:41,238 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 14:39:41,238 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 14:39:41,238 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 14:39:41,238 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 14:39:41,238 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 14:39:41,238 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 14:39:41,238 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 14:39:41,238 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 14:39:41,238 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 14:39:41,238 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 14:39:41,239 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 14:39:41,239 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 14:39:41,239 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 14:39:41,239 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 14:39:41,239 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 14:39:41,239 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 14:39:41,239 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 14:39:41,239 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 14:39:41,240 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 14:39:41,240 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 14:39:41,240 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 14:39:41,240 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 14:39:41,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:39:41,240 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 14:39:41,240 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 14:39:41,240 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 14:39:41,240 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 14:39:41,240 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 14:39:41,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 14:39:41,241 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 14:39:41,241 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 14:39:41,241 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 14:39:41,241 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 14:39:41,241 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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5e803a3547be3620dc8dbbd84c6dab2896bff52984e7e41a97c3a64196bed15a [2025-03-04 14:39:41,467 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 14:39:41,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 14:39:41,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 14:39:41,478 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 14:39:41,478 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 14:39:41,478 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/fold-1.i [2025-03-04 14:39:42,600 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b90083f25/90d8ce3c8f1c4e3f9c2b3db9eb6bf2cb/FLAG97929d4dc [2025-03-04 14:39:42,977 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 14:39:42,977 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/fold-1.i [2025-03-04 14:39:43,001 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b90083f25/90d8ce3c8f1c4e3f9c2b3db9eb6bf2cb/FLAG97929d4dc [2025-03-04 14:39:43,011 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b90083f25/90d8ce3c8f1c4e3f9c2b3db9eb6bf2cb [2025-03-04 14:39:43,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 14:39:43,014 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 14:39:43,015 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 14:39:43,015 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 14:39:43,018 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 14:39:43,018 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:39:43" (1/1) ... [2025-03-04 14:39:43,019 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76f0d4dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:43, skipping insertion in model container [2025-03-04 14:39:43,019 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:39:43" (1/1) ... [2025-03-04 14:39:43,059 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 14:39:43,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:39:43,888 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 14:39:44,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:39:44,128 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-04 14:39:44,133 INFO L204 MainTranslator]: Completed translation [2025-03-04 14:39:44,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:44 WrapperNode [2025-03-04 14:39:44,133 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 14:39:44,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 14:39:44,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 14:39:44,134 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 14:39:44,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:44" (1/1) ... [2025-03-04 14:39:44,180 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:44" (1/1) ... [2025-03-04 14:39:44,240 INFO L138 Inliner]: procedures = 581, calls = 798, calls flagged for inlining = 28, calls inlined = 26, statements flattened = 2129 [2025-03-04 14:39:44,240 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 14:39:44,241 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 14:39:44,241 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 14:39:44,241 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 14:39:44,247 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:44" (1/1) ... [2025-03-04 14:39:44,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:44" (1/1) ... [2025-03-04 14:39:44,261 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:44" (1/1) ... [2025-03-04 14:39:44,373 INFO L175 MemorySlicer]: Split 645 memory accesses to 23 slices as follows [2, 2, 25, 22, 6, 3, 7, 3, 44, 4, 34, 2, 3, 1, 10, 1, 17, 3, 17, 355, 65, 16, 3]. 55 percent of accesses are in the largest equivalence class. The 389 initializations are split as follows [2, 0, 9, 0, 0, 3, 0, 0, 0, 0, 5, 2, 0, 0, 1, 0, 0, 0, 4, 355, 8, 0, 0]. The 116 writes are split as follows [0, 1, 15, 5, 4, 0, 7, 3, 12, 1, 0, 0, 0, 1, 5, 1, 17, 0, 4, 0, 39, 1, 0]. [2025-03-04 14:39:44,374 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:44" (1/1) ... [2025-03-04 14:39:44,374 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:44" (1/1) ... [2025-03-04 14:39:44,429 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:44" (1/1) ... [2025-03-04 14:39:44,438 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:44" (1/1) ... [2025-03-04 14:39:44,464 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:44" (1/1) ... [2025-03-04 14:39:44,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:44" (1/1) ... [2025-03-04 14:39:44,504 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 14:39:44,505 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 14:39:44,505 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 14:39:44,505 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 14:39:44,506 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:44" (1/1) ... [2025-03-04 14:39:44,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:39:44,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:39:44,536 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 14:39:44,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 14:39:44,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#0 [2025-03-04 14:39:44,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#1 [2025-03-04 14:39:44,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#2 [2025-03-04 14:39:44,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#3 [2025-03-04 14:39:44,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#4 [2025-03-04 14:39:44,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#5 [2025-03-04 14:39:44,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#6 [2025-03-04 14:39:44,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#7 [2025-03-04 14:39:44,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#8 [2025-03-04 14:39:44,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#9 [2025-03-04 14:39:44,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#10 [2025-03-04 14:39:44,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#11 [2025-03-04 14:39:44,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#12 [2025-03-04 14:39:44,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#13 [2025-03-04 14:39:44,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#14 [2025-03-04 14:39:44,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#15 [2025-03-04 14:39:44,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#16 [2025-03-04 14:39:44,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#17 [2025-03-04 14:39:44,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#18 [2025-03-04 14:39:44,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#19 [2025-03-04 14:39:44,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#20 [2025-03-04 14:39:44,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#21 [2025-03-04 14:39:44,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#22 [2025-03-04 14:39:44,559 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#0 [2025-03-04 14:39:44,559 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#1 [2025-03-04 14:39:44,559 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#2 [2025-03-04 14:39:44,559 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#3 [2025-03-04 14:39:44,559 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#4 [2025-03-04 14:39:44,559 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#5 [2025-03-04 14:39:44,560 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#6 [2025-03-04 14:39:44,560 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#7 [2025-03-04 14:39:44,560 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#8 [2025-03-04 14:39:44,560 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#9 [2025-03-04 14:39:44,560 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#10 [2025-03-04 14:39:44,560 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#11 [2025-03-04 14:39:44,560 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#12 [2025-03-04 14:39:44,560 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#13 [2025-03-04 14:39:44,560 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#14 [2025-03-04 14:39:44,560 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#15 [2025-03-04 14:39:44,560 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#16 [2025-03-04 14:39:44,560 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#17 [2025-03-04 14:39:44,560 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#18 [2025-03-04 14:39:44,560 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#19 [2025-03-04 14:39:44,560 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#20 [2025-03-04 14:39:44,560 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#21 [2025-03-04 14:39:44,560 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#22 [2025-03-04 14:39:44,560 INFO L130 BoogieDeclarations]: Found specification of procedure vasprintf [2025-03-04 14:39:44,560 INFO L138 BoogieDeclarations]: Found implementation of procedure vasprintf [2025-03-04 14:39:44,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 14:39:44,560 INFO L130 BoogieDeclarations]: Found specification of procedure adjust_column [2025-03-04 14:39:44,560 INFO L138 BoogieDeclarations]: Found implementation of procedure adjust_column [2025-03-04 14:39:44,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-04 14:39:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-04 14:39:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-04 14:39:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-04 14:39:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-04 14:39:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-04 14:39:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-04 14:39:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-04 14:39:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-04 14:39:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-03-04 14:39:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-03-04 14:39:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-03-04 14:39:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-03-04 14:39:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-03-04 14:39:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-03-04 14:39:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-03-04 14:39:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-03-04 14:39:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-03-04 14:39:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#18 [2025-03-04 14:39:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#19 [2025-03-04 14:39:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#20 [2025-03-04 14:39:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#21 [2025-03-04 14:39:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#22 [2025-03-04 14:39:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-03-04 14:39:44,561 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-03-04 14:39:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 14:39:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 14:39:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 14:39:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 14:39:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 14:39:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 14:39:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 14:39:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 14:39:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 14:39:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 14:39:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 14:39:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-04 14:39:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-04 14:39:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-04 14:39:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-04 14:39:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-04 14:39:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-04 14:39:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-04 14:39:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-04 14:39:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-03-04 14:39:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-03-04 14:39:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-03-04 14:39:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-03-04 14:39:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 14:39:44,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 14:39:44,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 14:39:44,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 14:39:44,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 14:39:44,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 14:39:44,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 14:39:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 14:39:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 14:39:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 14:39:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 14:39:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 14:39:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 14:39:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 14:39:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 14:39:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-04 14:39:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-04 14:39:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-04 14:39:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-04 14:39:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-04 14:39:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-03-04 14:39:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-03-04 14:39:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-03-04 14:39:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 14:39:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 14:39:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 14:39:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 14:39:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 14:39:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 14:39:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 14:39:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 14:39:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 14:39:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 14:39:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 14:39:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 14:39:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 14:39:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 14:39:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 14:39:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 14:39:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-04 14:39:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-04 14:39:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-04 14:39:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-04 14:39:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-04 14:39:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-04 14:39:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-03-04 14:39:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-03-04 14:39:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2025-03-04 14:39:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 14:39:44,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 14:39:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#0 [2025-03-04 14:39:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#1 [2025-03-04 14:39:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#2 [2025-03-04 14:39:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#3 [2025-03-04 14:39:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#4 [2025-03-04 14:39:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#5 [2025-03-04 14:39:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#6 [2025-03-04 14:39:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#7 [2025-03-04 14:39:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#8 [2025-03-04 14:39:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#9 [2025-03-04 14:39:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#10 [2025-03-04 14:39:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#11 [2025-03-04 14:39:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#12 [2025-03-04 14:39:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#13 [2025-03-04 14:39:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#14 [2025-03-04 14:39:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#15 [2025-03-04 14:39:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#16 [2025-03-04 14:39:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#17 [2025-03-04 14:39:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#18 [2025-03-04 14:39:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#19 [2025-03-04 14:39:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#20 [2025-03-04 14:39:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#21 [2025-03-04 14:39:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#22 [2025-03-04 14:39:44,567 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#0 [2025-03-04 14:39:44,567 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#1 [2025-03-04 14:39:44,567 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#2 [2025-03-04 14:39:44,567 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#3 [2025-03-04 14:39:44,567 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#4 [2025-03-04 14:39:44,567 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#5 [2025-03-04 14:39:44,567 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#6 [2025-03-04 14:39:44,567 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#7 [2025-03-04 14:39:44,567 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#8 [2025-03-04 14:39:44,567 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#9 [2025-03-04 14:39:44,567 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#10 [2025-03-04 14:39:44,567 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#11 [2025-03-04 14:39:44,567 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#12 [2025-03-04 14:39:44,567 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#13 [2025-03-04 14:39:44,567 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#14 [2025-03-04 14:39:44,567 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#15 [2025-03-04 14:39:44,567 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#16 [2025-03-04 14:39:44,568 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#17 [2025-03-04 14:39:44,568 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#18 [2025-03-04 14:39:44,570 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#19 [2025-03-04 14:39:44,570 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#20 [2025-03-04 14:39:44,571 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#21 [2025-03-04 14:39:44,571 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#22 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure write2stdout [2025-03-04 14:39:44,571 INFO L138 BoogieDeclarations]: Found implementation of procedure write2stdout [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-03-04 14:39:44,571 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#18 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#19 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#20 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#21 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#22 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-03-04 14:39:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#22 [2025-03-04 14:39:44,572 INFO L130 BoogieDeclarations]: Found specification of procedure bb_simple_perror_msg [2025-03-04 14:39:44,572 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_simple_perror_msg [2025-03-04 14:39:44,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 14:39:44,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 14:39:44,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 14:39:44,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-03-04 14:39:44,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-03-04 14:39:44,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-03-04 14:39:44,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-03-04 14:39:44,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-03-04 14:39:44,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-03-04 14:39:44,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-03-04 14:39:44,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-03-04 14:39:44,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-03-04 14:39:44,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-03-04 14:39:44,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-03-04 14:39:44,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-03-04 14:39:44,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2025-03-04 14:39:44,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#16 [2025-03-04 14:39:44,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#17 [2025-03-04 14:39:44,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#18 [2025-03-04 14:39:44,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#19 [2025-03-04 14:39:44,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#20 [2025-03-04 14:39:44,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#21 [2025-03-04 14:39:44,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#22 [2025-03-04 14:39:44,574 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 14:39:44,574 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 14:39:44,574 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 14:39:44,574 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-03-04 14:39:44,574 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-03-04 14:39:44,574 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-03-04 14:39:44,574 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-03-04 14:39:44,574 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-03-04 14:39:44,574 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-03-04 14:39:44,574 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-03-04 14:39:44,574 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-03-04 14:39:44,574 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-03-04 14:39:44,574 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-03-04 14:39:44,574 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-03-04 14:39:44,574 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-03-04 14:39:44,574 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2025-03-04 14:39:44,574 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#16 [2025-03-04 14:39:44,574 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#17 [2025-03-04 14:39:44,574 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#18 [2025-03-04 14:39:44,574 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#19 [2025-03-04 14:39:44,574 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#20 [2025-03-04 14:39:44,574 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#21 [2025-03-04 14:39:44,575 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#22 [2025-03-04 14:39:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 14:39:44,575 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 14:39:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 14:39:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 14:39:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 14:39:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 14:39:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 14:39:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 14:39:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 14:39:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 14:39:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 14:39:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 14:39:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 14:39:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 14:39:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 14:39:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 14:39:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 14:39:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-04 14:39:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-04 14:39:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-04 14:39:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-04 14:39:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-04 14:39:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-04 14:39:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-03-04 14:39:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-03-04 14:39:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2025-03-04 14:39:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 14:39:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 14:39:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 14:39:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 14:39:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 14:39:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 14:39:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 14:39:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 14:39:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 14:39:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-04 14:39:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-04 14:39:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-04 14:39:44,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-04 14:39:44,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-04 14:39:44,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-04 14:39:44,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-04 14:39:44,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-04 14:39:44,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-04 14:39:44,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-04 14:39:44,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-03-04 14:39:44,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-03-04 14:39:44,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-03-04 14:39:44,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2025-03-04 14:39:44,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#0 [2025-03-04 14:39:44,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#1 [2025-03-04 14:39:44,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#2 [2025-03-04 14:39:44,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#3 [2025-03-04 14:39:44,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#4 [2025-03-04 14:39:44,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#5 [2025-03-04 14:39:44,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#6 [2025-03-04 14:39:44,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#7 [2025-03-04 14:39:44,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#8 [2025-03-04 14:39:44,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#9 [2025-03-04 14:39:44,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#10 [2025-03-04 14:39:44,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#11 [2025-03-04 14:39:44,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#12 [2025-03-04 14:39:44,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#13 [2025-03-04 14:39:44,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#14 [2025-03-04 14:39:44,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#15 [2025-03-04 14:39:44,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#16 [2025-03-04 14:39:44,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#17 [2025-03-04 14:39:44,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#18 [2025-03-04 14:39:44,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#19 [2025-03-04 14:39:44,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#20 [2025-03-04 14:39:44,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#21 [2025-03-04 14:39:44,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove#22 [2025-03-04 14:39:44,579 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#0 [2025-03-04 14:39:44,579 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#1 [2025-03-04 14:39:44,579 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#2 [2025-03-04 14:39:44,579 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#3 [2025-03-04 14:39:44,579 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#4 [2025-03-04 14:39:44,579 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#5 [2025-03-04 14:39:44,579 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#6 [2025-03-04 14:39:44,579 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#7 [2025-03-04 14:39:44,579 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#8 [2025-03-04 14:39:44,579 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#9 [2025-03-04 14:39:44,579 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#10 [2025-03-04 14:39:44,579 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#11 [2025-03-04 14:39:44,579 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#12 [2025-03-04 14:39:44,579 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#13 [2025-03-04 14:39:44,579 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#14 [2025-03-04 14:39:44,579 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#15 [2025-03-04 14:39:44,579 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#16 [2025-03-04 14:39:44,579 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#17 [2025-03-04 14:39:44,579 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#18 [2025-03-04 14:39:44,579 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#19 [2025-03-04 14:39:44,579 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#20 [2025-03-04 14:39:44,579 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#21 [2025-03-04 14:39:44,579 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove#22 [2025-03-04 14:39:44,579 INFO L130 BoogieDeclarations]: Found specification of procedure xatou_range [2025-03-04 14:39:44,579 INFO L138 BoogieDeclarations]: Found implementation of procedure xatou_range [2025-03-04 14:39:44,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 14:39:44,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 14:39:44,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 14:39:44,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 14:39:44,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 14:39:44,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 14:39:44,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 14:39:44,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 14:39:44,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 14:39:44,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 14:39:44,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 14:39:44,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 14:39:44,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 14:39:44,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 14:39:44,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 14:39:44,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-04 14:39:44,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-04 14:39:44,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-04 14:39:44,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-04 14:39:44,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-04 14:39:44,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-03-04 14:39:44,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-03-04 14:39:44,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-03-04 14:39:44,581 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-03-04 14:39:44,581 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-03-04 14:39:44,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 14:39:44,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 14:39:44,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 14:39:44,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 14:39:44,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 14:39:44,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 14:39:44,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 14:39:44,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 14:39:44,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 14:39:44,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 14:39:44,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 14:39:44,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 14:39:44,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 14:39:44,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 14:39:44,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 14:39:44,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-04 14:39:44,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-04 14:39:44,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-04 14:39:44,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-04 14:39:44,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-04 14:39:44,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-03-04 14:39:44,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-03-04 14:39:44,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-03-04 14:39:45,166 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 14:39:45,168 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 14:39:51,430 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3217: havoc _IO_getc_#t~nondet266#1; [2025-03-04 14:39:51,431 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2625: call ULTIMATE.dealloc(getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset);havoc getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset; [2025-03-04 14:39:51,431 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3097: havoc xasprintf_#t~mem240#1.base, xasprintf_#t~mem240#1.offset;call ULTIMATE.dealloc(xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset);havoc xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset; [2025-03-04 14:39:51,431 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2440: call ULTIMATE.dealloc(__main_~#w_opt~0#1.base, __main_~#w_opt~0#1.offset);havoc __main_~#w_opt~0#1.base, __main_~#w_opt~0#1.offset; [2025-03-04 14:39:51,431 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3268: havoc getopt_long_#t~ret295#1; [2025-03-04 14:39:51,431 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2411: havoc fclose_if_not_stdin_#t~bitwise75#1; [2025-03-04 14:39:51,744 INFO L? ?]: Removed 1162 outVars from TransFormulas that were not future-live. [2025-03-04 14:39:51,744 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 14:39:51,821 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 14:39:51,823 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 14:39:51,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:39:51 BoogieIcfgContainer [2025-03-04 14:39:51,823 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 14:39:51,825 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 14:39:51,825 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 14:39:51,828 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 14:39:51,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:39:43" (1/3) ... [2025-03-04 14:39:51,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a5ff07b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:39:51, skipping insertion in model container [2025-03-04 14:39:51,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:39:44" (2/3) ... [2025-03-04 14:39:51,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a5ff07b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:39:51, skipping insertion in model container [2025-03-04 14:39:51,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:39:51" (3/3) ... [2025-03-04 14:39:51,831 INFO L128 eAbstractionObserver]: Analyzing ICFG fold-1.i [2025-03-04 14:39:51,843 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 14:39:51,848 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fold-1.i that has 102 procedures, 988 locations, 1 initial locations, 126 loop locations, and 66 error locations. [2025-03-04 14:39:51,906 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 14:39:51,917 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;@2fe4da08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 14:39:51,917 INFO L334 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2025-03-04 14:39:51,924 INFO L276 IsEmpty]: Start isEmpty. Operand has 630 states, 510 states have (on average 1.6333333333333333) internal successors, (833), 582 states have internal predecessors, (833), 36 states have call successors, (36), 17 states have call predecessors, (36), 17 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 14:39:51,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 14:39:51,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:51,929 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 14:39:51,929 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 63 more)] === [2025-03-04 14:39:51,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:51,933 INFO L85 PathProgramCache]: Analyzing trace with hash 47006143, now seen corresponding path program 1 times [2025-03-04 14:39:51,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:51,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022134000] [2025-03-04 14:39:51,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:51,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:52,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 14:39:52,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 14:39:52,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:52,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:52,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:39:52,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:52,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022134000] [2025-03-04 14:39:52,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022134000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:39:52,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:39:52,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:39:52,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248609832] [2025-03-04 14:39:52,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:39:52,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:39:52,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:52,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:39:52,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:39:52,947 INFO L87 Difference]: Start difference. First operand has 630 states, 510 states have (on average 1.6333333333333333) internal successors, (833), 582 states have internal predecessors, (833), 36 states have call successors, (36), 17 states have call predecessors, (36), 17 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:39:53,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:53,215 INFO L93 Difference]: Finished difference Result 1132 states and 1667 transitions. [2025-03-04 14:39:53,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:39:53,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 14:39:53,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:53,226 INFO L225 Difference]: With dead ends: 1132 [2025-03-04 14:39:53,226 INFO L226 Difference]: Without dead ends: 506 [2025-03-04 14:39:53,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-04 14:39:53,238 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 1 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:53,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1348 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:39:53,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-03-04 14:39:53,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2025-03-04 14:39:53,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 426 states have (on average 1.556338028169014) internal successors, (663), 477 states have internal predecessors, (663), 26 states have call successors, (26), 14 states have call predecessors, (26), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 14:39:53,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 704 transitions. [2025-03-04 14:39:53,294 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 704 transitions. Word has length 4 [2025-03-04 14:39:53,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:53,295 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 704 transitions. [2025-03-04 14:39:53,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:39:53,295 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 704 transitions. [2025-03-04 14:39:53,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 14:39:53,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:53,296 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-04 14:39:53,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 14:39:53,297 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 63 more)] === [2025-03-04 14:39:53,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:53,297 INFO L85 PathProgramCache]: Analyzing trace with hash 202118516, now seen corresponding path program 1 times [2025-03-04 14:39:53,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:53,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756672400] [2025-03-04 14:39:53,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:53,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:53,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:39:53,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:39:53,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:53,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:54,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:39:54,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:54,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756672400] [2025-03-04 14:39:54,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756672400] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:39:54,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230377007] [2025-03-04 14:39:54,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:54,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:54,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:39:54,022 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:39:54,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 14:39:54,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:39:54,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:39:54,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:54,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:54,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 1491 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:39:54,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:39:54,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:39:54,823 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:39:54,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230377007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:39:54,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:39:54,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 14:39:54,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795746133] [2025-03-04 14:39:54,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:39:54,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:39:54,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:54,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:39:54,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:39:54,825 INFO L87 Difference]: Start difference. First operand 506 states and 704 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:39:54,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:54,986 INFO L93 Difference]: Finished difference Result 506 states and 704 transitions. [2025-03-04 14:39:54,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:39:54,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 14:39:54,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:54,989 INFO L225 Difference]: With dead ends: 506 [2025-03-04 14:39:54,989 INFO L226 Difference]: Without dead ends: 505 [2025-03-04 14:39:54,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-04 14:39:54,990 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 1 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2014 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:54,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2014 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:39:54,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-03-04 14:39:55,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2025-03-04 14:39:55,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 426 states have (on average 1.5539906103286385) internal successors, (662), 476 states have internal predecessors, (662), 26 states have call successors, (26), 14 states have call predecessors, (26), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 14:39:55,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 703 transitions. [2025-03-04 14:39:55,010 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 703 transitions. Word has length 7 [2025-03-04 14:39:55,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:55,010 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 703 transitions. [2025-03-04 14:39:55,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:39:55,011 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 703 transitions. [2025-03-04 14:39:55,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 14:39:55,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:55,011 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-04 14:39:55,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 14:39:55,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:55,216 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 63 more)] === [2025-03-04 14:39:55,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:55,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1970708161, now seen corresponding path program 1 times [2025-03-04 14:39:55,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:55,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803267455] [2025-03-04 14:39:55,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:55,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:55,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 14:39:55,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 14:39:55,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:55,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:55,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 14:39:55,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:55,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803267455] [2025-03-04 14:39:55,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803267455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:39:55,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:39:55,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:39:55,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878373862] [2025-03-04 14:39:55,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:39:55,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:39:55,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:55,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:39:55,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:39:55,735 INFO L87 Difference]: Start difference. First operand 505 states and 703 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:39:55,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:55,852 INFO L93 Difference]: Finished difference Result 505 states and 703 transitions. [2025-03-04 14:39:55,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:39:55,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 14:39:55,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:55,855 INFO L225 Difference]: With dead ends: 505 [2025-03-04 14:39:55,855 INFO L226 Difference]: Without dead ends: 504 [2025-03-04 14:39:55,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-04 14:39:55,856 INFO L435 NwaCegarLoop]: 673 mSDtfsCounter, 0 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:55,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1344 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:39:55,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-03-04 14:39:55,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 502. [2025-03-04 14:39:55,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 424 states have (on average 1.554245283018868) internal successors, (659), 473 states have internal predecessors, (659), 26 states have call successors, (26), 14 states have call predecessors, (26), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 14:39:55,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 700 transitions. [2025-03-04 14:39:55,869 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 700 transitions. Word has length 8 [2025-03-04 14:39:55,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:55,870 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 700 transitions. [2025-03-04 14:39:55,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:39:55,870 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 700 transitions. [2025-03-04 14:39:55,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 14:39:55,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:55,870 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:39:55,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 14:39:55,871 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 63 more)] === [2025-03-04 14:39:55,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:55,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1262625545, now seen corresponding path program 1 times [2025-03-04 14:39:55,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:55,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749384597] [2025-03-04 14:39:55,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:55,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:56,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 14:39:56,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 14:39:56,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:56,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:56,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:39:56,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:56,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749384597] [2025-03-04 14:39:56,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749384597] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:39:56,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644823015] [2025-03-04 14:39:56,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:56,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:56,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:39:56,412 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-04 14:39:56,414 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-04 14:39:57,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 14:39:57,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 14:39:57,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:57,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:57,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 1508 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:39:57,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:39:57,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 14:39:57,169 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:39:57,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644823015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:39:57,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:39:57,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 14:39:57,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314675759] [2025-03-04 14:39:57,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:39:57,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:39:57,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:57,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:39:57,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:39:57,171 INFO L87 Difference]: Start difference. First operand 502 states and 700 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:39:57,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:57,342 INFO L93 Difference]: Finished difference Result 502 states and 700 transitions. [2025-03-04 14:39:57,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:39:57,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-04 14:39:57,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:57,345 INFO L225 Difference]: With dead ends: 502 [2025-03-04 14:39:57,345 INFO L226 Difference]: Without dead ends: 500 [2025-03-04 14:39:57,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:39:57,346 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 535 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:57,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 809 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:39:57,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-03-04 14:39:57,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2025-03-04 14:39:57,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 424 states have (on average 1.5495283018867925) internal successors, (657), 471 states have internal predecessors, (657), 26 states have call successors, (26), 14 states have call predecessors, (26), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 14:39:57,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 698 transitions. [2025-03-04 14:39:57,361 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 698 transitions. Word has length 12 [2025-03-04 14:39:57,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:57,363 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 698 transitions. [2025-03-04 14:39:57,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:39:57,363 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 698 transitions. [2025-03-04 14:39:57,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 14:39:57,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:57,364 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:39:57,374 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-04 14:39:57,565 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,SelfDestructingSolverStorable3 [2025-03-04 14:39:57,565 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 63 more)] === [2025-03-04 14:39:57,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:57,565 INFO L85 PathProgramCache]: Analyzing trace with hash -486684776, now seen corresponding path program 1 times [2025-03-04 14:39:57,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:57,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066879457] [2025-03-04 14:39:57,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:57,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:57,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 14:39:57,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 14:39:57,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:57,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:57,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:39:57,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:57,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066879457] [2025-03-04 14:39:57,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066879457] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:39:57,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199924114] [2025-03-04 14:39:57,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:57,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:57,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:39:58,000 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:39:58,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 14:39:58,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 14:39:58,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 14:39:58,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:58,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:58,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 1509 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:39:58,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:39:58,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:39:58,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:39:58,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:39:58,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199924114] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:39:58,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:39:58,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 14:39:58,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288810239] [2025-03-04 14:39:58,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:39:58,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:39:58,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:58,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:39:58,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:39:58,871 INFO L87 Difference]: Start difference. First operand 500 states and 698 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:39:59,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:59,049 INFO L93 Difference]: Finished difference Result 1003 states and 1401 transitions. [2025-03-04 14:39:59,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:39:59,050 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2025-03-04 14:39:59,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:59,052 INFO L225 Difference]: With dead ends: 1003 [2025-03-04 14:39:59,052 INFO L226 Difference]: Without dead ends: 509 [2025-03-04 14:39:59,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:39:59,054 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 4 mSDsluCounter, 2007 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2678 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:59,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2678 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:39:59,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-03-04 14:39:59,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2025-03-04 14:39:59,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 433 states have (on average 1.53810623556582) internal successors, (666), 480 states have internal predecessors, (666), 26 states have call successors, (26), 14 states have call predecessors, (26), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 14:39:59,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 707 transitions. [2025-03-04 14:39:59,069 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 707 transitions. Word has length 13 [2025-03-04 14:39:59,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:59,069 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 707 transitions. [2025-03-04 14:39:59,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:39:59,069 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 707 transitions. [2025-03-04 14:39:59,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 14:39:59,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:59,070 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:39:59,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 14:39:59,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:59,271 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 63 more)] === [2025-03-04 14:39:59,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:59,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1511397533, now seen corresponding path program 2 times [2025-03-04 14:39:59,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:59,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748195675] [2025-03-04 14:39:59,271 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:39:59,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:59,496 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 14:39:59,528 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-03-04 14:39:59,528 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 14:39:59,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:59,838 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 14:39:59,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:59,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748195675] [2025-03-04 14:39:59,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748195675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:39:59,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:39:59,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:39:59,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555054704] [2025-03-04 14:39:59,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:39:59,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:39:59,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:59,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:39:59,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:39:59,840 INFO L87 Difference]: Start difference. First operand 509 states and 707 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:00,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:00,034 INFO L93 Difference]: Finished difference Result 509 states and 707 transitions. [2025-03-04 14:40:00,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:40:00,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-03-04 14:40:00,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:00,039 INFO L225 Difference]: With dead ends: 509 [2025-03-04 14:40:00,039 INFO L226 Difference]: Without dead ends: 507 [2025-03-04 14:40:00,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:40:00,041 INFO L435 NwaCegarLoop]: 663 mSDtfsCounter, 534 mSDsluCounter, 1461 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 2124 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:00,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 2124 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:40:00,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-03-04 14:40:00,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2025-03-04 14:40:00,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 433 states have (on average 1.533487297921478) internal successors, (664), 478 states have internal predecessors, (664), 26 states have call successors, (26), 14 states have call predecessors, (26), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 14:40:00,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 705 transitions. [2025-03-04 14:40:00,056 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 705 transitions. Word has length 22 [2025-03-04 14:40:00,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:00,056 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 705 transitions. [2025-03-04 14:40:00,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:00,056 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 705 transitions. [2025-03-04 14:40:00,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 14:40:00,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:00,057 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:00,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 14:40:00,058 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 63 more)] === [2025-03-04 14:40:00,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:00,058 INFO L85 PathProgramCache]: Analyzing trace with hash -826068025, now seen corresponding path program 1 times [2025-03-04 14:40:00,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:00,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185430224] [2025-03-04 14:40:00,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:00,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:00,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 14:40:00,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 14:40:00,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:00,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:00,472 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 14:40:00,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:00,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185430224] [2025-03-04 14:40:00,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185430224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:00,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:00,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:40:00,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479079510] [2025-03-04 14:40:00,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:00,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:40:00,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:00,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:40:00,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:00,473 INFO L87 Difference]: Start difference. First operand 507 states and 705 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:00,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:00,597 INFO L93 Difference]: Finished difference Result 997 states and 1394 transitions. [2025-03-04 14:40:00,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:40:00,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-03-04 14:40:00,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:00,600 INFO L225 Difference]: With dead ends: 997 [2025-03-04 14:40:00,600 INFO L226 Difference]: Without dead ends: 510 [2025-03-04 14:40:00,601 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-04 14:40:00,602 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 2 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:00,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1333 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:00,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-03-04 14:40:00,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2025-03-04 14:40:00,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 436 states have (on average 1.5298165137614679) internal successors, (667), 481 states have internal predecessors, (667), 26 states have call successors, (26), 14 states have call predecessors, (26), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 14:40:00,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 708 transitions. [2025-03-04 14:40:00,618 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 708 transitions. Word has length 27 [2025-03-04 14:40:00,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:00,618 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 708 transitions. [2025-03-04 14:40:00,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:00,619 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 708 transitions. [2025-03-04 14:40:00,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 14:40:00,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:00,620 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:00,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 14:40:00,620 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 63 more)] === [2025-03-04 14:40:00,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:00,623 INFO L85 PathProgramCache]: Analyzing trace with hash 776274716, now seen corresponding path program 1 times [2025-03-04 14:40:00,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:00,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635624311] [2025-03-04 14:40:00,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:00,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:00,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:40:00,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:40:00,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:00,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:01,060 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 14:40:01,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:01,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635624311] [2025-03-04 14:40:01,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635624311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:01,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:01,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:40:01,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072577889] [2025-03-04 14:40:01,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:01,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:40:01,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:01,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:40:01,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:01,062 INFO L87 Difference]: Start difference. First operand 510 states and 708 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:01,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:01,192 INFO L93 Difference]: Finished difference Result 523 states and 723 transitions. [2025-03-04 14:40:01,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:40:01,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-03-04 14:40:01,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:01,195 INFO L225 Difference]: With dead ends: 523 [2025-03-04 14:40:01,195 INFO L226 Difference]: Without dead ends: 521 [2025-03-04 14:40:01,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-04 14:40:01,195 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 3 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:01,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1330 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:01,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-03-04 14:40:01,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 519. [2025-03-04 14:40:01,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 445 states have (on average 1.5280898876404494) internal successors, (680), 490 states have internal predecessors, (680), 26 states have call successors, (26), 14 states have call predecessors, (26), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 14:40:01,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 721 transitions. [2025-03-04 14:40:01,206 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 721 transitions. Word has length 30 [2025-03-04 14:40:01,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:01,207 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 721 transitions. [2025-03-04 14:40:01,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:01,207 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 721 transitions. [2025-03-04 14:40:01,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 14:40:01,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:01,207 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:01,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 14:40:01,208 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 63 more)] === [2025-03-04 14:40:01,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:01,208 INFO L85 PathProgramCache]: Analyzing trace with hash 776274876, now seen corresponding path program 1 times [2025-03-04 14:40:01,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:01,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082187584] [2025-03-04 14:40:01,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:01,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:01,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:40:01,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:40:01,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:01,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:01,652 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 14:40:01,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:01,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082187584] [2025-03-04 14:40:01,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082187584] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:40:01,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554712021] [2025-03-04 14:40:01,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:01,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:01,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:01,657 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:40:01,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 14:40:02,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:40:02,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:40:02,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:02,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:02,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 1698 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 14:40:02,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:02,654 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 14:40:02,655 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:40:02,746 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 14:40:02,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554712021] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:40:02,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:40:02,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-04 14:40:02,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665162168] [2025-03-04 14:40:02,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:40:02,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 14:40:02,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:02,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 14:40:02,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:40:02,747 INFO L87 Difference]: Start difference. First operand 519 states and 721 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 14:40:03,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:03,050 INFO L93 Difference]: Finished difference Result 1040 states and 1450 transitions. [2025-03-04 14:40:03,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 14:40:03,051 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2025-03-04 14:40:03,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:03,053 INFO L225 Difference]: With dead ends: 1040 [2025-03-04 14:40:03,053 INFO L226 Difference]: Without dead ends: 536 [2025-03-04 14:40:03,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:40:03,058 INFO L435 NwaCegarLoop]: 663 mSDtfsCounter, 5 mSDsluCounter, 2644 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3307 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:03,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3307 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 14:40:03,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-03-04 14:40:03,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-03-04 14:40:03,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 463 states have (on average 1.5032397408207343) internal successors, (696), 507 states have internal predecessors, (696), 26 states have call successors, (26), 14 states have call predecessors, (26), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 14:40:03,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 737 transitions. [2025-03-04 14:40:03,075 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 737 transitions. Word has length 30 [2025-03-04 14:40:03,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:03,076 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 737 transitions. [2025-03-04 14:40:03,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 14:40:03,076 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 737 transitions. [2025-03-04 14:40:03,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 14:40:03,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:03,078 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:03,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 14:40:03,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:03,283 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 63 more)] === [2025-03-04 14:40:03,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:03,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1049446967, now seen corresponding path program 1 times [2025-03-04 14:40:03,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:03,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468860530] [2025-03-04 14:40:03,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:03,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:03,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 14:40:03,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 14:40:03,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:03,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:03,711 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-04 14:40:03,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:03,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468860530] [2025-03-04 14:40:03,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468860530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:03,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:03,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:40:03,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874796954] [2025-03-04 14:40:03,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:03,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:40:03,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:03,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:40:03,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:03,714 INFO L87 Difference]: Start difference. First operand 536 states and 737 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:03,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:03,790 INFO L93 Difference]: Finished difference Result 536 states and 737 transitions. [2025-03-04 14:40:03,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:40:03,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-03-04 14:40:03,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:03,794 INFO L225 Difference]: With dead ends: 536 [2025-03-04 14:40:03,794 INFO L226 Difference]: Without dead ends: 535 [2025-03-04 14:40:03,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-04 14:40:03,794 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 0 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:03,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1331 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:03,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-04 14:40:03,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 531. [2025-03-04 14:40:03,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 459 states have (on average 1.5032679738562091) internal successors, (690), 502 states have internal predecessors, (690), 26 states have call successors, (26), 14 states have call predecessors, (26), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 14:40:03,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 731 transitions. [2025-03-04 14:40:03,808 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 731 transitions. Word has length 49 [2025-03-04 14:40:03,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:03,808 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 731 transitions. [2025-03-04 14:40:03,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:03,808 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 731 transitions. [2025-03-04 14:40:03,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 14:40:03,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:03,810 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:03,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 14:40:03,810 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 63 more)] === [2025-03-04 14:40:03,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:03,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1715511782, now seen corresponding path program 1 times [2025-03-04 14:40:03,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:03,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155714893] [2025-03-04 14:40:03,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:03,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:04,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 14:40:04,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 14:40:04,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:04,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:04,179 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:40:04,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:04,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155714893] [2025-03-04 14:40:04,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155714893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:04,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:04,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:40:04,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016464742] [2025-03-04 14:40:04,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:04,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:40:04,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:04,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:40:04,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:04,180 INFO L87 Difference]: Start difference. First operand 531 states and 731 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:04,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:04,273 INFO L93 Difference]: Finished difference Result 545 states and 749 transitions. [2025-03-04 14:40:04,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:40:04,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-03-04 14:40:04,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:04,278 INFO L225 Difference]: With dead ends: 545 [2025-03-04 14:40:04,278 INFO L226 Difference]: Without dead ends: 543 [2025-03-04 14:40:04,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-04 14:40:04,279 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 11 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:04,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1327 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:04,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-03-04 14:40:04,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 542. [2025-03-04 14:40:04,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 470 states have (on average 1.5) internal successors, (705), 513 states have internal predecessors, (705), 26 states have call successors, (26), 14 states have call predecessors, (26), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 14:40:04,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 746 transitions. [2025-03-04 14:40:04,290 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 746 transitions. Word has length 50 [2025-03-04 14:40:04,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:04,290 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 746 transitions. [2025-03-04 14:40:04,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:04,290 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 746 transitions. [2025-03-04 14:40:04,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-04 14:40:04,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:04,292 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:04,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 14:40:04,292 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 63 more)] === [2025-03-04 14:40:04,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:04,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1680834570, now seen corresponding path program 1 times [2025-03-04 14:40:04,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:04,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989039517] [2025-03-04 14:40:04,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:04,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:04,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 14:40:04,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 14:40:04,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:04,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:04,789 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:40:04,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:04,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989039517] [2025-03-04 14:40:04,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989039517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:04,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:04,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:40:04,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368343315] [2025-03-04 14:40:04,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:04,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:40:04,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:04,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:40:04,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:04,791 INFO L87 Difference]: Start difference. First operand 542 states and 746 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:04,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:04,933 INFO L93 Difference]: Finished difference Result 813 states and 1145 transitions. [2025-03-04 14:40:04,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:40:04,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2025-03-04 14:40:04,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:04,937 INFO L225 Difference]: With dead ends: 813 [2025-03-04 14:40:04,937 INFO L226 Difference]: Without dead ends: 811 [2025-03-04 14:40:04,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-04 14:40:04,939 INFO L435 NwaCegarLoop]: 662 mSDtfsCounter, 373 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:04,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1316 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:04,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2025-03-04 14:40:04,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 546. [2025-03-04 14:40:04,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 474 states have (on average 1.4978902953586497) internal successors, (710), 517 states have internal predecessors, (710), 26 states have call successors, (26), 14 states have call predecessors, (26), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 14:40:04,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 751 transitions. [2025-03-04 14:40:04,957 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 751 transitions. Word has length 54 [2025-03-04 14:40:04,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:04,958 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 751 transitions. [2025-03-04 14:40:04,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:04,959 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 751 transitions. [2025-03-04 14:40:04,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 14:40:04,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:04,960 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:04,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 14:40:04,960 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 63 more)] === [2025-03-04 14:40:04,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:04,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1138888961, now seen corresponding path program 1 times [2025-03-04 14:40:04,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:04,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419533697] [2025-03-04 14:40:04,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:04,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:05,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:40:05,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:40:05,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:05,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:05,507 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:40:05,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:05,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419533697] [2025-03-04 14:40:05,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419533697] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:40:05,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910871667] [2025-03-04 14:40:05,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:05,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:05,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:05,511 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:40:05,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 14:40:06,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:40:06,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:40:06,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:06,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:06,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 1871 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:40:06,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:06,582 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:40:06,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:40:06,629 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:40:06,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910871667] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:40:06,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:40:06,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 14:40:06,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984889322] [2025-03-04 14:40:06,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:40:06,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:40:06,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:06,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:40:06,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:40:06,632 INFO L87 Difference]: Start difference. First operand 546 states and 751 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:06,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:06,858 INFO L93 Difference]: Finished difference Result 1067 states and 1479 transitions. [2025-03-04 14:40:06,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:40:06,859 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-03-04 14:40:06,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:06,861 INFO L225 Difference]: With dead ends: 1067 [2025-03-04 14:40:06,861 INFO L226 Difference]: Without dead ends: 564 [2025-03-04 14:40:06,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:40:06,863 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 4 mSDsluCounter, 1992 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2659 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:06,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2659 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:40:06,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-03-04 14:40:06,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2025-03-04 14:40:06,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 492 states have (on average 1.4796747967479675) internal successors, (728), 535 states have internal predecessors, (728), 26 states have call successors, (26), 14 states have call predecessors, (26), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 14:40:06,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 769 transitions. [2025-03-04 14:40:06,882 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 769 transitions. Word has length 55 [2025-03-04 14:40:06,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:06,882 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 769 transitions. [2025-03-04 14:40:06,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:06,882 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 769 transitions. [2025-03-04 14:40:06,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 14:40:06,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:06,883 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:06,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 14:40:07,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 14:40:07,085 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 63 more)] === [2025-03-04 14:40:07,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:07,086 INFO L85 PathProgramCache]: Analyzing trace with hash 343969661, now seen corresponding path program 1 times [2025-03-04 14:40:07,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:07,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026741196] [2025-03-04 14:40:07,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:07,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:07,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:40:07,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:40:07,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:07,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:07,542 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:40:07,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:07,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026741196] [2025-03-04 14:40:07,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026741196] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:40:07,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340966303] [2025-03-04 14:40:07,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:07,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:07,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:07,544 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:40:07,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 14:40:08,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:40:08,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:40:08,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:08,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:08,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 1788 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:40:08,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:08,558 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:40:08,558 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:40:08,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340966303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:08,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:40:08,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 14:40:08,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502478454] [2025-03-04 14:40:08,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:08,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:40:08,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:08,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:40:08,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:40:08,559 INFO L87 Difference]: Start difference. First operand 564 states and 769 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:08,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:08,643 INFO L93 Difference]: Finished difference Result 565 states and 770 transitions. [2025-03-04 14:40:08,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:40:08,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-03-04 14:40:08,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:08,646 INFO L225 Difference]: With dead ends: 565 [2025-03-04 14:40:08,646 INFO L226 Difference]: Without dead ends: 564 [2025-03-04 14:40:08,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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-04 14:40:08,647 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 21 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:08,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1337 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:08,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-03-04 14:40:08,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 563. [2025-03-04 14:40:08,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 492 states have (on average 1.4776422764227641) internal successors, (727), 534 states have internal predecessors, (727), 26 states have call successors, (26), 14 states have call predecessors, (26), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 14:40:08,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 768 transitions. [2025-03-04 14:40:08,657 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 768 transitions. Word has length 55 [2025-03-04 14:40:08,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:08,658 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 768 transitions. [2025-03-04 14:40:08,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:08,658 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 768 transitions. [2025-03-04 14:40:08,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 14:40:08,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:08,658 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:08,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 14:40:08,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:08,859 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 63 more)] === [2025-03-04 14:40:08,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:08,860 INFO L85 PathProgramCache]: Analyzing trace with hash 2073126270, now seen corresponding path program 1 times [2025-03-04 14:40:08,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:08,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205428371] [2025-03-04 14:40:08,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:08,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:09,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 14:40:09,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 14:40:09,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:09,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:09,384 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:40:09,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:09,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205428371] [2025-03-04 14:40:09,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205428371] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:40:09,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661556051] [2025-03-04 14:40:09,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:09,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:09,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:09,388 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:40:09,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 14:40:10,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 14:40:10,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 14:40:10,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:10,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:10,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 1789 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:40:10,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:10,358 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:40:10,358 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:40:10,392 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:40:10,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661556051] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:40:10,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:40:10,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 14:40:10,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124955444] [2025-03-04 14:40:10,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:40:10,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:40:10,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:10,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:40:10,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:40:10,395 INFO L87 Difference]: Start difference. First operand 563 states and 768 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:10,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:10,552 INFO L93 Difference]: Finished difference Result 601 states and 820 transitions. [2025-03-04 14:40:10,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:40:10,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-03-04 14:40:10,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:10,555 INFO L225 Difference]: With dead ends: 601 [2025-03-04 14:40:10,555 INFO L226 Difference]: Without dead ends: 600 [2025-03-04 14:40:10,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:40:10,556 INFO L435 NwaCegarLoop]: 665 mSDtfsCounter, 60 mSDsluCounter, 1994 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 2659 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:10,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 2659 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:10,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-03-04 14:40:10,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 596. [2025-03-04 14:40:10,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 525 states have (on average 1.4704761904761905) internal successors, (772), 567 states have internal predecessors, (772), 26 states have call successors, (26), 14 states have call predecessors, (26), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 14:40:10,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 813 transitions. [2025-03-04 14:40:10,567 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 813 transitions. Word has length 56 [2025-03-04 14:40:10,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:10,567 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 813 transitions. [2025-03-04 14:40:10,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:10,567 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 813 transitions. [2025-03-04 14:40:10,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 14:40:10,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:10,567 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:10,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 14:40:10,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:10,769 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 63 more)] === [2025-03-04 14:40:10,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:10,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1099040698, now seen corresponding path program 1 times [2025-03-04 14:40:10,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:10,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074845155] [2025-03-04 14:40:10,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:10,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:11,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 14:40:11,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 14:40:11,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:11,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:11,286 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:40:11,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:11,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074845155] [2025-03-04 14:40:11,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074845155] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:40:11,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638676613] [2025-03-04 14:40:11,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:11,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:11,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:11,289 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:40:11,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 14:40:12,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 14:40:12,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 14:40:12,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:12,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:12,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 1854 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:40:12,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:12,345 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:40:12,346 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:40:12,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638676613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:12,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:40:12,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 14:40:12,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213775671] [2025-03-04 14:40:12,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:12,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:40:12,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:12,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:40:12,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:40:12,347 INFO L87 Difference]: Start difference. First operand 596 states and 813 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:12,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:12,624 INFO L93 Difference]: Finished difference Result 865 states and 1210 transitions. [2025-03-04 14:40:12,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:40:12,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2025-03-04 14:40:12,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:12,629 INFO L225 Difference]: With dead ends: 865 [2025-03-04 14:40:12,629 INFO L226 Difference]: Without dead ends: 864 [2025-03-04 14:40:12,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 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-04 14:40:12,630 INFO L435 NwaCegarLoop]: 1028 mSDtfsCounter, 745 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:12,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 1686 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:40:12,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2025-03-04 14:40:12,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 595. [2025-03-04 14:40:12,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 525 states have (on average 1.4685714285714286) internal successors, (771), 566 states have internal predecessors, (771), 26 states have call successors, (26), 14 states have call predecessors, (26), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 14:40:12,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 812 transitions. [2025-03-04 14:40:12,645 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 812 transitions. Word has length 58 [2025-03-04 14:40:12,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:12,645 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 812 transitions. [2025-03-04 14:40:12,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:12,646 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 812 transitions. [2025-03-04 14:40:12,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-04 14:40:12,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:12,647 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:12,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 14:40:12,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 14:40:12,848 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 63 more)] === [2025-03-04 14:40:12,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:12,848 INFO L85 PathProgramCache]: Analyzing trace with hash -289475371, now seen corresponding path program 1 times [2025-03-04 14:40:12,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:12,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012647543] [2025-03-04 14:40:12,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:12,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:13,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 14:40:13,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 14:40:13,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:13,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:13,273 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:40:13,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:13,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012647543] [2025-03-04 14:40:13,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012647543] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:40:13,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775324119] [2025-03-04 14:40:13,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:13,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:13,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:13,276 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:40:13,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 14:40:14,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 14:40:14,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 14:40:14,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:14,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:14,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 1855 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:40:14,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:40:14,518 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:40:14,518 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:40:14,559 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:40:14,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775324119] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:40:14,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:40:14,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 14:40:14,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301455828] [2025-03-04 14:40:14,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:40:14,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:40:14,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:14,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:40:14,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:40:14,561 INFO L87 Difference]: Start difference. First operand 595 states and 812 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:14,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:14,971 INFO L93 Difference]: Finished difference Result 1668 states and 2398 transitions. [2025-03-04 14:40:14,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:40:14,971 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2025-03-04 14:40:14,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:14,976 INFO L225 Difference]: With dead ends: 1668 [2025-03-04 14:40:14,976 INFO L226 Difference]: Without dead ends: 1667 [2025-03-04 14:40:14,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:40:14,977 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 1867 mSDsluCounter, 2709 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1899 SdHoareTripleChecker+Valid, 3369 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:14,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1899 Valid, 3369 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 14:40:14,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2025-03-04 14:40:14,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 607. [2025-03-04 14:40:14,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 537 states have (on average 1.4636871508379887) internal successors, (786), 578 states have internal predecessors, (786), 26 states have call successors, (26), 14 states have call predecessors, (26), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 14:40:14,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 827 transitions. [2025-03-04 14:40:14,991 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 827 transitions. Word has length 59 [2025-03-04 14:40:14,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:14,992 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 827 transitions. [2025-03-04 14:40:14,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:14,992 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 827 transitions. [2025-03-04 14:40:14,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 14:40:14,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:14,992 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:15,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 14:40:15,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 14:40:15,193 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 63 more)] === [2025-03-04 14:40:15,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:15,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1691218805, now seen corresponding path program 1 times [2025-03-04 14:40:15,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:15,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882434413] [2025-03-04 14:40:15,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:15,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:15,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 14:40:15,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 14:40:15,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:15,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:15,630 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:40:15,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:15,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882434413] [2025-03-04 14:40:15,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882434413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:15,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:15,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:40:15,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916573374] [2025-03-04 14:40:15,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:15,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:40:15,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:15,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:40:15,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:15,632 INFO L87 Difference]: Start difference. First operand 607 states and 827 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:40:15,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:15,928 INFO L93 Difference]: Finished difference Result 1125 states and 1565 transitions. [2025-03-04 14:40:15,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:40:15,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 68 [2025-03-04 14:40:15,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:15,931 INFO L225 Difference]: With dead ends: 1125 [2025-03-04 14:40:15,931 INFO L226 Difference]: Without dead ends: 702 [2025-03-04 14:40:15,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-04 14:40:15,933 INFO L435 NwaCegarLoop]: 680 mSDtfsCounter, 119 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:15,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1276 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 14:40:15,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-03-04 14:40:15,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 649. [2025-03-04 14:40:15,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 578 states have (on average 1.4567474048442905) internal successors, (842), 619 states have internal predecessors, (842), 27 states have call successors, (27), 14 states have call predecessors, (27), 11 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 14:40:15,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 885 transitions. [2025-03-04 14:40:15,949 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 885 transitions. Word has length 68 [2025-03-04 14:40:15,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:15,950 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 885 transitions. [2025-03-04 14:40:15,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 14:40:15,950 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 885 transitions. [2025-03-04 14:40:15,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 14:40:15,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:15,953 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:15,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 14:40:15,954 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 63 more)] === [2025-03-04 14:40:15,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:15,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1763676435, now seen corresponding path program 1 times [2025-03-04 14:40:15,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:15,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394495504] [2025-03-04 14:40:15,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:40:15,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:16,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 14:40:16,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 14:40:16,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:40:16,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:16,372 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:40:16,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:16,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394495504] [2025-03-04 14:40:16,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394495504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:16,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:16,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:40:16,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743657106] [2025-03-04 14:40:16,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:16,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:40:16,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:16,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:40:16,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:16,378 INFO L87 Difference]: Start difference. First operand 649 states and 885 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:40:16,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:16,508 INFO L93 Difference]: Finished difference Result 651 states and 885 transitions. [2025-03-04 14:40:16,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:40:16,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2025-03-04 14:40:16,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:16,512 INFO L225 Difference]: With dead ends: 651 [2025-03-04 14:40:16,512 INFO L226 Difference]: Without dead ends: 649 [2025-03-04 14:40:16,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-04 14:40:16,513 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 1 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:16,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1327 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:16,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-03-04 14:40:16,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 649. [2025-03-04 14:40:16,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 578 states have (on average 1.453287197231834) internal successors, (840), 619 states have internal predecessors, (840), 27 states have call successors, (27), 14 states have call predecessors, (27), 11 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 14:40:16,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 883 transitions. [2025-03-04 14:40:16,535 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 883 transitions. Word has length 70 [2025-03-04 14:40:16,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:16,536 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 883 transitions. [2025-03-04 14:40:16,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:40:16,536 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 883 transitions. [2025-03-04 14:40:16,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-04 14:40:16,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:16,537 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:16,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 14:40:16,537 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 63 more)] === [2025-03-04 14:40:16,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:16,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1782525175, now seen corresponding path program 2 times [2025-03-04 14:40:16,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:16,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855406039] [2025-03-04 14:40:16,538 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:40:16,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:16,770 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-03-04 14:40:16,784 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 71 statements. [2025-03-04 14:40:16,784 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 14:40:16,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:16,977 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-03-04 14:40:16,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:16,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855406039] [2025-03-04 14:40:16,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855406039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:40:16,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:40:16,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:40:16,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685849858] [2025-03-04 14:40:16,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:40:16,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:40:16,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:40:16,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:40:16,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:40:16,978 INFO L87 Difference]: Start difference. First operand 649 states and 883 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:17,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:40:17,070 INFO L93 Difference]: Finished difference Result 1211 states and 1661 transitions. [2025-03-04 14:40:17,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:40:17,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2025-03-04 14:40:17,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:40:17,074 INFO L225 Difference]: With dead ends: 1211 [2025-03-04 14:40:17,074 INFO L226 Difference]: Without dead ends: 653 [2025-03-04 14:40:17,075 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-04 14:40:17,075 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 27 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:40:17,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1293 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:40:17,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2025-03-04 14:40:17,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 653. [2025-03-04 14:40:17,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 581 states have (on average 1.4492254733218588) internal successors, (842), 622 states have internal predecessors, (842), 27 states have call successors, (27), 15 states have call predecessors, (27), 12 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 14:40:17,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 885 transitions. [2025-03-04 14:40:17,100 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 885 transitions. Word has length 71 [2025-03-04 14:40:17,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:40:17,101 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 885 transitions. [2025-03-04 14:40:17,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:40:17,101 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 885 transitions. [2025-03-04 14:40:17,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 14:40:17,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:40:17,102 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:40:17,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 14:40:17,102 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [write2stdoutErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 63 more)] === [2025-03-04 14:40:17,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:40:17,102 INFO L85 PathProgramCache]: Analyzing trace with hash -659565009, now seen corresponding path program 2 times [2025-03-04 14:40:17,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:40:17,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8796990] [2025-03-04 14:40:17,103 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:40:17,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:40:17,428 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-04 14:40:17,525 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 14:40:17,526 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:40:17,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:40:17,698 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-03-04 14:40:17,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:40:17,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8796990] [2025-03-04 14:40:17,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8796990] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:40:17,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693993293] [2025-03-04 14:40:17,699 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:40:17,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:40:17,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:40:17,701 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:40:17,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 14:40:18,632 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes.