./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncmp-alloca-2.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/array-memsafety/openbsd_cstrncmp-alloca-2.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 56a580402957a2b1cbf29fbd94cbf8b053aa37d1b59885905020b64e56afe693 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:00:26,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:00:26,996 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-04-29 11:00:26,999 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:00:27,000 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:00:27,019 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:00:27,020 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:00:27,020 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:00:27,020 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:00:27,020 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:00:27,021 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:00:27,021 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:00:27,021 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:00:27,021 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:00:27,021 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:00:27,021 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:00:27,021 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:00:27,021 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:00:27,021 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:00:27,021 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:00:27,022 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:00:27,022 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:00:27,022 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:00:27,022 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:00:27,022 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-29 11:00:27,022 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:00:27,022 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:00:27,022 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:00:27,022 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:00:27,022 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:00:27,022 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:00:27,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:00:27,022 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:00:27,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:00:27,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:00:27,023 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:00:27,023 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:00:27,023 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:00:27,023 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:00:27,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:00:27,024 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:00:27,024 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:00:27,024 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:00:27,024 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:00:27,024 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:00:27,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:00:27,025 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:00:27,025 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:00:27,025 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:00:27,025 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 -> 56a580402957a2b1cbf29fbd94cbf8b053aa37d1b59885905020b64e56afe693 [2025-04-29 11:00:27,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:00:27,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:00:27,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:00:27,232 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:00:27,232 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:00:27,234 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncmp-alloca-2.c [2025-04-29 11:00:28,504 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/696ce3445/7888312905164d5aa5b4048e145b0a96/FLAGffffaa3a0 [2025-04-29 11:00:28,717 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:00:28,722 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/openbsd_cstrncmp-alloca-2.c [2025-04-29 11:00:28,724 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:00:28,729 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/696ce3445/7888312905164d5aa5b4048e145b0a96/FLAGffffaa3a0 [2025-04-29 11:00:29,554 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/696ce3445/7888312905164d5aa5b4048e145b0a96 [2025-04-29 11:00:29,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:00:29,557 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:00:29,558 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:00:29,558 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:00:29,561 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:00:29,562 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:00:29" (1/1) ... [2025-04-29 11:00:29,562 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fac9066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:29, skipping insertion in model container [2025-04-29 11:00:29,562 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:00:29" (1/1) ... [2025-04-29 11:00:29,572 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:00:29,730 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:00:29,736 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:00:29,766 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:00:29,777 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:00:29,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:29 WrapperNode [2025-04-29 11:00:29,778 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:00:29,779 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:00:29,779 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:00:29,779 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:00:29,783 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:00:29" (1/1) ... [2025-04-29 11:00:29,790 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:00:29" (1/1) ... [2025-04-29 11:00:29,804 INFO L138 Inliner]: procedures = 10, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 122 [2025-04-29 11:00:29,804 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:00:29,805 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:00:29,805 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:00:29,805 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:00:29,812 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:29" (1/1) ... [2025-04-29 11:00:29,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:29" (1/1) ... [2025-04-29 11:00:29,813 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:29" (1/1) ... [2025-04-29 11:00:29,832 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [5, 4]. 56 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2025-04-29 11:00:29,832 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:29" (1/1) ... [2025-04-29 11:00:29,832 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:29" (1/1) ... [2025-04-29 11:00:29,835 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:29" (1/1) ... [2025-04-29 11:00:29,836 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:29" (1/1) ... [2025-04-29 11:00:29,838 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:29" (1/1) ... [2025-04-29 11:00:29,839 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:29" (1/1) ... [2025-04-29 11:00:29,840 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:29" (1/1) ... [2025-04-29 11:00:29,842 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:00:29,843 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:00:29,843 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:00:29,843 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:00:29,844 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:29" (1/1) ... [2025-04-29 11:00:29,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:00:29,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:00:29,868 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:00:29,870 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:00:29,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:00:29,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 11:00:29,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:00:29,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:00:29,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:00:29,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 11:00:29,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 11:00:29,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:00:29,940 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:00:29,942 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:00:30,099 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2025-04-29 11:00:30,099 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:00:30,106 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:00:30,106 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-29 11:00:30,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:00:30 BoogieIcfgContainer [2025-04-29 11:00:30,107 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:00:30,108 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:00:30,108 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:00:30,113 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:00:30,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:00:29" (1/3) ... [2025-04-29 11:00:30,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7925f014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:00:30, skipping insertion in model container [2025-04-29 11:00:30,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:29" (2/3) ... [2025-04-29 11:00:30,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7925f014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:00:30, skipping insertion in model container [2025-04-29 11:00:30,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:00:30" (3/3) ... [2025-04-29 11:00:30,118 INFO L128 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncmp-alloca-2.c [2025-04-29 11:00:30,130 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:00:30,131 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG openbsd_cstrncmp-alloca-2.c that has 1 procedures, 49 locations, 59 edges, 1 initial locations, 3 loop locations, and 14 error locations. [2025-04-29 11:00:30,176 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:00:30,186 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;@c7815cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:00:30,186 INFO L341 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-04-29 11:00:30,189 INFO L278 IsEmpty]: Start isEmpty. Operand has 49 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 48 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:00:30,192 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:00:30,192 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:30,192 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:00:30,192 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:30,195 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:30,196 INFO L85 PathProgramCache]: Analyzing trace with hash 889510733, now seen corresponding path program 1 times [2025-04-29 11:00:30,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:30,201 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992523527] [2025-04-29 11:00:30,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:30,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:30,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:00:30,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:00:30,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:30,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:30,338 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:00:30,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:30,340 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992523527] [2025-04-29 11:00:30,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992523527] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:30,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:30,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:00:30,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380155746] [2025-04-29 11:00:30,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:30,345 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:00:30,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:30,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:00:30,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:00:30,358 INFO L87 Difference]: Start difference. First operand has 49 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 48 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) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:30,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:30,400 INFO L93 Difference]: Finished difference Result 80 states and 99 transitions. [2025-04-29 11:00:30,401 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:00:30,402 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-04-29 11:00:30,402 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:30,405 INFO L225 Difference]: With dead ends: 80 [2025-04-29 11:00:30,406 INFO L226 Difference]: Without dead ends: 33 [2025-04-29 11:00:30,408 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:00:30,412 INFO L437 NwaCegarLoop]: 43 mSDtfsCounter, 24 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:30,412 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 62 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:30,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-04-29 11:00:30,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-04-29 11:00:30,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.565217391304348) internal successors, (36), 32 states have internal predecessors, (36), 0 states have call successors, (0), 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:00:30,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2025-04-29 11:00:30,434 INFO L79 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 6 [2025-04-29 11:00:30,434 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:30,434 INFO L485 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2025-04-29 11:00:30,435 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:30,435 INFO L278 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2025-04-29 11:00:30,435 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:00:30,435 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:30,436 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:30,436 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:00:30,436 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:30,437 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:30,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028999, now seen corresponding path program 1 times [2025-04-29 11:00:30,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:30,438 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426669295] [2025-04-29 11:00:30,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:30,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:30,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:00:30,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:00:30,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:30,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:30,491 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:00:30,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:30,492 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426669295] [2025-04-29 11:00:30,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426669295] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:30,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:30,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:00:30,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215904170] [2025-04-29 11:00:30,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:30,493 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:00:30,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:30,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:00:30,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:00:30,494 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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:00:30,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:30,522 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2025-04-29 11:00:30,522 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:00:30,522 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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:00:30,522 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:30,523 INFO L225 Difference]: With dead ends: 59 [2025-04-29 11:00:30,523 INFO L226 Difference]: Without dead ends: 57 [2025-04-29 11:00:30,523 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:00:30,524 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 53 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:00:30,524 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 53 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:30,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-04-29 11:00:30,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2025-04-29 11:00:30,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 50 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:00:30,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2025-04-29 11:00:30,528 INFO L79 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 7 [2025-04-29 11:00:30,528 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:30,529 INFO L485 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2025-04-29 11:00:30,530 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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:00:30,530 INFO L278 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2025-04-29 11:00:30,531 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:00:30,531 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:30,531 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:30,531 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:00:30,531 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:30,532 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:30,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1806876041, now seen corresponding path program 1 times [2025-04-29 11:00:30,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:30,533 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877253625] [2025-04-29 11:00:30,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:30,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:30,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:00:30,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:00:30,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:30,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:30,577 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:00:30,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:30,578 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877253625] [2025-04-29 11:00:30,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877253625] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:30,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:30,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:00:30,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362333791] [2025-04-29 11:00:30,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:30,579 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:00:30,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:30,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:00:30,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:00:30,580 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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:00:30,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:30,602 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2025-04-29 11:00:30,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:00:30,602 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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:00:30,602 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:30,603 INFO L225 Difference]: With dead ends: 51 [2025-04-29 11:00:30,603 INFO L226 Difference]: Without dead ends: 49 [2025-04-29 11:00:30,603 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:00:30,603 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:30,604 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 29 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:30,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-04-29 11:00:30,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 31. [2025-04-29 11:00:30,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 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:00:30,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2025-04-29 11:00:30,608 INFO L79 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 7 [2025-04-29 11:00:30,608 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:30,608 INFO L485 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2025-04-29 11:00:30,608 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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:00:30,608 INFO L278 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2025-04-29 11:00:30,608 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:00:30,608 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:30,609 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:30,609 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:00:30,610 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:30,610 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:30,610 INFO L85 PathProgramCache]: Analyzing trace with hash 628418034, now seen corresponding path program 1 times [2025-04-29 11:00:30,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:30,611 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124260391] [2025-04-29 11:00:30,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:30,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:30,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:00:30,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:00:30,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:30,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:30,683 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:00:30,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:30,683 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124260391] [2025-04-29 11:00:30,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124260391] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:30,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:30,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:00:30,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861852065] [2025-04-29 11:00:30,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:30,683 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:00:30,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:30,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:00:30,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:30,684 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:30,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:30,734 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2025-04-29 11:00:30,736 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:00:30,736 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-29 11:00:30,737 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:30,737 INFO L225 Difference]: With dead ends: 76 [2025-04-29 11:00:30,737 INFO L226 Difference]: Without dead ends: 50 [2025-04-29 11:00:30,737 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:00:30,738 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 16 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:30,739 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 66 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:30,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-04-29 11:00:30,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 36. [2025-04-29 11:00:30,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 35 states have internal predecessors, (40), 0 states have call successors, (0), 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:00:30,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2025-04-29 11:00:30,743 INFO L79 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 10 [2025-04-29 11:00:30,743 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:30,743 INFO L485 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2025-04-29 11:00:30,743 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:30,743 INFO L278 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2025-04-29 11:00:30,743 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:00:30,743 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:30,743 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:30,743 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:00:30,744 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:30,744 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:30,744 INFO L85 PathProgramCache]: Analyzing trace with hash 628420215, now seen corresponding path program 1 times [2025-04-29 11:00:30,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:30,744 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915708678] [2025-04-29 11:00:30,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:30,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:30,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:00:30,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:00:30,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:30,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:30,783 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:00:30,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:30,784 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915708678] [2025-04-29 11:00:30,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915708678] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:30,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:30,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:00:30,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417148883] [2025-04-29 11:00:30,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:30,785 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:00:30,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:30,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:00:30,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:00:30,786 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:30,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:30,802 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2025-04-29 11:00:30,802 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:00:30,803 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-29 11:00:30,803 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:30,803 INFO L225 Difference]: With dead ends: 36 [2025-04-29 11:00:30,803 INFO L226 Difference]: Without dead ends: 34 [2025-04-29 11:00:30,804 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:00:30,804 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:30,804 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 27 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:30,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-04-29 11:00:30,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-04-29 11:00:30,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 33 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:30,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2025-04-29 11:00:30,809 INFO L79 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 10 [2025-04-29 11:00:30,809 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:30,809 INFO L485 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2025-04-29 11:00:30,809 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:30,809 INFO L278 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2025-04-29 11:00:30,809 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:00:30,809 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:30,809 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:30,809 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:00:30,809 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:00:30,810 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:30,810 INFO L85 PathProgramCache]: Analyzing trace with hash -180928592, now seen corresponding path program 1 times [2025-04-29 11:00:30,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:30,810 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164902447] [2025-04-29 11:00:30,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:30,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:30,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:00:30,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:00:30,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:30,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:30,867 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:00:30,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:30,867 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164902447] [2025-04-29 11:00:30,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164902447] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:30,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:30,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:00:30,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694651279] [2025-04-29 11:00:30,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:30,868 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:00:30,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:30,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:00:30,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:30,869 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:30,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:30,897 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2025-04-29 11:00:30,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:00:30,898 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-29 11:00:30,898 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:30,899 INFO L225 Difference]: With dead ends: 42 [2025-04-29 11:00:30,899 INFO L226 Difference]: Without dead ends: 40 [2025-04-29 11:00:30,899 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:00:30,900 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:30,900 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 75 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:30,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-04-29 11:00:30,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-04-29 11:00:30,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 39 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:00:30,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2025-04-29 11:00:30,905 INFO L79 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 10 [2025-04-29 11:00:30,905 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:30,905 INFO L485 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2025-04-29 11:00:30,905 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:30,905 INFO L278 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2025-04-29 11:00:30,906 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-29 11:00:30,906 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:30,906 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:30,906 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:00:30,906 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:30,906 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:30,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1993809741, now seen corresponding path program 1 times [2025-04-29 11:00:30,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:30,906 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148247121] [2025-04-29 11:00:30,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:30,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:30,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:00:30,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:00:30,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:30,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:30,934 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:00:30,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:30,935 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148247121] [2025-04-29 11:00:30,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148247121] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:30,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:30,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:00:30,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093165608] [2025-04-29 11:00:30,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:30,935 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:00:30,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:30,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:00:30,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:00:30,936 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:30,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:30,954 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2025-04-29 11:00:30,954 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:00:30,954 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-29 11:00:30,955 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:30,955 INFO L225 Difference]: With dead ends: 75 [2025-04-29 11:00:30,955 INFO L226 Difference]: Without dead ends: 68 [2025-04-29 11:00:30,956 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:00:30,956 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 47 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:00:30,957 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 47 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:30,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-04-29 11:00:30,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2025-04-29 11:00:30,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 58 states have (on average 1.293103448275862) internal successors, (75), 63 states have internal predecessors, (75), 0 states have call successors, (0), 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:00:30,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2025-04-29 11:00:30,964 INFO L79 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 11 [2025-04-29 11:00:30,964 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:30,964 INFO L485 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2025-04-29 11:00:30,964 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:30,965 INFO L278 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2025-04-29 11:00:30,965 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-29 11:00:30,965 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:30,965 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:30,965 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:00:30,965 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:30,965 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:30,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1491810929, now seen corresponding path program 1 times [2025-04-29 11:00:30,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:30,965 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445976748] [2025-04-29 11:00:30,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:30,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:30,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:00:30,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:00:30,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:30,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:30,996 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:00:30,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:30,996 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445976748] [2025-04-29 11:00:30,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445976748] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:30,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:30,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:00:30,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97422722] [2025-04-29 11:00:30,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:30,997 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:00:30,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:30,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:00:30,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:00:30,997 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:31,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:31,007 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2025-04-29 11:00:31,008 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:00:31,008 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-29 11:00:31,008 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:31,008 INFO L225 Difference]: With dead ends: 64 [2025-04-29 11:00:31,008 INFO L226 Difference]: Without dead ends: 57 [2025-04-29 11:00:31,008 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:00:31,009 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 19 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:31,009 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 23 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:31,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-04-29 11:00:31,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 33. [2025-04-29 11:00:31,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 32 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:31,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2025-04-29 11:00:31,011 INFO L79 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 11 [2025-04-29 11:00:31,011 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:31,011 INFO L485 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2025-04-29 11:00:31,011 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:31,012 INFO L278 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2025-04-29 11:00:31,012 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:00:31,012 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:31,012 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:31,012 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:00:31,012 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:31,013 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:31,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1811786140, now seen corresponding path program 1 times [2025-04-29 11:00:31,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:31,013 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610842043] [2025-04-29 11:00:31,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:31,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:31,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:00:31,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:00:31,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:31,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:31,047 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:00:31,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:31,048 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610842043] [2025-04-29 11:00:31,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610842043] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:31,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:31,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:00:31,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817917000] [2025-04-29 11:00:31,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:31,048 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:00:31,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:31,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:00:31,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:31,050 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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:00:31,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:31,067 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2025-04-29 11:00:31,067 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:00:31,067 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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:00:31,067 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:31,068 INFO L225 Difference]: With dead ends: 64 [2025-04-29 11:00:31,068 INFO L226 Difference]: Without dead ends: 48 [2025-04-29 11:00:31,068 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:00:31,068 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:31,069 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 55 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:31,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-04-29 11:00:31,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2025-04-29 11:00:31,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 45 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:00:31,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2025-04-29 11:00:31,072 INFO L79 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 14 [2025-04-29 11:00:31,072 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:31,072 INFO L485 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2025-04-29 11:00:31,072 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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:00:31,072 INFO L278 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2025-04-29 11:00:31,072 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:00:31,072 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:31,072 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:31,073 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:00:31,073 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:00:31,073 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:31,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1782116578, now seen corresponding path program 1 times [2025-04-29 11:00:31,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:31,073 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070467543] [2025-04-29 11:00:31,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:31,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:31,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:00:31,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:00:31,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:31,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:31,102 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:00:31,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:31,102 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070467543] [2025-04-29 11:00:31,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070467543] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:31,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:31,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:00:31,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940171158] [2025-04-29 11:00:31,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:31,103 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:00:31,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:31,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:00:31,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:31,103 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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:00:31,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:31,121 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2025-04-29 11:00:31,121 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:00:31,121 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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:00:31,121 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:31,122 INFO L225 Difference]: With dead ends: 54 [2025-04-29 11:00:31,122 INFO L226 Difference]: Without dead ends: 52 [2025-04-29 11:00:31,122 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:00:31,122 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 58 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:00:31,123 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 58 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:31,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-04-29 11:00:31,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-04-29 11:00:31,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 51 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:00:31,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2025-04-29 11:00:31,126 INFO L79 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 14 [2025-04-29 11:00:31,126 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:31,126 INFO L485 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2025-04-29 11:00:31,126 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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:00:31,126 INFO L278 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2025-04-29 11:00:31,126 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-29 11:00:31,127 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:31,127 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:31,127 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:00:31,127 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:31,127 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:31,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1697585960, now seen corresponding path program 1 times [2025-04-29 11:00:31,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:31,127 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026783966] [2025-04-29 11:00:31,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:31,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:31,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:00:31,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:00:31,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:31,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:31,184 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:31,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:31,184 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026783966] [2025-04-29 11:00:31,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026783966] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:00:31,184 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769363916] [2025-04-29 11:00:31,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:31,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:31,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:00:31,186 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:00:31,187 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:00:31,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:00:31,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:00:31,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:31,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:31,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:00:31,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:00:31,278 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:31,278 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:00:31,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769363916] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:31,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:00:31,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-04-29 11:00:31,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874026595] [2025-04-29 11:00:31,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:31,279 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:00:31,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:31,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:00:31,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:00:31,279 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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:00:31,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:31,320 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2025-04-29 11:00:31,320 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:00:31,320 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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 16 [2025-04-29 11:00:31,320 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:31,320 INFO L225 Difference]: With dead ends: 52 [2025-04-29 11:00:31,321 INFO L226 Difference]: Without dead ends: 51 [2025-04-29 11:00:31,321 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:00:31,322 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:31,322 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 67 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:31,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-04-29 11:00:31,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-04-29 11:00:31,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 48 states have (on average 1.1666666666666667) 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:00:31,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2025-04-29 11:00:31,328 INFO L79 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 16 [2025-04-29 11:00:31,328 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:31,328 INFO L485 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2025-04-29 11:00:31,329 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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:00:31,329 INFO L278 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2025-04-29 11:00:31,329 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-29 11:00:31,329 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:31,329 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:31,336 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:00:31,533 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-29 11:00:31,533 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:31,533 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:31,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1085557271, now seen corresponding path program 1 times [2025-04-29 11:00:31,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:31,534 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612527473] [2025-04-29 11:00:31,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:31,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:31,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:00:31,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:00:31,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:31,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:31,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:31,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:31,586 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612527473] [2025-04-29 11:00:31,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612527473] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:00:31,586 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733618104] [2025-04-29 11:00:31,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:31,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:31,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:00:31,588 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:00:31,589 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:00:31,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:00:31,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:00:31,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:31,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:31,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:00:31,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:00:31,672 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:31,672 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:00:31,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:31,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733618104] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:00:31,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:00:31,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-29 11:00:31,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454295390] [2025-04-29 11:00:31,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:00:31,716 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:00:31,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:31,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:00:31,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:00:31,717 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 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:00:31,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:31,749 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2025-04-29 11:00:31,750 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:00:31,750 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-29 11:00:31,750 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:31,751 INFO L225 Difference]: With dead ends: 88 [2025-04-29 11:00:31,751 INFO L226 Difference]: Without dead ends: 87 [2025-04-29 11:00:31,751 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 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:00:31,751 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:31,752 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:31,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-04-29 11:00:31,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-04-29 11:00:31,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 84 states have (on average 1.130952380952381) internal successors, (95), 86 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:31,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2025-04-29 11:00:31,758 INFO L79 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 17 [2025-04-29 11:00:31,758 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:31,758 INFO L485 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2025-04-29 11:00:31,759 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 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:00:31,759 INFO L278 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2025-04-29 11:00:31,759 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 11:00:31,760 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:31,760 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:31,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:00:31,960 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-29 11:00:31,961 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:31,961 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:31,961 INFO L85 PathProgramCache]: Analyzing trace with hash 706746454, now seen corresponding path program 1 times [2025-04-29 11:00:31,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:31,961 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384780352] [2025-04-29 11:00:31,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:31,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:31,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:00:31,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:00:31,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:31,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:32,022 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:32,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:32,023 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384780352] [2025-04-29 11:00:32,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384780352] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:00:32,023 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543199268] [2025-04-29 11:00:32,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:32,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:32,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:00:32,025 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:00:32,026 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:00:32,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:00:32,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:00:32,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:32,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:32,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:00:32,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:00:32,098 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:32,098 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:00:32,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543199268] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:32,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:00:32,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-04-29 11:00:32,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360743880] [2025-04-29 11:00:32,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:32,099 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:00:32,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:32,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:00:32,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:00:32,099 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 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:00:32,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:32,119 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2025-04-29 11:00:32,120 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:00:32,120 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 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 20 [2025-04-29 11:00:32,120 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:32,120 INFO L225 Difference]: With dead ends: 87 [2025-04-29 11:00:32,121 INFO L226 Difference]: Without dead ends: 86 [2025-04-29 11:00:32,121 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:00:32,121 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:32,121 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 74 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:32,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-04-29 11:00:32,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-04-29 11:00:32,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 84 states have (on average 1.119047619047619) internal successors, (94), 85 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:00:32,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2025-04-29 11:00:32,126 INFO L79 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 20 [2025-04-29 11:00:32,126 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:32,126 INFO L485 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2025-04-29 11:00:32,126 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 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:00:32,126 INFO L278 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2025-04-29 11:00:32,126 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-29 11:00:32,127 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:32,127 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:32,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-29 11:00:32,331 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:32,331 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:32,331 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:32,331 INFO L85 PathProgramCache]: Analyzing trace with hash 434303679, now seen corresponding path program 1 times [2025-04-29 11:00:32,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:32,331 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657181988] [2025-04-29 11:00:32,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:32,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:32,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:00:32,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:00:32,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:32,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:32,379 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:32,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:32,380 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657181988] [2025-04-29 11:00:32,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657181988] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:00:32,380 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831855428] [2025-04-29 11:00:32,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:32,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:32,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:00:32,382 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:00:32,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:00:32,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:00:32,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:00:32,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:32,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:32,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:00:32,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:00:32,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:32,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:00:32,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:32,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831855428] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:00:32,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:00:32,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-29 11:00:32,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614947693] [2025-04-29 11:00:32,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:00:32,496 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:00:32,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:32,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:00:32,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:00:32,496 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 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:00:32,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:32,528 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2025-04-29 11:00:32,528 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:00:32,528 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 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:00:32,528 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:32,529 INFO L225 Difference]: With dead ends: 105 [2025-04-29 11:00:32,529 INFO L226 Difference]: Without dead ends: 104 [2025-04-29 11:00:32,529 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 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:00:32,529 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:32,529 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:32,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-04-29 11:00:32,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-04-29 11:00:32,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 102 states have (on average 1.0980392156862746) internal successors, (112), 103 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:32,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2025-04-29 11:00:32,534 INFO L79 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 21 [2025-04-29 11:00:32,534 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:32,534 INFO L485 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2025-04-29 11:00:32,534 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 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:00:32,534 INFO L278 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2025-04-29 11:00:32,535 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-29 11:00:32,535 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:32,535 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:32,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 11:00:32,735 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:32,735 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:32,736 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:32,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1315938129, now seen corresponding path program 2 times [2025-04-29 11:00:32,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:32,736 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911921392] [2025-04-29 11:00:32,736 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:00:32,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:32,747 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-29 11:00:32,750 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 35 statements. [2025-04-29 11:00:32,750 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:00:32,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:32,771 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-29 11:00:32,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:32,771 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911921392] [2025-04-29 11:00:32,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911921392] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:00:32,771 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779267615] [2025-04-29 11:00:32,772 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:00:32,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:32,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:00:32,773 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:00:32,775 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:00:32,815 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-29 11:00:32,821 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 35 statements. [2025-04-29 11:00:32,821 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:00:32,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:32,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:00:32,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:00:32,869 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-29 11:00:32,869 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:00:32,921 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-29 11:00:32,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779267615] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:00:32,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:00:32,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-29 11:00:32,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237977357] [2025-04-29 11:00:32,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:00:32,922 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:00:32,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:32,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:00:32,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:00:32,922 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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:00:32,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:32,963 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2025-04-29 11:00:32,963 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:00:32,963 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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 35 [2025-04-29 11:00:32,963 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:32,963 INFO L225 Difference]: With dead ends: 104 [2025-04-29 11:00:32,963 INFO L226 Difference]: Without dead ends: 72 [2025-04-29 11:00:32,964 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 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:00:32,964 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:32,964 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 34 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:32,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-04-29 11:00:32,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 48. [2025-04-29 11:00:32,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 47 states have internal predecessors, (50), 0 states have call successors, (0), 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:00:32,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2025-04-29 11:00:32,967 INFO L79 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 35 [2025-04-29 11:00:32,967 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:32,967 INFO L485 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2025-04-29 11:00:32,967 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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:00:32,967 INFO L278 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2025-04-29 11:00:32,968 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-29 11:00:32,968 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:32,968 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:32,973 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:00:33,172 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,SelfDestructingSolverStorable14 [2025-04-29 11:00:33,172 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:33,172 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:33,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1259898903, now seen corresponding path program 2 times [2025-04-29 11:00:33,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:33,173 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044050663] [2025-04-29 11:00:33,173 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:00:33,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:33,180 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-04-29 11:00:33,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 39 statements. [2025-04-29 11:00:33,183 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:00:33,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:33,209 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-29 11:00:33,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:33,209 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044050663] [2025-04-29 11:00:33,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044050663] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:00:33,210 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484123678] [2025-04-29 11:00:33,210 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:00:33,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:33,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:00:33,222 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:00:33,223 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:00:33,265 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-04-29 11:00:33,273 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 39 statements. [2025-04-29 11:00:33,274 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:00:33,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:33,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:00:33,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:00:33,319 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-29 11:00:33,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:00:33,370 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-29 11:00:33,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484123678] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:00:33,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:00:33,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-29 11:00:33,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510171520] [2025-04-29 11:00:33,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:00:33,371 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:00:33,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:33,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:00:33,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:00:33,372 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 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:00:33,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:33,404 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2025-04-29 11:00:33,405 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:00:33,405 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-04-29 11:00:33,405 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:33,405 INFO L225 Difference]: With dead ends: 48 [2025-04-29 11:00:33,405 INFO L226 Difference]: Without dead ends: 0 [2025-04-29 11:00:33,405 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 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:00:33,406 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 9 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:33,406 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 45 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:33,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-29 11:00:33,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-29 11:00:33,406 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:00:33,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-29 11:00:33,406 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2025-04-29 11:00:33,406 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:33,406 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-29 11:00:33,406 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 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:00:33,406 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-29 11:00:33,406 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-29 11:00:33,408 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2025-04-29 11:00:33,408 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2025-04-29 11:00:33,408 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2025-04-29 11:00:33,408 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2025-04-29 11:00:33,409 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2025-04-29 11:00:33,409 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2025-04-29 11:00:33,409 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2025-04-29 11:00:33,409 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2025-04-29 11:00:33,409 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2025-04-29 11:00:33,409 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2025-04-29 11:00:33,409 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2025-04-29 11:00:33,409 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2025-04-29 11:00:33,409 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2025-04-29 11:00:33,409 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2025-04-29 11:00:33,415 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:00:33,610 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:00:33,612 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:33,614 INFO L312 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-04-29 11:00:33,794 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:00:33,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:00:33 BoogieIcfgContainer [2025-04-29 11:00:33,811 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:00:33,812 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:00:33,812 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:00:33,812 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:00:33,813 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:00:30" (3/4) ... [2025-04-29 11:00:33,814 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 11:00:33,820 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-04-29 11:00:33,820 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-04-29 11:00:33,820 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-29 11:00:33,821 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-04-29 11:00:33,887 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:00:33,888 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:00:33,888 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:00:33,888 INFO L158 Benchmark]: Toolchain (without parser) took 4331.22ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 75.5MB in the end (delta: 30.6MB). Peak memory consumption was 34.4MB. Max. memory is 16.1GB. [2025-04-29 11:00:33,888 INFO L158 Benchmark]: CDTParser took 1.21ms. Allocated memory is still 201.3MB. Free memory is still 129.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:00:33,888 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.11ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 92.4MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:00:33,889 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.23ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 90.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:00:33,889 INFO L158 Benchmark]: Boogie Preprocessor took 37.97ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 88.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:00:33,889 INFO L158 Benchmark]: RCFGBuilder took 263.53ms. Allocated memory is still 142.6MB. Free memory was 88.4MB in the beginning and 72.7MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:00:33,889 INFO L158 Benchmark]: TraceAbstraction took 3703.17ms. Allocated memory is still 142.6MB. Free memory was 72.7MB in the beginning and 82.5MB in the end (delta: -9.8MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. [2025-04-29 11:00:33,889 INFO L158 Benchmark]: Witness Printer took 76.01ms. Allocated memory is still 142.6MB. Free memory was 82.5MB in the beginning and 75.5MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:00:33,890 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.21ms. Allocated memory is still 201.3MB. Free memory is still 129.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.11ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 92.4MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.23ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 90.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.97ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 88.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 263.53ms. Allocated memory is still 142.6MB. Free memory was 88.4MB in the beginning and 72.7MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3703.17ms. Allocated memory is still 142.6MB. Free memory was 72.7MB in the beginning and 82.5MB in the end (delta: -9.8MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. * Witness Printer took 76.01ms. Allocated memory is still 142.6MB. Free memory was 82.5MB in the beginning and 75.5MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 76]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 76]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: 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, 49 locations, 59 edges, 14 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 16, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 189 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 189 mSDsluCounter, 892 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 523 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 356 IncrementalHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 369 mSDtfsCounter, 356 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 312 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=14, InterpolantAutomatonStates: 78, 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, 16 MinimizatonAttempts, 92 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 396 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 482 ConstructedInterpolants, 0 QuantifiedInterpolants, 1272 SizeOfPredicates, 4 NumberOfNonLiveVariables, 421 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 26 InterpolantComputations, 12 PerfectInterpolantSequences, 298/416 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: 65]: Loop Invariant Derived loop invariant: ((((((i == 0) && (1 <= length1)) && (1 <= length2)) && (length1 <= 2147483647)) || (((((1 <= i) && (i <= 2147483646)) && (1 <= length1)) && (1 <= length2)) && (length1 <= 2147483647))) && (length2 <= 2147483647)) - InvariantResult [Line: 70]: Loop Invariant Derived loop invariant: ((((((i == 0) && (1 <= length1)) && (1 <= length2)) && (length1 <= 2147483647)) && (length2 <= 2147483647)) || ((((((1 <= length1) && (i <= 2147483646)) && (1 <= length2)) && (length1 <= 2147483647)) && (1 <= i)) && (length2 <= 2147483647))) RESULT: Ultimate proved your program to be correct! [2025-04-29 11:00:33,907 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