./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/loop-zilu/benchmark04_conjunctive.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/loop-zilu/benchmark04_conjunctive.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0f05c589421d8e3d6b7f849625b36aa3dbfd97a1290fcfe4bd84327e66cb8d62 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:02:38,550 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:02:38,591 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-04-29 11:02:38,594 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:02:38,594 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:02:38,628 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:02:38,628 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:02:38,628 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:02:38,629 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:02:38,629 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:02:38,629 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:02:38,629 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:02:38,629 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:02:38,629 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:02:38,629 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:02:38,629 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:02:38,630 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:02:38,630 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:02:38,630 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:02:38,630 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:02:38,630 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:02:38,630 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:02:38,630 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:02:38,630 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:02:38,630 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-29 11:02:38,630 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:02:38,630 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:02:38,630 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:02:38,630 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:02:38,631 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:02:38,631 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:02:38,631 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:02:38,631 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:02:38,631 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:02:38,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:02:38,631 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:02:38,631 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:02:38,631 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:02:38,631 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:02:38,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:02:38,631 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:02:38,631 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:02:38,632 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:02:38,632 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:02:38,632 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:02:38,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:02:38,632 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:02:38,632 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:02:38,632 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:02:38,632 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 -> 0f05c589421d8e3d6b7f849625b36aa3dbfd97a1290fcfe4bd84327e66cb8d62 [2025-04-29 11:02:38,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:02:38,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:02:38,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:02:38,865 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:02:38,865 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:02:38,866 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark04_conjunctive.c [2025-04-29 11:02:40,170 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1cc2d5b6/37b58c3597ff4a9a84feda6722222d70/FLAGdf34c83b4 [2025-04-29 11:02:40,367 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:02:40,367 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark04_conjunctive.c [2025-04-29 11:02:40,373 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:02:40,380 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1cc2d5b6/37b58c3597ff4a9a84feda6722222d70/FLAGdf34c83b4 [2025-04-29 11:02:41,221 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1cc2d5b6/37b58c3597ff4a9a84feda6722222d70 [2025-04-29 11:02:41,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:02:41,225 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:02:41,226 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:02:41,226 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:02:41,229 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:02:41,231 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:02:41" (1/1) ... [2025-04-29 11:02:41,232 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5edc8287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:41, skipping insertion in model container [2025-04-29 11:02:41,232 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:02:41" (1/1) ... [2025-04-29 11:02:41,243 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:02:41,402 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:02:41,406 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:02:41,428 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:02:41,439 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:02:41,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:41 WrapperNode [2025-04-29 11:02:41,441 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:02:41,442 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:02:41,442 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:02:41,442 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:02:41,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:41" (1/1) ... [2025-04-29 11:02:41,453 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:41" (1/1) ... [2025-04-29 11:02:41,466 INFO L138 Inliner]: procedures = 7, calls = 4, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 39 [2025-04-29 11:02:41,467 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:02:41,467 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:02:41,467 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:02:41,467 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:02:41,473 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:41" (1/1) ... [2025-04-29 11:02:41,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:41" (1/1) ... [2025-04-29 11:02:41,475 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:41" (1/1) ... [2025-04-29 11:02:41,483 INFO L175 MemorySlicer]: No memory access in input program. [2025-04-29 11:02:41,483 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:41" (1/1) ... [2025-04-29 11:02:41,483 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:41" (1/1) ... [2025-04-29 11:02:41,485 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:41" (1/1) ... [2025-04-29 11:02:41,485 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:41" (1/1) ... [2025-04-29 11:02:41,488 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:41" (1/1) ... [2025-04-29 11:02:41,489 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:41" (1/1) ... [2025-04-29 11:02:41,489 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:41" (1/1) ... [2025-04-29 11:02:41,491 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:02:41,495 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:02:41,495 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:02:41,496 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:02:41,496 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:41" (1/1) ... [2025-04-29 11:02:41,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:02:41,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:41,521 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:02:41,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:02:41,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:02:41,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:02:41,576 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:02:41,578 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:02:41,662 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-04-29 11:02:41,662 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:02:41,667 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:02:41,668 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-29 11:02:41,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:02:41 BoogieIcfgContainer [2025-04-29 11:02:41,668 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:02:41,671 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:02:41,671 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:02:41,675 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:02:41,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:02:41" (1/3) ... [2025-04-29 11:02:41,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7929716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:02:41, skipping insertion in model container [2025-04-29 11:02:41,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:41" (2/3) ... [2025-04-29 11:02:41,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7929716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:02:41, skipping insertion in model container [2025-04-29 11:02:41,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:02:41" (3/3) ... [2025-04-29 11:02:41,676 INFO L128 eAbstractionObserver]: Analyzing ICFG benchmark04_conjunctive.c [2025-04-29 11:02:41,686 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:02:41,687 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG benchmark04_conjunctive.c that has 1 procedures, 24 locations, 27 edges, 1 initial locations, 1 loop locations, and 6 error locations. [2025-04-29 11:02:41,734 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:02:41,742 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@143284b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:02:41,743 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-29 11:02:41,745 INFO L278 IsEmpty]: Start isEmpty. Operand has 24 states, 17 states have (on average 1.588235294117647) internal successors, (27), 23 states have internal predecessors, (27), 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-04-29 11:02:41,749 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-04-29 11:02:41,749 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:41,750 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-04-29 11:02:41,750 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:02:41,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:41,754 INFO L85 PathProgramCache]: Analyzing trace with hash 925671, now seen corresponding path program 1 times [2025-04-29 11:02:41,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:41,760 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866456507] [2025-04-29 11:02:41,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:41,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:41,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-29 11:02:41,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-29 11:02:41,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:41,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:41,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:41,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:41,876 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866456507] [2025-04-29 11:02:41,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866456507] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:41,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:41,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:02:41,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366546842] [2025-04-29 11:02:41,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:41,881 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:02:41,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:41,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:02:41,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:02:41,896 INFO L87 Difference]: Start difference. First operand has 24 states, 17 states have (on average 1.588235294117647) internal successors, (27), 23 states have internal predecessors, (27), 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.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:41,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:41,924 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2025-04-29 11:02:41,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:02:41,926 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-04-29 11:02:41,926 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:41,931 INFO L225 Difference]: With dead ends: 30 [2025-04-29 11:02:41,931 INFO L226 Difference]: Without dead ends: 16 [2025-04-29 11:02:41,933 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:02:41,937 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:41,938 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 23 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:41,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-04-29 11:02:41,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-04-29 11:02:41,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 15 states have internal predecessors, (16), 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-04-29 11:02:41,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2025-04-29 11:02:41,964 INFO L79 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 4 [2025-04-29 11:02:41,965 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:41,965 INFO L485 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2025-04-29 11:02:41,965 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:41,965 INFO L278 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2025-04-29 11:02:41,965 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-29 11:02:41,965 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:41,965 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-29 11:02:41,965 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:02:41,966 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:02:41,966 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:41,966 INFO L85 PathProgramCache]: Analyzing trace with hash 28695845, now seen corresponding path program 1 times [2025-04-29 11:02:41,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:41,967 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361736063] [2025-04-29 11:02:41,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:41,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:41,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-29 11:02:41,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-29 11:02:41,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:41,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:42,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:42,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:42,008 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361736063] [2025-04-29 11:02:42,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361736063] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:42,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:42,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:02:42,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158085020] [2025-04-29 11:02:42,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:42,009 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:02:42,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:42,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:02:42,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:02:42,010 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. 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-04-29 11:02:42,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:42,026 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2025-04-29 11:02:42,027 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:02:42,027 INFO L79 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-04-29 11:02:42,027 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:42,028 INFO L225 Difference]: With dead ends: 16 [2025-04-29 11:02:42,028 INFO L226 Difference]: Without dead ends: 15 [2025-04-29 11:02:42,028 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:02:42,028 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:42,029 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 12 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:42,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-04-29 11:02:42,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-04-29 11:02:42,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 14 states have internal predecessors, (15), 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-04-29 11:02:42,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2025-04-29 11:02:42,033 INFO L79 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 5 [2025-04-29 11:02:42,033 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:42,033 INFO L485 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2025-04-29 11:02:42,033 INFO L486 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-04-29 11:02:42,033 INFO L278 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2025-04-29 11:02:42,033 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-29 11:02:42,033 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:42,033 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:42,034 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:02:42,034 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:02:42,034 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:42,034 INFO L85 PathProgramCache]: Analyzing trace with hash 179473292, now seen corresponding path program 1 times [2025-04-29 11:02:42,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:42,034 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84827930] [2025-04-29 11:02:42,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:42,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:42,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:02:42,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:02:42,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:42,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:42,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:42,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:42,092 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84827930] [2025-04-29 11:02:42,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84827930] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:42,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:42,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:02:42,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903591075] [2025-04-29 11:02:42,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:42,092 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:02:42,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:42,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:02:42,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:42,093 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:42,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:42,116 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2025-04-29 11:02:42,117 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:02:42,118 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-04-29 11:02:42,118 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:42,118 INFO L225 Difference]: With dead ends: 15 [2025-04-29 11:02:42,118 INFO L226 Difference]: Without dead ends: 14 [2025-04-29 11:02:42,118 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:42,119 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 5 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:42,119 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 18 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:42,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-04-29 11:02:42,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-04-29 11:02:42,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 13 states have internal predecessors, (14), 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-04-29 11:02:42,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2025-04-29 11:02:42,122 INFO L79 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 8 [2025-04-29 11:02:42,122 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:42,122 INFO L485 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2025-04-29 11:02:42,122 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:42,123 INFO L278 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2025-04-29 11:02:42,123 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:02:42,123 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:42,123 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:42,123 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:02:42,124 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:02:42,124 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:42,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1268704811, now seen corresponding path program 1 times [2025-04-29 11:02:42,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:42,124 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689421891] [2025-04-29 11:02:42,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:42,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:42,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:02:42,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:02:42,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:42,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:42,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:42,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:42,190 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689421891] [2025-04-29 11:02:42,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689421891] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:42,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:42,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:02:42,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661695022] [2025-04-29 11:02:42,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:42,191 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:02:42,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:42,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:02:42,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:42,192 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-04-29 11:02:42,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:42,215 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2025-04-29 11:02:42,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:02:42,215 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2025-04-29 11:02:42,215 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:42,216 INFO L225 Difference]: With dead ends: 21 [2025-04-29 11:02:42,216 INFO L226 Difference]: Without dead ends: 20 [2025-04-29 11:02:42,217 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:42,217 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:42,219 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:42,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-04-29 11:02:42,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-04-29 11:02:42,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 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-04-29 11:02:42,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2025-04-29 11:02:42,224 INFO L79 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 9 [2025-04-29 11:02:42,225 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:42,225 INFO L485 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2025-04-29 11:02:42,225 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-04-29 11:02:42,226 INFO L278 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2025-04-29 11:02:42,226 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:02:42,226 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:42,226 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:42,226 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:02:42,227 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:02:42,227 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:42,227 INFO L85 PathProgramCache]: Analyzing trace with hash 675143534, now seen corresponding path program 1 times [2025-04-29 11:02:42,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:42,227 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527563997] [2025-04-29 11:02:42,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:42,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:42,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:02:42,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:02:42,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:42,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:42,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:42,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:42,293 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527563997] [2025-04-29 11:02:42,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527563997] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:42,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:42,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:02:42,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423675602] [2025-04-29 11:02:42,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:42,294 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:02:42,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:42,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:02:42,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:42,295 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-04-29 11:02:42,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:42,313 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2025-04-29 11:02:42,313 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:02:42,313 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-04-29 11:02:42,314 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:42,314 INFO L225 Difference]: With dead ends: 23 [2025-04-29 11:02:42,314 INFO L226 Difference]: Without dead ends: 22 [2025-04-29 11:02:42,314 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:42,315 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:42,315 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 26 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:42,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-04-29 11:02:42,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2025-04-29 11:02:42,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 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-04-29 11:02:42,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2025-04-29 11:02:42,318 INFO L79 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 10 [2025-04-29 11:02:42,318 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:42,318 INFO L485 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2025-04-29 11:02:42,318 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-04-29 11:02:42,318 INFO L278 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2025-04-29 11:02:42,318 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-29 11:02:42,318 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:42,318 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:42,318 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:02:42,319 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:02:42,319 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:42,319 INFO L85 PathProgramCache]: Analyzing trace with hash -545386867, now seen corresponding path program 1 times [2025-04-29 11:02:42,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:42,319 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887715685] [2025-04-29 11:02:42,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:42,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:42,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:02:42,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:02:42,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:42,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:42,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:42,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:42,350 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887715685] [2025-04-29 11:02:42,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887715685] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:42,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:42,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:02:42,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268013473] [2025-04-29 11:02:42,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:42,351 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:02:42,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:42,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:02:42,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:42,352 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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-04-29 11:02:42,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:42,363 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2025-04-29 11:02:42,363 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:02:42,363 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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) Word has length 11 [2025-04-29 11:02:42,363 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:42,364 INFO L225 Difference]: With dead ends: 21 [2025-04-29 11:02:42,364 INFO L226 Difference]: Without dead ends: 20 [2025-04-29 11:02:42,364 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:42,364 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:42,365 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 16 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:42,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-04-29 11:02:42,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-04-29 11:02:42,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 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-04-29 11:02:42,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2025-04-29 11:02:42,367 INFO L79 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 11 [2025-04-29 11:02:42,367 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:42,367 INFO L485 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2025-04-29 11:02:42,367 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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-04-29 11:02:42,367 INFO L278 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2025-04-29 11:02:42,368 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-29 11:02:42,368 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:42,368 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:42,368 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:02:42,368 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:02:42,368 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:42,368 INFO L85 PathProgramCache]: Analyzing trace with hash -851973995, now seen corresponding path program 1 times [2025-04-29 11:02:42,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:42,369 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081143953] [2025-04-29 11:02:42,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:42,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:42,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:02:42,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:02:42,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:42,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:42,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:42,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:42,461 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081143953] [2025-04-29 11:02:42,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081143953] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:02:42,461 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681468761] [2025-04-29 11:02:42,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:42,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:42,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:42,464 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:02:42,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:02:42,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:02:42,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:02:42,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:42,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:42,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:02:42,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:42,566 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:42,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:02:42,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:42,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681468761] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:02:42,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:02:42,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-04-29 11:02:42,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91368673] [2025-04-29 11:02:42,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:02:42,632 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:02:42,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:42,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:02:42,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:02:42,634 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 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-04-29 11:02:42,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:42,680 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2025-04-29 11:02:42,681 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:02:42,681 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 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 17 [2025-04-29 11:02:42,681 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:42,682 INFO L225 Difference]: With dead ends: 46 [2025-04-29 11:02:42,682 INFO L226 Difference]: Without dead ends: 45 [2025-04-29 11:02:42,682 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:02:42,683 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 5 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:42,683 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 52 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:42,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-04-29 11:02:42,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2025-04-29 11:02:42,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 states have internal predecessors, (45), 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-04-29 11:02:42,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2025-04-29 11:02:42,688 INFO L79 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 17 [2025-04-29 11:02:42,688 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:42,688 INFO L485 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2025-04-29 11:02:42,688 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 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-04-29 11:02:42,688 INFO L278 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2025-04-29 11:02:42,689 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:02:42,689 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:42,689 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:42,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:02:42,889 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:42,890 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:02:42,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:42,890 INFO L85 PathProgramCache]: Analyzing trace with hash -641390012, now seen corresponding path program 1 times [2025-04-29 11:02:42,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:42,890 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843140863] [2025-04-29 11:02:42,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:42,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:42,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:02:42,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:02:42,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:42,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:42,965 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:42,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:42,965 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843140863] [2025-04-29 11:02:42,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843140863] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:02:42,966 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342909026] [2025-04-29 11:02:42,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:42,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:42,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:42,970 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:02:42,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:02:42,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:02:42,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:02:42,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:42,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:42,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-29 11:02:42,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:43,103 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:43,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:02:43,261 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:43,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342909026] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:02:43,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:02:43,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2025-04-29 11:02:43,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863044929] [2025-04-29 11:02:43,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:02:43,262 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-29 11:02:43,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:43,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-29 11:02:43,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:02:43,263 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 16 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-04-29 11:02:43,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:43,450 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2025-04-29 11:02:43,450 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 11:02:43,451 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 16 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) Word has length 18 [2025-04-29 11:02:43,451 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:43,451 INFO L225 Difference]: With dead ends: 54 [2025-04-29 11:02:43,451 INFO L226 Difference]: Without dead ends: 53 [2025-04-29 11:02:43,451 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2025-04-29 11:02:43,452 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 12 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:43,452 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 24 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:02:43,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-04-29 11:02:43,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2025-04-29 11:02:43,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.06) internal successors, (53), 51 states have internal predecessors, (53), 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-04-29 11:02:43,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2025-04-29 11:02:43,459 INFO L79 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 18 [2025-04-29 11:02:43,460 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:43,460 INFO L485 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2025-04-29 11:02:43,460 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 16 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-04-29 11:02:43,460 INFO L278 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2025-04-29 11:02:43,460 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-29 11:02:43,460 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:43,460 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1] [2025-04-29 11:02:43,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:02:43,660 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-04-29 11:02:43,661 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:02:43,661 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:43,661 INFO L85 PathProgramCache]: Analyzing trace with hash 534950867, now seen corresponding path program 2 times [2025-04-29 11:02:43,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:43,661 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774261095] [2025-04-29 11:02:43,661 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:02:43,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:43,667 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-04-29 11:02:43,668 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 41 statements. [2025-04-29 11:02:43,668 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:02:43,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:43,707 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-04-29 11:02:43,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:43,707 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774261095] [2025-04-29 11:02:43,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774261095] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:02:43,707 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038929770] [2025-04-29 11:02:43,707 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:02:43,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:43,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:43,712 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:02:43,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:02:43,737 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-04-29 11:02:43,740 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 41 statements. [2025-04-29 11:02:43,740 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:02:43,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:43,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:02:43,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:43,797 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-04-29 11:02:43,797 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:02:43,855 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-04-29 11:02:43,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038929770] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:02:43,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:02:43,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 5 [2025-04-29 11:02:43,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721043850] [2025-04-29 11:02:43,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:02:43,856 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:02:43,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:43,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:02:43,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:02:43,856 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-04-29 11:02:43,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:43,890 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2025-04-29 11:02:43,891 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:02:43,891 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 41 [2025-04-29 11:02:43,891 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:43,893 INFO L225 Difference]: With dead ends: 52 [2025-04-29 11:02:43,893 INFO L226 Difference]: Without dead ends: 51 [2025-04-29 11:02:43,894 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:02:43,894 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 12 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:43,894 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 17 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:43,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-04-29 11:02:43,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-04-29 11:02:43,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 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-04-29 11:02:43,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2025-04-29 11:02:43,900 INFO L79 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 41 [2025-04-29 11:02:43,901 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:43,901 INFO L485 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2025-04-29 11:02:43,901 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-04-29 11:02:43,901 INFO L278 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2025-04-29 11:02:43,901 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-29 11:02:43,901 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:43,901 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1] [2025-04-29 11:02:43,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 11:02:44,102 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:44,102 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-29 11:02:44,103 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:44,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1084897692, now seen corresponding path program 2 times [2025-04-29 11:02:44,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:44,103 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678204919] [2025-04-29 11:02:44,103 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:02:44,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:44,107 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-04-29 11:02:44,117 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 11:02:44,117 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:02:44,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:44,380 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-04-29 11:02:44,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:44,380 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678204919] [2025-04-29 11:02:44,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678204919] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:02:44,380 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909052591] [2025-04-29 11:02:44,380 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:02:44,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:44,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:44,382 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:02:44,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:02:44,403 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-04-29 11:02:44,416 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 11:02:44,417 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:02:44,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:44,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-29 11:02:44,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:44,765 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:44,766 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:02:45,244 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:45,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909052591] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:02:45,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:02:45,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 19, 19] total 40 [2025-04-29 11:02:45,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439845716] [2025-04-29 11:02:45,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:02:45,245 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-29 11:02:45,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:45,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-29 11:02:45,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1424, Unknown=0, NotChecked=0, Total=1640 [2025-04-29 11:02:45,249 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 41 states, 40 states have (on average 2.7) internal successors, (108), 41 states have internal predecessors, (108), 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-04-29 11:02:46,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:46,051 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2025-04-29 11:02:46,051 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-29 11:02:46,051 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.7) internal successors, (108), 41 states have internal predecessors, (108), 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 50 [2025-04-29 11:02:46,052 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:46,052 INFO L225 Difference]: With dead ends: 56 [2025-04-29 11:02:46,052 INFO L226 Difference]: Without dead ends: 0 [2025-04-29 11:02:46,054 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=628, Invalid=3662, Unknown=0, NotChecked=0, Total=4290 [2025-04-29 11:02:46,055 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 87 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:46,056 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 25 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:02:46,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-29 11:02:46,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-29 11:02:46,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-04-29 11:02:46,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-29 11:02:46,057 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2025-04-29 11:02:46,057 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:46,057 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-29 11:02:46,057 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.7) internal successors, (108), 41 states have internal predecessors, (108), 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-04-29 11:02:46,058 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-29 11:02:46,058 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-29 11:02:46,060 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-04-29 11:02:46,061 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-04-29 11:02:46,061 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-04-29 11:02:46,061 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-04-29 11:02:46,061 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-04-29 11:02:46,061 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-04-29 11:02:46,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-29 11:02:46,265 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:46,267 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:46,269 INFO L312 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-04-29 11:02:46,363 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:02:46,371 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~post3 [2025-04-29 11:02:46,372 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~post3 [2025-04-29 11:02:46,372 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~post3 [2025-04-29 11:02:46,372 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~post3 [2025-04-29 11:02:46,372 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~post3 [2025-04-29 11:02:46,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:02:46 BoogieIcfgContainer [2025-04-29 11:02:46,376 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:02:46,377 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:02:46,377 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:02:46,377 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:02:46,377 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:02:41" (3/4) ... [2025-04-29 11:02:46,379 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 11:02:46,384 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-04-29 11:02:46,385 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-04-29 11:02:46,385 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-29 11:02:46,444 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:02:46,445 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:02:46,445 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:02:46,446 INFO L158 Benchmark]: Toolchain (without parser) took 5220.87ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 50.2MB in the end (delta: 59.0MB). Peak memory consumption was 59.8MB. Max. memory is 16.1GB. [2025-04-29 11:02:46,446 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:02:46,447 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.45ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 96.2MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:02:46,447 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.99ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 94.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:02:46,447 INFO L158 Benchmark]: Boogie Preprocessor took 23.98ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 93.3MB in the end (delta: 977.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:02:46,447 INFO L158 Benchmark]: RCFGBuilder took 172.81ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 82.9MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:02:46,448 INFO L158 Benchmark]: TraceAbstraction took 4705.18ms. Allocated memory is still 142.6MB. Free memory was 81.9MB in the beginning and 55.8MB in the end (delta: 26.1MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2025-04-29 11:02:46,448 INFO L158 Benchmark]: Witness Printer took 67.93ms. Allocated memory is still 142.6MB. Free memory was 55.8MB in the beginning and 50.2MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:02:46,449 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.15ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.45ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 96.2MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.99ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 94.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.98ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 93.3MB in the end (delta: 977.5kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 172.81ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 82.9MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4705.18ms. Allocated memory is still 142.6MB. Free memory was 81.9MB in the beginning and 55.8MB in the end (delta: 26.1MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. * Witness Printer took 67.93ms. Allocated memory is still 142.6MB. Free memory was 55.8MB in the beginning and 50.2MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~post3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~post3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~post3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~post3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~post3 * 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 - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 27 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 10, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 146 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 146 mSDsluCounter, 239 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 151 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1012 IncrementalHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 88 mSDtfsCounter, 1012 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 329 GetRequests, 215 SyntacticMatches, 3 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=8, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 299 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 407 ConstructedInterpolants, 0 QuantifiedInterpolants, 2005 SizeOfPredicates, 14 NumberOfNonLiveVariables, 195 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 275/600 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 - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((n <= 2147483647) && (0 <= ((long long) 2147483647 + k))) && (k <= 2147483647)) && (0 <= j)) && (n <= ((long long) j + k))) && (1 <= n)) RESULT: Ultimate proved your program to be correct! [2025-04-29 11:02:46,466 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 Result: TRUE