./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/termination-memory-alloca/b.06-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-memory-alloca/b.06-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 21a06ce5e98962e93aa29e180f0bc8e543a622b520b6d7eef2d0a57c9849b220 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:23:51,156 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:23:51,206 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-04-30 10:23:51,211 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:23:51,212 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:23:51,227 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:23:51,228 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:23:51,228 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:23:51,228 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:23:51,228 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:23:51,228 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:23:51,228 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:23:51,229 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:23:51,229 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:23:51,229 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:23:51,229 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:23:51,229 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:23:51,229 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:23:51,229 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:23:51,229 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:23:51,229 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:23:51,230 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:23:51,230 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-30 10:23:51,230 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:23:51,230 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:23:51,230 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:23:51,230 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:23:51,230 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:23:51,230 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:23:51,230 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:23:51,230 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:23:51,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:23:51,231 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:23:51,231 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:23:51,231 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:23:51,231 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:23:51,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:23:51,231 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:23:51,231 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:23:51,231 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:23:51,231 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:23:51,231 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:23:51,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:23:51,232 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:23:51,232 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:23:51,232 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:23:51,232 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 21a06ce5e98962e93aa29e180f0bc8e543a622b520b6d7eef2d0a57c9849b220 [2025-04-30 10:23:51,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:23:51,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:23:51,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:23:51,436 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:23:51,436 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:23:51,437 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/termination-memory-alloca/b.06-alloca.i [2025-04-30 10:23:52,636 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8871e2eff/68f1f474fc6b40d18e8c65bcf8cfb943/FLAG35e7be044 [2025-04-30 10:23:52,843 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:23:52,844 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/termination-memory-alloca/b.06-alloca.i [2025-04-30 10:23:52,855 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8871e2eff/68f1f474fc6b40d18e8c65bcf8cfb943/FLAG35e7be044 [2025-04-30 10:23:53,638 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8871e2eff/68f1f474fc6b40d18e8c65bcf8cfb943 [2025-04-30 10:23:53,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:23:53,640 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:23:53,641 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:23:53,641 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:23:53,644 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:23:53,645 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:23:53" (1/1) ... [2025-04-30 10:23:53,645 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23cb3ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:23:53, skipping insertion in model container [2025-04-30 10:23:53,645 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:23:53" (1/1) ... [2025-04-30 10:23:53,666 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:23:53,929 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:23:53,936 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:23:53,992 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:23:54,009 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:23:54,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:23:54 WrapperNode [2025-04-30 10:23:54,009 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:23:54,010 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:23:54,010 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:23:54,010 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:23:54,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:23:54" (1/1) ... [2025-04-30 10:23:54,023 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:23:54" (1/1) ... [2025-04-30 10:23:54,040 INFO L138 Inliner]: procedures = 111, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 75 [2025-04-30 10:23:54,041 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:23:54,041 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:23:54,041 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:23:54,041 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:23:54,048 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:23:54" (1/1) ... [2025-04-30 10:23:54,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:23:54" (1/1) ... [2025-04-30 10:23:54,052 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:23:54" (1/1) ... [2025-04-30 10:23:54,063 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [4, 4, 4]. 33 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 6 writes are split as follows [2, 2, 2]. [2025-04-30 10:23:54,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:23:54" (1/1) ... [2025-04-30 10:23:54,063 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:23:54" (1/1) ... [2025-04-30 10:23:54,065 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:23:54" (1/1) ... [2025-04-30 10:23:54,066 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:23:54" (1/1) ... [2025-04-30 10:23:54,072 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:23:54" (1/1) ... [2025-04-30 10:23:54,076 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:23:54" (1/1) ... [2025-04-30 10:23:54,076 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:23:54" (1/1) ... [2025-04-30 10:23:54,079 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:23:54,079 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:23:54,079 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:23:54,080 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:23:54,080 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:23:54" (1/1) ... [2025-04-30 10:23:54,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:23:54,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:23:54,103 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-30 10:23:54,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-30 10:23:54,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:23:54,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:23:54,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-30 10:23:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:23:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:23:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-30 10:23:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:23:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:23:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:23:54,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:23:54,201 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:23:54,202 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:23:54,303 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-04-30 10:23:54,303 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:23:54,308 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:23:54,309 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-30 10:23:54,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:23:54 BoogieIcfgContainer [2025-04-30 10:23:54,309 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:23:54,311 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:23:54,312 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:23:54,315 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:23:54,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:23:53" (1/3) ... [2025-04-30 10:23:54,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62077b3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:23:54, skipping insertion in model container [2025-04-30 10:23:54,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:23:54" (2/3) ... [2025-04-30 10:23:54,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62077b3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:23:54, skipping insertion in model container [2025-04-30 10:23:54,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:23:54" (3/3) ... [2025-04-30 10:23:54,317 INFO L128 eAbstractionObserver]: Analyzing ICFG b.06-alloca.i [2025-04-30 10:23:54,329 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:23:54,330 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG b.06-alloca.i that has 1 procedures, 23 locations, 25 edges, 1 initial locations, 1 loop locations, and 6 error locations. [2025-04-30 10:23:54,367 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:23:54,376 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;@674a8df2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:23:54,377 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-30 10:23:54,379 INFO L278 IsEmpty]: Start isEmpty. Operand has 23 states, 16 states have (on average 1.5625) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:54,382 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:23:54,382 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:23:54,383 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:23:54,383 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-30 10:23:54,387 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:23:54,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1805892906, now seen corresponding path program 1 times [2025-04-30 10:23:54,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:23:54,393 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963906768] [2025-04-30 10:23:54,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:23:54,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:23:54,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:23:54,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:23:54,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:23:54,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:23:54,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:23:54,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:23:54,661 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963906768] [2025-04-30 10:23:54,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963906768] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:23:54,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:23:54,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:23:54,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713527190] [2025-04-30 10:23:54,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:23:54,666 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:23:54,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:23:54,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:23:54,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:23:54,682 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.5625) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 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 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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-30 10:23:54,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:23:54,735 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2025-04-30 10:23:54,736 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:23:54,737 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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-30 10:23:54,737 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:23:54,741 INFO L225 Difference]: With dead ends: 31 [2025-04-30 10:23:54,741 INFO L226 Difference]: Without dead ends: 18 [2025-04-30 10:23:54,743 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:23:54,745 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:23:54,746 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 44 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:23:54,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-04-30 10:23:54,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2025-04-30 10:23:54,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.5) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:54,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2025-04-30 10:23:54,773 INFO L79 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 7 [2025-04-30 10:23:54,773 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:23:54,773 INFO L485 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2025-04-30 10:23:54,773 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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-30 10:23:54,774 INFO L278 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2025-04-30 10:23:54,774 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-30 10:23:54,774 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:23:54,774 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:23:54,775 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:23:54,775 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-30 10:23:54,775 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:23:54,776 INFO L85 PathProgramCache]: Analyzing trace with hash 148105291, now seen corresponding path program 1 times [2025-04-30 10:23:54,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:23:54,776 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114015621] [2025-04-30 10:23:54,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:23:54,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:23:54,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:23:54,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:23:54,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:23:54,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:23:54,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:23:54,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:23:54,980 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114015621] [2025-04-30 10:23:54,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114015621] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:23:54,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:23:54,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:23:54,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057156013] [2025-04-30 10:23:54,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:23:54,981 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:23:54,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:23:54,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:23:54,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:23:54,983 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:55,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:23:55,005 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2025-04-30 10:23:55,006 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:23:55,007 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-04-30 10:23:55,007 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:23:55,007 INFO L225 Difference]: With dead ends: 17 [2025-04-30 10:23:55,007 INFO L226 Difference]: Without dead ends: 16 [2025-04-30 10:23:55,007 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:23:55,008 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 11 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:23:55,008 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 26 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:23:55,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-04-30 10:23:55,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-04-30 10:23:55,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:55,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2025-04-30 10:23:55,012 INFO L79 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 8 [2025-04-30 10:23:55,012 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:23:55,013 INFO L485 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2025-04-30 10:23:55,013 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:55,013 INFO L278 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2025-04-30 10:23:55,013 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-30 10:23:55,013 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:23:55,013 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:23:55,013 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:23:55,013 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-30 10:23:55,014 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:23:55,014 INFO L85 PathProgramCache]: Analyzing trace with hash 296296780, now seen corresponding path program 1 times [2025-04-30 10:23:55,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:23:55,014 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095888115] [2025-04-30 10:23:55,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:23:55,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:23:55,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:23:55,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:23:55,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:23:55,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:23:55,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:23:55,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:23:55,173 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095888115] [2025-04-30 10:23:55,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095888115] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:23:55,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:23:55,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:23:55,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891840536] [2025-04-30 10:23:55,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:23:55,174 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:23:55,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:23:55,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:23:55,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:23:55,175 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:55,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:23:55,199 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2025-04-30 10:23:55,199 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:23:55,199 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-30 10:23:55,199 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:23:55,200 INFO L225 Difference]: With dead ends: 16 [2025-04-30 10:23:55,200 INFO L226 Difference]: Without dead ends: 15 [2025-04-30 10:23:55,200 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:23:55,200 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 7 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:23:55,201 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 27 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:23:55,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-04-30 10:23:55,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-04-30 10:23:55,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 14 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-30 10:23:55,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2025-04-30 10:23:55,205 INFO L79 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 9 [2025-04-30 10:23:55,205 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:23:55,205 INFO L485 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2025-04-30 10:23:55,205 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:55,205 INFO L278 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2025-04-30 10:23:55,205 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:23:55,205 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:23:55,205 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:23:55,205 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:23:55,206 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-30 10:23:55,206 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:23:55,207 INFO L85 PathProgramCache]: Analyzing trace with hash 595265645, now seen corresponding path program 1 times [2025-04-30 10:23:55,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:23:55,208 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147489869] [2025-04-30 10:23:55,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:23:55,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:23:55,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:23:55,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:23:55,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:23:55,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:23:55,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:23:55,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:23:55,279 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147489869] [2025-04-30 10:23:55,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147489869] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:23:55,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:23:55,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:23:55,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912806840] [2025-04-30 10:23:55,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:23:55,280 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:23:55,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:23:55,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:23:55,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:23:55,281 INFO L87 Difference]: Start difference. First operand 15 states and 16 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-30 10:23:55,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:23:55,294 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2025-04-30 10:23:55,294 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:23:55,295 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-30 10:23:55,295 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:23:55,295 INFO L225 Difference]: With dead ends: 15 [2025-04-30 10:23:55,295 INFO L226 Difference]: Without dead ends: 14 [2025-04-30 10:23:55,295 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:23:55,296 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 7 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:23:55,296 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 22 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:23:55,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-04-30 10:23:55,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-04-30 10:23:55,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:55,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2025-04-30 10:23:55,297 INFO L79 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2025-04-30 10:23:55,297 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:23:55,297 INFO L485 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2025-04-30 10:23:55,297 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-30 10:23:55,297 INFO L278 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2025-04-30 10:23:55,297 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-30 10:23:55,297 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:23:55,297 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:23:55,297 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:23:55,298 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-30 10:23:55,298 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:23:55,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1273365870, now seen corresponding path program 1 times [2025-04-30 10:23:55,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:23:55,298 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271969058] [2025-04-30 10:23:55,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:23:55,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:23:55,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:23:55,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:23:55,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:23:55,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:23:55,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:23:55,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:23:55,355 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271969058] [2025-04-30 10:23:55,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271969058] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:23:55,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:23:55,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:23:55,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396675824] [2025-04-30 10:23:55,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:23:55,355 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:23:55,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:23:55,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:23:55,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:23:55,356 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:55,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:23:55,385 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2025-04-30 10:23:55,385 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:23:55,385 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-30 10:23:55,385 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:23:55,387 INFO L225 Difference]: With dead ends: 26 [2025-04-30 10:23:55,387 INFO L226 Difference]: Without dead ends: 24 [2025-04-30 10:23:55,387 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:23:55,388 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:23:55,388 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 33 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:23:55,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-04-30 10:23:55,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-04-30 10:23:55,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:55,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2025-04-30 10:23:55,393 INFO L79 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 11 [2025-04-30 10:23:55,393 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:23:55,393 INFO L485 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2025-04-30 10:23:55,393 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:55,393 INFO L278 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2025-04-30 10:23:55,394 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-30 10:23:55,394 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:23:55,394 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-04-30 10:23:55,394 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:23:55,394 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-30 10:23:55,395 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:23:55,396 INFO L85 PathProgramCache]: Analyzing trace with hash 462649153, now seen corresponding path program 1 times [2025-04-30 10:23:55,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:23:55,397 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238741853] [2025-04-30 10:23:55,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:23:55,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:23:55,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-30 10:23:55,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-30 10:23:55,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:23:55,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:23:55,530 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:23:55,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:23:55,530 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238741853] [2025-04-30 10:23:55,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238741853] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:23:55,530 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099767675] [2025-04-30 10:23:55,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:23:55,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:23:55,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:23:55,532 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:23:55,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-30 10:23:55,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-30 10:23:55,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-30 10:23:55,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:23:55,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:23:55,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-30 10:23:55,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:23:55,658 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:23:55,694 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-04-30 10:23:55,708 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:23:55,709 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:23:55,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099767675] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:23:55,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:23:55,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-04-30 10:23:55,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50917234] [2025-04-30 10:23:55,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:23:55,710 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:23:55,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:23:55,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:23:55,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:23:55,713 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:55,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:23:55,733 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2025-04-30 10:23:55,734 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:23:55,734 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-30 10:23:55,734 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:23:55,734 INFO L225 Difference]: With dead ends: 24 [2025-04-30 10:23:55,734 INFO L226 Difference]: Without dead ends: 23 [2025-04-30 10:23:55,735 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:23:55,735 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 5 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:23:55,736 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 20 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:23:55,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-04-30 10:23:55,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-04-30 10:23:55,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:55,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2025-04-30 10:23:55,738 INFO L79 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 21 [2025-04-30 10:23:55,738 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:23:55,738 INFO L485 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2025-04-30 10:23:55,738 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:55,738 INFO L278 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2025-04-30 10:23:55,739 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-30 10:23:55,739 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:23:55,739 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-04-30 10:23:55,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-30 10:23:55,943 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-30 10:23:55,943 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-30 10:23:55,943 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:23:55,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1457221916, now seen corresponding path program 1 times [2025-04-30 10:23:55,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:23:55,943 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158882791] [2025-04-30 10:23:55,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:23:55,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:23:55,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-30 10:23:55,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-30 10:23:55,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:23:55,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:23:56,089 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:23:56,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:23:56,089 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158882791] [2025-04-30 10:23:56,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158882791] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:23:56,090 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556178127] [2025-04-30 10:23:56,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:23:56,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:23:56,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:23:56,092 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:23:56,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-30 10:23:56,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-30 10:23:56,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-30 10:23:56,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:23:56,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:23:56,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:23:56,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:23:56,173 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:23:56,209 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-04-30 10:23:56,228 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-30 10:23:56,231 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:23:56,231 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:23:56,304 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:23:56,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556178127] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:23:56,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:23:56,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-30 10:23:56,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988132975] [2025-04-30 10:23:56,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:23:56,305 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:23:56,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:23:56,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:23:56,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:23:56,306 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:56,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:23:56,364 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2025-04-30 10:23:56,364 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:23:56,364 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-30 10:23:56,364 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:23:56,365 INFO L225 Difference]: With dead ends: 54 [2025-04-30 10:23:56,365 INFO L226 Difference]: Without dead ends: 53 [2025-04-30 10:23:56,365 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:23:56,365 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:23:56,366 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 73 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:23:56,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-04-30 10:23:56,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-04-30 10:23:56,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 52 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:56,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2025-04-30 10:23:56,369 INFO L79 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 22 [2025-04-30 10:23:56,369 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:23:56,369 INFO L485 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2025-04-30 10:23:56,370 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:56,370 INFO L278 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2025-04-30 10:23:56,370 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-04-30 10:23:56,370 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:23:56,370 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1] [2025-04-30 10:23:56,377 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-30 10:23:56,575 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-04-30 10:23:56,575 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-30 10:23:56,575 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:23:56,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1194180931, now seen corresponding path program 2 times [2025-04-30 10:23:56,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:23:56,576 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645133015] [2025-04-30 10:23:56,576 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:23:56,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:23:56,594 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-04-30 10:23:56,610 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-04-30 10:23:56,611 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:23:56,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:23:57,009 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:23:57,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:23:57,009 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645133015] [2025-04-30 10:23:57,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645133015] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:23:57,009 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755264124] [2025-04-30 10:23:57,009 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:23:57,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:23:57,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:23:57,011 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:23:57,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-30 10:23:57,065 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-04-30 10:23:57,092 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-04-30 10:23:57,092 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:23:57,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:23:57,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-30 10:23:57,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:23:57,100 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:23:57,142 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-04-30 10:23:57,183 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:23:57,221 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:23:57,262 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:23:57,281 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-30 10:23:57,284 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:23:57,284 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:23:57,476 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:23:57,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755264124] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:23:57,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:23:57,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2025-04-30 10:23:57,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236862859] [2025-04-30 10:23:57,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:23:57,476 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-30 10:23:57,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:23:57,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-30 10:23:57,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=438, Unknown=0, NotChecked=0, Total=650 [2025-04-30 10:23:57,480 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 26 states, 25 states have (on average 4.6) internal successors, (115), 26 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:57,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:23:57,629 INFO L93 Difference]: Finished difference Result 114 states and 130 transitions. [2025-04-30 10:23:57,629 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-30 10:23:57,630 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.6) internal successors, (115), 26 states have internal predecessors, (115), 0 states have call successors, (0), 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 52 [2025-04-30 10:23:57,630 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:23:57,630 INFO L225 Difference]: With dead ends: 114 [2025-04-30 10:23:57,630 INFO L226 Difference]: Without dead ends: 113 [2025-04-30 10:23:57,631 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=337, Invalid=719, Unknown=0, NotChecked=0, Total=1056 [2025-04-30 10:23:57,631 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 36 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:23:57,631 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 127 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:23:57,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-04-30 10:23:57,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-04-30 10:23:57,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.1071428571428572) internal successors, (124), 112 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:57,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 124 transitions. [2025-04-30 10:23:57,639 INFO L79 Accepts]: Start accepts. Automaton has 113 states and 124 transitions. Word has length 52 [2025-04-30 10:23:57,639 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:23:57,639 INFO L485 AbstractCegarLoop]: Abstraction has 113 states and 124 transitions. [2025-04-30 10:23:57,639 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.6) internal successors, (115), 26 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:23:57,639 INFO L278 IsEmpty]: Start isEmpty. Operand 113 states and 124 transitions. [2025-04-30 10:23:57,642 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-04-30 10:23:57,643 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:23:57,643 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1] [2025-04-30 10:23:57,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-30 10:23:57,844 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:23:57,845 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-30 10:23:57,845 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:23:57,845 INFO L85 PathProgramCache]: Analyzing trace with hash -848275759, now seen corresponding path program 3 times [2025-04-30 10:23:57,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:23:57,845 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857152905] [2025-04-30 10:23:57,845 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:23:57,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:23:57,868 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 112 statements into 11 equivalence classes. [2025-04-30 10:23:57,952 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 112 of 112 statements. [2025-04-30 10:23:57,953 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-30 10:23:57,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:23:59,217 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 0 proven. 550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:23:59,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:23:59,218 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857152905] [2025-04-30 10:23:59,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857152905] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:23:59,218 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055154522] [2025-04-30 10:23:59,218 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:23:59,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:23:59,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:23:59,221 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:23:59,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-30 10:23:59,293 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 112 statements into 11 equivalence classes. [2025-04-30 10:24:00,071 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 112 of 112 statements. [2025-04-30 10:24:00,072 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-30 10:24:00,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:00,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-30 10:24:00,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:24:00,084 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:24:00,110 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-04-30 10:24:00,137 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:00,169 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:00,212 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:00,242 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:00,272 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:00,304 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:00,336 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:00,382 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:00,417 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:00,439 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-30 10:24:00,442 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 0 proven. 550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:00,442 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:24:00,976 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 0 proven. 550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:00,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055154522] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:24:00,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:24:00,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 55 [2025-04-30 10:24:00,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82489332] [2025-04-30 10:24:00,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:24:00,977 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-04-30 10:24:00,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:24:00,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-04-30 10:24:00,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=965, Invalid=2115, Unknown=0, NotChecked=0, Total=3080 [2025-04-30 10:24:00,979 INFO L87 Difference]: Start difference. First operand 113 states and 124 transitions. Second operand has 56 states, 55 states have (on average 4.6) internal successors, (253), 56 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:01,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:24:01,357 INFO L93 Difference]: Finished difference Result 234 states and 268 transitions. [2025-04-30 10:24:01,357 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-30 10:24:01,358 INFO L79 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 4.6) internal successors, (253), 56 states have internal predecessors, (253), 0 states have call successors, (0), 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 112 [2025-04-30 10:24:01,358 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:24:01,359 INFO L225 Difference]: With dead ends: 234 [2025-04-30 10:24:01,359 INFO L226 Difference]: Without dead ends: 233 [2025-04-30 10:24:01,361 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1635 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1399, Invalid=3293, Unknown=0, NotChecked=0, Total=4692 [2025-04-30 10:24:01,361 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 177 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:24:01,361 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 228 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:24:01,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-04-30 10:24:01,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2025-04-30 10:24:01,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 1.103448275862069) internal successors, (256), 232 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:01,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 256 transitions. [2025-04-30 10:24:01,372 INFO L79 Accepts]: Start accepts. Automaton has 233 states and 256 transitions. Word has length 112 [2025-04-30 10:24:01,373 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:24:01,373 INFO L485 AbstractCegarLoop]: Abstraction has 233 states and 256 transitions. [2025-04-30 10:24:01,373 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 4.6) internal successors, (253), 56 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:01,373 INFO L278 IsEmpty]: Start isEmpty. Operand 233 states and 256 transitions. [2025-04-30 10:24:01,374 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-04-30 10:24:01,374 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:24:01,375 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 1, 1, 1] [2025-04-30 10:24:01,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-30 10:24:01,575 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:24:01,575 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-30 10:24:01,576 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:24:01,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1542088979, now seen corresponding path program 4 times [2025-04-30 10:24:01,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:24:01,576 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467848423] [2025-04-30 10:24:01,576 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:24:01,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:24:01,603 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 232 statements into 2 equivalence classes. [2025-04-30 10:24:01,674 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 232 of 232 statements. [2025-04-30 10:24:01,674 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:24:01,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:05,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2530 backedges. 0 proven. 2530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:05,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:24:05,044 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467848423] [2025-04-30 10:24:05,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467848423] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:24:05,044 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106603471] [2025-04-30 10:24:05,044 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:24:05,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:24:05,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:24:05,046 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:24:05,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-30 10:24:05,169 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 232 statements into 2 equivalence classes. [2025-04-30 10:24:05,254 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 232 of 232 statements. [2025-04-30 10:24:05,254 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:24:05,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:05,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 92 conjuncts are in the unsatisfiable core [2025-04-30 10:24:05,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:24:05,284 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:24:05,315 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-04-30 10:24:05,343 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:05,374 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:05,402 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:05,430 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:05,460 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:05,493 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:05,526 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:05,560 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:05,605 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:05,644 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:05,683 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:05,725 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:05,767 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:05,810 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:05,854 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:05,894 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:05,945 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:05,986 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:06,030 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:06,075 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:06,127 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-30 10:24:06,140 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-30 10:24:06,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2530 backedges. 0 proven. 2530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:06,144 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:24:07,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2530 backedges. 0 proven. 2530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:07,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106603471] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:24:07,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:24:07,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 115 [2025-04-30 10:24:07,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975803198] [2025-04-30 10:24:07,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:24:07,670 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 116 states [2025-04-30 10:24:07,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:24:07,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2025-04-30 10:24:07,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4091, Invalid=9249, Unknown=0, NotChecked=0, Total=13340 [2025-04-30 10:24:07,676 INFO L87 Difference]: Start difference. First operand 233 states and 256 transitions. Second operand has 116 states, 115 states have (on average 4.6) internal successors, (529), 116 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:08,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:24:08,647 INFO L93 Difference]: Finished difference Result 474 states and 544 transitions. [2025-04-30 10:24:08,647 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2025-04-30 10:24:08,647 INFO L79 Accepts]: Start accepts. Automaton has has 116 states, 115 states have (on average 4.6) internal successors, (529), 116 states have internal predecessors, (529), 0 states have call successors, (0), 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 232 [2025-04-30 10:24:08,648 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:24:08,649 INFO L225 Difference]: With dead ends: 474 [2025-04-30 10:24:08,649 INFO L226 Difference]: Without dead ends: 473 [2025-04-30 10:24:08,654 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7551 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=5683, Invalid=14057, Unknown=0, NotChecked=0, Total=19740 [2025-04-30 10:24:08,655 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 276 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:24:08,655 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 444 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:24:08,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-04-30 10:24:08,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2025-04-30 10:24:08,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 472 states have (on average 1.1016949152542372) internal successors, (520), 472 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:08,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 520 transitions. [2025-04-30 10:24:08,672 INFO L79 Accepts]: Start accepts. Automaton has 473 states and 520 transitions. Word has length 232 [2025-04-30 10:24:08,672 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:24:08,673 INFO L485 AbstractCegarLoop]: Abstraction has 473 states and 520 transitions. [2025-04-30 10:24:08,673 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 116 states, 115 states have (on average 4.6) internal successors, (529), 116 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:24:08,673 INFO L278 IsEmpty]: Start isEmpty. Operand 473 states and 520 transitions. [2025-04-30 10:24:08,679 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-04-30 10:24:08,679 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:24:08,679 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 47, 47, 47, 46, 1, 1, 1] [2025-04-30 10:24:08,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-30 10:24:08,880 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,SelfDestructingSolverStorable9 [2025-04-30 10:24:08,880 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-30 10:24:08,880 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:24:08,881 INFO L85 PathProgramCache]: Analyzing trace with hash -352163035, now seen corresponding path program 5 times [2025-04-30 10:24:08,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:24:08,881 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094288011] [2025-04-30 10:24:08,881 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:24:08,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:24:08,928 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 472 statements into 47 equivalence classes. [2025-04-30 10:24:09,937 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 472 of 472 statements. [2025-04-30 10:24:09,937 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-04-30 10:24:09,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:24:21,065 INFO L134 CoverageAnalysis]: Checked inductivity of 10810 backedges. 0 proven. 10810 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:24:21,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:24:21,065 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094288011] [2025-04-30 10:24:21,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094288011] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:24:21,065 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521595199] [2025-04-30 10:24:21,065 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:24:21,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:24:21,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:24:21,067 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:24:21,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-30 10:24:21,250 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 472 statements into 47 equivalence classes. Killed by 15