./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/list-simple/sll2n_prepend_equal.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/list-simple/sll2n_prepend_equal.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 81cba62178f289182ca7c1f9a7037a5c75b42c819300893ba900414543e9f4e8 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:02:07,364 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:02:07,418 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-04-29 11:02:07,424 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:02:07,424 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:02:07,445 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:02:07,445 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:02:07,445 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:02:07,446 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:02:07,446 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:02:07,447 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:02:07,447 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:02:07,447 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:02:07,447 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:02:07,447 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:02:07,447 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:02:07,447 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:02:07,447 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:02:07,447 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:02:07,447 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:02:07,447 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:02:07,447 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:02:07,447 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:02:07,447 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:02:07,447 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-29 11:02:07,447 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:02:07,447 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:02:07,447 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:02:07,447 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:02:07,448 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:02:07,448 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:02:07,448 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:02:07,448 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:02:07,448 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:02:07,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:02:07,448 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:02:07,448 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:02:07,448 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:02:07,448 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:02:07,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:02:07,448 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:02:07,448 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:02:07,448 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:02:07,448 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:02:07,448 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:02:07,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:02:07,448 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:02:07,448 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:02:07,448 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:02:07,449 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 81cba62178f289182ca7c1f9a7037a5c75b42c819300893ba900414543e9f4e8 [2025-04-29 11:02:07,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:02:07,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:02:07,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:02:07,699 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:02:07,699 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:02:07,700 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_prepend_equal.c [2025-04-29 11:02:08,941 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c75ba721/92a20315aa104b94a31e687c646c83e1/FLAG18fe4e00f [2025-04-29 11:02:09,141 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:02:09,142 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_prepend_equal.c [2025-04-29 11:02:09,143 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:02:09,143 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:02:09,147 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c75ba721/92a20315aa104b94a31e687c646c83e1/FLAG18fe4e00f [2025-04-29 11:02:09,942 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c75ba721/92a20315aa104b94a31e687c646c83e1 [2025-04-29 11:02:09,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:02:09,945 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:02:09,946 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:02:09,946 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:02:09,948 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:02:09,949 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:02:09" (1/1) ... [2025-04-29 11:02:09,949 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11c76a02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:09, skipping insertion in model container [2025-04-29 11:02:09,949 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:02:09" (1/1) ... [2025-04-29 11:02:09,961 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:02:10,121 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:02:10,128 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:02:10,163 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:02:10,173 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:02:10,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:10 WrapperNode [2025-04-29 11:02:10,174 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:02:10,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:02:10,175 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:02:10,175 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:02:10,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:10" (1/1) ... [2025-04-29 11:02:10,187 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:10" (1/1) ... [2025-04-29 11:02:10,205 INFO L138 Inliner]: procedures = 18, calls = 27, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 99 [2025-04-29 11:02:10,207 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:02:10,207 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:02:10,208 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:02:10,208 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:02:10,215 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:10" (1/1) ... [2025-04-29 11:02:10,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:10" (1/1) ... [2025-04-29 11:02:10,217 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:10" (1/1) ... [2025-04-29 11:02:10,237 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [7, 5]. 58 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [0, 1]. The 5 writes are split as follows [4, 1]. [2025-04-29 11:02:10,237 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:10" (1/1) ... [2025-04-29 11:02:10,238 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:10" (1/1) ... [2025-04-29 11:02:10,248 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:10" (1/1) ... [2025-04-29 11:02:10,252 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:10" (1/1) ... [2025-04-29 11:02:10,254 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:10" (1/1) ... [2025-04-29 11:02:10,258 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:10" (1/1) ... [2025-04-29 11:02:10,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:10" (1/1) ... [2025-04-29 11:02:10,262 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:02:10,266 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:02:10,266 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:02:10,266 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:02:10,267 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:10" (1/1) ... [2025-04-29 11:02:10,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:02:10,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:10,293 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-04-29 11:02:10,296 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-04-29 11:02:10,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:02:10,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 11:02:10,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 11:02:10,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 11:02:10,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 11:02:10,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:02:10,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 11:02:10,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:02:10,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 11:02:10,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:02:10,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:02:10,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:02:10,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:02:10,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 11:02:10,315 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-04-29 11:02:10,315 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-04-29 11:02:10,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:02:10,386 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:02:10,387 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:02:10,537 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2025-04-29 11:02:10,538 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:02:10,550 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:02:10,551 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:02:10,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:02:10 BoogieIcfgContainer [2025-04-29 11:02:10,551 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:02:10,553 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:02:10,553 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:02:10,556 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:02:10,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:02:09" (1/3) ... [2025-04-29 11:02:10,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da762e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:02:10, skipping insertion in model container [2025-04-29 11:02:10,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:10" (2/3) ... [2025-04-29 11:02:10,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da762e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:02:10, skipping insertion in model container [2025-04-29 11:02:10,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:02:10" (3/3) ... [2025-04-29 11:02:10,558 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal.c [2025-04-29 11:02:10,570 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:02:10,571 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_prepend_equal.c that has 2 procedures, 37 locations, 45 edges, 1 initial locations, 3 loop locations, and 6 error locations. [2025-04-29 11:02:10,615 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:02:10,624 INFO L340 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;@1737ca2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:02:10,625 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-29 11:02:10,630 INFO L278 IsEmpty]: Start isEmpty. Operand has 37 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 33 states have internal predecessors, (39), 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-04-29 11:02:10,634 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-29 11:02:10,635 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:10,635 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:10,636 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:02:10,639 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:10,639 INFO L85 PathProgramCache]: Analyzing trace with hash 331807454, now seen corresponding path program 1 times [2025-04-29 11:02:10,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:10,645 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898718574] [2025-04-29 11:02:10,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:10,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:10,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:02:10,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:02:10,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:10,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:10,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:10,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:10,917 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898718574] [2025-04-29 11:02:10,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898718574] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:10,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:10,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:02:10,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113511381] [2025-04-29 11:02:10,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:10,923 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:02:10,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:10,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:02:10,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:10,937 INFO L87 Difference]: Start difference. First operand has 37 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 33 states have internal predecessors, (39), 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) Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-04-29 11:02:10,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:10,980 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2025-04-29 11:02:10,981 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:02:10,982 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 11 [2025-04-29 11:02:10,982 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:10,985 INFO L225 Difference]: With dead ends: 70 [2025-04-29 11:02:10,986 INFO L226 Difference]: Without dead ends: 33 [2025-04-29 11:02:10,988 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:10,993 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:10,994 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 102 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:11,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-04-29 11:02:11,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2025-04-29 11:02:11,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 27 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:02:11,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2025-04-29 11:02:11,022 INFO L79 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 11 [2025-04-29 11:02:11,026 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:11,026 INFO L485 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2025-04-29 11:02:11,027 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-04-29 11:02:11,027 INFO L278 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2025-04-29 11:02:11,027 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-29 11:02:11,027 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:11,027 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:11,027 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:02:11,027 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:02:11,028 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:11,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1696096524, now seen corresponding path program 1 times [2025-04-29 11:02:11,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:11,028 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841470588] [2025-04-29 11:02:11,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:11,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:11,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:02:11,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:02:11,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:11,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:11,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:11,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:11,138 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841470588] [2025-04-29 11:02:11,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841470588] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:11,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:11,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:02:11,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136107509] [2025-04-29 11:02:11,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:11,139 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:02:11,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:11,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:02:11,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:11,140 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-04-29 11:02:11,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:11,173 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2025-04-29 11:02:11,173 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:02:11,173 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-04-29 11:02:11,174 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:11,174 INFO L225 Difference]: With dead ends: 34 [2025-04-29 11:02:11,174 INFO L226 Difference]: Without dead ends: 33 [2025-04-29 11:02:11,175 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:11,175 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:11,177 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:11,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-04-29 11:02:11,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-04-29 11:02:11,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 28 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:02:11,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2025-04-29 11:02:11,180 INFO L79 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 12 [2025-04-29 11:02:11,180 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:11,180 INFO L485 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2025-04-29 11:02:11,180 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-04-29 11:02:11,180 INFO L278 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2025-04-29 11:02:11,181 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-29 11:02:11,181 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:11,181 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-04-29 11:02:11,181 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:02:11,181 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:02:11,181 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:11,181 INFO L85 PathProgramCache]: Analyzing trace with hash 889319636, now seen corresponding path program 1 times [2025-04-29 11:02:11,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:11,182 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706921368] [2025-04-29 11:02:11,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:11,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:11,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:02:11,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:02:11,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:11,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:11,256 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 11:02:11,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:11,256 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706921368] [2025-04-29 11:02:11,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706921368] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:11,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:11,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:02:11,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529987872] [2025-04-29 11:02:11,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:11,257 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:02:11,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:11,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:02:11,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:11,258 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-04-29 11:02:11,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:11,282 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2025-04-29 11:02:11,282 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:02:11,282 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 21 [2025-04-29 11:02:11,282 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:11,283 INFO L225 Difference]: With dead ends: 33 [2025-04-29 11:02:11,283 INFO L226 Difference]: Without dead ends: 32 [2025-04-29 11:02:11,283 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:11,283 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:11,283 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 66 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:11,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-04-29 11:02:11,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-04-29 11:02:11,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 27 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:02:11,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2025-04-29 11:02:11,288 INFO L79 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 21 [2025-04-29 11:02:11,288 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:11,288 INFO L485 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2025-04-29 11:02:11,288 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-04-29 11:02:11,288 INFO L278 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2025-04-29 11:02:11,289 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-29 11:02:11,289 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:11,289 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-04-29 11:02:11,289 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:02:11,290 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:02:11,290 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:11,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1799104982, now seen corresponding path program 1 times [2025-04-29 11:02:11,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:11,291 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654100662] [2025-04-29 11:02:11,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:11,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:11,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:02:11,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:02:11,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:11,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:11,421 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:02:11,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:11,421 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654100662] [2025-04-29 11:02:11,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654100662] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:11,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:11,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:02:11,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244748159] [2025-04-29 11:02:11,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:11,421 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:02:11,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:11,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:02:11,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:02:11,422 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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-04-29 11:02:11,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:11,461 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2025-04-29 11:02:11,463 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:02:11,464 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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 22 [2025-04-29 11:02:11,464 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:11,464 INFO L225 Difference]: With dead ends: 32 [2025-04-29 11:02:11,464 INFO L226 Difference]: Without dead ends: 31 [2025-04-29 11:02:11,465 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:02:11,465 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:11,465 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:11,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-04-29 11:02:11,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2025-04-29 11:02:11,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.25) internal successors, (25), 23 states have internal predecessors, (25), 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-04-29 11:02:11,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2025-04-29 11:02:11,470 INFO L79 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 22 [2025-04-29 11:02:11,470 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:11,470 INFO L485 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2025-04-29 11:02:11,470 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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-04-29 11:02:11,470 INFO L278 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2025-04-29 11:02:11,470 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:02:11,470 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:11,470 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:11,470 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:02:11,470 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:02:11,471 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:11,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1253921300, now seen corresponding path program 1 times [2025-04-29 11:02:11,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:11,471 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445558384] [2025-04-29 11:02:11,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:11,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:11,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:02:11,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:02:11,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:11,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:11,685 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:02:11,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:11,685 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445558384] [2025-04-29 11:02:11,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445558384] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:11,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:11,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:02:11,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025536007] [2025-04-29 11:02:11,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:11,685 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:02:11,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:11,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:02:11,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:02:11,686 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:02:11,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:11,724 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2025-04-29 11:02:11,725 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:02:11,725 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2025-04-29 11:02:11,725 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:11,725 INFO L225 Difference]: With dead ends: 32 [2025-04-29 11:02:11,726 INFO L226 Difference]: Without dead ends: 28 [2025-04-29 11:02:11,726 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:02:11,726 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 12 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:11,726 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 118 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:11,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-04-29 11:02:11,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-04-29 11:02:11,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 24 states have internal predecessors, (26), 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-04-29 11:02:11,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2025-04-29 11:02:11,729 INFO L79 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 24 [2025-04-29 11:02:11,729 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:11,729 INFO L485 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2025-04-29 11:02:11,730 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:02:11,730 INFO L278 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2025-04-29 11:02:11,730 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-29 11:02:11,730 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:11,730 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:11,731 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:02:11,732 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:02:11,732 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:11,732 INFO L85 PathProgramCache]: Analyzing trace with hash -216865394, now seen corresponding path program 1 times [2025-04-29 11:02:11,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:11,732 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441884418] [2025-04-29 11:02:11,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:11,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:11,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 11:02:11,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 11:02:11,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:11,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:11,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:02:11,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:11,816 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441884418] [2025-04-29 11:02:11,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441884418] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:02:11,816 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770456560] [2025-04-29 11:02:11,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:11,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:11,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:11,819 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-04-29 11:02:11,820 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-04-29 11:02:11,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 11:02:11,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 11:02:11,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:11,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:11,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 11:02:11,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:11,963 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:11,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:02:12,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:02:12,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770456560] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:02:12,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:02:12,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-04-29 11:02:12,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328130317] [2025-04-29 11:02:12,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:02:12,018 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:02:12,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:12,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:02:12,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:02:12,019 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-29 11:02:12,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:12,048 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2025-04-29 11:02:12,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:02:12,049 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2025-04-29 11:02:12,049 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:12,049 INFO L225 Difference]: With dead ends: 53 [2025-04-29 11:02:12,049 INFO L226 Difference]: Without dead ends: 33 [2025-04-29 11:02:12,050 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:02:12,050 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:12,050 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 108 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:12,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-04-29 11:02:12,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-04-29 11:02:12,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.2) internal successors, (30), 28 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:02:12,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2025-04-29 11:02:12,054 INFO L79 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 25 [2025-04-29 11:02:12,054 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:12,054 INFO L485 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2025-04-29 11:02:12,054 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-29 11:02:12,054 INFO L278 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2025-04-29 11:02:12,054 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-29 11:02:12,055 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:12,055 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:12,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:02:12,259 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-29 11:02:12,259 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:02:12,259 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:12,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1135266556, now seen corresponding path program 2 times [2025-04-29 11:02:12,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:12,259 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483510002] [2025-04-29 11:02:12,259 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:02:12,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:12,288 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-29 11:02:12,292 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 35 statements. [2025-04-29 11:02:12,292 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:02:12,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:12,318 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 11:02:12,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:12,318 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483510002] [2025-04-29 11:02:12,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483510002] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:12,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:12,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:02:12,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885925099] [2025-04-29 11:02:12,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:12,319 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:02:12,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:12,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:02:12,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:12,319 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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-04-29 11:02:12,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:12,332 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2025-04-29 11:02:12,332 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:02:12,332 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 35 [2025-04-29 11:02:12,333 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:12,333 INFO L225 Difference]: With dead ends: 38 [2025-04-29 11:02:12,333 INFO L226 Difference]: Without dead ends: 36 [2025-04-29 11:02:12,333 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:12,334 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:12,334 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 70 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:12,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-04-29 11:02:12,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-04-29 11:02:12,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 31 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:02:12,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2025-04-29 11:02:12,342 INFO L79 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 35 [2025-04-29 11:02:12,342 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:12,342 INFO L485 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2025-04-29 11:02:12,342 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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-04-29 11:02:12,343 INFO L278 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2025-04-29 11:02:12,343 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-29 11:02:12,343 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:12,343 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:12,343 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:02:12,343 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:02:12,344 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:12,344 INFO L85 PathProgramCache]: Analyzing trace with hash 2141548829, now seen corresponding path program 1 times [2025-04-29 11:02:12,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:12,344 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034649409] [2025-04-29 11:02:12,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:12,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:12,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 11:02:12,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 11:02:12,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:12,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:12,395 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-04-29 11:02:12,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:12,396 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034649409] [2025-04-29 11:02:12,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034649409] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:12,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:12,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:02:12,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844578386] [2025-04-29 11:02:12,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:12,396 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:02:12,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:12,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:02:12,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:02:12,397 INFO L87 Difference]: Start difference. First operand 36 states and 39 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, (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-04-29 11:02:12,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:12,401 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2025-04-29 11:02:12,401 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:02:12,401 INFO L79 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, (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 38 [2025-04-29 11:02:12,402 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:12,402 INFO L225 Difference]: With dead ends: 36 [2025-04-29 11:02:12,402 INFO L226 Difference]: Without dead ends: 35 [2025-04-29 11:02:12,402 INFO L436 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-04-29 11:02:12,403 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 3 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:12,403 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 32 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:12,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-04-29 11:02:12,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-04-29 11:02:12,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 30 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:02:12,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2025-04-29 11:02:12,406 INFO L79 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 38 [2025-04-29 11:02:12,406 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:12,406 INFO L485 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2025-04-29 11:02:12,406 INFO L486 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, (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-04-29 11:02:12,407 INFO L278 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2025-04-29 11:02:12,407 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-29 11:02:12,407 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:12,407 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:12,407 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:02:12,407 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:02:12,408 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:12,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1963504328, now seen corresponding path program 1 times [2025-04-29 11:02:12,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:12,408 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232376610] [2025-04-29 11:02:12,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:12,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:12,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 11:02:12,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 11:02:12,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:12,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:12,461 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-04-29 11:02:12,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:12,462 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232376610] [2025-04-29 11:02:12,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232376610] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:12,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:12,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:02:12,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221146263] [2025-04-29 11:02:12,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:12,463 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:02:12,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:12,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:02:12,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:02:12,464 INFO L87 Difference]: Start difference. First operand 35 states and 38 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, (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-04-29 11:02:12,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:12,468 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2025-04-29 11:02:12,468 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:02:12,468 INFO L79 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, (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 39 [2025-04-29 11:02:12,469 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:12,469 INFO L225 Difference]: With dead ends: 35 [2025-04-29 11:02:12,470 INFO L226 Difference]: Without dead ends: 32 [2025-04-29 11:02:12,470 INFO L436 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-04-29 11:02:12,471 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:12,471 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 32 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:12,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-04-29 11:02:12,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-04-29 11:02:12,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:02:12,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2025-04-29 11:02:12,477 INFO L79 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 39 [2025-04-29 11:02:12,477 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:12,478 INFO L485 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2025-04-29 11:02:12,478 INFO L486 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, (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-04-29 11:02:12,478 INFO L278 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2025-04-29 11:02:12,479 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-29 11:02:12,479 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:12,479 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:12,479 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:02:12,479 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:02:12,479 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:12,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1963493501, now seen corresponding path program 1 times [2025-04-29 11:02:12,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:12,480 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807235181] [2025-04-29 11:02:12,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:12,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:12,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 11:02:12,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 11:02:12,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:12,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:12,620 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 11:02:12,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:12,620 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807235181] [2025-04-29 11:02:12,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807235181] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:02:12,620 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859996958] [2025-04-29 11:02:12,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:12,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:12,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:12,624 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-04-29 11:02:12,626 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-04-29 11:02:12,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 11:02:12,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 11:02:12,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:12,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:12,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:02:12,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:12,769 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 11:02:12,770 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:02:12,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859996958] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:12,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:02:12,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-04-29 11:02:12,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874002897] [2025-04-29 11:02:12,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:12,770 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:02:12,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:12,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:02:12,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:02:12,771 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-04-29 11:02:12,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:12,781 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2025-04-29 11:02:12,782 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:02:12,782 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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 39 [2025-04-29 11:02:12,782 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:12,782 INFO L225 Difference]: With dead ends: 32 [2025-04-29 11:02:12,782 INFO L226 Difference]: Without dead ends: 31 [2025-04-29 11:02:12,782 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:02:12,783 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:12,783 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 53 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:12,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-04-29 11:02:12,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-04-29 11:02:12,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:02:12,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2025-04-29 11:02:12,786 INFO L79 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 39 [2025-04-29 11:02:12,786 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:12,786 INFO L485 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2025-04-29 11:02:12,786 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-04-29 11:02:12,786 INFO L278 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2025-04-29 11:02:12,786 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-29 11:02:12,787 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:12,787 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:12,793 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-04-29 11:02:12,987 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-29 11:02:12,987 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:02:12,988 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:12,988 INFO L85 PathProgramCache]: Analyzing trace with hash 738756450, now seen corresponding path program 1 times [2025-04-29 11:02:12,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:12,988 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450983898] [2025-04-29 11:02:12,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:12,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:13,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-29 11:02:13,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 11:02:13,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:13,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:13,079 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 11:02:13,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:13,080 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450983898] [2025-04-29 11:02:13,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450983898] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:02:13,080 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718364693] [2025-04-29 11:02:13,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:13,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:13,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:13,082 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-04-29 11:02:13,083 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-04-29 11:02:13,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-29 11:02:13,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 11:02:13,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:13,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:13,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:02:13,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:13,227 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 11:02:13,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:02:13,293 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 11:02:13,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718364693] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:02:13,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:02:13,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-29 11:02:13,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973851376] [2025-04-29 11:02:13,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:02:13,294 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:02:13,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:13,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:02:13,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:02:13,295 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 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-04-29 11:02:13,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:13,325 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2025-04-29 11:02:13,325 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:02:13,325 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 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 40 [2025-04-29 11:02:13,325 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:13,326 INFO L225 Difference]: With dead ends: 44 [2025-04-29 11:02:13,326 INFO L226 Difference]: Without dead ends: 43 [2025-04-29 11:02:13,326 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:02:13,327 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:13,328 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:13,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-04-29 11:02:13,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-04-29 11:02:13,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:02:13,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2025-04-29 11:02:13,334 INFO L79 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 40 [2025-04-29 11:02:13,335 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:13,335 INFO L485 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2025-04-29 11:02:13,336 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 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-04-29 11:02:13,336 INFO L278 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2025-04-29 11:02:13,336 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-04-29 11:02:13,336 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:13,336 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:13,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-29 11:02:13,536 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:13,537 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:02:13,537 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:13,537 INFO L85 PathProgramCache]: Analyzing trace with hash -279194281, now seen corresponding path program 2 times [2025-04-29 11:02:13,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:13,537 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590529357] [2025-04-29 11:02:13,537 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:02:13,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:13,553 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-04-29 11:02:13,563 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-04-29 11:02:13,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:02:13,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:13,754 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 11:02:13,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:13,754 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590529357] [2025-04-29 11:02:13,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590529357] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:02:13,754 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320014292] [2025-04-29 11:02:13,754 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:02:13,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:13,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:13,757 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-04-29 11:02:13,758 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-04-29 11:02:13,846 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-04-29 11:02:13,895 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-04-29 11:02:13,895 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:02:13,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:13,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-29 11:02:13,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:13,954 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 11:02:13,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:02:14,086 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 11:02:14,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320014292] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:02:14,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:02:14,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-04-29 11:02:14,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782658470] [2025-04-29 11:02:14,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:02:14,087 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-29 11:02:14,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:14,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-29 11:02:14,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-04-29 11:02:14,088 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 24 states have internal predecessors, (60), 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-04-29 11:02:14,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:14,134 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2025-04-29 11:02:14,135 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-29 11:02:14,135 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 24 states have internal predecessors, (60), 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 52 [2025-04-29 11:02:14,135 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:14,136 INFO L225 Difference]: With dead ends: 68 [2025-04-29 11:02:14,136 INFO L226 Difference]: Without dead ends: 67 [2025-04-29 11:02:14,136 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-04-29 11:02:14,136 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 170 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.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:14,137 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:14,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-04-29 11:02:14,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-04-29 11:02:14,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:02:14,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2025-04-29 11:02:14,144 INFO L79 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 52 [2025-04-29 11:02:14,144 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:14,144 INFO L485 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2025-04-29 11:02:14,144 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 24 states have internal predecessors, (60), 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-04-29 11:02:14,145 INFO L278 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2025-04-29 11:02:14,146 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-04-29 11:02:14,146 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:14,146 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:14,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 11:02:14,346 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:14,347 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:02:14,347 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:14,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1103177023, now seen corresponding path program 3 times [2025-04-29 11:02:14,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:14,348 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128255685] [2025-04-29 11:02:14,348 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:02:14,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:14,370 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 76 statements into 11 equivalence classes. [2025-04-29 11:02:14,426 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 76 of 76 statements. [2025-04-29 11:02:14,426 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-29 11:02:14,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:14,941 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 11:02:14,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:14,941 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128255685] [2025-04-29 11:02:14,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128255685] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:02:14,941 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582552342] [2025-04-29 11:02:14,941 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:02:14,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:14,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:14,943 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-04-29 11:02:14,945 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-04-29 11:02:15,033 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 76 statements into 11 equivalence classes. [2025-04-29 11:02:15,687 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 76 of 76 statements. [2025-04-29 11:02:15,687 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-29 11:02:15,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:15,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-29 11:02:15,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:15,783 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 11:02:15,784 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:02:16,230 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 11:02:16,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582552342] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:02:16,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:02:16,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 47 [2025-04-29 11:02:16,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653480930] [2025-04-29 11:02:16,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:02:16,231 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-04-29 11:02:16,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:16,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-04-29 11:02:16,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2025-04-29 11:02:16,233 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 48 states, 47 states have (on average 2.297872340425532) internal successors, (108), 48 states have internal predecessors, (108), 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-04-29 11:02:16,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:16,327 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2025-04-29 11:02:16,327 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-29 11:02:16,327 INFO L79 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.297872340425532) internal successors, (108), 48 states have internal predecessors, (108), 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 76 [2025-04-29 11:02:16,327 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:16,328 INFO L225 Difference]: With dead ends: 116 [2025-04-29 11:02:16,328 INFO L226 Difference]: Without dead ends: 115 [2025-04-29 11:02:16,329 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2025-04-29 11:02:16,329 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:16,329 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 253 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:02:16,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-04-29 11:02:16,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-04-29 11:02:16,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:02:16,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 118 transitions. [2025-04-29 11:02:16,340 INFO L79 Accepts]: Start accepts. Automaton has 115 states and 118 transitions. Word has length 76 [2025-04-29 11:02:16,341 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:16,341 INFO L485 AbstractCegarLoop]: Abstraction has 115 states and 118 transitions. [2025-04-29 11:02:16,341 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.297872340425532) internal successors, (108), 48 states have internal predecessors, (108), 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-04-29 11:02:16,341 INFO L278 IsEmpty]: Start isEmpty. Operand 115 states and 118 transitions. [2025-04-29 11:02:16,342 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-04-29 11:02:16,342 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:16,342 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 22, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:16,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-29 11:02:16,542 WARN L466 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-04-29 11:02:16,543 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:02:16,543 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:16,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1568770965, now seen corresponding path program 4 times [2025-04-29 11:02:16,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:16,543 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452906699] [2025-04-29 11:02:16,543 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:02:16,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:16,559 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 124 statements into 2 equivalence classes. [2025-04-29 11:02:16,591 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 74 of 124 statements. [2025-04-29 11:02:16,592 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 11:02:16,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:18,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 262 proven. 30 refuted. 0 times theorem prover too weak. 742 trivial. 0 not checked. [2025-04-29 11:02:18,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:18,421 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452906699] [2025-04-29 11:02:18,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452906699] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:02:18,421 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229412691] [2025-04-29 11:02:18,421 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:02:18,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:18,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:18,423 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-04-29 11:02:18,424 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-04-29 11:02:18,536 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 124 statements into 2 equivalence classes. [2025-04-29 11:02:18,611 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 74 of 124 statements. [2025-04-29 11:02:18,611 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 11:02:18,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:18,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 125 conjuncts are in the unsatisfiable core [2025-04-29 11:02:18,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:18,650 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:02:18,685 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:02:18,689 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:02:18,839 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:02:18,839 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-04-29 11:02:18,864 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:02:18,864 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-04-29 11:02:18,886 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 11:02:18,886 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-29 11:02:18,946 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2025-04-29 11:02:18,959 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-04-29 11:02:19,165 INFO L325 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2025-04-29 11:02:19,165 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 27 [2025-04-29 11:02:19,171 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2025-04-29 11:02:19,175 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-29 11:02:19,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:02:19,291 INFO L325 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-04-29 11:02:19,292 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 75 [2025-04-29 11:02:19,321 INFO L325 Elim1Store]: treesize reduction 60, result has 47.8 percent of original size [2025-04-29 11:02:19,321 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 71 [2025-04-29 11:02:19,327 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-04-29 11:02:19,353 INFO L325 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2025-04-29 11:02:19,353 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2025-04-29 11:02:19,446 INFO L325 Elim1Store]: treesize reduction 65, result has 9.7 percent of original size [2025-04-29 11:02:19,446 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 75 [2025-04-29 11:02:19,456 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 66 [2025-04-29 11:02:19,461 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 105 [2025-04-29 11:02:19,465 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 161 [2025-04-29 11:02:19,525 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 243 treesize of output 183 [2025-04-29 11:02:19,527 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 135 [2025-04-29 11:02:45,985 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-29 11:02:45,986 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-29 11:02:45,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2025-04-29 11:02:45,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-29 11:02:46,187 WARN L466 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-04-29 11:02:46,188 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:945) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:784) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:372) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:321) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:551) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 45 more [2025-04-29 11:02:46,193 INFO L158 Benchmark]: Toolchain (without parser) took 36247.95ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 105.9MB in the beginning and 333.9MB in the end (delta: -228.0MB). Peak memory consumption was 222.0MB. Max. memory is 16.1GB. [2025-04-29 11:02:46,193 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:02:46,193 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.54ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 91.7MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:02:46,194 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.97ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 90.7MB in the end (delta: 988.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:02:46,194 INFO L158 Benchmark]: Boogie Preprocessor took 57.78ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 87.7MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:02:46,195 INFO L158 Benchmark]: RCFGBuilder took 285.47ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 73.0MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:02:46,195 INFO L158 Benchmark]: TraceAbstraction took 35639.56ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 72.0MB in the beginning and 333.9MB in the end (delta: -261.9MB). Peak memory consumption was 188.4MB. Max. memory is 16.1GB. [2025-04-29 11:02:46,196 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.54ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 91.7MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.97ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 90.7MB in the end (delta: 988.6kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 57.78ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 87.7MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 285.47ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 73.0MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 35639.56ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 72.0MB in the beginning and 333.9MB in the end (delta: -261.9MB). Peak memory consumption was 188.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/list-simple/sll2n_prepend_equal.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 81cba62178f289182ca7c1f9a7037a5c75b42c819300893ba900414543e9f4e8 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:02:47,746 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:02:47,821 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2025-04-29 11:02:47,829 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:02:47,829 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:02:47,860 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:02:47,861 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:02:47,861 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:02:47,862 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:02:47,862 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:02:47,862 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:02:47,862 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:02:47,863 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:02:47,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:02:47,863 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:02:47,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:02:47,863 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:02:47,863 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:02:47,863 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:02:47,864 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:02:47,864 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:02:47,864 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:02:47,864 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:02:47,864 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:02:47,864 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-04-29 11:02:47,864 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-29 11:02:47,864 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-04-29 11:02:47,864 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:02:47,864 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:02:47,864 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:02:47,865 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:02:47,865 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:02:47,865 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:02:47,865 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:02:47,865 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:02:47,865 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:02:47,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:02:47,866 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:02:47,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:02:47,866 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:02:47,866 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:02:47,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:02:47,866 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:02:47,866 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:02:47,867 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:02:47,867 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:02:47,867 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-04-29 11:02:47,867 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-04-29 11:02:47,867 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:02:47,867 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:02:47,867 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:02:47,867 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 81cba62178f289182ca7c1f9a7037a5c75b42c819300893ba900414543e9f4e8 [2025-04-29 11:02:48,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:02:48,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:02:48,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:02:48,080 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:02:48,080 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:02:48,081 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_prepend_equal.c [2025-04-29 11:02:49,356 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d54cffb08/a9e8fab7142d4522b22463f1dc7852d5/FLAGaba2c3be5 [2025-04-29 11:02:49,541 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:02:49,542 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_prepend_equal.c [2025-04-29 11:02:49,543 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:02:49,543 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:02:49,549 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d54cffb08/a9e8fab7142d4522b22463f1dc7852d5/FLAGaba2c3be5 [2025-04-29 11:02:50,357 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d54cffb08/a9e8fab7142d4522b22463f1dc7852d5 [2025-04-29 11:02:50,359 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:02:50,360 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:02:50,364 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:02:50,364 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:02:50,367 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:02:50,368 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:02:50" (1/1) ... [2025-04-29 11:02:50,369 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e62bdf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:50, skipping insertion in model container [2025-04-29 11:02:50,369 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:02:50" (1/1) ... [2025-04-29 11:02:50,381 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:02:50,514 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:02:50,523 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:02:50,547 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:02:50,560 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:02:50,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:50 WrapperNode [2025-04-29 11:02:50,561 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:02:50,562 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:02:50,562 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:02:50,562 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:02:50,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:50" (1/1) ... [2025-04-29 11:02:50,580 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:50" (1/1) ... [2025-04-29 11:02:50,598 INFO L138 Inliner]: procedures = 18, calls = 27, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 99 [2025-04-29 11:02:50,599 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:02:50,600 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:02:50,600 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:02:50,600 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:02:50,606 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:50" (1/1) ... [2025-04-29 11:02:50,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:50" (1/1) ... [2025-04-29 11:02:50,609 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:50" (1/1) ... [2025-04-29 11:02:50,628 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [5, 7]. 58 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1, 0]. The 5 writes are split as follows [1, 4]. [2025-04-29 11:02:50,633 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:50" (1/1) ... [2025-04-29 11:02:50,634 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:50" (1/1) ... [2025-04-29 11:02:50,639 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:50" (1/1) ... [2025-04-29 11:02:50,639 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:50" (1/1) ... [2025-04-29 11:02:50,641 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:50" (1/1) ... [2025-04-29 11:02:50,642 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:50" (1/1) ... [2025-04-29 11:02:50,643 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:50" (1/1) ... [2025-04-29 11:02:50,650 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:02:50,652 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:02:50,652 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:02:50,652 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:02:50,653 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:50" (1/1) ... [2025-04-29 11:02:50,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:02:50,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:50,678 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-04-29 11:02:50,681 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-04-29 11:02:50,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:02:50,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 11:02:50,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 11:02:50,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 11:02:50,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 11:02:50,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:02:50,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 11:02:50,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:02:50,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-04-29 11:02:50,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-04-29 11:02:50,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:02:50,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:02:50,701 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-04-29 11:02:50,701 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-04-29 11:02:50,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:02:50,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-04-29 11:02:50,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-04-29 11:02:50,771 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:02:50,772 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:02:50,984 INFO L? ?]: Removed 46 outVars from TransFormulas that were not future-live. [2025-04-29 11:02:50,984 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:02:50,990 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:02:50,990 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:02:50,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:02:50 BoogieIcfgContainer [2025-04-29 11:02:50,991 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:02:50,992 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:02:50,992 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:02:50,995 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:02:50,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:02:50" (1/3) ... [2025-04-29 11:02:50,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d963e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:02:50, skipping insertion in model container [2025-04-29 11:02:50,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:50" (2/3) ... [2025-04-29 11:02:50,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d963e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:02:50, skipping insertion in model container [2025-04-29 11:02:50,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:02:50" (3/3) ... [2025-04-29 11:02:50,998 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal.c [2025-04-29 11:02:51,008 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:02:51,010 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_prepend_equal.c that has 2 procedures, 37 locations, 45 edges, 1 initial locations, 3 loop locations, and 6 error locations. [2025-04-29 11:02:51,050 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:02:51,058 INFO L340 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;@692a76ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:02:51,059 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-29 11:02:51,061 INFO L278 IsEmpty]: Start isEmpty. Operand has 37 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 33 states have internal predecessors, (39), 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-04-29 11:02:51,065 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-29 11:02:51,065 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:51,065 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:51,065 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:02:51,069 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:51,069 INFO L85 PathProgramCache]: Analyzing trace with hash 331807454, now seen corresponding path program 1 times [2025-04-29 11:02:51,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:02:51,078 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2000278643] [2025-04-29 11:02:51,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:51,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:51,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:51,081 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-04-29 11:02:51,082 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-04-29 11:02:51,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:02:51,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:02:51,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:51,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:51,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 11:02:51,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:51,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:51,218 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:02:51,218 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:02:51,218 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000278643] [2025-04-29 11:02:51,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000278643] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:51,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:51,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:02:51,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893532296] [2025-04-29 11:02:51,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:51,223 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:02:51,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:02:51,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:02:51,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:51,238 INFO L87 Difference]: Start difference. First operand has 37 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 33 states have internal predecessors, (39), 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) Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-04-29 11:02:51,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:51,289 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2025-04-29 11:02:51,290 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:02:51,292 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 11 [2025-04-29 11:02:51,292 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:51,295 INFO L225 Difference]: With dead ends: 63 [2025-04-29 11:02:51,296 INFO L226 Difference]: Without dead ends: 25 [2025-04-29 11:02:51,298 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:51,300 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:51,301 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 93 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:51,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-04-29 11:02:51,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-04-29 11:02:51,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 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-04-29 11:02:51,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2025-04-29 11:02:51,329 INFO L79 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 11 [2025-04-29 11:02:51,329 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:51,330 INFO L485 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2025-04-29 11:02:51,330 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-04-29 11:02:51,330 INFO L278 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2025-04-29 11:02:51,332 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-29 11:02:51,332 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:51,332 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:51,339 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-04-29 11:02:51,532 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:51,533 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:02:51,533 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:51,534 INFO L85 PathProgramCache]: Analyzing trace with hash -216854567, now seen corresponding path program 1 times [2025-04-29 11:02:51,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:02:51,535 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1515004744] [2025-04-29 11:02:51,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:51,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:51,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:51,537 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-04-29 11:02:51,539 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-04-29 11:02:51,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 11:02:51,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 11:02:51,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:51,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:51,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-29 11:02:51,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:51,769 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 11:02:51,791 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-04-29 11:02:51,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:02:51,802 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:02:51,803 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:02:51,803 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515004744] [2025-04-29 11:02:51,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515004744] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:51,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:51,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:02:51,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814728645] [2025-04-29 11:02:51,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:51,804 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:02:51,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:02:51,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:02:51,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:02:51,804 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:02:52,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:52,060 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2025-04-29 11:02:52,061 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:02:52,061 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2025-04-29 11:02:52,061 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:52,061 INFO L225 Difference]: With dead ends: 29 [2025-04-29 11:02:52,061 INFO L226 Difference]: Without dead ends: 26 [2025-04-29 11:02:52,062 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:02:52,062 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 10 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:52,064 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 126 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:02:52,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-04-29 11:02:52,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-04-29 11:02:52,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 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-04-29 11:02:52,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2025-04-29 11:02:52,067 INFO L79 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 25 [2025-04-29 11:02:52,067 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:52,067 INFO L485 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-04-29 11:02:52,068 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:02:52,068 INFO L278 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2025-04-29 11:02:52,068 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:02:52,068 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:52,069 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:52,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:02:52,269 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:52,269 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:02:52,270 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:52,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1867107441, now seen corresponding path program 1 times [2025-04-29 11:02:52,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:02:52,270 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1805687352] [2025-04-29 11:02:52,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:52,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:52,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:52,272 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-04-29 11:02:52,273 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-04-29 11:02:52,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:02:52,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:02:52,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:52,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:52,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 11:02:52,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:52,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 11:02:52,402 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:02:52,402 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:02:52,402 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805687352] [2025-04-29 11:02:52,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805687352] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:52,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:52,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:02:52,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364967203] [2025-04-29 11:02:52,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:52,403 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:02:52,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:02:52,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:02:52,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:52,405 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-04-29 11:02:52,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:52,428 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2025-04-29 11:02:52,428 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:02:52,428 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 26 [2025-04-29 11:02:52,429 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:52,430 INFO L225 Difference]: With dead ends: 30 [2025-04-29 11:02:52,430 INFO L226 Difference]: Without dead ends: 29 [2025-04-29 11:02:52,430 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:52,431 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:52,431 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:52,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-04-29 11:02:52,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-04-29 11:02:52,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 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-04-29 11:02:52,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2025-04-29 11:02:52,438 INFO L79 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 26 [2025-04-29 11:02:52,438 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:52,438 INFO L485 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2025-04-29 11:02:52,438 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-04-29 11:02:52,438 INFO L278 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2025-04-29 11:02:52,439 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 11:02:52,439 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:52,439 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:52,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 11:02:52,642 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:52,643 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:02:52,643 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:52,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1123611054, now seen corresponding path program 1 times [2025-04-29 11:02:52,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:02:52,643 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1364819218] [2025-04-29 11:02:52,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:52,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:52,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:52,646 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-04-29 11:02:52,647 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-04-29 11:02:52,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:02:52,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:02:52,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:52,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:52,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-29 11:02:52,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:52,769 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 11:02:52,769 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:02:52,769 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:02:52,770 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364819218] [2025-04-29 11:02:52,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364819218] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:52,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:52,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:02:52,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092895198] [2025-04-29 11:02:52,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:52,770 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:02:52,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:02:52,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:02:52,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:02:52,771 INFO L87 Difference]: Start difference. First operand 29 states and 31 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, (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-04-29 11:02:52,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:52,776 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2025-04-29 11:02:52,776 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:02:52,777 INFO L79 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, (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 29 [2025-04-29 11:02:52,777 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:52,777 INFO L225 Difference]: With dead ends: 29 [2025-04-29 11:02:52,777 INFO L226 Difference]: Without dead ends: 26 [2025-04-29 11:02:52,777 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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-04-29 11:02:52,778 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:52,778 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 31 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:52,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-04-29 11:02:52,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-04-29 11:02:52,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 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-04-29 11:02:52,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2025-04-29 11:02:52,781 INFO L79 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 29 [2025-04-29 11:02:52,782 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:52,782 INFO L485 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-04-29 11:02:52,782 INFO L486 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, (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-04-29 11:02:52,782 INFO L278 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2025-04-29 11:02:52,782 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:02:52,786 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:52,787 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:52,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 11:02:52,987 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:52,987 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:02:52,987 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:52,988 INFO L85 PathProgramCache]: Analyzing trace with hash -472539880, now seen corresponding path program 1 times [2025-04-29 11:02:52,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:02:52,988 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [403713287] [2025-04-29 11:02:52,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:52,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:52,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:52,990 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-04-29 11:02:52,991 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-04-29 11:02:53,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:02:53,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:02:53,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:53,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:53,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-29 11:02:53,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:53,104 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 11:02:53,106 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:02:53,176 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:02:53,176 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:02:53,176 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403713287] [2025-04-29 11:02:53,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403713287] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:02:53,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:02:53,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2025-04-29 11:02:53,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729796406] [2025-04-29 11:02:53,177 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:02:53,177 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:02:53,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:02:53,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:02:53,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:02:53,178 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-29 11:02:53,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:53,281 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2025-04-29 11:02:53,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:02:53,285 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2025-04-29 11:02:53,285 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:53,285 INFO L225 Difference]: With dead ends: 51 [2025-04-29 11:02:53,285 INFO L226 Difference]: Without dead ends: 33 [2025-04-29 11:02:53,286 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:02:53,286 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 139 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-04-29 11:02:53,286 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 139 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:02:53,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-04-29 11:02:53,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2025-04-29 11:02:53,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:02:53,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2025-04-29 11:02:53,294 INFO L79 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 30 [2025-04-29 11:02:53,294 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:53,294 INFO L485 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2025-04-29 11:02:53,294 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-29 11:02:53,294 INFO L278 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2025-04-29 11:02:53,294 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-29 11:02:53,295 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:53,295 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:53,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-29 11:02:53,495 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:53,495 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:02:53,496 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:53,496 INFO L85 PathProgramCache]: Analyzing trace with hash 738756450, now seen corresponding path program 2 times [2025-04-29 11:02:53,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:02:53,496 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [942284967] [2025-04-29 11:02:53,496 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:02:53,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:53,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:53,498 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-04-29 11:02:53,498 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-04-29 11:02:53,562 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-29 11:02:53,643 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 11:02:53,643 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:02:53,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:53,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:02:53,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:53,679 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 11:02:53,680 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:02:53,747 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 11:02:53,747 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:02:53,747 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942284967] [2025-04-29 11:02:53,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942284967] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:02:53,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:02:53,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-04-29 11:02:53,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059144785] [2025-04-29 11:02:53,748 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:02:53,748 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:02:53,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:02:53,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:02:53,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:02:53,749 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 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-04-29 11:02:53,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:53,810 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2025-04-29 11:02:53,810 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:02:53,810 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 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 40 [2025-04-29 11:02:53,810 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:53,811 INFO L225 Difference]: With dead ends: 44 [2025-04-29 11:02:53,811 INFO L226 Difference]: Without dead ends: 43 [2025-04-29 11:02:53,811 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:02:53,812 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:53,812 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:53,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-04-29 11:02:53,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-04-29 11:02:53,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:02:53,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2025-04-29 11:02:53,824 INFO L79 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 40 [2025-04-29 11:02:53,824 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:53,824 INFO L485 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2025-04-29 11:02:53,824 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 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-04-29 11:02:53,824 INFO L278 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2025-04-29 11:02:53,825 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-04-29 11:02:53,825 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:53,825 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:53,833 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-04-29 11:02:54,026 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:54,026 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:02:54,027 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:54,027 INFO L85 PathProgramCache]: Analyzing trace with hash -279194281, now seen corresponding path program 3 times [2025-04-29 11:02:54,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:02:54,027 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [767123235] [2025-04-29 11:02:54,027 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:02:54,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:54,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:54,042 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-04-29 11:02:54,043 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-04-29 11:02:54,122 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 5 equivalence classes. [2025-04-29 11:02:57,153 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 52 of 52 statements. [2025-04-29 11:02:57,153 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-29 11:02:57,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:57,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-29 11:02:57,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:57,277 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 11:02:57,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:02:57,537 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 11:02:57,537 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:02:57,537 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767123235] [2025-04-29 11:02:57,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767123235] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:02:57,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:02:57,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2025-04-29 11:02:57,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175394048] [2025-04-29 11:02:57,538 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:02:57,538 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-29 11:02:57,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:02:57,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-29 11:02:57,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2025-04-29 11:02:57,539 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 22 states, 21 states have (on average 2.619047619047619) internal successors, (55), 22 states have internal predecessors, (55), 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-04-29 11:02:57,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:57,944 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2025-04-29 11:02:57,944 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-29 11:02:57,944 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.619047619047619) internal successors, (55), 22 states have internal predecessors, (55), 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 52 [2025-04-29 11:02:57,945 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:57,945 INFO L225 Difference]: With dead ends: 68 [2025-04-29 11:02:57,945 INFO L226 Difference]: Without dead ends: 67 [2025-04-29 11:02:57,945 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=683, Unknown=0, NotChecked=0, Total=870 [2025-04-29 11:02:57,946 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:57,946 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 266 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:02:57,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-04-29 11:02:57,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-04-29 11:02:57,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:02:57,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2025-04-29 11:02:57,952 INFO L79 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 52 [2025-04-29 11:02:57,952 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:57,952 INFO L485 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2025-04-29 11:02:57,953 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.619047619047619) internal successors, (55), 22 states have internal predecessors, (55), 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-04-29 11:02:57,953 INFO L278 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2025-04-29 11:02:57,953 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-04-29 11:02:57,953 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:57,953 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:57,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-29 11:02:58,154 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:58,154 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:02:58,154 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:58,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1103177023, now seen corresponding path program 4 times [2025-04-29 11:02:58,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:02:58,155 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1092230468] [2025-04-29 11:02:58,155 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:02:58,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:58,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:58,157 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-04-29 11:02:58,158 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-04-29 11:02:58,224 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 76 statements into 2 equivalence classes. [2025-04-29 11:02:58,274 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 50 of 76 statements. [2025-04-29 11:02:58,275 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 11:02:58,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:58,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 88 conjuncts are in the unsatisfiable core [2025-04-29 11:02:58,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:58,311 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-04-29 11:02:58,381 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:02:58,393 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:02:58,588 INFO L325 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2025-04-29 11:02:58,588 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2025-04-29 11:02:58,600 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-29 11:02:58,609 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-29 11:02:58,663 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-29 11:02:58,673 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-04-29 11:02:58,933 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-29 11:02:58,934 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 29 [2025-04-29 11:02:58,943 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-04-29 11:02:58,951 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-04-29 11:03:07,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:03:07,205 INFO L325 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-04-29 11:03:07,205 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 53 [2025-04-29 11:03:07,232 INFO L325 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2025-04-29 11:03:07,232 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2025-04-29 11:03:07,250 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2025-04-29 11:03:07,414 INFO L325 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-04-29 11:03:07,415 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2025-04-29 11:03:07,453 INFO L325 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2025-04-29 11:03:07,453 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 63 [2025-04-29 11:03:07,464 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 69 [2025-04-29 11:03:07,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:03:07,485 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2025-04-29 11:03:07,603 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 80 [2025-04-29 11:03:08,387 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 107 proven. 30 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-04-29 11:03:08,387 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:03:09,817 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:03:09,818 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 423 treesize of output 385 [2025-04-29 11:03:09,845 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:03:09,845 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 374 treesize of output 336 [2025-04-29 11:03:13,017 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:03:13,017 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092230468] [2025-04-29 11:03:13,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092230468] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:03:13,017 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1896397675] [2025-04-29 11:03:13,017 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:03:13,017 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-04-29 11:03:13,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-04-29 11:03:13,041 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-04-29 11:03:13,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2025-04-29 11:03:13,133 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 76 statements into 2 equivalence classes. [2025-04-29 11:03:13,375 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 50 of 76 statements. [2025-04-29 11:03:13,375 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 11:03:13,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:13,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 88 conjuncts are in the unsatisfiable core [2025-04-29 11:03:13,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:03:13,491 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-04-29 11:03:13,628 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:03:13,632 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:03:13,878 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:03:13,878 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-04-29 11:03:13,913 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:03:13,913 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-04-29 11:03:13,942 INFO L325 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2025-04-29 11:03:13,942 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2025-04-29 11:03:14,117 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-04-29 11:03:14,132 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-29 11:03:14,696 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-29 11:03:14,696 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 29 [2025-04-29 11:03:14,702 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-04-29 11:03:14,707 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 Killed by 15