./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/list-simple/sll2n_update_all.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/list-simple/sll2n_update_all.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f99aa5fd03ca5c00d7a972ed12be6649d688145eadeca69fa5b97f6f4a2041e9 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:02:11,834 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:02:11,881 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-04-29 11:02:11,886 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:02:11,886 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:02:11,911 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:02:11,912 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:02:11,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:02:11,913 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:02:11,913 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:02:11,913 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:02:11,913 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:02:11,914 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:02:11,914 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:02:11,914 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:02:11,914 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:02:11,914 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:02:11,914 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:02:11,914 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:02:11,914 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:02:11,914 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:02:11,914 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:02:11,914 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:02:11,914 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:02:11,914 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-29 11:02:11,914 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:02:11,914 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:02:11,914 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:02:11,914 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:02:11,914 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:02:11,914 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:02:11,915 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:02:11,915 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:02:11,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:02:11,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:02:11,915 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:02:11,915 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:02:11,915 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:02:11,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:02:11,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:02:11,915 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:02:11,915 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:02:11,915 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:02:11,915 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:02:11,915 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:02:11,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:02:11,915 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:02:11,915 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:02:11,915 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:02:11,915 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 -> f99aa5fd03ca5c00d7a972ed12be6649d688145eadeca69fa5b97f6f4a2041e9 [2025-04-29 11:02:12,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:02:12,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:02:12,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:02:12,140 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:02:12,141 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:02:12,141 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_update_all.c [2025-04-29 11:02:13,422 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cf6d636f/89cad27158004309a164074c991a5b80/FLAG618c5f9f2 [2025-04-29 11:02:13,622 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:02:13,623 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_update_all.c [2025-04-29 11:02:13,624 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:02:13,624 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:02:13,630 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cf6d636f/89cad27158004309a164074c991a5b80/FLAG618c5f9f2 [2025-04-29 11:02:14,472 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cf6d636f/89cad27158004309a164074c991a5b80 [2025-04-29 11:02:14,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:02:14,475 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:02:14,476 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:02:14,477 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:02:14,480 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:02:14,480 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:02:14" (1/1) ... [2025-04-29 11:02:14,481 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ac0d635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:14, skipping insertion in model container [2025-04-29 11:02:14,481 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:02:14" (1/1) ... [2025-04-29 11:02:14,492 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:02:14,657 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:02:14,667 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:02:14,702 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:02:14,716 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:02:14,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:14 WrapperNode [2025-04-29 11:02:14,717 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:02:14,718 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:02:14,718 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:02:14,718 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:02:14,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:14" (1/1) ... [2025-04-29 11:02:14,729 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:14" (1/1) ... [2025-04-29 11:02:14,750 INFO L138 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 115 [2025-04-29 11:02:14,751 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:02:14,752 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:02:14,752 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:02:14,752 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:02:14,757 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:14" (1/1) ... [2025-04-29 11:02:14,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:14" (1/1) ... [2025-04-29 11:02:14,759 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:14" (1/1) ... [2025-04-29 11:02:14,774 INFO L175 MemorySlicer]: Split 8 memory accesses to 1 slices as follows [8]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 4 writes are split as follows [4]. [2025-04-29 11:02:14,774 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:14" (1/1) ... [2025-04-29 11:02:14,774 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:14" (1/1) ... [2025-04-29 11:02:14,778 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:14" (1/1) ... [2025-04-29 11:02:14,779 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:14" (1/1) ... [2025-04-29 11:02:14,781 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:14" (1/1) ... [2025-04-29 11:02:14,781 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:14" (1/1) ... [2025-04-29 11:02:14,782 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:14" (1/1) ... [2025-04-29 11:02:14,785 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:02:14,786 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:02:14,786 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:02:14,786 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:02:14,786 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:14" (1/1) ... [2025-04-29 11:02:14,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:02:14,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:14,812 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:02:14,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:02:14,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:02:14,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:02:14,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:02:14,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:02:14,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:02:14,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:02:14,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:02:14,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:02:14,892 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:02:14,893 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:02:15,053 INFO L? ?]: Removed 68 outVars from TransFormulas that were not future-live. [2025-04-29 11:02:15,053 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:02:15,060 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:02:15,060 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:02:15,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:02:15 BoogieIcfgContainer [2025-04-29 11:02:15,061 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:02:15,062 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:02:15,063 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:02:15,066 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:02:15,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:02:14" (1/3) ... [2025-04-29 11:02:15,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2caf0306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:02:15, skipping insertion in model container [2025-04-29 11:02:15,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:02:14" (2/3) ... [2025-04-29 11:02:15,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2caf0306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:02:15, skipping insertion in model container [2025-04-29 11:02:15,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:02:15" (3/3) ... [2025-04-29 11:02:15,067 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_update_all.c [2025-04-29 11:02:15,078 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:02:15,079 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_update_all.c that has 1 procedures, 50 locations, 57 edges, 1 initial locations, 6 loop locations, and 14 error locations. [2025-04-29 11:02:15,113 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:02:15,121 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4f172ef9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:02:15,122 INFO L341 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-04-29 11:02:15,124 INFO L278 IsEmpty]: Start isEmpty. Operand has 50 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 49 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:15,127 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:02:15,127 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:15,128 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:02:15,128 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:02:15,134 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:15,134 INFO L85 PathProgramCache]: Analyzing trace with hash 890030086, now seen corresponding path program 1 times [2025-04-29 11:02:15,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:15,139 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144667232] [2025-04-29 11:02:15,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:15,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:15,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:02:15,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:02:15,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:15,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:15,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:15,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:15,289 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144667232] [2025-04-29 11:02:15,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144667232] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:15,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:15,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:02:15,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382035458] [2025-04-29 11:02:15,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:15,293 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:02:15,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:15,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:02:15,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:02:15,310 INFO L87 Difference]: Start difference. First operand has 50 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 49 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:15,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:15,344 INFO L93 Difference]: Finished difference Result 93 states and 107 transitions. [2025-04-29 11:02:15,345 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:02:15,346 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-04-29 11:02:15,346 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:15,350 INFO L225 Difference]: With dead ends: 93 [2025-04-29 11:02:15,351 INFO L226 Difference]: Without dead ends: 46 [2025-04-29 11:02:15,353 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:02:15,356 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 5 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:15,357 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 102 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:15,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-04-29 11:02:15,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2025-04-29 11:02:15,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 42 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:15,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2025-04-29 11:02:15,386 INFO L79 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 6 [2025-04-29 11:02:15,386 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:15,386 INFO L485 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2025-04-29 11:02:15,387 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:15,387 INFO L278 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2025-04-29 11:02:15,387 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:02:15,388 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:15,388 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:15,388 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:02:15,388 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:02:15,389 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:15,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1805981222, now seen corresponding path program 1 times [2025-04-29 11:02:15,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:15,389 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932486252] [2025-04-29 11:02:15,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:15,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:15,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:02:15,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:02:15,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:15,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:15,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:15,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:15,510 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932486252] [2025-04-29 11:02:15,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932486252] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:15,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:15,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:02:15,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928863175] [2025-04-29 11:02:15,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:15,511 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:02:15,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:15,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:02:15,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:15,511 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:15,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:15,547 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2025-04-29 11:02:15,549 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:02:15,549 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-29 11:02:15,549 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:15,549 INFO L225 Difference]: With dead ends: 50 [2025-04-29 11:02:15,549 INFO L226 Difference]: Without dead ends: 48 [2025-04-29 11:02:15,550 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:15,550 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 1 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:15,550 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 119 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:15,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-04-29 11:02:15,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-04-29 11:02:15,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 47 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:15,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2025-04-29 11:02:15,558 INFO L79 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 7 [2025-04-29 11:02:15,558 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:15,558 INFO L485 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2025-04-29 11:02:15,558 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:15,558 INFO L278 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2025-04-29 11:02:15,559 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-29 11:02:15,559 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:15,559 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:15,559 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:02:15,559 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:02:15,560 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:15,560 INFO L85 PathProgramCache]: Analyzing trace with hash -506864112, now seen corresponding path program 1 times [2025-04-29 11:02:15,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:15,560 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940628041] [2025-04-29 11:02:15,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:15,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:15,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:02:15,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:02:15,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:15,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:15,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:15,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:15,695 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940628041] [2025-04-29 11:02:15,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940628041] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:02:15,695 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522463517] [2025-04-29 11:02:15,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:15,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:15,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:15,697 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:02:15,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:02:15,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:02:15,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:02:15,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:15,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:15,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 11:02:15,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:15,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:15,794 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:02:15,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:15,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522463517] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:02:15,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:02:15,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-04-29 11:02:15,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778826511] [2025-04-29 11:02:15,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:02:15,825 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:02:15,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:15,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:02:15,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:02:15,826 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:15,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:15,860 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2025-04-29 11:02:15,863 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:02:15,863 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-04-29 11:02:15,863 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:15,864 INFO L225 Difference]: With dead ends: 81 [2025-04-29 11:02:15,864 INFO L226 Difference]: Without dead ends: 49 [2025-04-29 11:02:15,864 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:02:15,864 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 3 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:15,864 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 156 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:15,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-04-29 11:02:15,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-04-29 11:02:15,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 48 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:15,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2025-04-29 11:02:15,870 INFO L79 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 12 [2025-04-29 11:02:15,870 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:15,870 INFO L485 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2025-04-29 11:02:15,870 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:15,870 INFO L278 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2025-04-29 11:02:15,871 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-29 11:02:15,871 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:15,871 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-04-29 11:02:15,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:02:16,071 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:16,071 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:02:16,072 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:16,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1451934044, now seen corresponding path program 1 times [2025-04-29 11:02:16,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:16,073 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457905043] [2025-04-29 11:02:16,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:16,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:16,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:02:16,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:02:16,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:16,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:16,138 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:02:16,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:16,139 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457905043] [2025-04-29 11:02:16,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457905043] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:16,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:16,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:02:16,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742605601] [2025-04-29 11:02:16,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:16,139 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:02:16,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:16,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:02:16,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:16,140 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:16,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:16,155 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2025-04-29 11:02:16,155 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:02:16,155 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-04-29 11:02:16,155 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:16,156 INFO L225 Difference]: With dead ends: 49 [2025-04-29 11:02:16,156 INFO L226 Difference]: Without dead ends: 48 [2025-04-29 11:02:16,156 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:16,156 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:16,156 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:16,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-04-29 11:02:16,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-04-29 11:02:16,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 47 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:16,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2025-04-29 11:02:16,159 INFO L79 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 13 [2025-04-29 11:02:16,159 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:16,159 INFO L485 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2025-04-29 11:02:16,159 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:16,159 INFO L278 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2025-04-29 11:02:16,159 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:02:16,159 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:16,159 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-04-29 11:02:16,159 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:02:16,160 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:02:16,160 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:16,160 INFO L85 PathProgramCache]: Analyzing trace with hash 2060282454, now seen corresponding path program 1 times [2025-04-29 11:02:16,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:16,160 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573390492] [2025-04-29 11:02:16,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:16,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:16,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:02:16,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:02:16,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:16,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:16,254 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:16,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:16,254 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573390492] [2025-04-29 11:02:16,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573390492] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:02:16,254 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819410554] [2025-04-29 11:02:16,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:16,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:16,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:16,256 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:02:16,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:02:16,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:02:16,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:02:16,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:16,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:16,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-29 11:02:16,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:16,341 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:02:16,341 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:02:16,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819410554] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:16,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:02:16,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-04-29 11:02:16,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541503445] [2025-04-29 11:02:16,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:16,342 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:02:16,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:16,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:02:16,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:02:16,343 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:16,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:16,378 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2025-04-29 11:02:16,379 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:02:16,379 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-29 11:02:16,379 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:16,379 INFO L225 Difference]: With dead ends: 48 [2025-04-29 11:02:16,379 INFO L226 Difference]: Without dead ends: 47 [2025-04-29 11:02:16,380 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:02:16,380 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:16,380 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:16,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-04-29 11:02:16,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-04-29 11:02:16,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 35 states have (on average 1.457142857142857) internal successors, (51), 46 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:16,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2025-04-29 11:02:16,386 INFO L79 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 14 [2025-04-29 11:02:16,386 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:16,386 INFO L485 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2025-04-29 11:02:16,386 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:16,386 INFO L278 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2025-04-29 11:02:16,386 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:02:16,386 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:16,386 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:16,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 11:02:16,586 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:16,587 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:02:16,587 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:16,587 INFO L85 PathProgramCache]: Analyzing trace with hash 652002458, now seen corresponding path program 2 times [2025-04-29 11:02:16,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:16,587 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916819448] [2025-04-29 11:02:16,587 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:02:16,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:16,598 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-29 11:02:16,601 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-04-29 11:02:16,601 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:02:16,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:16,632 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 11:02:16,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:16,633 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916819448] [2025-04-29 11:02:16,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916819448] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:16,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:16,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:02:16,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100748799] [2025-04-29 11:02:16,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:16,633 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:02:16,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:16,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:02:16,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:16,634 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:16,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:16,673 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2025-04-29 11:02:16,675 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:02:16,675 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-29 11:02:16,675 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:16,676 INFO L225 Difference]: With dead ends: 68 [2025-04-29 11:02:16,676 INFO L226 Difference]: Without dead ends: 66 [2025-04-29 11:02:16,676 INFO L436 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-04-29 11:02:16,676 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 71 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:16,677 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 59 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:16,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-04-29 11:02:16,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 51. [2025-04-29 11:02:16,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 39 states have (on average 1.435897435897436) internal successors, (56), 50 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:16,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2025-04-29 11:02:16,681 INFO L79 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 18 [2025-04-29 11:02:16,681 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:16,681 INFO L485 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2025-04-29 11:02:16,681 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:16,681 INFO L278 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2025-04-29 11:02:16,681 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 11:02:16,681 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:16,681 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:16,681 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:02:16,681 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:02:16,682 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:16,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1262760220, now seen corresponding path program 1 times [2025-04-29 11:02:16,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:16,682 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30895354] [2025-04-29 11:02:16,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:16,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:16,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:02:16,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:02:16,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:16,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:16,730 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 11:02:16,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:16,730 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30895354] [2025-04-29 11:02:16,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30895354] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:16,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:16,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:02:16,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580225954] [2025-04-29 11:02:16,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:16,731 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:02:16,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:16,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:02:16,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:16,731 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:16,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:16,757 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2025-04-29 11:02:16,757 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:02:16,757 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-29 11:02:16,757 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:16,758 INFO L225 Difference]: With dead ends: 68 [2025-04-29 11:02:16,758 INFO L226 Difference]: Without dead ends: 66 [2025-04-29 11:02:16,758 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:16,758 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 67 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:16,759 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 58 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:16,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-04-29 11:02:16,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 53. [2025-04-29 11:02:16,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 52 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:16,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2025-04-29 11:02:16,762 INFO L79 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 19 [2025-04-29 11:02:16,762 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:16,762 INFO L485 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2025-04-29 11:02:16,762 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:16,762 INFO L278 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2025-04-29 11:02:16,762 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-29 11:02:16,762 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:16,762 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:16,762 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:02:16,763 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:02:16,763 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:16,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1963175462, now seen corresponding path program 1 times [2025-04-29 11:02:16,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:16,763 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694781107] [2025-04-29 11:02:16,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:16,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:16,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:02:16,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:02:16,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:16,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:16,824 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 11:02:16,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:16,824 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694781107] [2025-04-29 11:02:16,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694781107] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:16,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:16,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:02:16,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723453730] [2025-04-29 11:02:16,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:16,825 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:02:16,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:16,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:02:16,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:16,826 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:16,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:16,872 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2025-04-29 11:02:16,872 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:02:16,872 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-29 11:02:16,872 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:16,872 INFO L225 Difference]: With dead ends: 96 [2025-04-29 11:02:16,872 INFO L226 Difference]: Without dead ends: 62 [2025-04-29 11:02:16,873 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:02:16,874 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:16,874 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 93 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:16,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-04-29 11:02:16,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2025-04-29 11:02:16,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 53 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:16,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2025-04-29 11:02:16,883 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 21 [2025-04-29 11:02:16,883 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:16,883 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2025-04-29 11:02:16,883 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:16,883 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2025-04-29 11:02:16,883 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-29 11:02:16,883 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:16,883 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:16,884 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:02:16,884 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:02:16,884 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:16,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1381639968, now seen corresponding path program 1 times [2025-04-29 11:02:16,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:16,884 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677729688] [2025-04-29 11:02:16,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:16,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:16,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:02:16,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:02:16,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:16,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:16,931 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 11:02:16,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:16,931 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677729688] [2025-04-29 11:02:16,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677729688] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:16,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:16,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:02:16,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399664473] [2025-04-29 11:02:16,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:16,932 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:02:16,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:16,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:02:16,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:16,932 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:16,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:16,966 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2025-04-29 11:02:16,967 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:02:16,967 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-29 11:02:16,967 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:16,967 INFO L225 Difference]: With dead ends: 74 [2025-04-29 11:02:16,967 INFO L226 Difference]: Without dead ends: 58 [2025-04-29 11:02:16,967 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:02:16,968 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:16,968 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 92 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:16,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-04-29 11:02:16,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2025-04-29 11:02:16,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 54 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:16,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2025-04-29 11:02:16,972 INFO L79 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 22 [2025-04-29 11:02:16,972 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:16,972 INFO L485 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2025-04-29 11:02:16,972 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:16,972 INFO L278 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2025-04-29 11:02:16,972 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-29 11:02:16,972 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:16,973 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:16,973 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:02:16,973 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:02:16,973 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:16,973 INFO L85 PathProgramCache]: Analyzing trace with hash 728903206, now seen corresponding path program 1 times [2025-04-29 11:02:16,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:16,973 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521851045] [2025-04-29 11:02:16,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:16,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:16,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:02:16,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:02:16,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:16,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:17,043 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 11:02:17,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:17,043 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521851045] [2025-04-29 11:02:17,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521851045] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:17,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:17,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:02:17,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372472253] [2025-04-29 11:02:17,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:17,044 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:02:17,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:17,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:02:17,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:17,044 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:17,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:17,077 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2025-04-29 11:02:17,077 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:02:17,077 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-29 11:02:17,077 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:17,078 INFO L225 Difference]: With dead ends: 62 [2025-04-29 11:02:17,078 INFO L226 Difference]: Without dead ends: 60 [2025-04-29 11:02:17,078 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:17,078 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:17,078 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 89 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:17,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-04-29 11:02:17,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2025-04-29 11:02:17,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 57 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:17,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2025-04-29 11:02:17,083 INFO L79 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 22 [2025-04-29 11:02:17,083 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:17,083 INFO L485 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2025-04-29 11:02:17,083 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:17,083 INFO L278 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2025-04-29 11:02:17,083 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:02:17,083 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:17,084 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:17,084 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:02:17,084 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:02:17,084 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:17,084 INFO L85 PathProgramCache]: Analyzing trace with hash 611302658, now seen corresponding path program 1 times [2025-04-29 11:02:17,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:17,084 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887665247] [2025-04-29 11:02:17,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:17,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:17,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:02:17,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:02:17,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:17,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:17,136 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 11:02:17,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:17,136 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887665247] [2025-04-29 11:02:17,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887665247] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:17,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:17,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:02:17,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528728096] [2025-04-29 11:02:17,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:17,136 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:02:17,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:17,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:02:17,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:17,137 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:17,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:17,169 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2025-04-29 11:02:17,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:02:17,169 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-29 11:02:17,169 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:17,169 INFO L225 Difference]: With dead ends: 64 [2025-04-29 11:02:17,169 INFO L226 Difference]: Without dead ends: 62 [2025-04-29 11:02:17,170 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:02:17,170 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 5 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:17,170 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 89 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:17,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-04-29 11:02:17,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-04-29 11:02:17,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 50 states have (on average 1.34) internal successors, (67), 61 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:17,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2025-04-29 11:02:17,176 INFO L79 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 24 [2025-04-29 11:02:17,176 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:17,176 INFO L485 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2025-04-29 11:02:17,176 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:17,176 INFO L278 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2025-04-29 11:02:17,177 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-29 11:02:17,177 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:17,177 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:17,178 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:02:17,178 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:02:17,178 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:17,178 INFO L85 PathProgramCache]: Analyzing trace with hash -599161814, now seen corresponding path program 1 times [2025-04-29 11:02:17,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:17,178 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875719554] [2025-04-29 11:02:17,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:17,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:17,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 11:02:17,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 11:02:17,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:17,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:17,261 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 11:02:17,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:17,262 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875719554] [2025-04-29 11:02:17,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875719554] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:02:17,262 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375884204] [2025-04-29 11:02:17,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:17,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:17,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:17,264 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:02:17,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:02:17,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 11:02:17,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 11:02:17,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:17,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:17,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:02:17,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:17,445 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 11:02:17,445 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:02:17,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375884204] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:17,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:02:17,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-04-29 11:02:17,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360439853] [2025-04-29 11:02:17,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:17,446 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:02:17,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:17,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:02:17,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:02:17,446 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:17,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:17,510 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2025-04-29 11:02:17,510 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:02:17,510 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-29 11:02:17,510 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:17,510 INFO L225 Difference]: With dead ends: 62 [2025-04-29 11:02:17,510 INFO L226 Difference]: Without dead ends: 60 [2025-04-29 11:02:17,511 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:02:17,511 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 41 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:17,511 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 90 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:02:17,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-04-29 11:02:17,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-04-29 11:02:17,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.3) internal successors, (65), 59 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:17,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2025-04-29 11:02:17,515 INFO L79 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 25 [2025-04-29 11:02:17,515 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:17,515 INFO L485 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2025-04-29 11:02:17,515 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:17,515 INFO L278 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2025-04-29 11:02:17,515 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:02:17,515 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:17,516 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:17,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 11:02:17,716 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:17,716 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:02:17,717 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:17,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1394146988, now seen corresponding path program 1 times [2025-04-29 11:02:17,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:17,717 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808690413] [2025-04-29 11:02:17,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:17,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:17,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:02:17,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:02:17,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:17,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:17,828 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:02:17,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:17,828 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808690413] [2025-04-29 11:02:17,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808690413] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:02:17,828 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82281874] [2025-04-29 11:02:17,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:17,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:17,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:17,830 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:02:17,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:02:17,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:02:17,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:02:17,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:17,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:17,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:02:17,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:17,966 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 11:02:17,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:02:18,018 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 11:02:18,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82281874] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:02:18,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:02:18,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2025-04-29 11:02:18,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025024166] [2025-04-29 11:02:18,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:02:18,020 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:02:18,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:18,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:02:18,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:02:18,021 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:18,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:18,098 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2025-04-29 11:02:18,098 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:02:18,098 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-29 11:02:18,098 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:18,099 INFO L225 Difference]: With dead ends: 61 [2025-04-29 11:02:18,099 INFO L226 Difference]: Without dead ends: 59 [2025-04-29 11:02:18,100 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:02:18,100 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 97 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:18,101 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 102 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:02:18,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-04-29 11:02:18,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2025-04-29 11:02:18,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 50 states have (on average 1.26) internal successors, (63), 57 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:18,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2025-04-29 11:02:18,107 INFO L79 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 26 [2025-04-29 11:02:18,107 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:18,107 INFO L485 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2025-04-29 11:02:18,107 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:18,107 INFO L278 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2025-04-29 11:02:18,108 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-29 11:02:18,108 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:18,108 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:18,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-29 11:02:18,308 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:18,311 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:02:18,312 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:18,312 INFO L85 PathProgramCache]: Analyzing trace with hash 656256877, now seen corresponding path program 1 times [2025-04-29 11:02:18,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:18,312 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882100117] [2025-04-29 11:02:18,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:18,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:18,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:02:18,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:02:18,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:18,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:18,412 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:02:18,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:18,413 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882100117] [2025-04-29 11:02:18,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882100117] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:02:18,413 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42909144] [2025-04-29 11:02:18,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:18,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:18,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:18,415 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:02:18,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 11:02:18,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:02:18,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:02:18,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:18,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:18,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 11:02:18,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:18,516 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:02:18,517 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:02:18,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42909144] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:18,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:02:18,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2025-04-29 11:02:18,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750936032] [2025-04-29 11:02:18,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:18,517 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:02:18,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:18,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:02:18,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:02:18,518 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:18,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:18,538 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2025-04-29 11:02:18,538 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:02:18,538 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-29 11:02:18,538 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:18,538 INFO L225 Difference]: With dead ends: 81 [2025-04-29 11:02:18,539 INFO L226 Difference]: Without dead ends: 58 [2025-04-29 11:02:18,539 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:02:18,539 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 49 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:18,539 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 56 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:18,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-04-29 11:02:18,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-04-29 11:02:18,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 50 states have (on average 1.24) internal successors, (62), 57 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:18,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2025-04-29 11:02:18,542 INFO L79 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 27 [2025-04-29 11:02:18,542 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:18,542 INFO L485 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2025-04-29 11:02:18,543 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:18,543 INFO L278 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2025-04-29 11:02:18,543 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:02:18,543 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:18,543 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:18,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-29 11:02:18,743 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-29 11:02:18,744 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:02:18,744 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:18,744 INFO L85 PathProgramCache]: Analyzing trace with hash 254542998, now seen corresponding path program 1 times [2025-04-29 11:02:18,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:18,744 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211429493] [2025-04-29 11:02:18,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:18,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:18,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:02:18,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:02:18,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:18,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:18,783 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:02:18,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:18,784 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211429493] [2025-04-29 11:02:18,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211429493] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:18,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:18,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:02:18,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115914094] [2025-04-29 11:02:18,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:18,784 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:02:18,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:18,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:02:18,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:02:18,784 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:18,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:18,792 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2025-04-29 11:02:18,792 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:02:18,792 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-29 11:02:18,792 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:18,792 INFO L225 Difference]: With dead ends: 58 [2025-04-29 11:02:18,792 INFO L226 Difference]: Without dead ends: 57 [2025-04-29 11:02:18,792 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:02:18,793 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:18,794 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 69 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:18,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-04-29 11:02:18,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-04-29 11:02:18,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.22) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:18,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2025-04-29 11:02:18,796 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 28 [2025-04-29 11:02:18,796 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:18,796 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2025-04-29 11:02:18,796 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:18,796 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2025-04-29 11:02:18,800 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 11:02:18,800 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:18,800 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:18,800 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:02:18,800 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:02:18,800 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:18,800 INFO L85 PathProgramCache]: Analyzing trace with hash -699101584, now seen corresponding path program 1 times [2025-04-29 11:02:18,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:18,800 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787849358] [2025-04-29 11:02:18,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:18,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:18,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:02:18,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:02:18,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:18,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:18,888 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 11:02:18,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:18,888 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787849358] [2025-04-29 11:02:18,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787849358] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:02:18,888 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936635796] [2025-04-29 11:02:18,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:18,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:18,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:18,891 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:02:18,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 11:02:18,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:02:18,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:02:18,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:18,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:18,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-29 11:02:18,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:19,018 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 11:02:19,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:02:19,071 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 11:02:19,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936635796] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:02:19,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:02:19,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-04-29 11:02:19,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799795186] [2025-04-29 11:02:19,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:02:19,071 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:02:19,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:19,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:02:19,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:02:19,072 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:19,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:19,183 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2025-04-29 11:02:19,183 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:02:19,184 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-29 11:02:19,184 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:19,184 INFO L225 Difference]: With dead ends: 64 [2025-04-29 11:02:19,184 INFO L226 Difference]: Without dead ends: 63 [2025-04-29 11:02:19,184 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2025-04-29 11:02:19,185 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 47 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:19,185 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 160 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:02:19,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-04-29 11:02:19,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2025-04-29 11:02:19,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 50 states have (on average 1.2) internal successors, (60), 55 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:19,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2025-04-29 11:02:19,189 INFO L79 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 29 [2025-04-29 11:02:19,189 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:19,189 INFO L485 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2025-04-29 11:02:19,189 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:19,189 INFO L278 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2025-04-29 11:02:19,190 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:02:19,190 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:19,190 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:19,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-29 11:02:19,390 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-29 11:02:19,391 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:02:19,391 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:19,391 INFO L85 PathProgramCache]: Analyzing trace with hash -197127848, now seen corresponding path program 1 times [2025-04-29 11:02:19,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:19,391 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670991754] [2025-04-29 11:02:19,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:19,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:19,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:02:19,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:02:19,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:19,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:19,474 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 11:02:19,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:19,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670991754] [2025-04-29 11:02:19,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670991754] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:02:19,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591781879] [2025-04-29 11:02:19,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:19,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:19,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:19,477 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:02:19,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-29 11:02:19,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:02:19,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:02:19,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:19,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:19,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 11:02:19,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:19,614 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 11:02:19,614 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:02:19,646 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 11:02:19,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591781879] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:02:19,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:02:19,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2025-04-29 11:02:19,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059410877] [2025-04-29 11:02:19,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:02:19,647 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:02:19,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:19,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:02:19,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:02:19,648 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:19,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:19,743 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2025-04-29 11:02:19,743 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:02:19,743 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-29 11:02:19,743 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:19,743 INFO L225 Difference]: With dead ends: 89 [2025-04-29 11:02:19,743 INFO L226 Difference]: Without dead ends: 56 [2025-04-29 11:02:19,744 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:02:19,744 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 59 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:19,744 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 134 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:02:19,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-04-29 11:02:19,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2025-04-29 11:02:19,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.1875) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2025-04-29 11:02:19,747 INFO L79 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 30 [2025-04-29 11:02:19,747 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:19,747 INFO L485 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2025-04-29 11:02:19,747 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:19,747 INFO L278 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2025-04-29 11:02:19,747 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-29 11:02:19,747 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:19,748 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:19,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-29 11:02:19,952 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:19,952 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:02:19,953 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:19,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1609251, now seen corresponding path program 1 times [2025-04-29 11:02:19,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:19,953 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979338288] [2025-04-29 11:02:19,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:19,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:19,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:02:19,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:02:19,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:19,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:20,024 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:02:20,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:20,025 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979338288] [2025-04-29 11:02:20,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979338288] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:02:20,025 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641229416] [2025-04-29 11:02:20,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:20,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:20,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:20,027 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:02:20,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-29 11:02:20,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:02:20,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:02:20,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:20,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:20,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:02:20,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:20,187 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:02:20,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:02:20,233 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:02:20,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641229416] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:02:20,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:02:20,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-29 11:02:20,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158727297] [2025-04-29 11:02:20,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:02:20,233 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:02:20,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:20,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:02:20,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:02:20,234 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:20,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:20,277 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2025-04-29 11:02:20,278 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:02:20,278 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-04-29 11:02:20,278 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:20,278 INFO L225 Difference]: With dead ends: 87 [2025-04-29 11:02:20,278 INFO L226 Difference]: Without dead ends: 64 [2025-04-29 11:02:20,278 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:02:20,279 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 89 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:20,279 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 87 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:20,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-04-29 11:02:20,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2025-04-29 11:02:20,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:20,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2025-04-29 11:02:20,283 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 34 [2025-04-29 11:02:20,283 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:20,283 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2025-04-29 11:02:20,283 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:20,284 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2025-04-29 11:02:20,284 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-29 11:02:20,284 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:20,284 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:20,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-29 11:02:20,485 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-29 11:02:20,485 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:02:20,485 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:20,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1415698223, now seen corresponding path program 1 times [2025-04-29 11:02:20,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:20,486 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843490498] [2025-04-29 11:02:20,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:20,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:20,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-29 11:02:20,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-29 11:02:20,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:20,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:20,576 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-29 11:02:20,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:20,576 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843490498] [2025-04-29 11:02:20,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843490498] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:02:20,576 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026901854] [2025-04-29 11:02:20,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:20,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:20,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:20,578 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:02:20,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-29 11:02:20,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-29 11:02:20,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-29 11:02:20,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:20,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:20,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:02:20,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:20,781 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-29 11:02:20,782 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:02:20,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026901854] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:20,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:02:20,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-04-29 11:02:20,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923023978] [2025-04-29 11:02:20,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:20,782 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:02:20,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:20,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:02:20,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:02:20,783 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:20,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:20,820 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2025-04-29 11:02:20,820 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:02:20,821 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-29 11:02:20,821 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:20,821 INFO L225 Difference]: With dead ends: 57 [2025-04-29 11:02:20,821 INFO L226 Difference]: Without dead ends: 55 [2025-04-29 11:02:20,821 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:02:20,822 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 19 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:20,822 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 75 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:20,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-04-29 11:02:20,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-04-29 11:02:20,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 54 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:20,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2025-04-29 11:02:20,826 INFO L79 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 44 [2025-04-29 11:02:20,826 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:20,826 INFO L485 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2025-04-29 11:02:20,826 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:20,826 INFO L278 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2025-04-29 11:02:20,826 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-29 11:02:20,826 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:20,826 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:20,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-29 11:02:21,026 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:21,027 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:02:21,027 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:21,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1513172841, now seen corresponding path program 1 times [2025-04-29 11:02:21,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:21,027 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158676920] [2025-04-29 11:02:21,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:21,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:21,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-29 11:02:21,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-29 11:02:21,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:21,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:21,090 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-04-29 11:02:21,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:21,091 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158676920] [2025-04-29 11:02:21,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158676920] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:21,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:21,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:02:21,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162973743] [2025-04-29 11:02:21,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:21,092 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:02:21,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:21,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:02:21,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:02:21,092 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:21,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:21,100 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2025-04-29 11:02:21,100 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:02:21,100 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-04-29 11:02:21,101 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:21,101 INFO L225 Difference]: With dead ends: 55 [2025-04-29 11:02:21,101 INFO L226 Difference]: Without dead ends: 54 [2025-04-29 11:02:21,101 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:02:21,101 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:21,102 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 59 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:21,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-04-29 11:02:21,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-04-29 11:02:21,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 53 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:21,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2025-04-29 11:02:21,109 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 47 [2025-04-29 11:02:21,109 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:21,110 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2025-04-29 11:02:21,110 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:21,110 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2025-04-29 11:02:21,110 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-04-29 11:02:21,110 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:21,110 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:21,111 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-29 11:02:21,111 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:02:21,111 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:21,111 INFO L85 PathProgramCache]: Analyzing trace with hash -336282089, now seen corresponding path program 1 times [2025-04-29 11:02:21,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:21,111 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770509197] [2025-04-29 11:02:21,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:21,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:21,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:02:21,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:02:21,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:21,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:21,228 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-29 11:02:21,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:21,229 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770509197] [2025-04-29 11:02:21,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770509197] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:02:21,229 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220984409] [2025-04-29 11:02:21,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:21,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:21,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:21,231 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:02:21,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-29 11:02:21,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:02:21,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:02:21,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:21,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:21,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-29 11:02:21,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:21,375 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-29 11:02:21,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:02:21,421 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-29 11:02:21,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220984409] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:02:21,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:02:21,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-04-29 11:02:21,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301667240] [2025-04-29 11:02:21,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:02:21,422 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:02:21,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:21,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:02:21,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:02:21,423 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 14 states, 13 states have (on average 4.538461538461538) internal successors, (59), 14 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:21,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:21,514 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2025-04-29 11:02:21,514 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:02:21,515 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.538461538461538) internal successors, (59), 14 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-04-29 11:02:21,515 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:21,515 INFO L225 Difference]: With dead ends: 62 [2025-04-29 11:02:21,515 INFO L226 Difference]: Without dead ends: 61 [2025-04-29 11:02:21,515 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2025-04-29 11:02:21,516 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 34 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:21,516 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 118 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:02:21,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-04-29 11:02:21,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2025-04-29 11:02:21,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:21,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2025-04-29 11:02:21,521 INFO L79 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 48 [2025-04-29 11:02:21,521 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:21,521 INFO L485 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2025-04-29 11:02:21,521 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.538461538461538) internal successors, (59), 14 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:21,521 INFO L278 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2025-04-29 11:02:21,521 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-29 11:02:21,521 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:21,521 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:21,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-29 11:02:21,722 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-04-29 11:02:21,723 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:02:21,723 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:21,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1038808382, now seen corresponding path program 1 times [2025-04-29 11:02:21,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:21,723 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664887508] [2025-04-29 11:02:21,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:21,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:21,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-29 11:02:21,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 11:02:21,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:21,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:21,786 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-29 11:02:21,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:21,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664887508] [2025-04-29 11:02:21,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664887508] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:02:21,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851335211] [2025-04-29 11:02:21,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:21,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:21,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:21,788 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:02:21,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-29 11:02:21,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-29 11:02:21,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 11:02:21,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:21,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:21,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 11:02:21,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:21,928 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-29 11:02:21,928 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:02:21,955 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-29 11:02:21,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851335211] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:02:21,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:02:21,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-04-29 11:02:21,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255178895] [2025-04-29 11:02:21,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:02:21,955 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:02:21,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:21,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:02:21,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:02:21,956 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:22,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:22,007 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2025-04-29 11:02:22,010 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:02:22,010 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-04-29 11:02:22,010 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:22,011 INFO L225 Difference]: With dead ends: 65 [2025-04-29 11:02:22,011 INFO L226 Difference]: Without dead ends: 54 [2025-04-29 11:02:22,011 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 94 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:02:22,012 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 11 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:22,012 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 108 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:22,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-04-29 11:02:22,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-04-29 11:02:22,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 53 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:22,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2025-04-29 11:02:22,018 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 50 [2025-04-29 11:02:22,018 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:22,018 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2025-04-29 11:02:22,018 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:22,018 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2025-04-29 11:02:22,018 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-29 11:02:22,018 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:22,019 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:22,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-29 11:02:22,219 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-04-29 11:02:22,219 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:02:22,219 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:22,219 INFO L85 PathProgramCache]: Analyzing trace with hash -769293230, now seen corresponding path program 1 times [2025-04-29 11:02:22,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:22,219 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435292479] [2025-04-29 11:02:22,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:22,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:22,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-29 11:02:22,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 11:02:22,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:22,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:22,277 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-29 11:02:22,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:22,277 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435292479] [2025-04-29 11:02:22,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435292479] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:02:22,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816921057] [2025-04-29 11:02:22,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:22,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:22,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:22,280 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:02:22,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-29 11:02:22,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-29 11:02:22,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 11:02:22,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:22,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:22,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:02:22,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:22,431 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-29 11:02:22,431 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:02:22,467 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-29 11:02:22,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816921057] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:02:22,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:02:22,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-29 11:02:22,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911994165] [2025-04-29 11:02:22,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:02:22,467 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:02:22,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:22,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:02:22,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:02:22,468 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:22,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:22,513 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2025-04-29 11:02:22,514 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:02:22,514 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-04-29 11:02:22,514 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:22,514 INFO L225 Difference]: With dead ends: 88 [2025-04-29 11:02:22,514 INFO L226 Difference]: Without dead ends: 87 [2025-04-29 11:02:22,515 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:02:22,515 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 19 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:22,515 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 92 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:22,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-04-29 11:02:22,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-04-29 11:02:22,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.0930232558139534) internal successors, (94), 86 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:22,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2025-04-29 11:02:22,521 INFO L79 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 53 [2025-04-29 11:02:22,521 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:22,521 INFO L485 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2025-04-29 11:02:22,521 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:22,521 INFO L278 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2025-04-29 11:02:22,521 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-04-29 11:02:22,522 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:02:22,522 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:22,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-29 11:02:22,722 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-29 11:02:22,722 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:02:22,723 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:22,723 INFO L85 PathProgramCache]: Analyzing trace with hash 779853391, now seen corresponding path program 2 times [2025-04-29 11:02:22,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:22,723 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098044358] [2025-04-29 11:02:22,723 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:02:22,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:22,734 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-04-29 11:02:22,735 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 86 statements. [2025-04-29 11:02:22,735 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:02:22,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:22,749 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-04-29 11:02:22,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:22,749 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098044358] [2025-04-29 11:02:22,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098044358] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:02:22,749 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761126737] [2025-04-29 11:02:22,749 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:02:22,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:02:22,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:02:22,751 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:02:22,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-29 11:02:22,871 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-04-29 11:02:22,877 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 86 statements. [2025-04-29 11:02:22,877 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:02:22,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:22,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:02:22,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:02:22,948 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-04-29 11:02:22,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:02:23,028 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-04-29 11:02:23,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761126737] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:02:23,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:02:23,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-29 11:02:23,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890626464] [2025-04-29 11:02:23,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:02:23,029 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:02:23,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:23,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:02:23,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:02:23,029 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:23,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:02:23,063 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2025-04-29 11:02:23,063 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:02:23,063 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-04-29 11:02:23,064 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:02:23,064 INFO L225 Difference]: With dead ends: 87 [2025-04-29 11:02:23,064 INFO L226 Difference]: Without dead ends: 0 [2025-04-29 11:02:23,065 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:02:23,065 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:02:23,065 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 61 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:02:23,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-29 11:02:23,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-29 11:02:23,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:23,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-29 11:02:23,066 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 86 [2025-04-29 11:02:23,066 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:02:23,066 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-29 11:02:23,066 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:23,066 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-29 11:02:23,067 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-29 11:02:23,068 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2025-04-29 11:02:23,068 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2025-04-29 11:02:23,069 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2025-04-29 11:02:23,069 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2025-04-29 11:02:23,069 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2025-04-29 11:02:23,069 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2025-04-29 11:02:23,069 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2025-04-29 11:02:23,069 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2025-04-29 11:02:23,069 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2025-04-29 11:02:23,069 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2025-04-29 11:02:23,069 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2025-04-29 11:02:23,069 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2025-04-29 11:02:23,069 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2025-04-29 11:02:23,069 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2025-04-29 11:02:23,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-29 11:02:23,270 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-04-29 11:02:23,272 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:23,273 INFO L312 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-04-29 11:02:23,423 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:02:23,434 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-04-29 11:02:23,435 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-04-29 11:02:23,435 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-04-29 11:02:23,435 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-04-29 11:02:23,435 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-04-29 11:02:23,435 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-04-29 11:02:23,435 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-04-29 11:02:23,435 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-04-29 11:02:23,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:02:23 BoogieIcfgContainer [2025-04-29 11:02:23,437 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:02:23,437 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:02:23,437 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:02:23,438 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:02:23,438 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:02:15" (3/4) ... [2025-04-29 11:02:23,440 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 11:02:23,446 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-04-29 11:02:23,446 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-04-29 11:02:23,446 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-29 11:02:23,447 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-04-29 11:02:23,504 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:02:23,504 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:02:23,504 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:02:23,505 INFO L158 Benchmark]: Toolchain (without parser) took 9029.34ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 104.8MB in the beginning and 215.7MB in the end (delta: -110.9MB). Peak memory consumption was 79.3MB. Max. memory is 16.1GB. [2025-04-29 11:02:23,505 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:02:23,505 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.38ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 90.8MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:02:23,505 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.23ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 88.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:02:23,505 INFO L158 Benchmark]: Boogie Preprocessor took 32.97ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 86.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:02:23,505 INFO L158 Benchmark]: RCFGBuilder took 275.40ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 70.2MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:02:23,505 INFO L158 Benchmark]: TraceAbstraction took 8374.48ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 70.2MB in the beginning and 220.7MB in the end (delta: -150.5MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. [2025-04-29 11:02:23,505 INFO L158 Benchmark]: Witness Printer took 66.82ms. Allocated memory is still 335.5MB. Free memory was 220.7MB in the beginning and 215.7MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:02:23,506 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.25ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 240.38ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 90.8MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.23ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 88.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.97ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 86.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 275.40ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 70.2MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8374.48ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 70.2MB in the beginning and 220.7MB in the end (delta: -150.5MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. * Witness Printer took 66.82ms. Allocated memory is still 335.5MB. Free memory was 220.7MB in the beginning and 215.7MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 * 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: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 68]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 68]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 73]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 73]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 72]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 72]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 50 locations, 57 edges, 14 error locations. Started 1 CEGAR loops. OverallTime: 8.2s, OverallIterations: 24, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 652 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 652 mSDsluCounter, 2337 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1595 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1166 IncrementalHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 742 mSDtfsCounter, 1166 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 952 GetRequests, 790 SyntacticMatches, 13 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=23, InterpolantAutomatonStates: 141, 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, 24 MinimizatonAttempts, 70 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1183 NumberOfCodeBlocks, 1025 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1505 ConstructedInterpolants, 0 QuantifiedInterpolants, 3635 SizeOfPredicates, 8 NumberOfNonLiveVariables, 2860 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 46 InterpolantComputations, 15 PerfectInterpolantSequences, 745/980 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 14 specifications checked. All of them hold - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: (((i == 0) && (len == 2)) || (((1 <= i) && (i <= 2147483646)) && (len == 2))) - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: ((index <= 2147483648) || (index == 0)) - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: ((index <= 2147483648) || (index == 0)) - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: (((i == 0) && (len == 2)) || (((((long long) len + i) < 2147483648) && (1 <= i)) && (len == 2))) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (((2 == len) && (len == 2)) || ((len <= 1) && (len == 2))) RESULT: Ultimate proved your program to be correct! [2025-04-29 11:02:23,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE