./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-zilu/benchmark01_conjunctive.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-zilu/benchmark01_conjunctive.i -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 1b503f9744330c40db60063d7713649b00b515fae7df517a0a6da071e866822e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 15:00:49,670 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:00:49,720 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 15:00:49,726 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:00:49,726 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:00:49,746 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:00:49,746 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:00:49,746 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:00:49,747 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:00:49,748 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:00:49,748 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:00:49,748 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:00:49,748 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:00:49,749 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:00:49,749 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:00:49,749 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:00:49,749 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:00:49,749 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 15:00:49,749 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:00:49,749 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 15:00:49,749 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:00:49,749 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:00:49,749 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:00:49,749 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:00:49,749 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:00:49,750 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:00:49,750 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 15:00:49,750 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:00:49,750 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:00:49,750 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:00:49,750 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:00:49,750 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:00:49,750 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:00:49,750 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:00:49,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:00:49,750 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:00:49,750 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:00:49,750 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:00:49,750 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:00:49,750 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:00:49,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:00:49,750 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:00:49,750 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:00:49,751 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:00:49,751 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:00:49,751 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 -> 1b503f9744330c40db60063d7713649b00b515fae7df517a0a6da071e866822e [2025-03-17 15:00:49,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:00:49,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:00:49,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:00:49,999 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:00:49,999 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:00:50,000 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-zilu/benchmark01_conjunctive.i [2025-03-17 15:00:51,139 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/080438adc/70f1c5cd21ec41e382c1af3ad84e1804/FLAG9ca389847 [2025-03-17 15:00:51,325 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:00:51,325 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark01_conjunctive.i [2025-03-17 15:00:51,347 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/080438adc/70f1c5cd21ec41e382c1af3ad84e1804/FLAG9ca389847 [2025-03-17 15:00:51,361 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/080438adc/70f1c5cd21ec41e382c1af3ad84e1804 [2025-03-17 15:00:51,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:00:51,365 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:00:51,366 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:00:51,366 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:00:51,371 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:00:51,372 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:00:51" (1/1) ... [2025-03-17 15:00:51,374 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f96c3f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:51, skipping insertion in model container [2025-03-17 15:00:51,374 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:00:51" (1/1) ... [2025-03-17 15:00:51,385 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:00:51,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:00:51,480 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:00:51,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:00:51,500 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:00:51,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:51 WrapperNode [2025-03-17 15:00:51,500 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:00:51,501 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:00:51,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:00:51,501 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:00:51,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:51" (1/1) ... [2025-03-17 15:00:51,510 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:51" (1/1) ... [2025-03-17 15:00:51,522 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 38 [2025-03-17 15:00:51,523 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:00:51,523 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:00:51,523 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:00:51,523 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:00:51,530 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:51" (1/1) ... [2025-03-17 15:00:51,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:51" (1/1) ... [2025-03-17 15:00:51,531 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:51" (1/1) ... [2025-03-17 15:00:51,537 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 15:00:51,537 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:51" (1/1) ... [2025-03-17 15:00:51,537 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:51" (1/1) ... [2025-03-17 15:00:51,539 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:51" (1/1) ... [2025-03-17 15:00:51,540 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:51" (1/1) ... [2025-03-17 15:00:51,540 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:51" (1/1) ... [2025-03-17 15:00:51,540 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:51" (1/1) ... [2025-03-17 15:00:51,541 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:00:51,542 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:00:51,542 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:00:51,542 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:00:51,543 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:51" (1/1) ... [2025-03-17 15:00:51,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:00:51,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:00:51,569 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 15:00:51,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 15:00:51,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:00:51,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:00:51,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:00:51,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:00:51,637 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:00:51,638 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:00:51,725 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 15:00:51,725 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:00:51,732 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:00:51,732 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:00:51,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:00:51 BoogieIcfgContainer [2025-03-17 15:00:51,732 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:00:51,734 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:00:51,734 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:00:51,737 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:00:51,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:00:51" (1/3) ... [2025-03-17 15:00:51,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37232a05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:00:51, skipping insertion in model container [2025-03-17 15:00:51,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:51" (2/3) ... [2025-03-17 15:00:51,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37232a05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:00:51, skipping insertion in model container [2025-03-17 15:00:51,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:00:51" (3/3) ... [2025-03-17 15:00:51,739 INFO L128 eAbstractionObserver]: Analyzing ICFG benchmark01_conjunctive.i [2025-03-17 15:00:51,749 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:00:51,751 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG benchmark01_conjunctive.i that has 1 procedures, 16 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-03-17 15:00:51,790 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:00:51,800 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@229974fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:00:51,800 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-17 15:00:51,807 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:00:51,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 15:00:51,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:51,811 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 15:00:51,811 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-17 15:00:51,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:51,815 INFO L85 PathProgramCache]: Analyzing trace with hash 47680430, now seen corresponding path program 1 times [2025-03-17 15:00:51,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:51,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661068707] [2025-03-17 15:00:51,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:00:51,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:51,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 15:00:51,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 15:00:51,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:51,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:51,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:51,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:51,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661068707] [2025-03-17 15:00:51,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661068707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:00:51,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:00:51,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:00:51,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397956756] [2025-03-17 15:00:51,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:00:51,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:00:51,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:51,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:00:51,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:00:51,975 INFO L87 Difference]: Start difference. First operand has 16 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:00:52,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:52,003 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2025-03-17 15:00:52,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:00:52,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 15:00:52,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:52,009 INFO L225 Difference]: With dead ends: 23 [2025-03-17 15:00:52,009 INFO L226 Difference]: Without dead ends: 7 [2025-03-17 15:00:52,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:00:52,013 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:52,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 15 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:00:52,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2025-03-17 15:00:52,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2025-03-17 15:00:52,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:00:52,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2025-03-17 15:00:52,032 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2025-03-17 15:00:52,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:52,033 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2025-03-17 15:00:52,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:00:52,033 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2025-03-17 15:00:52,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 15:00:52,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:52,033 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 15:00:52,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 15:00:52,034 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-17 15:00:52,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:52,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1478093309, now seen corresponding path program 1 times [2025-03-17 15:00:52,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:52,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917953220] [2025-03-17 15:00:52,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:00:52,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:52,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 15:00:52,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 15:00:52,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:52,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:52,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:52,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:52,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917953220] [2025-03-17 15:00:52,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917953220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:00:52,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:00:52,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:00:52,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790827242] [2025-03-17 15:00:52,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:00:52,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:00:52,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:52,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:00:52,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:00:52,092 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:00:52,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:52,104 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2025-03-17 15:00:52,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:00:52,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 15:00:52,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:52,104 INFO L225 Difference]: With dead ends: 12 [2025-03-17 15:00:52,104 INFO L226 Difference]: Without dead ends: 11 [2025-03-17 15:00:52,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:00:52,106 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:52,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:00:52,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-03-17 15:00:52,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-03-17 15:00:52,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:00:52,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-03-17 15:00:52,108 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 6 [2025-03-17 15:00:52,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:52,109 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-03-17 15:00:52,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:00:52,109 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-03-17 15:00:52,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 15:00:52,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:52,109 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2025-03-17 15:00:52,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 15:00:52,110 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-17 15:00:52,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:52,110 INFO L85 PathProgramCache]: Analyzing trace with hash -2065461319, now seen corresponding path program 1 times [2025-03-17 15:00:52,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:52,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81428838] [2025-03-17 15:00:52,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:00:52,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:52,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 15:00:52,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 15:00:52,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:52,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:52,199 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:52,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:52,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81428838] [2025-03-17 15:00:52,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81428838] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:00:52,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181742759] [2025-03-17 15:00:52,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:00:52,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:00:52,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:00:52,203 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:00:52,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 15:00:52,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 15:00:52,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 15:00:52,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:52,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:52,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:00:52,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:00:52,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:52,330 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:00:52,383 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:52,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181742759] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:00:52,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:00:52,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-03-17 15:00:52,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568819030] [2025-03-17 15:00:52,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:00:52,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 15:00:52,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:52,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 15:00:52,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:00:52,385 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:00:52,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:52,425 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2025-03-17 15:00:52,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:00:52,425 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-17 15:00:52,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:52,425 INFO L225 Difference]: With dead ends: 24 [2025-03-17 15:00:52,425 INFO L226 Difference]: Without dead ends: 23 [2025-03-17 15:00:52,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:00:52,426 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:52,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:00:52,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-17 15:00:52,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-17 15:00:52,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:00:52,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2025-03-17 15:00:52,432 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 10 [2025-03-17 15:00:52,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:52,432 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2025-03-17 15:00:52,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:00:52,433 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2025-03-17 15:00:52,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 15:00:52,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:52,433 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1] [2025-03-17 15:00:52,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 15:00:52,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:00:52,636 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-17 15:00:52,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:52,636 INFO L85 PathProgramCache]: Analyzing trace with hash 2029325549, now seen corresponding path program 2 times [2025-03-17 15:00:52,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:52,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650655180] [2025-03-17 15:00:52,637 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:00:52,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:52,646 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-17 15:00:52,670 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 15:00:52,671 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:00:52,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:52,855 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:52,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:52,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650655180] [2025-03-17 15:00:52,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650655180] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:00:52,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115024612] [2025-03-17 15:00:52,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:00:52,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:00:52,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:00:52,857 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:00:52,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 15:00:52,894 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-17 15:00:52,907 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 15:00:52,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:00:52,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:52,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 15:00:52,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:00:53,038 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:53,039 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:00:53,126 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:53,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115024612] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:00:53,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:00:53,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-03-17 15:00:53,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84335669] [2025-03-17 15:00:53,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:00:53,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 15:00:53,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:53,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 15:00:53,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=153, Unknown=0, NotChecked=0, Total=272 [2025-03-17 15:00:53,128 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 17 states, 16 states have (on average 4.0) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:00:53,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:53,173 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2025-03-17 15:00:53,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 15:00:53,173 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.0) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-17 15:00:53,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:53,173 INFO L225 Difference]: With dead ends: 48 [2025-03-17 15:00:53,173 INFO L226 Difference]: Without dead ends: 47 [2025-03-17 15:00:53,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=170, Unknown=0, NotChecked=0, Total=306 [2025-03-17 15:00:53,175 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:53,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:00:53,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-17 15:00:53,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-17 15:00:53,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:00:53,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2025-03-17 15:00:53,179 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 22 [2025-03-17 15:00:53,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:53,179 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2025-03-17 15:00:53,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.0) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:00:53,179 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2025-03-17 15:00:53,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-17 15:00:53,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:53,180 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 1, 1, 1] [2025-03-17 15:00:53,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 15:00:53,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-17 15:00:53,382 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-17 15:00:53,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:53,382 INFO L85 PathProgramCache]: Analyzing trace with hash -926253739, now seen corresponding path program 3 times [2025-03-17 15:00:53,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:53,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487288470] [2025-03-17 15:00:53,383 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:00:53,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:53,390 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 11 equivalence classes. [2025-03-17 15:00:53,433 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 15:00:53,435 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 15:00:53,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:53,692 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:53,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:53,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487288470] [2025-03-17 15:00:53,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487288470] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:00:53,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514152052] [2025-03-17 15:00:53,693 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:00:53,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:00:53,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:00:53,695 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:00:53,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 15:00:53,721 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 11 equivalence classes. [2025-03-17 15:00:53,744 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 15:00:53,744 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 15:00:53,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:53,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 15:00:53,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:00:54,044 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:54,044 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:00:54,314 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:54,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514152052] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:00:54,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:00:54,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2025-03-17 15:00:54,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041028252] [2025-03-17 15:00:54,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:00:54,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-17 15:00:54,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:54,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-17 15:00:54,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=542, Invalid=648, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 15:00:54,321 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand has 35 states, 34 states have (on average 4.0) internal successors, (136), 35 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:00:54,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:54,424 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2025-03-17 15:00:54,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 15:00:54,425 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 4.0) internal successors, (136), 35 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-03-17 15:00:54,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:54,426 INFO L225 Difference]: With dead ends: 96 [2025-03-17 15:00:54,426 INFO L226 Difference]: Without dead ends: 95 [2025-03-17 15:00:54,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=577, Invalid=683, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 15:00:54,427 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:54,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:00:54,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-17 15:00:54,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-17 15:00:54,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.0106382978723405) internal successors, (95), 94 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:00:54,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2025-03-17 15:00:54,451 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 46 [2025-03-17 15:00:54,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:54,451 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2025-03-17 15:00:54,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 4.0) internal successors, (136), 35 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:00:54,451 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2025-03-17 15:00:54,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 15:00:54,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:54,453 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 22, 1, 1, 1] [2025-03-17 15:00:54,459 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-03-17 15:00:54,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:00:54,658 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-17 15:00:54,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:54,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1946891813, now seen corresponding path program 4 times [2025-03-17 15:00:54,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:54,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975650064] [2025-03-17 15:00:54,659 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 15:00:54,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:54,670 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 94 statements into 2 equivalence classes. [2025-03-17 15:00:54,694 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 15:00:54,694 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 15:00:54,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:55,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 1012 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:55,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:55,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975650064] [2025-03-17 15:00:55,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975650064] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:00:55,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397732599] [2025-03-17 15:00:55,756 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 15:00:55,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:00:55,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:00:55,760 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:00:55,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 15:00:55,792 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 94 statements into 2 equivalence classes. [2025-03-17 15:00:55,818 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 15:00:55,818 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 15:00:55,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:55,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-17 15:00:55,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:00:56,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 1012 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:56,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:00:57,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 1012 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:57,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397732599] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:00:57,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:00:57,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 70 [2025-03-17 15:00:57,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396393991] [2025-03-17 15:00:57,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:00:57,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2025-03-17 15:00:57,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:57,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2025-03-17 15:00:57,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1926, Invalid=3044, Unknown=0, NotChecked=0, Total=4970 [2025-03-17 15:00:57,702 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand has 71 states, 70 states have (on average 4.0) internal successors, (280), 71 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:00:57,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:57,840 INFO L93 Difference]: Finished difference Result 128 states and 135 transitions. [2025-03-17 15:00:57,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-17 15:00:57,840 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 70 states have (on average 4.0) internal successors, (280), 71 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-17 15:00:57,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:57,841 INFO L225 Difference]: With dead ends: 128 [2025-03-17 15:00:57,841 INFO L226 Difference]: Without dead ends: 127 [2025-03-17 15:00:57,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1997, Invalid=3115, Unknown=0, NotChecked=0, Total=5112 [2025-03-17 15:00:57,843 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:57,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:00:57,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-17 15:00:57,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-03-17 15:00:57,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.007936507936508) internal successors, (127), 126 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:00:57,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2025-03-17 15:00:57,857 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 94 [2025-03-17 15:00:57,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:57,857 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2025-03-17 15:00:57,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 70 states have (on average 4.0) internal successors, (280), 71 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:00:57,857 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2025-03-17 15:00:57,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 15:00:57,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:57,859 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 30, 1, 1, 1] [2025-03-17 15:00:57,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 15:00:58,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:00:58,064 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-17 15:00:58,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:58,065 INFO L85 PathProgramCache]: Analyzing trace with hash -2147288059, now seen corresponding path program 5 times [2025-03-17 15:00:58,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:58,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848669866] [2025-03-17 15:00:58,065 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 15:00:58,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:58,076 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 126 statements into 31 equivalence classes. [2025-03-17 15:00:58,222 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 15:00:58,223 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2025-03-17 15:00:58,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 15:00:58,223 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 15:00:58,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 15:00:58,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 15:00:58,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:58,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 15:00:58,287 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 15:00:58,288 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 15:00:58,288 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2025-03-17 15:00:58,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2025-03-17 15:00:58,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 15:00:58,292 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1] [2025-03-17 15:00:58,322 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 15:00:58,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:00:58 BoogieIcfgContainer [2025-03-17 15:00:58,324 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 15:00:58,324 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 15:00:58,324 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 15:00:58,324 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 15:00:58,327 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:00:51" (3/4) ... [2025-03-17 15:00:58,328 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-17 15:00:58,370 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 64. [2025-03-17 15:00:58,441 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 15:00:58,444 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 15:00:58,444 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 15:00:58,445 INFO L158 Benchmark]: Toolchain (without parser) took 7079.94ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 124.0MB in the beginning and 59.1MB in the end (delta: 64.9MB). Peak memory consumption was 92.8MB. Max. memory is 16.1GB. [2025-03-17 15:00:58,445 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:00:58,445 INFO L158 Benchmark]: CACSL2BoogieTranslator took 135.03ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 113.6MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:00:58,445 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.54ms. Allocated memory is still 167.8MB. Free memory was 113.6MB in the beginning and 112.7MB in the end (delta: 911.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:00:58,445 INFO L158 Benchmark]: Boogie Preprocessor took 18.04ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 111.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:00:58,445 INFO L158 Benchmark]: IcfgBuilder took 190.63ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 101.1MB in the end (delta: 10.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 15:00:58,446 INFO L158 Benchmark]: TraceAbstraction took 6589.51ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 100.6MB in the beginning and 67.5MB in the end (delta: 33.1MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. [2025-03-17 15:00:58,446 INFO L158 Benchmark]: Witness Printer took 120.11ms. Allocated memory is still 201.3MB. Free memory was 67.5MB in the beginning and 59.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:00:58,447 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.16ms. Allocated memory is still 201.3MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 135.03ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 113.6MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.54ms. Allocated memory is still 167.8MB. Free memory was 113.6MB in the beginning and 112.7MB in the end (delta: 911.2kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.04ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 111.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 190.63ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 101.1MB in the end (delta: 10.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6589.51ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 100.6MB in the beginning and 67.5MB in the end (delta: 33.1MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. * Witness Printer took 120.11ms. Allocated memory is still 201.3MB. Free memory was 67.5MB in the beginning and 59.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 24]: integer overflow possible integer overflow possible We found a FailurePath: [L20] int x = __VERIFIER_nondet_int(); [L21] int y = __VERIFIER_nondet_int(); [L22] COND FALSE !(!(x==1 && y==1)) VAL [x=1, y=1] [L23] COND TRUE __VERIFIER_nondet_bool() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=2, y=2] [L23] COND TRUE __VERIFIER_nondet_bool() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=4, y=4] [L23] COND TRUE __VERIFIER_nondet_bool() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=8, y=8] [L23] COND TRUE __VERIFIER_nondet_bool() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=16, y=16] [L23] COND TRUE __VERIFIER_nondet_bool() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=32, y=32] [L23] COND TRUE __VERIFIER_nondet_bool() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=64, y=64] [L23] COND TRUE __VERIFIER_nondet_bool() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=128, y=128] [L23] COND TRUE __VERIFIER_nondet_bool() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=256, y=256] [L23] COND TRUE __VERIFIER_nondet_bool() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=512, y=512] [L23] COND TRUE __VERIFIER_nondet_bool() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=1024, y=1024] [L23] COND TRUE __VERIFIER_nondet_bool() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=2048, y=2048] [L23] COND TRUE __VERIFIER_nondet_bool() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=4096, y=4096] [L23] COND TRUE __VERIFIER_nondet_bool() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=8192, y=8192] [L23] COND TRUE __VERIFIER_nondet_bool() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=16384, y=16384] [L23] COND TRUE __VERIFIER_nondet_bool() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=32768, y=32768] [L23] COND TRUE __VERIFIER_nondet_bool() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=65536, y=65536] [L23] COND TRUE __VERIFIER_nondet_bool() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=131072, y=131072] [L23] COND TRUE __VERIFIER_nondet_bool() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=262144, y=262144] [L23] COND TRUE __VERIFIER_nondet_bool() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=524288, y=524288] [L23] COND TRUE __VERIFIER_nondet_bool() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=1048576, y=1048576] [L23] COND TRUE __VERIFIER_nondet_bool() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=2097152, y=2097152] [L23] COND TRUE __VERIFIER_nondet_bool() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=4194304, y=4194304] [L23] COND TRUE __VERIFIER_nondet_bool() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=8388608, y=8388608] [L23] COND TRUE __VERIFIER_nondet_bool() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=16777216, y=16777216] [L23] COND TRUE __VERIFIER_nondet_bool() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=33554432, y=33554432] [L23] COND TRUE __VERIFIER_nondet_bool() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=67108864, y=67108864] [L23] COND TRUE __VERIFIER_nondet_bool() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=134217728, y=134217728] [L23] COND TRUE __VERIFIER_nondet_bool() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=268435456, y=268435456] [L23] COND TRUE __VERIFIER_nondet_bool() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=536870912, y=536870912] [L23] COND TRUE __VERIFIER_nondet_bool() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=1073741824, y=1073741824] [L23] COND TRUE __VERIFIER_nondet_bool() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] x+y - UnprovableResult [Line: 24]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 20 edges, 2 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 7, TraceHistogramMax: 31, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 224 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 188 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 235 IncrementalHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 36 mSDtfsCounter, 235 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 389 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1250 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=6, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 481 NumberOfCodeBlocks, 481 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 513 ConstructedInterpolants, 0 QuantifiedInterpolants, 3061 SizeOfPredicates, 8 NumberOfNonLiveVariables, 412 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 0/3828 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-17 15:00:58,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)