./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound50.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 462bdab67ac93ddd789186f30bfdfc189629d2959c27ec219da5960b800d2042 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:56:08,226 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:56:08,284 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:56:08,289 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:56:08,290 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:56:08,309 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:56:08,310 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:56:08,310 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:56:08,310 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:56:08,311 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:56:08,311 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:56:08,311 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:56:08,312 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:56:08,312 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:56:08,312 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:56:08,312 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:56:08,312 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:56:08,312 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:56:08,312 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:56:08,312 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:56:08,312 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:56:08,312 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:56:08,312 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:56:08,312 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:56:08,312 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:56:08,313 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:56:08,313 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:56:08,313 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:56:08,313 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:56:08,313 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:56:08,313 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:56:08,313 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:56:08,313 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:56:08,313 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:56:08,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:56:08,313 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:56:08,313 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:56:08,313 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:56:08,313 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:56:08,313 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:56:08,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:56:08,313 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:56:08,313 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:56:08,314 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:56:08,314 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:56:08,314 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 -> 462bdab67ac93ddd789186f30bfdfc189629d2959c27ec219da5960b800d2042 [2025-03-04 10:56:08,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:56:08,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:56:08,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:56:08,545 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:56:08,545 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:56:08,545 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound50.i [2025-03-04 10:56:09,638 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d86826756/21a2acb7841c4caabc212e70e4320b33/FLAG3bda7caf4 [2025-03-04 10:56:09,824 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:56:09,826 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound50.i [2025-03-04 10:56:09,834 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d86826756/21a2acb7841c4caabc212e70e4320b33/FLAG3bda7caf4 [2025-03-04 10:56:10,199 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d86826756/21a2acb7841c4caabc212e70e4320b33 [2025-03-04 10:56:10,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:56:10,201 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:56:10,202 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:56:10,202 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:56:10,205 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:56:10,205 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:56:10" (1/1) ... [2025-03-04 10:56:10,206 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79da9237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:56:10, skipping insertion in model container [2025-03-04 10:56:10,206 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:56:10" (1/1) ... [2025-03-04 10:56:10,215 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:56:10,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:56:10,334 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:56:10,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:56:10,357 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:56:10,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:56:10 WrapperNode [2025-03-04 10:56:10,358 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:56:10,359 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:56:10,359 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:56:10,359 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:56:10,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:56:10" (1/1) ... [2025-03-04 10:56:10,369 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:56:10" (1/1) ... [2025-03-04 10:56:10,379 INFO L138 Inliner]: procedures = 16, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2025-03-04 10:56:10,381 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:56:10,382 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:56:10,382 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:56:10,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:56:10,387 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:56:10" (1/1) ... [2025-03-04 10:56:10,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:56:10" (1/1) ... [2025-03-04 10:56:10,391 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:56:10" (1/1) ... [2025-03-04 10:56:10,399 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 10:56:10,402 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:56:10" (1/1) ... [2025-03-04 10:56:10,403 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:56:10" (1/1) ... [2025-03-04 10:56:10,405 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:56:10" (1/1) ... [2025-03-04 10:56:10,405 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:56:10" (1/1) ... [2025-03-04 10:56:10,405 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:56:10" (1/1) ... [2025-03-04 10:56:10,406 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:56:10" (1/1) ... [2025-03-04 10:56:10,406 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:56:10,407 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:56:10,409 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:56:10,409 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:56:10,410 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:56:10" (1/1) ... [2025-03-04 10:56:10,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:56:10,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:56:10,436 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:56:10,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:56:10,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:56:10,456 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 10:56:10,456 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 10:56:10,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:56:10,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:56:10,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:56:10,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 10:56:10,457 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 10:56:10,499 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:56:10,501 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:56:10,625 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-04 10:56:10,625 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:56:10,635 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:56:10,635 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:56:10,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:56:10 BoogieIcfgContainer [2025-03-04 10:56:10,635 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:56:10,636 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:56:10,636 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:56:10,640 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:56:10,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:56:10" (1/3) ... [2025-03-04 10:56:10,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65fafe11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:56:10, skipping insertion in model container [2025-03-04 10:56:10,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:56:10" (2/3) ... [2025-03-04 10:56:10,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65fafe11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:56:10, skipping insertion in model container [2025-03-04 10:56:10,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:56:10" (3/3) ... [2025-03-04 10:56:10,643 INFO L128 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound50.i [2025-03-04 10:56:10,654 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:56:10,657 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG divbin_unwindbound50.i that has 3 procedures, 37 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-03-04 10:56:10,697 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:56:10,704 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@237a8392, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:56:10,704 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 10:56:10,708 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 30 states have internal predecessors, (40), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:56:10,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 10:56:10,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:56:10,712 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:56:10,713 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:56:10,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:56:10,716 INFO L85 PathProgramCache]: Analyzing trace with hash -2049057214, now seen corresponding path program 1 times [2025-03-04 10:56:10,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:56:10,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119190729] [2025-03-04 10:56:10,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:56:10,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:56:10,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:56:10,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:56:10,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:56:10,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:56:10,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:56:10,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:56:10,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119190729] [2025-03-04 10:56:10,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119190729] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:56:10,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768471799] [2025-03-04 10:56:10,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:56:10,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:56:10,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:56:10,828 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:56:10,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:56:10,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:56:10,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:56:10,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:56:10,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:56:10,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 10:56:10,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:56:10,876 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:56:10,876 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:56:10,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768471799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:56:10,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:56:10,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 10:56:10,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072709173] [2025-03-04 10:56:10,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:56:10,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 10:56:10,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:56:10,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 10:56:10,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 10:56:10,897 INFO L87 Difference]: Start difference. First operand has 37 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 30 states have internal predecessors, (40), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:56:10,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:56:10,908 INFO L93 Difference]: Finished difference Result 70 states and 95 transitions. [2025-03-04 10:56:10,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 10:56:10,909 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2025-03-04 10:56:10,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:56:10,912 INFO L225 Difference]: With dead ends: 70 [2025-03-04 10:56:10,912 INFO L226 Difference]: Without dead ends: 29 [2025-03-04 10:56:10,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 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-03-04 10:56:10,915 INFO L435 NwaCegarLoop]: 42 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, 42 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-03-04 10:56:10,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:56:10,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-04 10:56:10,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-04 10:56:10,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:56:10,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2025-03-04 10:56:10,940 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 15 [2025-03-04 10:56:10,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:56:10,940 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2025-03-04 10:56:10,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:56:10,941 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2025-03-04 10:56:10,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 10:56:10,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:56:10,942 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:56:10,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 10:56:11,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 10:56:11,146 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:56:11,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:56:11,147 INFO L85 PathProgramCache]: Analyzing trace with hash 477587874, now seen corresponding path program 1 times [2025-03-04 10:56:11,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:56:11,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946587403] [2025-03-04 10:56:11,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:56:11,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:56:11,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:56:11,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:56:11,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:56:11,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:56:11,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:56:11,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:56:11,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946587403] [2025-03-04 10:56:11,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946587403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:56:11,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:56:11,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:56:11,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250838655] [2025-03-04 10:56:11,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:56:11,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:56:11,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:56:11,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:56:11,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:56:11,247 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:56:11,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:56:11,285 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2025-03-04 10:56:11,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:56:11,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2025-03-04 10:56:11,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:56:11,285 INFO L225 Difference]: With dead ends: 34 [2025-03-04 10:56:11,285 INFO L226 Difference]: Without dead ends: 33 [2025-03-04 10:56:11,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:56:11,286 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 18 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:56:11,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 61 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:56:11,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-04 10:56:11,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2025-03-04 10:56:11,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:56:11,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2025-03-04 10:56:11,293 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 15 [2025-03-04 10:56:11,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:56:11,294 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-03-04 10:56:11,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:56:11,294 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2025-03-04 10:56:11,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 10:56:11,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:56:11,294 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:56:11,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:56:11,294 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:56:11,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:56:11,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1920322201, now seen corresponding path program 1 times [2025-03-04 10:56:11,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:56:11,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031797271] [2025-03-04 10:56:11,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:56:11,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:56:11,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:56:11,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:56:11,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:56:11,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:56:11,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:56:11,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:56:11,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031797271] [2025-03-04 10:56:11,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031797271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:56:11,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:56:11,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:56:11,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100309320] [2025-03-04 10:56:11,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:56:11,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:56:11,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:56:11,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:56:11,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:56:11,354 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:56:11,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:56:11,377 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2025-03-04 10:56:11,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:56:11,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2025-03-04 10:56:11,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:56:11,378 INFO L225 Difference]: With dead ends: 46 [2025-03-04 10:56:11,378 INFO L226 Difference]: Without dead ends: 32 [2025-03-04 10:56:11,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:56:11,379 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 8 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:56:11,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 70 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:56:11,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-04 10:56:11,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-04 10:56:11,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.25) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:56:11,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2025-03-04 10:56:11,384 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 16 [2025-03-04 10:56:11,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:56:11,384 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2025-03-04 10:56:11,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:56:11,384 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2025-03-04 10:56:11,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 10:56:11,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:56:11,385 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:56:11,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:56:11,385 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:56:11,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:56:11,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1458143316, now seen corresponding path program 1 times [2025-03-04 10:56:11,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:56:11,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307163132] [2025-03-04 10:56:11,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:56:11,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:56:11,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:56:11,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:56:11,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:56:11,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:56:11,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:56:11,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:56:11,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307163132] [2025-03-04 10:56:11,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307163132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:56:11,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:56:11,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:56:11,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329842998] [2025-03-04 10:56:11,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:56:11,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:56:11,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:56:11,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:56:11,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:56:11,491 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:56:11,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:56:11,551 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2025-03-04 10:56:11,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:56:11,551 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2025-03-04 10:56:11,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:56:11,551 INFO L225 Difference]: With dead ends: 32 [2025-03-04 10:56:11,551 INFO L226 Difference]: Without dead ends: 31 [2025-03-04 10:56:11,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:56:11,552 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:56:11,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 63 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:56:11,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-04 10:56:11,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-04 10:56:11,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:56:11,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2025-03-04 10:56:11,559 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 20 [2025-03-04 10:56:11,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:56:11,559 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2025-03-04 10:56:11,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:56:11,559 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2025-03-04 10:56:11,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 10:56:11,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:56:11,559 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:56:11,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:56:11,559 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:56:11,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:56:11,560 INFO L85 PathProgramCache]: Analyzing trace with hash -2042197477, now seen corresponding path program 1 times [2025-03-04 10:56:11,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:56:11,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847240585] [2025-03-04 10:56:11,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:56:11,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:56:11,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:56:11,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:56:11,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:56:11,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:56:11,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:56:11,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:56:11,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847240585] [2025-03-04 10:56:11,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847240585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:56:11,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:56:11,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:56:11,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340579442] [2025-03-04 10:56:11,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:56:11,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:56:11,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:56:11,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:56:11,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:56:11,643 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:56:11,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:56:11,695 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2025-03-04 10:56:11,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:56:11,696 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-03-04 10:56:11,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:56:11,696 INFO L225 Difference]: With dead ends: 41 [2025-03-04 10:56:11,696 INFO L226 Difference]: Without dead ends: 40 [2025-03-04 10:56:11,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:56:11,697 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:56:11,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 94 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:56:11,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-04 10:56:11,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2025-03-04 10:56:11,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:56:11,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2025-03-04 10:56:11,701 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 21 [2025-03-04 10:56:11,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:56:11,701 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-03-04 10:56:11,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:56:11,701 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2025-03-04 10:56:11,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 10:56:11,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:56:11,705 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:56:11,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:56:11,705 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:56:11,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:56:11,705 INFO L85 PathProgramCache]: Analyzing trace with hash -2042125979, now seen corresponding path program 1 times [2025-03-04 10:56:11,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:56:11,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168054106] [2025-03-04 10:56:11,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:56:11,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:56:11,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:56:11,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:56:11,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:56:11,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:56:11,772 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:56:11,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:56:11,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168054106] [2025-03-04 10:56:11,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168054106] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:56:11,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352389336] [2025-03-04 10:56:11,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:56:11,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:56:11,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:56:11,774 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:56:11,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:56:11,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:56:11,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:56:11,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:56:11,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:56:11,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:56:11,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:56:11,845 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:56:11,845 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:56:11,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352389336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:56:11,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:56:11,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-04 10:56:11,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741635466] [2025-03-04 10:56:11,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:56:11,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:56:11,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:56:11,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:56:11,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:56:11,846 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:56:11,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:56:11,889 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2025-03-04 10:56:11,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:56:11,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-03-04 10:56:11,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:56:11,891 INFO L225 Difference]: With dead ends: 39 [2025-03-04 10:56:11,891 INFO L226 Difference]: Without dead ends: 38 [2025-03-04 10:56:11,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:56:11,892 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:56:11,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 78 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:56:11,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-04 10:56:11,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2025-03-04 10:56:11,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:56:11,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2025-03-04 10:56:11,895 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 21 [2025-03-04 10:56:11,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:56:11,895 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2025-03-04 10:56:11,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:56:11,895 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2025-03-04 10:56:11,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 10:56:11,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:56:11,896 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:56:11,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:56:12,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 10:56:12,096 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:56:12,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:56:12,097 INFO L85 PathProgramCache]: Analyzing trace with hash -316966404, now seen corresponding path program 1 times [2025-03-04 10:56:12,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:56:12,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537722529] [2025-03-04 10:56:12,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:56:12,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:56:12,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 10:56:12,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:56:12,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:56:12,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:56:12,142 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:56:12,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:56:12,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537722529] [2025-03-04 10:56:12,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537722529] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:56:12,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284698714] [2025-03-04 10:56:12,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:56:12,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:56:12,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:56:12,144 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:56:12,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:56:12,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 10:56:12,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:56:12,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:56:12,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:56:12,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:56:12,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:56:12,208 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:56:12,208 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:56:12,264 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:56:12,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284698714] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:56:12,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:56:12,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2025-03-04 10:56:12,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189549651] [2025-03-04 10:56:12,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:56:12,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:56:12,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:56:12,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:56:12,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:56:12,268 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 10:56:12,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:56:12,358 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2025-03-04 10:56:12,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:56:12,359 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 25 [2025-03-04 10:56:12,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:56:12,360 INFO L225 Difference]: With dead ends: 68 [2025-03-04 10:56:12,360 INFO L226 Difference]: Without dead ends: 56 [2025-03-04 10:56:12,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:56:12,360 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 25 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:56:12,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 117 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:56:12,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-04 10:56:12,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2025-03-04 10:56:12,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:56:12,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2025-03-04 10:56:12,368 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 25 [2025-03-04 10:56:12,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:56:12,368 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2025-03-04 10:56:12,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 10:56:12,368 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2025-03-04 10:56:12,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 10:56:12,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:56:12,369 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:56:12,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:56:12,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:56:12,572 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:56:12,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:56:12,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1236856113, now seen corresponding path program 1 times [2025-03-04 10:56:12,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:56:12,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449076249] [2025-03-04 10:56:12,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:56:12,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:56:12,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:56:12,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:56:12,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:56:12,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:56:12,655 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:56:12,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:56:12,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449076249] [2025-03-04 10:56:12,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449076249] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:56:12,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672438603] [2025-03-04 10:56:12,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:56:12,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:56:12,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:56:12,667 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:56:12,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:56:12,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:56:12,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:56:12,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:56:12,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:56:12,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:56:12,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:56:12,752 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:56:12,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:56:12,828 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:56:12,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672438603] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:56:12,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:56:12,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-03-04 10:56:12,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755843114] [2025-03-04 10:56:12,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:56:12,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:56:12,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:56:12,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:56:12,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:56:12,829 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 18 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:56:13,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:56:13,069 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2025-03-04 10:56:13,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 10:56:13,070 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2025-03-04 10:56:13,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:56:13,071 INFO L225 Difference]: With dead ends: 77 [2025-03-04 10:56:13,071 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 10:56:13,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=733, Unknown=0, NotChecked=0, Total=992 [2025-03-04 10:56:13,071 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 110 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:56:13,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 122 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:56:13,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 10:56:13,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2025-03-04 10:56:13,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 60 states have (on average 1.15) internal successors, (69), 60 states have internal predecessors, (69), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:56:13,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2025-03-04 10:56:13,082 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 26 [2025-03-04 10:56:13,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:56:13,082 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2025-03-04 10:56:13,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:56:13,082 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2025-03-04 10:56:13,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-04 10:56:13,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:56:13,083 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:56:13,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:56:13,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:56:13,284 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:56:13,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:56:13,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1579602768, now seen corresponding path program 1 times [2025-03-04 10:56:13,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:56:13,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908786364] [2025-03-04 10:56:13,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:56:13,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:56:13,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 10:56:13,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 10:56:13,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:56:13,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:56:13,438 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 10:56:13,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:56:13,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908786364] [2025-03-04 10:56:13,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908786364] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:56:13,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505011314] [2025-03-04 10:56:13,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:56:13,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:56:13,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:56:13,441 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:56:13,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:56:13,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 10:56:13,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 10:56:13,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:56:13,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:56:13,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:56:13,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:56:13,638 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:56:13,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:56:13,830 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 10:56:13,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505011314] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:56:13,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:56:13,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2025-03-04 10:56:13,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838494856] [2025-03-04 10:56:13,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:56:13,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 10:56:13,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:56:13,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 10:56:13,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2025-03-04 10:56:13,832 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand has 30 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 30 states have internal predecessors, (97), 11 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2025-03-04 10:56:14,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:56:14,288 INFO L93 Difference]: Finished difference Result 223 states and 253 transitions. [2025-03-04 10:56:14,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-04 10:56:14,289 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 30 states have internal predecessors, (97), 11 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 54 [2025-03-04 10:56:14,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:56:14,290 INFO L225 Difference]: With dead ends: 223 [2025-03-04 10:56:14,290 INFO L226 Difference]: Without dead ends: 222 [2025-03-04 10:56:14,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=896, Invalid=2296, Unknown=0, NotChecked=0, Total=3192 [2025-03-04 10:56:14,292 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 214 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:56:14,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 207 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:56:14,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-04 10:56:14,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 169. [2025-03-04 10:56:14,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 141 states have (on average 1.127659574468085) internal successors, (159), 141 states have internal predecessors, (159), 14 states have call successors, (14), 13 states have call predecessors, (14), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 10:56:14,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 187 transitions. [2025-03-04 10:56:14,323 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 187 transitions. Word has length 54 [2025-03-04 10:56:14,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:56:14,323 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 187 transitions. [2025-03-04 10:56:14,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 30 states have internal predecessors, (97), 11 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2025-03-04 10:56:14,324 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 187 transitions. [2025-03-04 10:56:14,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 10:56:14,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:56:14,325 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:56:14,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:56:14,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:56:14,526 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:56:14,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:56:14,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1632735056, now seen corresponding path program 1 times [2025-03-04 10:56:14,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:56:14,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822550223] [2025-03-04 10:56:14,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:56:14,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:56:14,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 10:56:14,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 10:56:14,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:56:14,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:56:14,658 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:56:14,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:56:14,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822550223] [2025-03-04 10:56:14,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822550223] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:56:14,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093223871] [2025-03-04 10:56:14,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:56:14,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:56:14,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:56:14,660 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:56:14,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:56:14,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 10:56:14,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 10:56:14,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:56:14,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:56:14,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:56:14,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:56:14,741 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:56:14,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:56:14,871 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:56:14,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093223871] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:56:14,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:56:14,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 22 [2025-03-04 10:56:14,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186497982] [2025-03-04 10:56:14,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:56:14,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:56:14,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:56:14,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:56:14,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:56:14,872 INFO L87 Difference]: Start difference. First operand 169 states and 187 transitions. Second operand has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 10:56:15,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:56:15,141 INFO L93 Difference]: Finished difference Result 249 states and 281 transitions. [2025-03-04 10:56:15,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 10:56:15,142 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 62 [2025-03-04 10:56:15,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:56:15,143 INFO L225 Difference]: With dead ends: 249 [2025-03-04 10:56:15,143 INFO L226 Difference]: Without dead ends: 223 [2025-03-04 10:56:15,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=549, Invalid=1091, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 10:56:15,146 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 89 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:56:15,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 183 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:56:15,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-04 10:56:15,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 199. [2025-03-04 10:56:15,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 171 states have (on average 1.1403508771929824) internal successors, (195), 171 states have internal predecessors, (195), 14 states have call successors, (14), 13 states have call predecessors, (14), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 10:56:15,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 223 transitions. [2025-03-04 10:56:15,165 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 223 transitions. Word has length 62 [2025-03-04 10:56:15,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:56:15,165 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 223 transitions. [2025-03-04 10:56:15,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 10:56:15,165 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 223 transitions. [2025-03-04 10:56:15,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 10:56:15,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:56:15,168 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:56:15,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:56:15,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:56:15,369 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:56:15,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:56:15,370 INFO L85 PathProgramCache]: Analyzing trace with hash -351064624, now seen corresponding path program 2 times [2025-03-04 10:56:15,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:56:15,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878172502] [2025-03-04 10:56:15,370 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:56:15,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:56:15,377 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 92 statements into 2 equivalence classes. [2025-03-04 10:56:15,385 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 10:56:15,385 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:56:15,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:56:15,436 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-04 10:56:15,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:56:15,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878172502] [2025-03-04 10:56:15,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878172502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:56:15,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:56:15,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:56:15,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76583777] [2025-03-04 10:56:15,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:56:15,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:56:15,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:56:15,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:56:15,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:56:15,437 INFO L87 Difference]: Start difference. First operand 199 states and 223 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:56:15,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:56:15,463 INFO L93 Difference]: Finished difference Result 225 states and 251 transitions. [2025-03-04 10:56:15,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:56:15,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 92 [2025-03-04 10:56:15,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:56:15,464 INFO L225 Difference]: With dead ends: 225 [2025-03-04 10:56:15,464 INFO L226 Difference]: Without dead ends: 199 [2025-03-04 10:56:15,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:56:15,465 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:56:15,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 94 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:56:15,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-04 10:56:15,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 155. [2025-03-04 10:56:15,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 127 states have (on average 1.1181102362204725) internal successors, (142), 127 states have internal predecessors, (142), 14 states have call successors, (14), 13 states have call predecessors, (14), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 10:56:15,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 170 transitions. [2025-03-04 10:56:15,477 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 170 transitions. Word has length 92 [2025-03-04 10:56:15,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:56:15,478 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 170 transitions. [2025-03-04 10:56:15,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:56:15,478 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 170 transitions. [2025-03-04 10:56:15,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 10:56:15,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:56:15,482 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:56:15,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:56:15,482 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:56:15,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:56:15,483 INFO L85 PathProgramCache]: Analyzing trace with hash -50660785, now seen corresponding path program 1 times [2025-03-04 10:56:15,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:56:15,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418507168] [2025-03-04 10:56:15,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:56:15,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:56:15,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 10:56:15,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 10:56:15,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:56:15,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:56:15,981 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-04 10:56:15,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:56:15,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418507168] [2025-03-04 10:56:15,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418507168] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:56:15,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357490068] [2025-03-04 10:56:15,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:56:15,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:56:15,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:56:15,985 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:56:15,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:56:16,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 10:56:16,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 10:56:16,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:56:16,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:56:16,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 10:56:16,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:56:16,548 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 3 proven. 334 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:56:16,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:56:17,246 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 3 proven. 222 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-04 10:56:17,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357490068] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:56:17,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:56:17,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 65 [2025-03-04 10:56:17,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758860404] [2025-03-04 10:56:17,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:56:17,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-03-04 10:56:17,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:56:17,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-03-04 10:56:17,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=974, Invalid=3316, Unknown=0, NotChecked=0, Total=4290 [2025-03-04 10:56:17,250 INFO L87 Difference]: Start difference. First operand 155 states and 170 transitions. Second operand has 66 states, 65 states have (on average 3.3384615384615386) internal successors, (217), 66 states have internal predecessors, (217), 26 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) [2025-03-04 10:56:18,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:56:18,767 INFO L93 Difference]: Finished difference Result 533 states and 600 transitions. [2025-03-04 10:56:18,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2025-03-04 10:56:18,768 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 3.3384615384615386) internal successors, (217), 66 states have internal predecessors, (217), 26 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) Word has length 114 [2025-03-04 10:56:18,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:56:18,770 INFO L225 Difference]: With dead ends: 533 [2025-03-04 10:56:18,770 INFO L226 Difference]: Without dead ends: 532 [2025-03-04 10:56:18,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3568 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=4405, Invalid=11597, Unknown=0, NotChecked=0, Total=16002 [2025-03-04 10:56:18,776 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 535 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:56:18,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 305 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:56:18,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-03-04 10:56:18,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 325. [2025-03-04 10:56:18,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 267 states have (on average 1.1161048689138577) internal successors, (298), 267 states have internal predecessors, (298), 29 states have call successors, (29), 28 states have call predecessors, (29), 28 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-04 10:56:18,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 356 transitions. [2025-03-04 10:56:18,795 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 356 transitions. Word has length 114 [2025-03-04 10:56:18,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:56:18,796 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 356 transitions. [2025-03-04 10:56:18,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 3.3384615384615386) internal successors, (217), 66 states have internal predecessors, (217), 26 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) [2025-03-04 10:56:18,796 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 356 transitions. [2025-03-04 10:56:18,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-04 10:56:18,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:56:18,798 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:56:18,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 10:56:18,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:56:18,999 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:56:18,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:56:18,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1346582139, now seen corresponding path program 2 times [2025-03-04 10:56:18,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:56:18,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86058931] [2025-03-04 10:56:18,999 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:56:18,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:56:19,013 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 229 statements into 2 equivalence classes. [2025-03-04 10:56:19,035 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 229 of 229 statements. [2025-03-04 10:56:19,036 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:56:19,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:56:19,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1756 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 1634 trivial. 0 not checked. [2025-03-04 10:56:19,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:56:19,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86058931] [2025-03-04 10:56:19,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86058931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:56:19,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:56:19,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:56:19,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840619879] [2025-03-04 10:56:19,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:56:19,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:56:19,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:56:19,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:56:19,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:56:19,241 INFO L87 Difference]: Start difference. First operand 325 states and 356 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:56:19,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:56:19,285 INFO L93 Difference]: Finished difference Result 329 states and 360 transitions. [2025-03-04 10:56:19,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:56:19,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 229 [2025-03-04 10:56:19,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:56:19,286 INFO L225 Difference]: With dead ends: 329 [2025-03-04 10:56:19,286 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 10:56:19,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:56:19,288 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 19 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:56:19,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 67 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:56:19,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 10:56:19,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 10:56:19,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:56:19,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 10:56:19,288 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 229 [2025-03-04 10:56:19,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:56:19,288 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 10:56:19,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:56:19,288 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 10:56:19,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 10:56:19,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-03-04 10:56:19,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-03-04 10:56:19,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-03-04 10:56:19,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-03-04 10:56:19,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:56:19,295 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:56:19,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 10:56:19,799 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:56:19,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:56:19 BoogieIcfgContainer [2025-03-04 10:56:19,810 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:56:19,810 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:56:19,810 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:56:19,810 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:56:19,811 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:56:10" (3/4) ... [2025-03-04 10:56:19,812 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 10:56:19,816 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-04 10:56:19,816 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-04 10:56:19,819 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-04 10:56:19,820 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 10:56:19,820 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 10:56:19,820 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 10:56:19,876 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 10:56:19,877 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 10:56:19,877 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:56:19,878 INFO L158 Benchmark]: Toolchain (without parser) took 9676.21ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 106.4MB in the beginning and 182.8MB in the end (delta: -76.5MB). Peak memory consumption was 63.3MB. Max. memory is 16.1GB. [2025-03-04 10:56:19,878 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:56:19,878 INFO L158 Benchmark]: CACSL2BoogieTranslator took 156.00ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 95.4MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:56:19,878 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.57ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 94.6MB in the end (delta: 759.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:56:19,879 INFO L158 Benchmark]: Boogie Preprocessor took 24.97ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 93.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:56:19,879 INFO L158 Benchmark]: IcfgBuilder took 228.08ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 81.0MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:56:19,879 INFO L158 Benchmark]: TraceAbstraction took 9173.37ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 81.0MB in the beginning and 186.0MB in the end (delta: -105.1MB). Peak memory consumption was 144.1MB. Max. memory is 16.1GB. [2025-03-04 10:56:19,879 INFO L158 Benchmark]: Witness Printer took 66.70ms. Allocated memory is still 285.2MB. Free memory was 186.0MB in the beginning and 182.8MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:56:19,880 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.12ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 156.00ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 95.4MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.57ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 94.6MB in the end (delta: 759.4kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.97ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 93.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 228.08ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 81.0MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9173.37ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 81.0MB in the beginning and 186.0MB in the end (delta: -105.1MB). Peak memory consumption was 144.1MB. Max. memory is 16.1GB. * Witness Printer took 66.70ms. Allocated memory is still 285.2MB. Free memory was 186.0MB in the beginning and 182.8MB in the end (delta: 3.2MB). There was no memory consumed. 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 - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 37 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 8.6s, OverallIterations: 13, TraceHistogramMax: 19, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1079 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1079 mSDsluCounter, 1503 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1173 mSDsCounter, 95 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 994 IncrementalHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 95 mSolverCounterUnsat, 330 mSDtfsCounter, 994 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 818 GetRequests, 516 SyntacticMatches, 0 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4643 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=325occurred in iteration=12, InterpolantAutomatonStates: 248, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 356 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1027 NumberOfCodeBlocks, 1027 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1283 ConstructedInterpolants, 0 QuantifiedInterpolants, 2457 SizeOfPredicates, 42 NumberOfNonLiveVariables, 791 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 25 InterpolantComputations, 8 PerfectInterpolantSequences, 2446/3493 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 36]: Location Invariant Derived location invariant: (((counter <= 50) && (1 <= counter)) || (counter == 0)) - InvariantResult [Line: 26]: Location Invariant Derived location invariant: (((counter <= 50) && (1 <= counter)) || ((counter <= 2147483645) && (51 <= counter))) RESULT: Ultimate proved your program to be correct! [2025-03-04 10:56:19,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE