./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/bitvector/byte_add_1-2.i --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/bitvector/byte_add_1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db53fe9124e215e75c7f288cadf12df33daef67c04c75ea6ca77bc804670a99c --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:18:28,488 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:18:28,540 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-04-30 10:18:28,546 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:18:28,547 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:18:28,571 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:18:28,572 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:18:28,572 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:18:28,572 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:18:28,572 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:18:28,572 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:18:28,572 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:18:28,572 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:18:28,572 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:18:28,573 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:18:28,573 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:18:28,573 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:18:28,573 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:18:28,573 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:18:28,573 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:18:28,573 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:18:28,573 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:18:28,573 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:18:28,573 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:18:28,573 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-30 10:18:28,573 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:18:28,573 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:18:28,573 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:18:28,573 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:18:28,573 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:18:28,574 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:18:28,574 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:18:28,574 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:18:28,574 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:18:28,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:18:28,574 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:18:28,574 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:18:28,574 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:18:28,574 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:18:28,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:18:28,574 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:18:28,574 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:18:28,574 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:18:28,574 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:18:28,574 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:18:28,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:18:28,574 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:18:28,575 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:18:28,575 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:18:28,575 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 -> db53fe9124e215e75c7f288cadf12df33daef67c04c75ea6ca77bc804670a99c [2025-04-30 10:18:28,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:18:28,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:18:28,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:18:28,807 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:18:28,807 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:18:28,808 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/byte_add_1-2.i [2025-04-30 10:18:30,079 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/628242533/ded0d990cec842439196c70b71e1f454/FLAG1c98916c6 [2025-04-30 10:18:30,256 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:18:30,277 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add_1-2.i [2025-04-30 10:18:30,283 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/628242533/ded0d990cec842439196c70b71e1f454/FLAG1c98916c6 [2025-04-30 10:18:31,130 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/628242533/ded0d990cec842439196c70b71e1f454 [2025-04-30 10:18:31,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:18:31,133 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:18:31,134 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:18:31,134 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:18:31,137 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:18:31,137 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:18:31" (1/1) ... [2025-04-30 10:18:31,138 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f117915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:31, skipping insertion in model container [2025-04-30 10:18:31,138 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:18:31" (1/1) ... [2025-04-30 10:18:31,148 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:18:31,305 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:18:31,311 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:18:31,359 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:18:31,368 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:18:31,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:31 WrapperNode [2025-04-30 10:18:31,368 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:18:31,369 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:18:31,369 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:18:31,369 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:18:31,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:31" (1/1) ... [2025-04-30 10:18:31,382 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:31" (1/1) ... [2025-04-30 10:18:31,415 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 184 [2025-04-30 10:18:31,415 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:18:31,416 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:18:31,416 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:18:31,416 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:18:31,422 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:31" (1/1) ... [2025-04-30 10:18:31,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:31" (1/1) ... [2025-04-30 10:18:31,426 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:31" (1/1) ... [2025-04-30 10:18:31,446 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-30 10:18:31,447 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:31" (1/1) ... [2025-04-30 10:18:31,447 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:31" (1/1) ... [2025-04-30 10:18:31,456 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:31" (1/1) ... [2025-04-30 10:18:31,457 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:31" (1/1) ... [2025-04-30 10:18:31,463 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:31" (1/1) ... [2025-04-30 10:18:31,464 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:31" (1/1) ... [2025-04-30 10:18:31,469 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:31" (1/1) ... [2025-04-30 10:18:31,482 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:18:31,482 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:18:31,482 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:18:31,482 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:18:31,483 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:31" (1/1) ... [2025-04-30 10:18:31,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:18:31,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:18:31,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-30 10:18:31,525 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-30 10:18:31,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:18:31,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:18:31,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:18:31,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:18:31,593 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:18:31,595 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:18:31,954 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2025-04-30 10:18:31,954 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:18:31,969 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:18:31,969 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:18:31,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:18:31 BoogieIcfgContainer [2025-04-30 10:18:31,970 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:18:31,971 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:18:31,971 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:18:31,974 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:18:31,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:18:31" (1/3) ... [2025-04-30 10:18:31,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa2a567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:18:31, skipping insertion in model container [2025-04-30 10:18:31,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:31" (2/3) ... [2025-04-30 10:18:31,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa2a567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:18:31, skipping insertion in model container [2025-04-30 10:18:31,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:18:31" (3/3) ... [2025-04-30 10:18:31,977 INFO L128 eAbstractionObserver]: Analyzing ICFG byte_add_1-2.i [2025-04-30 10:18:31,989 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:18:31,990 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG byte_add_1-2.i that has 1 procedures, 132 locations, 166 edges, 1 initial locations, 2 loop locations, and 41 error locations. [2025-04-30 10:18:32,036 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:18:32,045 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;@110a59b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:18:32,046 INFO L341 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2025-04-30 10:18:32,048 INFO L278 IsEmpty]: Start isEmpty. Operand has 132 states, 90 states have (on average 1.8444444444444446) internal successors, (166), 131 states have internal predecessors, (166), 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-30 10:18:32,052 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-04-30 10:18:32,052 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:18:32,052 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-04-30 10:18:32,052 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-04-30 10:18:32,056 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:32,057 INFO L85 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2025-04-30 10:18:32,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:32,061 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316101665] [2025-04-30 10:18:32,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:32,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:32,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-30 10:18:32,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-30 10:18:32,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:32,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:32,174 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-30 10:18:32,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:32,175 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316101665] [2025-04-30 10:18:32,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316101665] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:32,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:32,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-30 10:18:32,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771936356] [2025-04-30 10:18:32,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:32,181 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-30 10:18:32,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:32,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-30 10:18:32,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-30 10:18:32,195 INFO L87 Difference]: Start difference. First operand has 132 states, 90 states have (on average 1.8444444444444446) internal successors, (166), 131 states have internal predecessors, (166), 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 2 states, 1 states have (on average 4.0) internal successors, (4), 2 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-30 10:18:32,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:18:32,215 INFO L93 Difference]: Finished difference Result 136 states and 169 transitions. [2025-04-30 10:18:32,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-30 10:18:32,216 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 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-30 10:18:32,218 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:18:32,223 INFO L225 Difference]: With dead ends: 136 [2025-04-30 10:18:32,223 INFO L226 Difference]: Without dead ends: 79 [2025-04-30 10:18:32,226 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-30 10:18:32,228 INFO L437 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:18:32,230 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:18:32,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-04-30 10:18:32,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-04-30 10:18:32,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 78 states have internal predecessors, (109), 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-30 10:18:32,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 109 transitions. [2025-04-30 10:18:32,251 INFO L79 Accepts]: Start accepts. Automaton has 79 states and 109 transitions. Word has length 4 [2025-04-30 10:18:32,252 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:18:32,252 INFO L485 AbstractCegarLoop]: Abstraction has 79 states and 109 transitions. [2025-04-30 10:18:32,253 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 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-30 10:18:32,253 INFO L278 IsEmpty]: Start isEmpty. Operand 79 states and 109 transitions. [2025-04-30 10:18:32,253 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-30 10:18:32,255 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:18:32,255 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:32,255 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:18:32,255 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-04-30 10:18:32,256 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:32,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1403565466, now seen corresponding path program 1 times [2025-04-30 10:18:32,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:32,256 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880951728] [2025-04-30 10:18:32,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:32,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:32,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:18:32,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:18:32,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:32,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:32,405 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-30 10:18:32,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:32,405 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880951728] [2025-04-30 10:18:32,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880951728] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:32,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:32,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:18:32,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026539759] [2025-04-30 10:18:32,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:32,407 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:18:32,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:32,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:18:32,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:18:32,408 INFO L87 Difference]: Start difference. First operand 79 states and 109 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-30 10:18:32,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:18:32,547 INFO L93 Difference]: Finished difference Result 165 states and 240 transitions. [2025-04-30 10:18:32,548 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:18:32,548 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2025-04-30 10:18:32,548 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:18:32,549 INFO L225 Difference]: With dead ends: 165 [2025-04-30 10:18:32,549 INFO L226 Difference]: Without dead ends: 108 [2025-04-30 10:18:32,549 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-30 10:18:32,550 INFO L437 NwaCegarLoop]: 84 mSDtfsCounter, 30 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:18:32,550 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 149 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:18:32,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-04-30 10:18:32,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2025-04-30 10:18:32,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 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-30 10:18:32,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 138 transitions. [2025-04-30 10:18:32,561 INFO L79 Accepts]: Start accepts. Automaton has 104 states and 138 transitions. Word has length 19 [2025-04-30 10:18:32,561 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:18:32,561 INFO L485 AbstractCegarLoop]: Abstraction has 104 states and 138 transitions. [2025-04-30 10:18:32,561 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-30 10:18:32,561 INFO L278 IsEmpty]: Start isEmpty. Operand 104 states and 138 transitions. [2025-04-30 10:18:32,562 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-30 10:18:32,562 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:18:32,562 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:32,562 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:18:32,562 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-04-30 10:18:32,563 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:32,564 INFO L85 PathProgramCache]: Analyzing trace with hash -226689128, now seen corresponding path program 1 times [2025-04-30 10:18:32,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:32,564 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775782608] [2025-04-30 10:18:32,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:32,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:32,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:18:32,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:18:32,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:32,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:32,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:18:32,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:32,720 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775782608] [2025-04-30 10:18:32,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775782608] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:32,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:32,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:18:32,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841985595] [2025-04-30 10:18:32,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:32,722 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:18:32,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:32,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:18:32,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:18:32,724 INFO L87 Difference]: Start difference. First operand 104 states and 138 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-30 10:18:32,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:18:32,923 INFO L93 Difference]: Finished difference Result 234 states and 345 transitions. [2025-04-30 10:18:32,923 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:18:32,924 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2025-04-30 10:18:32,924 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:18:32,925 INFO L225 Difference]: With dead ends: 234 [2025-04-30 10:18:32,925 INFO L226 Difference]: Without dead ends: 177 [2025-04-30 10:18:32,925 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:18:32,925 INFO L437 NwaCegarLoop]: 76 mSDtfsCounter, 114 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:18:32,925 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 204 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:18:32,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-04-30 10:18:32,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 129. [2025-04-30 10:18:32,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.3671875) internal successors, (175), 128 states have internal predecessors, (175), 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-30 10:18:32,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 175 transitions. [2025-04-30 10:18:32,942 INFO L79 Accepts]: Start accepts. Automaton has 129 states and 175 transitions. Word has length 26 [2025-04-30 10:18:32,942 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:18:32,942 INFO L485 AbstractCegarLoop]: Abstraction has 129 states and 175 transitions. [2025-04-30 10:18:32,943 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-30 10:18:32,943 INFO L278 IsEmpty]: Start isEmpty. Operand 129 states and 175 transitions. [2025-04-30 10:18:32,943 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-30 10:18:32,943 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:18:32,943 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:32,944 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:18:32,944 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-04-30 10:18:32,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:32,944 INFO L85 PathProgramCache]: Analyzing trace with hash -332454890, now seen corresponding path program 1 times [2025-04-30 10:18:32,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:32,944 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625041454] [2025-04-30 10:18:32,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:32,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:32,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:18:32,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:18:32,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:32,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:33,052 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-30 10:18:33,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:33,053 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625041454] [2025-04-30 10:18:33,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625041454] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:33,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:33,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:18:33,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752474058] [2025-04-30 10:18:33,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:33,054 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:18:33,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:33,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:18:33,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:18:33,055 INFO L87 Difference]: Start difference. First operand 129 states and 175 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:18:33,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:18:33,166 INFO L93 Difference]: Finished difference Result 335 states and 454 transitions. [2025-04-30 10:18:33,167 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:18:33,167 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-30 10:18:33,167 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:18:33,168 INFO L225 Difference]: With dead ends: 335 [2025-04-30 10:18:33,170 INFO L226 Difference]: Without dead ends: 231 [2025-04-30 10:18:33,170 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:18:33,171 INFO L437 NwaCegarLoop]: 131 mSDtfsCounter, 110 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:18:33,171 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 310 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:18:33,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-04-30 10:18:33,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 142. [2025-04-30 10:18:33,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.3546099290780143) internal successors, (191), 141 states have internal predecessors, (191), 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-30 10:18:33,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 191 transitions. [2025-04-30 10:18:33,182 INFO L79 Accepts]: Start accepts. Automaton has 142 states and 191 transitions. Word has length 33 [2025-04-30 10:18:33,182 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:18:33,182 INFO L485 AbstractCegarLoop]: Abstraction has 142 states and 191 transitions. [2025-04-30 10:18:33,182 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:18:33,182 INFO L278 IsEmpty]: Start isEmpty. Operand 142 states and 191 transitions. [2025-04-30 10:18:33,183 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-30 10:18:33,183 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:18:33,183 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:33,183 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:18:33,184 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-04-30 10:18:33,184 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:33,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1383788046, now seen corresponding path program 1 times [2025-04-30 10:18:33,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:33,184 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120165370] [2025-04-30 10:18:33,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:33,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:33,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:18:33,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:18:33,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:33,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:33,307 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-30 10:18:33,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:33,307 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120165370] [2025-04-30 10:18:33,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120165370] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:33,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:33,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:18:33,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88110970] [2025-04-30 10:18:33,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:33,308 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:18:33,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:33,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:18:33,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:18:33,308 INFO L87 Difference]: Start difference. First operand 142 states and 191 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-30 10:18:33,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:18:33,429 INFO L93 Difference]: Finished difference Result 341 states and 460 transitions. [2025-04-30 10:18:33,429 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:18:33,429 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 36 [2025-04-30 10:18:33,429 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:18:33,430 INFO L225 Difference]: With dead ends: 341 [2025-04-30 10:18:33,430 INFO L226 Difference]: Without dead ends: 237 [2025-04-30 10:18:33,431 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:18:33,431 INFO L437 NwaCegarLoop]: 123 mSDtfsCounter, 99 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:18:33,431 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 300 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:18:33,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-04-30 10:18:33,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 155. [2025-04-30 10:18:33,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.3311688311688312) internal successors, (205), 154 states have internal predecessors, (205), 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-30 10:18:33,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 205 transitions. [2025-04-30 10:18:33,438 INFO L79 Accepts]: Start accepts. Automaton has 155 states and 205 transitions. Word has length 36 [2025-04-30 10:18:33,438 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:18:33,438 INFO L485 AbstractCegarLoop]: Abstraction has 155 states and 205 transitions. [2025-04-30 10:18:33,438 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-30 10:18:33,438 INFO L278 IsEmpty]: Start isEmpty. Operand 155 states and 205 transitions. [2025-04-30 10:18:33,439 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-30 10:18:33,439 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:18:33,439 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:33,440 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:18:33,440 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-04-30 10:18:33,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:33,440 INFO L85 PathProgramCache]: Analyzing trace with hash 273325243, now seen corresponding path program 1 times [2025-04-30 10:18:33,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:33,440 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959492905] [2025-04-30 10:18:33,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:33,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:33,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-30 10:18:33,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:18:33,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:33,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:33,546 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:18:33,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:33,546 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959492905] [2025-04-30 10:18:33,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959492905] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:18:33,546 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506863080] [2025-04-30 10:18:33,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:33,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:18:33,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:18:33,551 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-30 10:18:33,553 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-30 10:18:33,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-30 10:18:33,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:18:33,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:33,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:33,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:18:33,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:18:33,668 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:18:33,669 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:18:33,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506863080] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:33,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:18:33,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2025-04-30 10:18:33,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125315010] [2025-04-30 10:18:33,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:33,670 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:18:33,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:33,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:18:33,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:18:33,674 INFO L87 Difference]: Start difference. First operand 155 states and 205 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-30 10:18:33,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:18:33,816 INFO L93 Difference]: Finished difference Result 310 states and 439 transitions. [2025-04-30 10:18:33,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:18:33,817 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 39 [2025-04-30 10:18:33,817 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:18:33,818 INFO L225 Difference]: With dead ends: 310 [2025-04-30 10:18:33,818 INFO L226 Difference]: Without dead ends: 208 [2025-04-30 10:18:33,818 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:18:33,820 INFO L437 NwaCegarLoop]: 113 mSDtfsCounter, 48 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:18:33,820 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 247 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:18:33,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-04-30 10:18:33,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 186. [2025-04-30 10:18:33,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.308108108108108) internal successors, (242), 185 states have internal predecessors, (242), 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-30 10:18:33,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 242 transitions. [2025-04-30 10:18:33,827 INFO L79 Accepts]: Start accepts. Automaton has 186 states and 242 transitions. Word has length 39 [2025-04-30 10:18:33,827 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:18:33,827 INFO L485 AbstractCegarLoop]: Abstraction has 186 states and 242 transitions. [2025-04-30 10:18:33,827 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-30 10:18:33,827 INFO L278 IsEmpty]: Start isEmpty. Operand 186 states and 242 transitions. [2025-04-30 10:18:33,828 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-30 10:18:33,828 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:18:33,828 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:33,836 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-30 10:18:34,031 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-30 10:18:34,031 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-04-30 10:18:34,032 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:34,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1212156375, now seen corresponding path program 1 times [2025-04-30 10:18:34,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:34,032 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227162138] [2025-04-30 10:18:34,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:34,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:34,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-30 10:18:34,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-30 10:18:34,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:34,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:34,141 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:18:34,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:34,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227162138] [2025-04-30 10:18:34,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227162138] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:18:34,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274692957] [2025-04-30 10:18:34,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:34,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:18:34,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:18:34,145 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-30 10:18:34,147 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-30 10:18:34,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-30 10:18:34,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-30 10:18:34,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:34,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:34,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:18:34,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:18:34,249 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-30 10:18:34,251 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:18:34,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274692957] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:34,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:18:34,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-04-30 10:18:34,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145785160] [2025-04-30 10:18:34,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:34,252 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:18:34,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:34,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:18:34,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:18:34,253 INFO L87 Difference]: Start difference. First operand 186 states and 242 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-30 10:18:34,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:18:34,393 INFO L93 Difference]: Finished difference Result 372 states and 507 transitions. [2025-04-30 10:18:34,393 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:18:34,394 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-04-30 10:18:34,394 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:18:34,395 INFO L225 Difference]: With dead ends: 372 [2025-04-30 10:18:34,396 INFO L226 Difference]: Without dead ends: 239 [2025-04-30 10:18:34,396 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:18:34,397 INFO L437 NwaCegarLoop]: 113 mSDtfsCounter, 47 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:18:34,397 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 247 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:18:34,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-04-30 10:18:34,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 211. [2025-04-30 10:18:34,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.2904761904761906) internal successors, (271), 210 states have internal predecessors, (271), 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-30 10:18:34,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 271 transitions. [2025-04-30 10:18:34,404 INFO L79 Accepts]: Start accepts. Automaton has 211 states and 271 transitions. Word has length 46 [2025-04-30 10:18:34,404 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:18:34,404 INFO L485 AbstractCegarLoop]: Abstraction has 211 states and 271 transitions. [2025-04-30 10:18:34,404 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-30 10:18:34,404 INFO L278 IsEmpty]: Start isEmpty. Operand 211 states and 271 transitions. [2025-04-30 10:18:34,405 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-30 10:18:34,405 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:18:34,405 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:34,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:18:34,610 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,SelfDestructingSolverStorable6 [2025-04-30 10:18:34,610 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-04-30 10:18:34,610 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:34,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1859374199, now seen corresponding path program 1 times [2025-04-30 10:18:34,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:34,611 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841729404] [2025-04-30 10:18:34,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:34,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:34,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:18:34,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:18:34,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:34,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:34,676 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-04-30 10:18:34,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:34,676 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841729404] [2025-04-30 10:18:34,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841729404] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:34,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:34,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:18:34,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130698242] [2025-04-30 10:18:34,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:34,676 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:18:34,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:34,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:18:34,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:18:34,677 INFO L87 Difference]: Start difference. First operand 211 states and 271 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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-30 10:18:34,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:18:34,686 INFO L93 Difference]: Finished difference Result 258 states and 328 transitions. [2025-04-30 10:18:34,686 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:18:34,687 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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 53 [2025-04-30 10:18:34,687 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:18:34,688 INFO L225 Difference]: With dead ends: 258 [2025-04-30 10:18:34,688 INFO L226 Difference]: Without dead ends: 185 [2025-04-30 10:18:34,688 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-30 10:18:34,689 INFO L437 NwaCegarLoop]: 120 mSDtfsCounter, 16 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:18:34,689 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 225 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:18:34,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-04-30 10:18:34,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2025-04-30 10:18:34,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.2771739130434783) internal successors, (235), 184 states have internal predecessors, (235), 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-30 10:18:34,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 235 transitions. [2025-04-30 10:18:34,695 INFO L79 Accepts]: Start accepts. Automaton has 185 states and 235 transitions. Word has length 53 [2025-04-30 10:18:34,696 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:18:34,696 INFO L485 AbstractCegarLoop]: Abstraction has 185 states and 235 transitions. [2025-04-30 10:18:34,696 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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-30 10:18:34,696 INFO L278 IsEmpty]: Start isEmpty. Operand 185 states and 235 transitions. [2025-04-30 10:18:34,697 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-04-30 10:18:34,698 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:18:34,698 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:34,698 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:18:34,698 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-04-30 10:18:34,699 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:34,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1408193789, now seen corresponding path program 1 times [2025-04-30 10:18:34,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:34,699 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802886507] [2025-04-30 10:18:34,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:34,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:34,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-04-30 10:18:34,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-04-30 10:18:34,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:34,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:34,824 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-04-30 10:18:34,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:34,824 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802886507] [2025-04-30 10:18:34,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802886507] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:34,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:34,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:18:34,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147189336] [2025-04-30 10:18:34,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:34,825 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:18:34,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:34,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:18:34,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:18:34,825 INFO L87 Difference]: Start difference. First operand 185 states and 235 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-30 10:18:34,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:18:34,958 INFO L93 Difference]: Finished difference Result 480 states and 612 transitions. [2025-04-30 10:18:34,958 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:18:34,959 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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 65 [2025-04-30 10:18:34,959 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:18:34,960 INFO L225 Difference]: With dead ends: 480 [2025-04-30 10:18:34,960 INFO L226 Difference]: Without dead ends: 346 [2025-04-30 10:18:34,960 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:18:34,961 INFO L437 NwaCegarLoop]: 84 mSDtfsCounter, 152 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:18:34,961 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 197 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:18:34,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-04-30 10:18:34,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 227. [2025-04-30 10:18:34,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.2743362831858407) internal successors, (288), 226 states have internal predecessors, (288), 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-30 10:18:34,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 288 transitions. [2025-04-30 10:18:34,967 INFO L79 Accepts]: Start accepts. Automaton has 227 states and 288 transitions. Word has length 65 [2025-04-30 10:18:34,967 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:18:34,968 INFO L485 AbstractCegarLoop]: Abstraction has 227 states and 288 transitions. [2025-04-30 10:18:34,968 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-30 10:18:34,968 INFO L278 IsEmpty]: Start isEmpty. Operand 227 states and 288 transitions. [2025-04-30 10:18:34,968 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-30 10:18:34,968 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:18:34,968 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:34,969 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:18:34,969 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-04-30 10:18:34,969 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:34,969 INFO L85 PathProgramCache]: Analyzing trace with hash -2020754200, now seen corresponding path program 1 times [2025-04-30 10:18:34,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:34,969 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791315895] [2025-04-30 10:18:34,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:34,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:34,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-30 10:18:34,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-30 10:18:34,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:34,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:35,062 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-30 10:18:35,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:35,062 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791315895] [2025-04-30 10:18:35,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791315895] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:35,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:35,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:18:35,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23233482] [2025-04-30 10:18:35,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:35,063 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:18:35,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:35,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:18:35,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:18:35,064 INFO L87 Difference]: Start difference. First operand 227 states and 288 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-30 10:18:35,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:18:35,114 INFO L93 Difference]: Finished difference Result 513 states and 651 transitions. [2025-04-30 10:18:35,114 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:18:35,114 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 68 [2025-04-30 10:18:35,115 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:18:35,116 INFO L225 Difference]: With dead ends: 513 [2025-04-30 10:18:35,116 INFO L226 Difference]: Without dead ends: 337 [2025-04-30 10:18:35,116 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:18:35,116 INFO L437 NwaCegarLoop]: 160 mSDtfsCounter, 68 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:18:35,117 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 398 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:18:35,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-04-30 10:18:35,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 249. [2025-04-30 10:18:35,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 1.2983870967741935) internal successors, (322), 248 states have internal predecessors, (322), 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-30 10:18:35,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 322 transitions. [2025-04-30 10:18:35,124 INFO L79 Accepts]: Start accepts. Automaton has 249 states and 322 transitions. Word has length 68 [2025-04-30 10:18:35,125 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:18:35,125 INFO L485 AbstractCegarLoop]: Abstraction has 249 states and 322 transitions. [2025-04-30 10:18:35,128 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-30 10:18:35,128 INFO L278 IsEmpty]: Start isEmpty. Operand 249 states and 322 transitions. [2025-04-30 10:18:35,128 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-04-30 10:18:35,128 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:18:35,128 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:35,129 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:18:35,129 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-04-30 10:18:35,129 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:35,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1924272046, now seen corresponding path program 1 times [2025-04-30 10:18:35,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:35,129 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746688099] [2025-04-30 10:18:35,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:35,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:35,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-04-30 10:18:35,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-04-30 10:18:35,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:35,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:35,269 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-30 10:18:35,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:35,269 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746688099] [2025-04-30 10:18:35,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746688099] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:35,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:35,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:18:35,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977860511] [2025-04-30 10:18:35,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:35,270 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:18:35,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:35,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:18:35,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:18:35,270 INFO L87 Difference]: Start difference. First operand 249 states and 322 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-30 10:18:35,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:18:35,436 INFO L93 Difference]: Finished difference Result 685 states and 891 transitions. [2025-04-30 10:18:35,436 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:18:35,436 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 74 [2025-04-30 10:18:35,436 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:18:35,438 INFO L225 Difference]: With dead ends: 685 [2025-04-30 10:18:35,438 INFO L226 Difference]: Without dead ends: 482 [2025-04-30 10:18:35,438 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:18:35,438 INFO L437 NwaCegarLoop]: 92 mSDtfsCounter, 158 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:18:35,438 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 235 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:18:35,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-04-30 10:18:35,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 407. [2025-04-30 10:18:35,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 1.2857142857142858) internal successors, (522), 406 states have internal predecessors, (522), 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-30 10:18:35,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 522 transitions. [2025-04-30 10:18:35,450 INFO L79 Accepts]: Start accepts. Automaton has 407 states and 522 transitions. Word has length 74 [2025-04-30 10:18:35,450 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:18:35,450 INFO L485 AbstractCegarLoop]: Abstraction has 407 states and 522 transitions. [2025-04-30 10:18:35,451 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-30 10:18:35,451 INFO L278 IsEmpty]: Start isEmpty. Operand 407 states and 522 transitions. [2025-04-30 10:18:35,451 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-04-30 10:18:35,451 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:18:35,451 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:35,452 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:18:35,452 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-04-30 10:18:35,452 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:35,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1949097674, now seen corresponding path program 1 times [2025-04-30 10:18:35,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:35,452 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576542847] [2025-04-30 10:18:35,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:35,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:35,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-04-30 10:18:35,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-04-30 10:18:35,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:35,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:35,523 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-04-30 10:18:35,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:35,523 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576542847] [2025-04-30 10:18:35,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576542847] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:18:35,524 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207501309] [2025-04-30 10:18:35,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:35,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:18:35,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:18:35,526 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-30 10:18:35,528 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-30 10:18:35,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-04-30 10:18:35,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-04-30 10:18:35,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:35,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:35,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:18:35,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:18:35,629 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-30 10:18:35,630 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:18:35,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207501309] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:35,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:18:35,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-04-30 10:18:35,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170681902] [2025-04-30 10:18:35,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:35,630 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:18:35,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:35,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:18:35,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:18:35,631 INFO L87 Difference]: Start difference. First operand 407 states and 522 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:18:35,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:18:35,697 INFO L93 Difference]: Finished difference Result 1047 states and 1341 transitions. [2025-04-30 10:18:35,697 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:18:35,697 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-04-30 10:18:35,698 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:18:35,699 INFO L225 Difference]: With dead ends: 1047 [2025-04-30 10:18:35,700 INFO L226 Difference]: Without dead ends: 649 [2025-04-30 10:18:35,700 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:18:35,700 INFO L437 NwaCegarLoop]: 106 mSDtfsCounter, 49 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:18:35,701 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 177 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:18:35,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-04-30 10:18:35,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 555. [2025-04-30 10:18:35,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 554 states have (on average 1.2761732851985559) internal successors, (707), 554 states have internal predecessors, (707), 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-30 10:18:35,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 707 transitions. [2025-04-30 10:18:35,713 INFO L79 Accepts]: Start accepts. Automaton has 555 states and 707 transitions. Word has length 74 [2025-04-30 10:18:35,713 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:18:35,713 INFO L485 AbstractCegarLoop]: Abstraction has 555 states and 707 transitions. [2025-04-30 10:18:35,713 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:18:35,713 INFO L278 IsEmpty]: Start isEmpty. Operand 555 states and 707 transitions. [2025-04-30 10:18:35,714 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-04-30 10:18:35,714 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:18:35,714 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:35,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-30 10:18:35,915 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:18:35,915 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-04-30 10:18:35,916 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:35,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1204511103, now seen corresponding path program 1 times [2025-04-30 10:18:35,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:35,916 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988084365] [2025-04-30 10:18:35,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:35,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:35,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-04-30 10:18:35,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-04-30 10:18:35,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:35,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:36,019 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-30 10:18:36,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:36,019 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988084365] [2025-04-30 10:18:36,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988084365] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:36,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:36,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:18:36,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411607043] [2025-04-30 10:18:36,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:36,022 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:18:36,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:36,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:18:36,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:18:36,023 INFO L87 Difference]: Start difference. First operand 555 states and 707 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-30 10:18:36,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:18:36,199 INFO L93 Difference]: Finished difference Result 1345 states and 1704 transitions. [2025-04-30 10:18:36,199 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:18:36,200 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 74 [2025-04-30 10:18:36,200 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:18:36,202 INFO L225 Difference]: With dead ends: 1345 [2025-04-30 10:18:36,202 INFO L226 Difference]: Without dead ends: 794 [2025-04-30 10:18:36,203 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:18:36,203 INFO L437 NwaCegarLoop]: 80 mSDtfsCounter, 156 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:18:36,203 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 349 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:18:36,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2025-04-30 10:18:36,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 696. [2025-04-30 10:18:36,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 695 states have (on average 1.2618705035971223) internal successors, (877), 695 states have internal predecessors, (877), 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-30 10:18:36,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 877 transitions. [2025-04-30 10:18:36,220 INFO L79 Accepts]: Start accepts. Automaton has 696 states and 877 transitions. Word has length 74 [2025-04-30 10:18:36,220 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:18:36,220 INFO L485 AbstractCegarLoop]: Abstraction has 696 states and 877 transitions. [2025-04-30 10:18:36,220 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-30 10:18:36,220 INFO L278 IsEmpty]: Start isEmpty. Operand 696 states and 877 transitions. [2025-04-30 10:18:36,221 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-04-30 10:18:36,221 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:18:36,221 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:36,221 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:18:36,221 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-04-30 10:18:36,221 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:36,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1004524282, now seen corresponding path program 1 times [2025-04-30 10:18:36,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:36,222 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610589195] [2025-04-30 10:18:36,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:36,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:36,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-04-30 10:18:36,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-04-30 10:18:36,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:36,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:36,328 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-30 10:18:36,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:36,329 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610589195] [2025-04-30 10:18:36,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610589195] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:18:36,329 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969628013] [2025-04-30 10:18:36,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:36,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:18:36,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:18:36,331 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-30 10:18:36,333 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-30 10:18:36,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-04-30 10:18:36,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-04-30 10:18:36,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:36,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:36,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-30 10:18:36,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:18:36,461 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 26 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:18:36,461 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:18:36,538 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-30 10:18:36,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969628013] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:18:36,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:18:36,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2025-04-30 10:18:36,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964109398] [2025-04-30 10:18:36,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:18:36,539 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:18:36,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:36,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:18:36,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:18:36,539 INFO L87 Difference]: Start difference. First operand 696 states and 877 transitions. Second operand has 10 states, 9 states have (on average 12.444444444444445) internal successors, (112), 10 states have internal predecessors, (112), 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-30 10:18:37,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:18:37,697 INFO L93 Difference]: Finished difference Result 4137 states and 5101 transitions. [2025-04-30 10:18:37,698 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-04-30 10:18:37,698 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 12.444444444444445) internal successors, (112), 10 states have internal predecessors, (112), 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 80 [2025-04-30 10:18:37,698 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:18:37,708 INFO L225 Difference]: With dead ends: 4137 [2025-04-30 10:18:37,708 INFO L226 Difference]: Without dead ends: 3323 [2025-04-30 10:18:37,712 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=592, Invalid=2600, Unknown=0, NotChecked=0, Total=3192 [2025-04-30 10:18:37,713 INFO L437 NwaCegarLoop]: 285 mSDtfsCounter, 777 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 1546 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-30 10:18:37,713 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 1546 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-30 10:18:37,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3323 states. [2025-04-30 10:18:37,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3323 to 900. [2025-04-30 10:18:37,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 899 states have (on average 1.4048943270300334) internal successors, (1263), 899 states have internal predecessors, (1263), 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-30 10:18:37,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1263 transitions. [2025-04-30 10:18:37,758 INFO L79 Accepts]: Start accepts. Automaton has 900 states and 1263 transitions. Word has length 80 [2025-04-30 10:18:37,758 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:18:37,758 INFO L485 AbstractCegarLoop]: Abstraction has 900 states and 1263 transitions. [2025-04-30 10:18:37,758 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 12.444444444444445) internal successors, (112), 10 states have internal predecessors, (112), 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-30 10:18:37,759 INFO L278 IsEmpty]: Start isEmpty. Operand 900 states and 1263 transitions. [2025-04-30 10:18:37,760 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-04-30 10:18:37,760 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:18:37,760 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:37,766 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-30 10:18:37,960 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:18:37,961 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-04-30 10:18:37,961 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:37,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1854220080, now seen corresponding path program 1 times [2025-04-30 10:18:37,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:37,961 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115985016] [2025-04-30 10:18:37,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:37,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:37,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-04-30 10:18:37,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-04-30 10:18:37,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:37,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:38,079 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-30 10:18:38,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:38,079 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115985016] [2025-04-30 10:18:38,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115985016] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:38,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:38,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:18:38,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433118338] [2025-04-30 10:18:38,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:38,079 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:18:38,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:38,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:18:38,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:18:38,080 INFO L87 Difference]: Start difference. First operand 900 states and 1263 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-30 10:18:38,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:18:38,318 INFO L93 Difference]: Finished difference Result 2124 states and 2967 transitions. [2025-04-30 10:18:38,318 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:18:38,318 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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 80 [2025-04-30 10:18:38,318 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:18:38,323 INFO L225 Difference]: With dead ends: 2124 [2025-04-30 10:18:38,323 INFO L226 Difference]: Without dead ends: 1165 [2025-04-30 10:18:38,325 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:18:38,326 INFO L437 NwaCegarLoop]: 95 mSDtfsCounter, 157 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:18:38,326 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 385 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:18:38,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2025-04-30 10:18:38,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1079. [2025-04-30 10:18:38,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 1078 states have (on average 1.4063079777365493) internal successors, (1516), 1078 states have internal predecessors, (1516), 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-30 10:18:38,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1516 transitions. [2025-04-30 10:18:38,358 INFO L79 Accepts]: Start accepts. Automaton has 1079 states and 1516 transitions. Word has length 80 [2025-04-30 10:18:38,359 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:18:38,359 INFO L485 AbstractCegarLoop]: Abstraction has 1079 states and 1516 transitions. [2025-04-30 10:18:38,359 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-30 10:18:38,359 INFO L278 IsEmpty]: Start isEmpty. Operand 1079 states and 1516 transitions. [2025-04-30 10:18:38,360 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-04-30 10:18:38,360 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:18:38,360 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:38,360 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-30 10:18:38,361 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-04-30 10:18:38,361 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:38,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1256187553, now seen corresponding path program 1 times [2025-04-30 10:18:38,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:38,361 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103380797] [2025-04-30 10:18:38,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:38,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:38,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-04-30 10:18:38,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-04-30 10:18:38,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:38,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:38,484 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-30 10:18:38,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:38,484 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103380797] [2025-04-30 10:18:38,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103380797] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:38,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:38,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:18:38,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475263945] [2025-04-30 10:18:38,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:38,485 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:18:38,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:38,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:18:38,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:18:38,486 INFO L87 Difference]: Start difference. First operand 1079 states and 1516 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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-30 10:18:38,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:18:38,718 INFO L93 Difference]: Finished difference Result 2425 states and 3400 transitions. [2025-04-30 10:18:38,718 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:18:38,718 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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 80 [2025-04-30 10:18:38,718 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:18:38,722 INFO L225 Difference]: With dead ends: 2425 [2025-04-30 10:18:38,722 INFO L226 Difference]: Without dead ends: 1331 [2025-04-30 10:18:38,723 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:18:38,724 INFO L437 NwaCegarLoop]: 85 mSDtfsCounter, 239 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:18:38,724 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 318 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:18:38,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2025-04-30 10:18:38,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1239. [2025-04-30 10:18:38,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1238 states have (on average 1.4103392568659128) internal successors, (1746), 1238 states have internal predecessors, (1746), 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-30 10:18:38,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1746 transitions. [2025-04-30 10:18:38,756 INFO L79 Accepts]: Start accepts. Automaton has 1239 states and 1746 transitions. Word has length 80 [2025-04-30 10:18:38,757 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:18:38,757 INFO L485 AbstractCegarLoop]: Abstraction has 1239 states and 1746 transitions. [2025-04-30 10:18:38,757 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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-30 10:18:38,757 INFO L278 IsEmpty]: Start isEmpty. Operand 1239 states and 1746 transitions. [2025-04-30 10:18:38,758 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-04-30 10:18:38,758 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:18:38,758 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:38,759 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:18:38,759 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-04-30 10:18:38,759 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:38,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1863527712, now seen corresponding path program 1 times [2025-04-30 10:18:38,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:38,759 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781273064] [2025-04-30 10:18:38,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:38,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:38,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-04-30 10:18:38,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-04-30 10:18:38,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:38,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:38,861 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-04-30 10:18:38,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:38,861 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781273064] [2025-04-30 10:18:38,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781273064] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:38,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:38,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:18:38,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625009345] [2025-04-30 10:18:38,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:38,862 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:18:38,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:38,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:18:38,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:18:38,862 INFO L87 Difference]: Start difference. First operand 1239 states and 1746 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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-30 10:18:38,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:18:38,884 INFO L93 Difference]: Finished difference Result 2433 states and 3436 transitions. [2025-04-30 10:18:38,884 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:18:38,884 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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) Word has length 86 [2025-04-30 10:18:38,884 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:18:38,888 INFO L225 Difference]: With dead ends: 2433 [2025-04-30 10:18:38,888 INFO L226 Difference]: Without dead ends: 1213 [2025-04-30 10:18:38,889 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:18:38,890 INFO L437 NwaCegarLoop]: 92 mSDtfsCounter, 92 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:18:38,890 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 93 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:18:38,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2025-04-30 10:18:38,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1213. [2025-04-30 10:18:38,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1213 states, 1212 states have (on average 1.4125412541254125) internal successors, (1712), 1212 states have internal predecessors, (1712), 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-30 10:18:38,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1712 transitions. [2025-04-30 10:18:38,923 INFO L79 Accepts]: Start accepts. Automaton has 1213 states and 1712 transitions. Word has length 86 [2025-04-30 10:18:38,923 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:18:38,923 INFO L485 AbstractCegarLoop]: Abstraction has 1213 states and 1712 transitions. [2025-04-30 10:18:38,923 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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-30 10:18:38,923 INFO L278 IsEmpty]: Start isEmpty. Operand 1213 states and 1712 transitions. [2025-04-30 10:18:38,925 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-04-30 10:18:38,925 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:18:38,925 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:38,925 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-30 10:18:38,925 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-04-30 10:18:38,927 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:38,927 INFO L85 PathProgramCache]: Analyzing trace with hash 498538101, now seen corresponding path program 1 times [2025-04-30 10:18:38,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:38,927 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502343711] [2025-04-30 10:18:38,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:38,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:38,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-04-30 10:18:38,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-04-30 10:18:38,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:38,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:39,139 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 30 proven. 28 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-30 10:18:39,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:39,139 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502343711] [2025-04-30 10:18:39,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502343711] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:18:39,139 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429924887] [2025-04-30 10:18:39,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:39,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:18:39,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:18:39,142 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:18:39,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-30 10:18:39,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-04-30 10:18:39,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-04-30 10:18:39,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:39,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:39,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-30 10:18:39,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:18:39,253 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-04-30 10:18:39,253 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:18:39,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429924887] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:39,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:18:39,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2025-04-30 10:18:39,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623070046] [2025-04-30 10:18:39,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:39,253 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:18:39,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:39,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:18:39,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:18:39,254 INFO L87 Difference]: Start difference. First operand 1213 states and 1712 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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-30 10:18:39,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:18:39,373 INFO L93 Difference]: Finished difference Result 3739 states and 5287 transitions. [2025-04-30 10:18:39,374 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:18:39,374 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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 86 [2025-04-30 10:18:39,374 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:18:39,384 INFO L225 Difference]: With dead ends: 3739 [2025-04-30 10:18:39,385 INFO L226 Difference]: Without dead ends: 3543 [2025-04-30 10:18:39,386 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:18:39,386 INFO L437 NwaCegarLoop]: 145 mSDtfsCounter, 126 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:18:39,386 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 357 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:18:39,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3543 states. [2025-04-30 10:18:39,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3543 to 1872. [2025-04-30 10:18:39,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1872 states, 1871 states have (on average 1.4270443613041155) internal successors, (2670), 1871 states have internal predecessors, (2670), 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-30 10:18:39,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 2670 transitions. [2025-04-30 10:18:39,471 INFO L79 Accepts]: Start accepts. Automaton has 1872 states and 2670 transitions. Word has length 86 [2025-04-30 10:18:39,471 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:18:39,471 INFO L485 AbstractCegarLoop]: Abstraction has 1872 states and 2670 transitions. [2025-04-30 10:18:39,471 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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-30 10:18:39,471 INFO L278 IsEmpty]: Start isEmpty. Operand 1872 states and 2670 transitions. [2025-04-30 10:18:39,473 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-04-30 10:18:39,473 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:18:39,473 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:39,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-30 10:18:39,674 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-30 10:18:39,674 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-04-30 10:18:39,674 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:39,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1746481831, now seen corresponding path program 1 times [2025-04-30 10:18:39,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:39,675 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122646928] [2025-04-30 10:18:39,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:39,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:39,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-04-30 10:18:39,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-04-30 10:18:39,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:39,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:39,779 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-04-30 10:18:39,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:39,780 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122646928] [2025-04-30 10:18:39,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122646928] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:39,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:39,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:18:39,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472301252] [2025-04-30 10:18:39,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:39,780 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:18:39,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:39,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:18:39,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:18:39,781 INFO L87 Difference]: Start difference. First operand 1872 states and 2670 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-30 10:18:39,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:18:39,903 INFO L93 Difference]: Finished difference Result 4733 states and 6415 transitions. [2025-04-30 10:18:39,904 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:18:39,904 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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 89 [2025-04-30 10:18:39,904 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:18:39,912 INFO L225 Difference]: With dead ends: 4733 [2025-04-30 10:18:39,912 INFO L226 Difference]: Without dead ends: 2892 [2025-04-30 10:18:39,914 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:18:39,914 INFO L437 NwaCegarLoop]: 136 mSDtfsCounter, 246 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:18:39,915 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 338 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:18:39,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2025-04-30 10:18:39,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 2142. [2025-04-30 10:18:39,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2142 states, 2141 states have (on average 1.2993928070994862) internal successors, (2782), 2141 states have internal predecessors, (2782), 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-30 10:18:39,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 2782 transitions. [2025-04-30 10:18:39,972 INFO L79 Accepts]: Start accepts. Automaton has 2142 states and 2782 transitions. Word has length 89 [2025-04-30 10:18:39,972 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:18:39,972 INFO L485 AbstractCegarLoop]: Abstraction has 2142 states and 2782 transitions. [2025-04-30 10:18:39,972 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-30 10:18:39,972 INFO L278 IsEmpty]: Start isEmpty. Operand 2142 states and 2782 transitions. [2025-04-30 10:18:39,974 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-04-30 10:18:39,974 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:18:39,974 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:39,974 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-30 10:18:39,974 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-04-30 10:18:39,975 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:39,975 INFO L85 PathProgramCache]: Analyzing trace with hash -450572063, now seen corresponding path program 1 times [2025-04-30 10:18:39,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:39,975 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599628260] [2025-04-30 10:18:39,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:39,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:39,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-04-30 10:18:39,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-04-30 10:18:39,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:39,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:40,163 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 39 proven. 33 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-30 10:18:40,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:40,163 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599628260] [2025-04-30 10:18:40,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599628260] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:18:40,164 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810217282] [2025-04-30 10:18:40,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:40,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:18:40,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:18:40,166 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:18:40,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-30 10:18:40,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-04-30 10:18:40,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-04-30 10:18:40,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:40,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:40,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-30 10:18:40,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:18:40,326 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-04-30 10:18:40,326 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:18:40,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810217282] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:40,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:18:40,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2025-04-30 10:18:40,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843913567] [2025-04-30 10:18:40,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:40,327 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:18:40,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:40,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:18:40,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:18:40,327 INFO L87 Difference]: Start difference. First operand 2142 states and 2782 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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-30 10:18:40,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:18:40,540 INFO L93 Difference]: Finished difference Result 5572 states and 7155 transitions. [2025-04-30 10:18:40,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:18:40,540 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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 89 [2025-04-30 10:18:40,540 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:18:40,555 INFO L225 Difference]: With dead ends: 5572 [2025-04-30 10:18:40,555 INFO L226 Difference]: Without dead ends: 5354 [2025-04-30 10:18:40,558 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:18:40,558 INFO L437 NwaCegarLoop]: 168 mSDtfsCounter, 161 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:18:40,559 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 631 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:18:40,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5354 states. [2025-04-30 10:18:40,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5354 to 2142. [2025-04-30 10:18:40,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2142 states, 2141 states have (on average 1.2993928070994862) internal successors, (2782), 2141 states have internal predecessors, (2782), 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-30 10:18:40,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 2782 transitions. [2025-04-30 10:18:40,658 INFO L79 Accepts]: Start accepts. Automaton has 2142 states and 2782 transitions. Word has length 89 [2025-04-30 10:18:40,658 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:18:40,658 INFO L485 AbstractCegarLoop]: Abstraction has 2142 states and 2782 transitions. [2025-04-30 10:18:40,658 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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-30 10:18:40,658 INFO L278 IsEmpty]: Start isEmpty. Operand 2142 states and 2782 transitions. [2025-04-30 10:18:40,660 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-04-30 10:18:40,660 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:18:40,660 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:40,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-30 10:18:40,861 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:18:40,861 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-04-30 10:18:40,862 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:40,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1406844758, now seen corresponding path program 1 times [2025-04-30 10:18:40,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:40,862 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659973388] [2025-04-30 10:18:40,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:40,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:40,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-04-30 10:18:40,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-04-30 10:18:40,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:40,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:40,979 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-04-30 10:18:40,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:40,980 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659973388] [2025-04-30 10:18:40,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659973388] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:18:40,980 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099282118] [2025-04-30 10:18:40,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:40,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:18:40,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:18:40,982 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:18:40,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-30 10:18:41,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-04-30 10:18:41,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-04-30 10:18:41,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:41,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:41,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-30 10:18:41,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:18:41,079 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-04-30 10:18:41,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:18:41,180 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 40 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-30 10:18:41,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099282118] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:18:41,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:18:41,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 6] total 11 [2025-04-30 10:18:41,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157222027] [2025-04-30 10:18:41,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:18:41,181 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:18:41,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:41,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:18:41,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:18:41,182 INFO L87 Difference]: Start difference. First operand 2142 states and 2782 transitions. Second operand has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 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-30 10:18:41,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:18:41,433 INFO L93 Difference]: Finished difference Result 3490 states and 4527 transitions. [2025-04-30 10:18:41,433 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:18:41,434 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 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 89 [2025-04-30 10:18:41,434 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:18:41,438 INFO L225 Difference]: With dead ends: 3490 [2025-04-30 10:18:41,438 INFO L226 Difference]: Without dead ends: 1371 [2025-04-30 10:18:41,440 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:18:41,441 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 276 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:18:41,441 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 266 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:18:41,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2025-04-30 10:18:41,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1105. [2025-04-30 10:18:41,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1105 states, 1104 states have (on average 1.1748188405797102) internal successors, (1297), 1104 states have internal predecessors, (1297), 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-30 10:18:41,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1297 transitions. [2025-04-30 10:18:41,488 INFO L79 Accepts]: Start accepts. Automaton has 1105 states and 1297 transitions. Word has length 89 [2025-04-30 10:18:41,488 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:18:41,488 INFO L485 AbstractCegarLoop]: Abstraction has 1105 states and 1297 transitions. [2025-04-30 10:18:41,489 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 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-30 10:18:41,489 INFO L278 IsEmpty]: Start isEmpty. Operand 1105 states and 1297 transitions. [2025-04-30 10:18:41,490 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-04-30 10:18:41,490 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:18:41,490 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:41,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-30 10:18:41,695 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:18:41,695 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-04-30 10:18:41,696 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:41,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1817188318, now seen corresponding path program 1 times [2025-04-30 10:18:41,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:41,696 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783479275] [2025-04-30 10:18:41,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:41,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:41,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-04-30 10:18:41,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-04-30 10:18:41,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:41,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:41,801 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-04-30 10:18:41,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:41,801 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783479275] [2025-04-30 10:18:41,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783479275] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:18:41,802 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579664165] [2025-04-30 10:18:41,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:41,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:18:41,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:18:41,804 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:18:41,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-30 10:18:41,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-04-30 10:18:41,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-04-30 10:18:41,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:41,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:41,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-30 10:18:41,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:18:41,899 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-04-30 10:18:41,899 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:18:41,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579664165] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:41,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:18:41,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-04-30 10:18:41,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109407794] [2025-04-30 10:18:41,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:41,900 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:18:41,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:41,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:18:41,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:18:41,900 INFO L87 Difference]: Start difference. First operand 1105 states and 1297 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-30 10:18:42,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:18:42,003 INFO L93 Difference]: Finished difference Result 1759 states and 2056 transitions. [2025-04-30 10:18:42,003 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:18:42,004 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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 89 [2025-04-30 10:18:42,004 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:18:42,007 INFO L225 Difference]: With dead ends: 1759 [2025-04-30 10:18:42,007 INFO L226 Difference]: Without dead ends: 1548 [2025-04-30 10:18:42,008 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:18:42,009 INFO L437 NwaCegarLoop]: 77 mSDtfsCounter, 47 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:18:42,009 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 208 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:18:42,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2025-04-30 10:18:42,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1451. [2025-04-30 10:18:42,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1451 states, 1450 states have (on average 1.1779310344827587) internal successors, (1708), 1450 states have internal predecessors, (1708), 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-30 10:18:42,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 1708 transitions. [2025-04-30 10:18:42,058 INFO L79 Accepts]: Start accepts. Automaton has 1451 states and 1708 transitions. Word has length 89 [2025-04-30 10:18:42,059 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:18:42,059 INFO L485 AbstractCegarLoop]: Abstraction has 1451 states and 1708 transitions. [2025-04-30 10:18:42,059 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-30 10:18:42,059 INFO L278 IsEmpty]: Start isEmpty. Operand 1451 states and 1708 transitions. [2025-04-30 10:18:42,060 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-04-30 10:18:42,060 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:18:42,060 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:42,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-30 10:18:42,260 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-04-30 10:18:42,261 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-04-30 10:18:42,261 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:42,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1280582435, now seen corresponding path program 1 times [2025-04-30 10:18:42,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:42,262 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277688854] [2025-04-30 10:18:42,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:42,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:42,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-04-30 10:18:42,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-04-30 10:18:42,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:42,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:42,437 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 39 proven. 33 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-30 10:18:42,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:42,438 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277688854] [2025-04-30 10:18:42,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277688854] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:18:42,438 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048292033] [2025-04-30 10:18:42,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:42,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:18:42,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:18:42,440 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:18:42,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-30 10:18:42,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-04-30 10:18:42,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-04-30 10:18:42,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:42,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:42,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-30 10:18:42,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:18:42,635 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-04-30 10:18:42,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:18:42,878 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-04-30 10:18:42,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048292033] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:18:42,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:18:42,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 18 [2025-04-30 10:18:42,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695703530] [2025-04-30 10:18:42,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:18:42,879 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-30 10:18:42,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:42,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-30 10:18:42,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:18:42,880 INFO L87 Difference]: Start difference. First operand 1451 states and 1708 transitions. Second operand has 18 states, 18 states have (on average 11.333333333333334) internal successors, (204), 18 states have internal predecessors, (204), 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-30 10:18:43,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:18:43,880 INFO L93 Difference]: Finished difference Result 3062 states and 3530 transitions. [2025-04-30 10:18:43,881 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-30 10:18:43,881 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 11.333333333333334) internal successors, (204), 18 states have internal predecessors, (204), 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 91 [2025-04-30 10:18:43,882 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:18:43,892 INFO L225 Difference]: With dead ends: 3062 [2025-04-30 10:18:43,894 INFO L226 Difference]: Without dead ends: 2658 [2025-04-30 10:18:43,896 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=611, Invalid=2251, Unknown=0, NotChecked=0, Total=2862 [2025-04-30 10:18:43,896 INFO L437 NwaCegarLoop]: 274 mSDtfsCounter, 720 mSDsluCounter, 1893 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 2167 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:18:43,896 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 2167 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:18:43,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2025-04-30 10:18:43,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 943. [2025-04-30 10:18:43,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 942 states have (on average 1.134819532908705) internal successors, (1069), 942 states have internal predecessors, (1069), 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-30 10:18:43,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1069 transitions. [2025-04-30 10:18:43,928 INFO L79 Accepts]: Start accepts. Automaton has 943 states and 1069 transitions. Word has length 91 [2025-04-30 10:18:43,928 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:18:43,928 INFO L485 AbstractCegarLoop]: Abstraction has 943 states and 1069 transitions. [2025-04-30 10:18:43,928 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 11.333333333333334) internal successors, (204), 18 states have internal predecessors, (204), 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-30 10:18:43,929 INFO L278 IsEmpty]: Start isEmpty. Operand 943 states and 1069 transitions. [2025-04-30 10:18:43,929 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-04-30 10:18:43,929 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:18:43,929 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:43,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-30 10:18:44,130 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:18:44,130 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-04-30 10:18:44,131 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:44,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1935176995, now seen corresponding path program 1 times [2025-04-30 10:18:44,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:44,131 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078421117] [2025-04-30 10:18:44,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:44,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:44,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-04-30 10:18:44,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-04-30 10:18:44,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:44,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:44,230 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-30 10:18:44,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:44,230 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078421117] [2025-04-30 10:18:44,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078421117] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:18:44,230 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733097924] [2025-04-30 10:18:44,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:44,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:18:44,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:18:44,257 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:18:44,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-30 10:18:44,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-04-30 10:18:44,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-04-30 10:18:44,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:44,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:44,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-30 10:18:44,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:18:44,385 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-04-30 10:18:44,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:18:44,542 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-30 10:18:44,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733097924] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:18:44,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:18:44,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 9] total 17 [2025-04-30 10:18:44,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754230422] [2025-04-30 10:18:44,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:18:44,543 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-30 10:18:44,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:44,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-30 10:18:44,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:18:44,544 INFO L87 Difference]: Start difference. First operand 943 states and 1069 transitions. Second operand has 17 states, 17 states have (on average 9.352941176470589) internal successors, (159), 17 states have internal predecessors, (159), 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-30 10:18:45,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:18:45,388 INFO L93 Difference]: Finished difference Result 2840 states and 3234 transitions. [2025-04-30 10:18:45,388 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-30 10:18:45,388 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 9.352941176470589) internal successors, (159), 17 states have internal predecessors, (159), 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 92 [2025-04-30 10:18:45,388 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:18:45,391 INFO L225 Difference]: With dead ends: 2840 [2025-04-30 10:18:45,391 INFO L226 Difference]: Without dead ends: 1704 [2025-04-30 10:18:45,393 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=535, Invalid=1105, Unknown=0, NotChecked=0, Total=1640 [2025-04-30 10:18:45,393 INFO L437 NwaCegarLoop]: 78 mSDtfsCounter, 985 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:18:45,394 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [985 Valid, 587 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-30 10:18:45,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states. [2025-04-30 10:18:45,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 1269. [2025-04-30 10:18:45,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 1268 states have (on average 1.1443217665615142) internal successors, (1451), 1268 states have internal predecessors, (1451), 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-30 10:18:45,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 1451 transitions. [2025-04-30 10:18:45,438 INFO L79 Accepts]: Start accepts. Automaton has 1269 states and 1451 transitions. Word has length 92 [2025-04-30 10:18:45,438 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:18:45,438 INFO L485 AbstractCegarLoop]: Abstraction has 1269 states and 1451 transitions. [2025-04-30 10:18:45,438 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.352941176470589) internal successors, (159), 17 states have internal predecessors, (159), 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-30 10:18:45,438 INFO L278 IsEmpty]: Start isEmpty. Operand 1269 states and 1451 transitions. [2025-04-30 10:18:45,439 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-04-30 10:18:45,439 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:18:45,440 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:45,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-30 10:18:45,644 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-04-30 10:18:45,644 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-04-30 10:18:45,644 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:45,645 INFO L85 PathProgramCache]: Analyzing trace with hash -199081263, now seen corresponding path program 1 times [2025-04-30 10:18:45,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:45,645 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256296318] [2025-04-30 10:18:45,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:45,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:45,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-04-30 10:18:45,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-04-30 10:18:45,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:45,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:45,811 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 30 proven. 28 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-30 10:18:45,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:45,811 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256296318] [2025-04-30 10:18:45,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256296318] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:18:45,812 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801044314] [2025-04-30 10:18:45,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:45,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:18:45,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:18:45,814 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:18:45,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-30 10:18:45,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-04-30 10:18:45,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-04-30 10:18:45,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:45,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:45,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-30 10:18:45,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:18:46,007 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 56 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-04-30 10:18:46,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:18:46,108 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 52 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-04-30 10:18:46,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801044314] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:18:46,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:18:46,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2025-04-30 10:18:46,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256988589] [2025-04-30 10:18:46,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:18:46,109 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-30 10:18:46,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:46,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-30 10:18:46,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:18:46,109 INFO L87 Difference]: Start difference. First operand 1269 states and 1451 transitions. Second operand has 15 states, 15 states have (on average 13.933333333333334) internal successors, (209), 15 states have internal predecessors, (209), 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-30 10:18:46,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:18:46,724 INFO L93 Difference]: Finished difference Result 2791 states and 3127 transitions. [2025-04-30 10:18:46,726 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-30 10:18:46,726 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 13.933333333333334) internal successors, (209), 15 states have internal predecessors, (209), 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 97 [2025-04-30 10:18:46,726 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:18:46,727 INFO L225 Difference]: With dead ends: 2791 [2025-04-30 10:18:46,728 INFO L226 Difference]: Without dead ends: 784 [2025-04-30 10:18:46,729 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=319, Invalid=941, Unknown=0, NotChecked=0, Total=1260 [2025-04-30 10:18:46,729 INFO L437 NwaCegarLoop]: 198 mSDtfsCounter, 664 mSDsluCounter, 1389 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 1587 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:18:46,730 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 1587 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:18:46,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2025-04-30 10:18:46,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 431. [2025-04-30 10:18:46,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 430 states have (on average 1.1744186046511629) internal successors, (505), 430 states have internal predecessors, (505), 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-30 10:18:46,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 505 transitions. [2025-04-30 10:18:46,743 INFO L79 Accepts]: Start accepts. Automaton has 431 states and 505 transitions. Word has length 97 [2025-04-30 10:18:46,743 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:18:46,743 INFO L485 AbstractCegarLoop]: Abstraction has 431 states and 505 transitions. [2025-04-30 10:18:46,743 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 13.933333333333334) internal successors, (209), 15 states have internal predecessors, (209), 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-30 10:18:46,744 INFO L278 IsEmpty]: Start isEmpty. Operand 431 states and 505 transitions. [2025-04-30 10:18:46,744 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-04-30 10:18:46,744 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:18:46,744 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:46,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-30 10:18:46,945 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-04-30 10:18:46,945 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-04-30 10:18:46,945 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:46,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1112601436, now seen corresponding path program 1 times [2025-04-30 10:18:46,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:46,946 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649431959] [2025-04-30 10:18:46,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:46,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:46,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-04-30 10:18:46,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-04-30 10:18:46,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:46,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:18:46,977 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:18:46,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-04-30 10:18:47,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-04-30 10:18:47,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:47,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:18:47,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:18:47,035 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:18:47,036 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 41 remaining) [2025-04-30 10:18:47,037 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 41 remaining) [2025-04-30 10:18:47,037 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 41 remaining) [2025-04-30 10:18:47,037 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 41 remaining) [2025-04-30 10:18:47,037 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 41 remaining) [2025-04-30 10:18:47,037 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 41 remaining) [2025-04-30 10:18:47,037 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 41 remaining) [2025-04-30 10:18:47,037 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 41 remaining) [2025-04-30 10:18:47,037 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 41 remaining) [2025-04-30 10:18:47,037 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 41 remaining) [2025-04-30 10:18:47,037 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 41 remaining) [2025-04-30 10:18:47,037 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 41 remaining) [2025-04-30 10:18:47,038 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 41 remaining) [2025-04-30 10:18:47,038 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 41 remaining) [2025-04-30 10:18:47,038 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 41 remaining) [2025-04-30 10:18:47,038 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 41 remaining) [2025-04-30 10:18:47,038 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 41 remaining) [2025-04-30 10:18:47,038 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 41 remaining) [2025-04-30 10:18:47,038 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 41 remaining) [2025-04-30 10:18:47,038 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 41 remaining) [2025-04-30 10:18:47,038 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 41 remaining) [2025-04-30 10:18:47,038 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 41 remaining) [2025-04-30 10:18:47,038 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 41 remaining) [2025-04-30 10:18:47,038 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 41 remaining) [2025-04-30 10:18:47,038 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 41 remaining) [2025-04-30 10:18:47,038 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 41 remaining) [2025-04-30 10:18:47,038 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 41 remaining) [2025-04-30 10:18:47,039 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 41 remaining) [2025-04-30 10:18:47,039 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 41 remaining) [2025-04-30 10:18:47,039 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 41 remaining) [2025-04-30 10:18:47,039 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 41 remaining) [2025-04-30 10:18:47,039 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 41 remaining) [2025-04-30 10:18:47,039 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 41 remaining) [2025-04-30 10:18:47,039 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 41 remaining) [2025-04-30 10:18:47,039 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 41 remaining) [2025-04-30 10:18:47,039 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 41 remaining) [2025-04-30 10:18:47,039 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 41 remaining) [2025-04-30 10:18:47,039 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 41 remaining) [2025-04-30 10:18:47,039 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 41 remaining) [2025-04-30 10:18:47,039 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 41 remaining) [2025-04-30 10:18:47,039 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 41 remaining) [2025-04-30 10:18:47,040 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-30 10:18:47,042 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:47,129 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:18:47,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:18:47 BoogieIcfgContainer [2025-04-30 10:18:47,132 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:18:47,132 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:18:47,132 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:18:47,133 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:18:47,133 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:18:31" (3/4) ... [2025-04-30 10:18:47,134 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-30 10:18:47,215 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 70. [2025-04-30 10:18:47,283 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:18:47,287 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:18:47,287 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:18:47,287 INFO L158 Benchmark]: Toolchain (without parser) took 16154.21ms. Allocated memory was 167.8MB in the beginning and 318.8MB in the end (delta: 151.0MB). Free memory was 134.8MB in the beginning and 145.4MB in the end (delta: -10.6MB). Peak memory consumption was 139.4MB. Max. memory is 16.1GB. [2025-04-30 10:18:47,287 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:18:47,288 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.59ms. Allocated memory is still 167.8MB. Free memory was 134.8MB in the beginning and 118.3MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:18:47,288 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.23ms. Allocated memory is still 167.8MB. Free memory was 118.3MB in the beginning and 114.1MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:18:47,288 INFO L158 Benchmark]: Boogie Preprocessor took 66.12ms. Allocated memory is still 167.8MB. Free memory was 114.1MB in the beginning and 111.3MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:18:47,288 INFO L158 Benchmark]: RCFGBuilder took 487.54ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 83.6MB in the end (delta: 27.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-30 10:18:47,288 INFO L158 Benchmark]: TraceAbstraction took 15160.77ms. Allocated memory was 167.8MB in the beginning and 318.8MB in the end (delta: 151.0MB). Free memory was 83.2MB in the beginning and 158.8MB in the end (delta: -75.6MB). Peak memory consumption was 72.3MB. Max. memory is 16.1GB. [2025-04-30 10:18:47,288 INFO L158 Benchmark]: Witness Printer took 154.44ms. Allocated memory is still 318.8MB. Free memory was 158.8MB in the beginning and 145.4MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:18:47,289 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.59ms. Allocated memory is still 167.8MB. Free memory was 134.8MB in the beginning and 118.3MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.23ms. Allocated memory is still 167.8MB. Free memory was 118.3MB in the beginning and 114.1MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 66.12ms. Allocated memory is still 167.8MB. Free memory was 114.1MB in the beginning and 111.3MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 487.54ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 83.6MB in the end (delta: 27.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 15160.77ms. Allocated memory was 167.8MB in the beginning and 318.8MB in the end (delta: 151.0MB). Free memory was 83.2MB in the beginning and 158.8MB in the end (delta: -75.6MB). Peak memory consumption was 72.3MB. Max. memory is 16.1GB. * Witness Printer took 154.44ms. Allocated memory is still 318.8MB. Free memory was 158.8MB in the beginning and 145.4MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 116]: integer overflow possible integer overflow possible We found a FailurePath: [L124] unsigned int a, b, r; [L126] b = __VERIFIER_nondet_uint() [L128] a = 234770789 [L130] CALL mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, na=4] [L68] nb = (unsigned char)4 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, na=4, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, na=4, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] EXPR partial_sum + a0 [L84] partial_sum = partial_sum + a0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=101] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=101] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=101] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=101] [L89] COND TRUE i < nb VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=101] [L90] COND TRUE i == (unsigned char)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=101] [L90] EXPR partial_sum + b0 [L90] partial_sum = partial_sum + b0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=256] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=256] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=256] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=256] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=0, na=4, nb=4, partial_sum=0] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L83] COND TRUE i < na VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L84] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L85] COND TRUE i == (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L85] EXPR partial_sum + a1 [L85] partial_sum = partial_sum + a1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=0] [L89] COND TRUE i < nb VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=0] [L91] COND TRUE i == (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=0] [L91] EXPR partial_sum + b1 [L91] partial_sum = partial_sum + b1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=0] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L83] COND TRUE i < na VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L84] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L86] COND TRUE i == (unsigned char)2 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L86] EXPR partial_sum + a2 [L86] partial_sum = partial_sum + a2 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L89] COND TRUE i < nb VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L92] COND TRUE i == (unsigned char)2 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L92] EXPR partial_sum + b2 [L92] partial_sum = partial_sum + b2 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=0, r1=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=0, r1=0] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=3, na=4, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L83] COND TRUE i < na VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L84] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L87] COND TRUE i == (unsigned char)3 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L87] EXPR partial_sum + a3 [L87] partial_sum = partial_sum + a3 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=0, r1=0, r2=0] [L89] COND TRUE i < nb VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=0, r1=0, r2=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=0, r1=0, r2=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=0, r1=0, r2=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=0, r1=0, r2=0] [L93] COND TRUE i == (unsigned char)3 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=0, r1=0, r2=0] [L93] EXPR partial_sum + b3 [L93] partial_sum = partial_sum + b3 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, r0=0, r1=0, r2=0, r3=255] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=4, na=4, nb=4, r0=0, r1=0, r2=0, r3=255] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, i=4, r0=0, r1=0, r2=0, r3=255] [L107] COND FALSE !(i < (unsigned char)4) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, r0=0, r1=0, r2=0, r3=255] [L116] EXPR r1 << 8U VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, r0=0, r1=0, r2=0, r3=255] [L116] EXPR r0 | (r1 << 8U) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, r2=0, r3=255] [L116] EXPR r2 << 16U VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, r2=0, r3=255] [L116] r0 | (r1 << 8U) | (r2 << 16U) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, r3=255] [L116] r3 << 24U VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241] - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 132 locations, 166 edges, 41 error locations. Started 1 CEGAR loops. OverallTime: 15.0s, OverallIterations: 26, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5537 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5537 mSDsluCounter, 11644 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8546 mSDsCounter, 464 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5683 IncrementalHoareTripleChecker+Invalid, 6147 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 464 mSolverCounterUnsat, 3098 mSDtfsCounter, 5683 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1652 GetRequests, 1364 SyntacticMatches, 2 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2287 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2142occurred in iteration=19, InterpolantAutomatonStates: 267, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 25 MinimizatonAttempts, 11847 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 2638 NumberOfCodeBlocks, 2638 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2939 ConstructedInterpolants, 0 QuantifiedInterpolants, 9895 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1960 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 41 InterpolantComputations, 20 PerfectInterpolantSequences, 2303/2663 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-30 10:18:47,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)