./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/array-memsafety/bubblesort-alloca-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/array-memsafety/bubblesort-alloca-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f9291bee30f7ea39e5694916101e0678a487b485a408acb1d18cb699e1624d3 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:00:09,895 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:00:09,944 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-04-29 11:00:09,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:00:09,949 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:00:09,970 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:00:09,971 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:00:09,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:00:09,971 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:00:09,972 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:00:09,972 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:00:09,972 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:00:09,973 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:00:09,973 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:00:09,973 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:00:09,973 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:00:09,973 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:00:09,974 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:00:09,974 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:00:09,974 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:00:09,974 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:00:09,974 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:00:09,974 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:00:09,974 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:00:09,974 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-29 11:00:09,974 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:00:09,974 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:00:09,974 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:00:09,974 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:00:09,974 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:00:09,975 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:00:09,975 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:00:09,975 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:00:09,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:00:09,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:00:09,975 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:00:09,976 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:00:09,976 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:00:09,976 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:00:09,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:00:09,976 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:00:09,976 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:00:09,976 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:00:09,976 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:00:09,976 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:00:09,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:00:09,976 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:00:09,976 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:00:09,976 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:00:09,976 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f9291bee30f7ea39e5694916101e0678a487b485a408acb1d18cb699e1624d3 [2025-04-29 11:00:10,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:00:10,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:00:10,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:00:10,213 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:00:10,213 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:00:10,214 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/bubblesort-alloca-2.c [2025-04-29 11:00:11,533 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b12825873/92181955096b492d8099640cae00c345/FLAG2b658fde0 [2025-04-29 11:00:11,725 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:00:11,726 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/bubblesort-alloca-2.c [2025-04-29 11:00:11,727 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:00:11,733 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b12825873/92181955096b492d8099640cae00c345/FLAG2b658fde0 [2025-04-29 11:00:12,535 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b12825873/92181955096b492d8099640cae00c345 [2025-04-29 11:00:12,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:00:12,537 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:00:12,538 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:00:12,538 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:00:12,540 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:00:12,541 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:00:12" (1/1) ... [2025-04-29 11:00:12,541 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@644546c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:12, skipping insertion in model container [2025-04-29 11:00:12,541 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:00:12" (1/1) ... [2025-04-29 11:00:12,551 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:00:12,671 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:00:12,678 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:00:12,696 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:00:12,704 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:00:12,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:12 WrapperNode [2025-04-29 11:00:12,705 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:00:12,706 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:00:12,706 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:00:12,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:00:12,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:12" (1/1) ... [2025-04-29 11:00:12,716 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:12" (1/1) ... [2025-04-29 11:00:12,732 INFO L138 Inliner]: procedures = 9, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 72 [2025-04-29 11:00:12,732 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:00:12,733 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:00:12,733 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:00:12,733 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:00:12,742 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:12" (1/1) ... [2025-04-29 11:00:12,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:12" (1/1) ... [2025-04-29 11:00:12,762 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:12" (1/1) ... [2025-04-29 11:00:12,780 INFO L175 MemorySlicer]: Split 7 memory accesses to 1 slices as follows [7]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2025-04-29 11:00:12,783 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:12" (1/1) ... [2025-04-29 11:00:12,783 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:12" (1/1) ... [2025-04-29 11:00:12,793 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:12" (1/1) ... [2025-04-29 11:00:12,795 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:12" (1/1) ... [2025-04-29 11:00:12,800 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:12" (1/1) ... [2025-04-29 11:00:12,801 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:12" (1/1) ... [2025-04-29 11:00:12,801 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:12" (1/1) ... [2025-04-29 11:00:12,807 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:00:12,808 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:00:12,808 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:00:12,808 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:00:12,811 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:12" (1/1) ... [2025-04-29 11:00:12,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:00:12,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:00:12,844 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:00:12,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:00:12,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:00:12,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:00:12,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:00:12,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:00:12,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 11:00:12,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:00:12,918 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:00:12,919 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:00:13,087 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-04-29 11:00:13,087 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:00:13,099 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:00:13,101 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:00:13,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:00:13 BoogieIcfgContainer [2025-04-29 11:00:13,101 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:00:13,103 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:00:13,104 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:00:13,107 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:00:13,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:00:12" (1/3) ... [2025-04-29 11:00:13,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f7b7535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:00:13, skipping insertion in model container [2025-04-29 11:00:13,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:12" (2/3) ... [2025-04-29 11:00:13,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f7b7535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:00:13, skipping insertion in model container [2025-04-29 11:00:13,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:00:13" (3/3) ... [2025-04-29 11:00:13,111 INFO L128 eAbstractionObserver]: Analyzing ICFG bubblesort-alloca-2.c [2025-04-29 11:00:13,123 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:00:13,124 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bubblesort-alloca-2.c that has 1 procedures, 41 locations, 45 edges, 1 initial locations, 3 loop locations, and 14 error locations. [2025-04-29 11:00:13,171 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:00:13,181 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;@67bbd1b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:00:13,182 INFO L341 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-04-29 11:00:13,186 INFO L278 IsEmpty]: Start isEmpty. Operand has 41 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:13,189 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:00:13,190 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:13,191 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:00:13,191 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:13,194 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:13,195 INFO L85 PathProgramCache]: Analyzing trace with hash 889508936, now seen corresponding path program 1 times [2025-04-29 11:00:13,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:13,201 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158173043] [2025-04-29 11:00:13,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:13,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:13,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:00:13,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:00:13,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:13,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:13,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:13,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:13,392 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158173043] [2025-04-29 11:00:13,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158173043] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:13,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:13,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:00:13,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414520143] [2025-04-29 11:00:13,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:13,398 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:00:13,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:13,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:00:13,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:13,413 INFO L87 Difference]: Start difference. First operand has 41 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:13,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:13,453 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2025-04-29 11:00:13,454 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:00:13,455 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-04-29 11:00:13,456 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:13,460 INFO L225 Difference]: With dead ends: 74 [2025-04-29 11:00:13,461 INFO L226 Difference]: Without dead ends: 38 [2025-04-29 11:00:13,463 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:13,465 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 113 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-29 11:00:13,466 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 113 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:13,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-04-29 11:00:13,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-04-29 11:00:13,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.75) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:13,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2025-04-29 11:00:13,495 INFO L79 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 6 [2025-04-29 11:00:13,495 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:13,495 INFO L485 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2025-04-29 11:00:13,495 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:13,495 INFO L278 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2025-04-29 11:00:13,495 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:00:13,496 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:13,496 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:00:13,496 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:00:13,497 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:13,498 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:13,498 INFO L85 PathProgramCache]: Analyzing trace with hash 889508744, now seen corresponding path program 1 times [2025-04-29 11:00:13,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:13,499 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625396487] [2025-04-29 11:00:13,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:13,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:13,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:00:13,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:00:13,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:13,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:13,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:13,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:13,584 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625396487] [2025-04-29 11:00:13,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625396487] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:13,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:13,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:00:13,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701069663] [2025-04-29 11:00:13,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:13,585 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:00:13,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:13,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:00:13,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:13,586 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:13,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:13,608 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2025-04-29 11:00:13,609 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:00:13,609 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-04-29 11:00:13,609 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:13,609 INFO L225 Difference]: With dead ends: 42 [2025-04-29 11:00:13,609 INFO L226 Difference]: Without dead ends: 40 [2025-04-29 11:00:13,610 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:13,610 INFO L437 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:13,610 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 108 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:13,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-04-29 11:00:13,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-04-29 11:00:13,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 39 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:13,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2025-04-29 11:00:13,614 INFO L79 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 6 [2025-04-29 11:00:13,614 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:13,614 INFO L485 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2025-04-29 11:00:13,614 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:13,614 INFO L278 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2025-04-29 11:00:13,614 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:00:13,614 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:13,615 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:13,615 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:00:13,615 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:13,616 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:13,617 INFO L85 PathProgramCache]: Analyzing trace with hash -593177079, now seen corresponding path program 1 times [2025-04-29 11:00:13,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:13,617 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208198834] [2025-04-29 11:00:13,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:13,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:13,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:00:13,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:00:13,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:13,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:13,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:00:13,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:13,704 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208198834] [2025-04-29 11:00:13,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208198834] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:13,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:13,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:00:13,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573538735] [2025-04-29 11:00:13,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:13,705 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:00:13,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:13,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:00:13,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:13,706 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-29 11:00:13,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:13,724 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2025-04-29 11:00:13,725 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:00:13,725 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-29 11:00:13,725 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:13,725 INFO L225 Difference]: With dead ends: 40 [2025-04-29 11:00:13,725 INFO L226 Difference]: Without dead ends: 39 [2025-04-29 11:00:13,726 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:13,726 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 3 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:13,726 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 95 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:13,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-04-29 11:00:13,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-04-29 11:00:13,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:13,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2025-04-29 11:00:13,730 INFO L79 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 9 [2025-04-29 11:00:13,730 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:13,730 INFO L485 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2025-04-29 11:00:13,730 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-29 11:00:13,731 INFO L278 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2025-04-29 11:00:13,731 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:00:13,731 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:13,731 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:13,731 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:00:13,731 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:13,732 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:13,732 INFO L85 PathProgramCache]: Analyzing trace with hash -593177271, now seen corresponding path program 1 times [2025-04-29 11:00:13,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:13,732 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910417988] [2025-04-29 11:00:13,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:13,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:13,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:00:13,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:00:13,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:13,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:13,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:13,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:13,845 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910417988] [2025-04-29 11:00:13,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910417988] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:00:13,845 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791908013] [2025-04-29 11:00:13,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:13,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:13,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:00:13,850 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:00:13,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:00:13,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:00:13,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:00:13,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:13,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:13,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:00:13,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:00:13,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:13,939 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:00:13,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791908013] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:13,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:00:13,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-04-29 11:00:13,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325074716] [2025-04-29 11:00:13,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:13,940 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:00:13,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:13,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:00:13,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:00:13,941 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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-29 11:00:13,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:13,970 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2025-04-29 11:00:13,973 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:00:13,974 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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-29 11:00:13,974 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:13,974 INFO L225 Difference]: With dead ends: 39 [2025-04-29 11:00:13,974 INFO L226 Difference]: Without dead ends: 38 [2025-04-29 11:00:13,974 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:00:13,975 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:13,975 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 164 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:13,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-04-29 11:00:13,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-04-29 11:00:13,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:13,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2025-04-29 11:00:13,978 INFO L79 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 9 [2025-04-29 11:00:13,978 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:13,979 INFO L485 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2025-04-29 11:00:13,979 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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-29 11:00:13,979 INFO L278 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2025-04-29 11:00:13,979 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:00:13,979 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:13,979 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:13,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:00:14,180 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:14,181 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:14,181 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:14,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1208620212, now seen corresponding path program 1 times [2025-04-29 11:00:14,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:14,181 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476179854] [2025-04-29 11:00:14,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:14,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:14,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:00:14,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:00:14,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:14,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:14,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:00:14,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:14,237 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476179854] [2025-04-29 11:00:14,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476179854] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:14,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:14,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:00:14,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210741440] [2025-04-29 11:00:14,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:14,237 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:00:14,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:14,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:00:14,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:14,238 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:14,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:14,274 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2025-04-29 11:00:14,274 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:00:14,274 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-29 11:00:14,275 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:14,275 INFO L225 Difference]: With dead ends: 49 [2025-04-29 11:00:14,275 INFO L226 Difference]: Without dead ends: 48 [2025-04-29 11:00:14,275 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:14,276 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:14,276 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:14,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-04-29 11:00:14,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2025-04-29 11:00:14,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 46 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:14,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2025-04-29 11:00:14,280 INFO L79 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 10 [2025-04-29 11:00:14,280 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:14,280 INFO L485 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2025-04-29 11:00:14,280 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:14,280 INFO L278 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2025-04-29 11:00:14,280 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:00:14,280 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:14,281 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:14,281 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:00:14,281 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:14,282 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:14,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1208626170, now seen corresponding path program 1 times [2025-04-29 11:00:14,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:14,282 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679932256] [2025-04-29 11:00:14,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:14,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:14,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:00:14,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:00:14,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:14,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:14,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:14,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:14,382 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679932256] [2025-04-29 11:00:14,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679932256] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:00:14,382 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410786817] [2025-04-29 11:00:14,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:14,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:14,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:00:14,384 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:00:14,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:00:14,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:00:14,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:00:14,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:14,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:14,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:00:14,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:00:14,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:14,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:00:14,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:14,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410786817] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:00:14,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:00:14,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2025-04-29 11:00:14,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482553942] [2025-04-29 11:00:14,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:00:14,499 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:00:14,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:14,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:00:14,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:00:14,500 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 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-29 11:00:14,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:14,557 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2025-04-29 11:00:14,558 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:00:14,558 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 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) Word has length 10 [2025-04-29 11:00:14,558 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:14,559 INFO L225 Difference]: With dead ends: 84 [2025-04-29 11:00:14,559 INFO L226 Difference]: Without dead ends: 54 [2025-04-29 11:00:14,559 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:00:14,560 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:14,560 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 225 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:14,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-04-29 11:00:14,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-04-29 11:00:14,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 53 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:14,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2025-04-29 11:00:14,569 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 10 [2025-04-29 11:00:14,570 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:14,570 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2025-04-29 11:00:14,570 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 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-29 11:00:14,570 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2025-04-29 11:00:14,570 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:00:14,570 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:14,570 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:14,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:00:14,771 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,SelfDestructingSolverStorable5 [2025-04-29 11:00:14,771 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:14,771 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:14,771 INFO L85 PathProgramCache]: Analyzing trace with hash -2017966838, now seen corresponding path program 1 times [2025-04-29 11:00:14,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:14,772 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193822457] [2025-04-29 11:00:14,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:14,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:14,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:00:14,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:00:14,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:14,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:14,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:00:14,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:14,800 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193822457] [2025-04-29 11:00:14,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193822457] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:14,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:14,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:00:14,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694021597] [2025-04-29 11:00:14,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:14,801 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:00:14,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:14,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:00:14,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:14,801 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:14,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:14,814 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2025-04-29 11:00:14,814 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:00:14,815 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-29 11:00:14,815 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:14,815 INFO L225 Difference]: With dead ends: 54 [2025-04-29 11:00:14,815 INFO L226 Difference]: Without dead ends: 53 [2025-04-29 11:00:14,815 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:14,816 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:14,816 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 89 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:14,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-04-29 11:00:14,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2025-04-29 11:00:14,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 40 states have (on average 1.45) internal successors, (58), 50 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:14,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2025-04-29 11:00:14,821 INFO L79 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 10 [2025-04-29 11:00:14,821 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:14,821 INFO L485 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2025-04-29 11:00:14,821 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:14,821 INFO L278 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2025-04-29 11:00:14,821 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-29 11:00:14,821 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:14,821 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:14,821 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:00:14,821 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:14,822 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:14,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1293835793, now seen corresponding path program 1 times [2025-04-29 11:00:14,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:14,822 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863923788] [2025-04-29 11:00:14,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:14,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:14,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:00:14,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:00:14,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:14,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:14,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:00:14,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:14,846 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863923788] [2025-04-29 11:00:14,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863923788] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:14,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:14,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:00:14,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447261404] [2025-04-29 11:00:14,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:14,847 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:00:14,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:14,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:00:14,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:14,847 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:14,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:14,858 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2025-04-29 11:00:14,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:00:14,858 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-04-29 11:00:14,858 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:14,859 INFO L225 Difference]: With dead ends: 51 [2025-04-29 11:00:14,859 INFO L226 Difference]: Without dead ends: 50 [2025-04-29 11:00:14,859 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:14,859 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 21 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:14,859 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 73 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:14,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-04-29 11:00:14,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-04-29 11:00:14,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.425) internal successors, (57), 49 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:14,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2025-04-29 11:00:14,862 INFO L79 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 13 [2025-04-29 11:00:14,862 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:14,863 INFO L485 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2025-04-29 11:00:14,863 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:14,863 INFO L278 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2025-04-29 11:00:14,863 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-29 11:00:14,863 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:14,863 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:14,863 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:00:14,863 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:14,864 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:14,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1293836593, now seen corresponding path program 1 times [2025-04-29 11:00:14,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:14,864 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776515762] [2025-04-29 11:00:14,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:14,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:14,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:00:14,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:00:14,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:14,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:14,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:00:14,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:14,891 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776515762] [2025-04-29 11:00:14,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776515762] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:14,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:14,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:00:14,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004455956] [2025-04-29 11:00:14,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:14,891 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:00:14,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:14,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:00:14,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:00:14,892 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:14,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:14,921 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2025-04-29 11:00:14,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:00:14,921 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-04-29 11:00:14,921 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:14,922 INFO L225 Difference]: With dead ends: 62 [2025-04-29 11:00:14,922 INFO L226 Difference]: Without dead ends: 59 [2025-04-29 11:00:14,923 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:00:14,923 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:14,924 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 44 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:14,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-04-29 11:00:14,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2025-04-29 11:00:14,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 47 states have (on average 1.446808510638298) internal successors, (68), 56 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:14,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2025-04-29 11:00:14,931 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 13 [2025-04-29 11:00:14,932 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:14,932 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2025-04-29 11:00:14,932 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:14,932 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2025-04-29 11:00:14,932 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:00:14,932 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:14,932 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:14,932 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:00:14,932 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:14,932 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:14,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1454203829, now seen corresponding path program 1 times [2025-04-29 11:00:14,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:14,933 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819740814] [2025-04-29 11:00:14,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:14,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:14,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:00:14,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:00:14,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:14,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:14,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:00:14,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:14,993 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819740814] [2025-04-29 11:00:14,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819740814] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:14,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:14,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:00:14,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513813409] [2025-04-29 11:00:14,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:14,994 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:00:14,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:14,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:00:14,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:00:14,994 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:15,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:15,026 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2025-04-29 11:00:15,026 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:00:15,027 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-29 11:00:15,027 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:15,027 INFO L225 Difference]: With dead ends: 89 [2025-04-29 11:00:15,027 INFO L226 Difference]: Without dead ends: 88 [2025-04-29 11:00:15,027 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:00:15,028 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 20 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:15,028 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 131 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:15,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-04-29 11:00:15,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2025-04-29 11:00:15,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.5) internal successors, (105), 79 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:15,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 105 transitions. [2025-04-29 11:00:15,033 INFO L79 Accepts]: Start accepts. Automaton has 80 states and 105 transitions. Word has length 14 [2025-04-29 11:00:15,033 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:15,033 INFO L485 AbstractCegarLoop]: Abstraction has 80 states and 105 transitions. [2025-04-29 11:00:15,033 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:15,033 INFO L278 IsEmpty]: Start isEmpty. Operand 80 states and 105 transitions. [2025-04-29 11:00:15,033 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:00:15,033 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:15,033 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:15,033 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:00:15,033 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:15,034 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:15,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1454228654, now seen corresponding path program 1 times [2025-04-29 11:00:15,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:15,034 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875897302] [2025-04-29 11:00:15,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:15,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:15,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:00:15,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:00:15,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:15,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:15,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:00:15,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:15,059 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875897302] [2025-04-29 11:00:15,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875897302] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:15,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:15,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:00:15,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411714087] [2025-04-29 11:00:15,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:15,060 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:00:15,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:15,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:00:15,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:00:15,060 INFO L87 Difference]: Start difference. First operand 80 states and 105 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:15,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:15,086 INFO L93 Difference]: Finished difference Result 87 states and 111 transitions. [2025-04-29 11:00:15,086 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:00:15,086 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-29 11:00:15,086 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:15,087 INFO L225 Difference]: With dead ends: 87 [2025-04-29 11:00:15,087 INFO L226 Difference]: Without dead ends: 84 [2025-04-29 11:00:15,087 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:00:15,087 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:15,087 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 47 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:15,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-04-29 11:00:15,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2025-04-29 11:00:15,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 81 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:15,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 103 transitions. [2025-04-29 11:00:15,097 INFO L79 Accepts]: Start accepts. Automaton has 82 states and 103 transitions. Word has length 14 [2025-04-29 11:00:15,097 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:15,097 INFO L485 AbstractCegarLoop]: Abstraction has 82 states and 103 transitions. [2025-04-29 11:00:15,098 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:15,098 INFO L278 IsEmpty]: Start isEmpty. Operand 82 states and 103 transitions. [2025-04-29 11:00:15,099 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:00:15,099 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:15,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:15,099 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:00:15,099 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:15,100 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:15,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1196038391, now seen corresponding path program 1 times [2025-04-29 11:00:15,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:15,101 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389355914] [2025-04-29 11:00:15,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:15,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:15,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:00:15,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:00:15,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:15,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:15,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:00:15,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:15,130 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389355914] [2025-04-29 11:00:15,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389355914] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:15,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:15,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:00:15,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386409211] [2025-04-29 11:00:15,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:15,130 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:00:15,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:15,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:00:15,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:15,131 INFO L87 Difference]: Start difference. First operand 82 states and 103 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:15,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:15,175 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2025-04-29 11:00:15,175 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:00:15,175 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-29 11:00:15,176 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:15,176 INFO L225 Difference]: With dead ends: 89 [2025-04-29 11:00:15,176 INFO L226 Difference]: Without dead ends: 88 [2025-04-29 11:00:15,176 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:15,176 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 9 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:15,177 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 67 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:15,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-04-29 11:00:15,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2025-04-29 11:00:15,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 74 states have (on average 1.4189189189189189) internal successors, (105), 83 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:15,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 105 transitions. [2025-04-29 11:00:15,180 INFO L79 Accepts]: Start accepts. Automaton has 84 states and 105 transitions. Word has length 14 [2025-04-29 11:00:15,180 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:15,180 INFO L485 AbstractCegarLoop]: Abstraction has 84 states and 105 transitions. [2025-04-29 11:00:15,181 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:15,181 INFO L278 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2025-04-29 11:00:15,181 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-29 11:00:15,181 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:15,181 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:15,181 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:00:15,181 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:15,182 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:15,182 INFO L85 PathProgramCache]: Analyzing trace with hash 409360958, now seen corresponding path program 1 times [2025-04-29 11:00:15,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:15,182 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118505875] [2025-04-29 11:00:15,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:15,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:15,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:00:15,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:00:15,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:15,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:15,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:00:15,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:15,208 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118505875] [2025-04-29 11:00:15,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118505875] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:15,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:15,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:00:15,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736883511] [2025-04-29 11:00:15,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:15,209 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:00:15,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:15,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:00:15,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:15,209 INFO L87 Difference]: Start difference. First operand 84 states and 105 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:15,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:15,234 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2025-04-29 11:00:15,234 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:00:15,234 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-29 11:00:15,234 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:15,235 INFO L225 Difference]: With dead ends: 84 [2025-04-29 11:00:15,235 INFO L226 Difference]: Without dead ends: 80 [2025-04-29 11:00:15,235 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:15,235 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:15,235 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 49 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:15,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-04-29 11:00:15,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-04-29 11:00:15,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 79 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:15,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 97 transitions. [2025-04-29 11:00:15,239 INFO L79 Accepts]: Start accepts. Automaton has 80 states and 97 transitions. Word has length 17 [2025-04-29 11:00:15,239 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:15,239 INFO L485 AbstractCegarLoop]: Abstraction has 80 states and 97 transitions. [2025-04-29 11:00:15,239 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:15,239 INFO L278 IsEmpty]: Start isEmpty. Operand 80 states and 97 transitions. [2025-04-29 11:00:15,239 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:00:15,239 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:15,239 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:15,239 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:00:15,240 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:15,240 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:15,240 INFO L85 PathProgramCache]: Analyzing trace with hash -194712106, now seen corresponding path program 1 times [2025-04-29 11:00:15,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:15,240 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892920697] [2025-04-29 11:00:15,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:15,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:15,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:00:15,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:00:15,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:15,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:15,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:00:15,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:15,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892920697] [2025-04-29 11:00:15,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892920697] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:15,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:15,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:00:15,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874017234] [2025-04-29 11:00:15,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:15,270 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:00:15,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:15,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:00:15,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:15,271 INFO L87 Difference]: Start difference. First operand 80 states and 97 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:15,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:15,301 INFO L93 Difference]: Finished difference Result 87 states and 105 transitions. [2025-04-29 11:00:15,301 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:00:15,301 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-29 11:00:15,301 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:15,302 INFO L225 Difference]: With dead ends: 87 [2025-04-29 11:00:15,302 INFO L226 Difference]: Without dead ends: 86 [2025-04-29 11:00:15,302 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:15,302 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:15,302 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 59 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:15,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-04-29 11:00:15,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-04-29 11:00:15,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 80 states have (on average 1.2875) internal successors, (103), 85 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:15,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 103 transitions. [2025-04-29 11:00:15,310 INFO L79 Accepts]: Start accepts. Automaton has 86 states and 103 transitions. Word has length 18 [2025-04-29 11:00:15,310 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:15,310 INFO L485 AbstractCegarLoop]: Abstraction has 86 states and 103 transitions. [2025-04-29 11:00:15,310 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:15,310 INFO L278 IsEmpty]: Start isEmpty. Operand 86 states and 103 transitions. [2025-04-29 11:00:15,310 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 11:00:15,311 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:15,311 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1] [2025-04-29 11:00:15,311 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:00:15,312 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:15,312 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:15,312 INFO L85 PathProgramCache]: Analyzing trace with hash -995229463, now seen corresponding path program 1 times [2025-04-29 11:00:15,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:15,312 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948424534] [2025-04-29 11:00:15,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:15,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:15,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:00:15,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:00:15,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:15,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:15,418 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:15,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:15,418 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948424534] [2025-04-29 11:00:15,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948424534] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:00:15,418 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67118554] [2025-04-29 11:00:15,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:15,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:15,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:00:15,436 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:00:15,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:00:15,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:00:15,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:00:15,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:15,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:15,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-29 11:00:15,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:00:15,523 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:15,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:00:15,650 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:15,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67118554] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:00:15,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:00:15,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-04-29 11:00:15,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860501568] [2025-04-29 11:00:15,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:00:15,652 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-29 11:00:15,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:15,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-29 11:00:15,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-04-29 11:00:15,653 INFO L87 Difference]: Start difference. First operand 86 states and 103 transitions. Second operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:15,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:15,702 INFO L93 Difference]: Finished difference Result 105 states and 133 transitions. [2025-04-29 11:00:15,702 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-29 11:00:15,703 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-29 11:00:15,703 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:15,703 INFO L225 Difference]: With dead ends: 105 [2025-04-29 11:00:15,703 INFO L226 Difference]: Without dead ends: 104 [2025-04-29 11:00:15,703 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-04-29 11:00:15,704 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:15,704 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 191 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:15,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-04-29 11:00:15,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-04-29 11:00:15,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 103 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:15,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 127 transitions. [2025-04-29 11:00:15,710 INFO L79 Accepts]: Start accepts. Automaton has 104 states and 127 transitions. Word has length 19 [2025-04-29 11:00:15,710 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:15,710 INFO L485 AbstractCegarLoop]: Abstraction has 104 states and 127 transitions. [2025-04-29 11:00:15,710 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:15,710 INFO L278 IsEmpty]: Start isEmpty. Operand 104 states and 127 transitions. [2025-04-29 11:00:15,711 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-29 11:00:15,711 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:15,711 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:15,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 11:00:15,915 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:15,915 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:15,915 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:15,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1832527689, now seen corresponding path program 1 times [2025-04-29 11:00:15,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:15,915 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814365278] [2025-04-29 11:00:15,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:15,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:15,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:00:15,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:00:15,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:15,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:15,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:00:15,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:15,935 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814365278] [2025-04-29 11:00:15,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814365278] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:15,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:15,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:00:15,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624807662] [2025-04-29 11:00:15,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:15,936 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:00:15,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:15,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:00:15,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:00:15,936 INFO L87 Difference]: Start difference. First operand 104 states and 127 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 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-29 11:00:15,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:15,953 INFO L93 Difference]: Finished difference Result 104 states and 127 transitions. [2025-04-29 11:00:15,953 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:00:15,953 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 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-29 11:00:15,953 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:15,953 INFO L225 Difference]: With dead ends: 104 [2025-04-29 11:00:15,953 INFO L226 Difference]: Without dead ends: 101 [2025-04-29 11:00:15,953 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:00:15,954 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:15,954 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 37 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:15,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-04-29 11:00:15,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-04-29 11:00:15,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 98 states have (on average 1.2346938775510203) internal successors, (121), 100 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:15,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2025-04-29 11:00:15,957 INFO L79 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 21 [2025-04-29 11:00:15,957 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:15,957 INFO L485 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2025-04-29 11:00:15,957 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 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-29 11:00:15,958 INFO L278 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2025-04-29 11:00:15,958 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-29 11:00:15,958 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:15,958 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:15,958 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:00:15,958 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:15,958 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:15,958 INFO L85 PathProgramCache]: Analyzing trace with hash 143608772, now seen corresponding path program 1 times [2025-04-29 11:00:15,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:15,958 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591703010] [2025-04-29 11:00:15,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:15,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:15,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:00:15,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:00:15,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:15,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:16,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:16,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:16,042 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591703010] [2025-04-29 11:00:16,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591703010] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:00:16,042 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466439223] [2025-04-29 11:00:16,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:16,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:16,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:00:16,045 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:00:16,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:00:16,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:00:16,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:00:16,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:16,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:16,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-29 11:00:16,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:00:16,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:16,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:00:16,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:16,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466439223] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:00:16,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:00:16,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2025-04-29 11:00:16,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689344698] [2025-04-29 11:00:16,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:00:16,174 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:00:16,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:16,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:00:16,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:00:16,174 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:16,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:16,220 INFO L93 Difference]: Finished difference Result 161 states and 192 transitions. [2025-04-29 11:00:16,220 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:00:16,221 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-29 11:00:16,221 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:16,221 INFO L225 Difference]: With dead ends: 161 [2025-04-29 11:00:16,221 INFO L226 Difference]: Without dead ends: 107 [2025-04-29 11:00:16,222 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:00:16,222 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:16,222 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:16,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-04-29 11:00:16,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-04-29 11:00:16,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 104 states have (on average 1.2211538461538463) internal successors, (127), 106 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:16,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 127 transitions. [2025-04-29 11:00:16,229 INFO L79 Accepts]: Start accepts. Automaton has 107 states and 127 transitions. Word has length 21 [2025-04-29 11:00:16,229 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:16,229 INFO L485 AbstractCegarLoop]: Abstraction has 107 states and 127 transitions. [2025-04-29 11:00:16,229 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:16,229 INFO L278 IsEmpty]: Start isEmpty. Operand 107 states and 127 transitions. [2025-04-29 11:00:16,230 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:00:16,230 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:16,230 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:16,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-29 11:00:16,430 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-29 11:00:16,430 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:16,431 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:16,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1065099679, now seen corresponding path program 2 times [2025-04-29 11:00:16,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:16,431 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190362157] [2025-04-29 11:00:16,431 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:00:16,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:16,436 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-29 11:00:16,438 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 24 statements. [2025-04-29 11:00:16,438 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:00:16,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:16,466 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 11:00:16,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:16,466 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190362157] [2025-04-29 11:00:16,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190362157] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:16,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:16,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:00:16,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66080084] [2025-04-29 11:00:16,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:16,467 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:00:16,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:16,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:00:16,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:00:16,467 INFO L87 Difference]: Start difference. First operand 107 states and 127 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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-29 11:00:16,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:16,491 INFO L93 Difference]: Finished difference Result 107 states and 127 transitions. [2025-04-29 11:00:16,491 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:00:16,491 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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 24 [2025-04-29 11:00:16,492 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:16,492 INFO L225 Difference]: With dead ends: 107 [2025-04-29 11:00:16,492 INFO L226 Difference]: Without dead ends: 106 [2025-04-29 11:00:16,492 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:00:16,493 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 7 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:16,493 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 69 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:16,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-04-29 11:00:16,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 75. [2025-04-29 11:00:16,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 73 states have (on average 1.2328767123287672) internal successors, (90), 74 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:16,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2025-04-29 11:00:16,496 INFO L79 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 24 [2025-04-29 11:00:16,496 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:16,496 INFO L485 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2025-04-29 11:00:16,496 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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-29 11:00:16,496 INFO L278 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2025-04-29 11:00:16,496 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:00:16,496 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:16,496 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:16,496 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:00:16,497 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:16,497 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:16,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1528583894, now seen corresponding path program 1 times [2025-04-29 11:00:16,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:16,498 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83939291] [2025-04-29 11:00:16,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:16,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:16,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:00:16,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:00:16,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:16,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:16,553 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:00:16,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:16,554 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83939291] [2025-04-29 11:00:16,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83939291] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:00:16,554 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606723866] [2025-04-29 11:00:16,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:16,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:16,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:00:16,556 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:00:16,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 11:00:16,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:00:16,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:00:16,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:16,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:16,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-29 11:00:16,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:00:16,716 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:16,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:00:16,811 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:16,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606723866] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:00:16,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:00:16,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12, 12] total 19 [2025-04-29 11:00:16,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364897202] [2025-04-29 11:00:16,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:00:16,812 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-29 11:00:16,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:16,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-29 11:00:16,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2025-04-29 11:00:16,813 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:16,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:16,971 INFO L93 Difference]: Finished difference Result 127 states and 152 transitions. [2025-04-29 11:00:16,971 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-29 11:00:16,972 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-29 11:00:16,972 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:16,972 INFO L225 Difference]: With dead ends: 127 [2025-04-29 11:00:16,972 INFO L226 Difference]: Without dead ends: 101 [2025-04-29 11:00:16,973 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 35 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2025-04-29 11:00:16,973 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 30 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:16,973 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 140 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:00:16,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-04-29 11:00:16,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2025-04-29 11:00:16,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 98 states have (on average 1.2142857142857142) internal successors, (119), 99 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:16,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2025-04-29 11:00:16,977 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 28 [2025-04-29 11:00:16,977 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:16,977 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2025-04-29 11:00:16,977 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:16,977 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2025-04-29 11:00:16,978 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-29 11:00:16,978 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:16,978 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:16,984 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-29 11:00:17,178 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:17,179 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:17,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:17,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1006231115, now seen corresponding path program 1 times [2025-04-29 11:00:17,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:17,179 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513850020] [2025-04-29 11:00:17,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:17,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:17,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:00:17,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:00:17,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:17,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:17,240 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-29 11:00:17,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:17,240 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513850020] [2025-04-29 11:00:17,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513850020] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:17,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:17,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:00:17,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826070440] [2025-04-29 11:00:17,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:17,241 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:00:17,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:17,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:00:17,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:00:17,241 INFO L87 Difference]: Start difference. First operand 100 states and 119 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:17,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:17,278 INFO L93 Difference]: Finished difference Result 141 states and 166 transitions. [2025-04-29 11:00:17,279 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:00:17,279 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-29 11:00:17,279 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:17,279 INFO L225 Difference]: With dead ends: 141 [2025-04-29 11:00:17,279 INFO L226 Difference]: Without dead ends: 92 [2025-04-29 11:00:17,280 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:00:17,280 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 9 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:17,280 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 79 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:17,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-04-29 11:00:17,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-04-29 11:00:17,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 91 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:17,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 107 transitions. [2025-04-29 11:00:17,283 INFO L79 Accepts]: Start accepts. Automaton has 92 states and 107 transitions. Word has length 36 [2025-04-29 11:00:17,283 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:17,283 INFO L485 AbstractCegarLoop]: Abstraction has 92 states and 107 transitions. [2025-04-29 11:00:17,283 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:17,284 INFO L278 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2025-04-29 11:00:17,284 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-29 11:00:17,284 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:17,284 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1] [2025-04-29 11:00:17,284 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-29 11:00:17,284 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:17,284 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:17,284 INFO L85 PathProgramCache]: Analyzing trace with hash 337255241, now seen corresponding path program 2 times [2025-04-29 11:00:17,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:17,284 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646001832] [2025-04-29 11:00:17,284 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:00:17,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:17,291 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-29 11:00:17,293 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 37 statements. [2025-04-29 11:00:17,293 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:00:17,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:17,307 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-29 11:00:17,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:17,307 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646001832] [2025-04-29 11:00:17,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646001832] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:00:17,307 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535368460] [2025-04-29 11:00:17,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:00:17,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:17,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:00:17,309 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:00:17,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 11:00:17,344 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-29 11:00:17,347 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 37 statements. [2025-04-29 11:00:17,348 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:00:17,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:17,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:00:17,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:00:17,381 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-29 11:00:17,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:00:17,414 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-29 11:00:17,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535368460] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:00:17,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:00:17,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-04-29 11:00:17,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412546032] [2025-04-29 11:00:17,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:00:17,415 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:00:17,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:17,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:00:17,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:17,416 INFO L87 Difference]: Start difference. First operand 92 states and 107 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:17,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:17,429 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2025-04-29 11:00:17,429 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:00:17,429 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 37 [2025-04-29 11:00:17,429 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:17,429 INFO L225 Difference]: With dead ends: 92 [2025-04-29 11:00:17,429 INFO L226 Difference]: Without dead ends: 91 [2025-04-29 11:00:17,430 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:00:17,430 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:17,430 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:17,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-04-29 11:00:17,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 68. [2025-04-29 11:00:17,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 67 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:17,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2025-04-29 11:00:17,433 INFO L79 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 37 [2025-04-29 11:00:17,433 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:17,433 INFO L485 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2025-04-29 11:00:17,433 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:17,433 INFO L278 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2025-04-29 11:00:17,433 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-29 11:00:17,433 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:17,433 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:17,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-29 11:00:17,634 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:17,634 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:17,635 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:17,635 INFO L85 PathProgramCache]: Analyzing trace with hash 2037096212, now seen corresponding path program 2 times [2025-04-29 11:00:17,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:17,635 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32078331] [2025-04-29 11:00:17,635 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:00:17,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:17,640 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-29 11:00:17,643 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 38 statements. [2025-04-29 11:00:17,643 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:00:17,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:17,678 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-29 11:00:17,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:17,678 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32078331] [2025-04-29 11:00:17,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32078331] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:00:17,678 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054801123] [2025-04-29 11:00:17,679 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:00:17,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:17,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:00:17,680 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:00:17,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-29 11:00:17,715 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-29 11:00:17,720 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 38 statements. [2025-04-29 11:00:17,720 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:00:17,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:17,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-29 11:00:17,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:00:17,761 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-29 11:00:17,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:00:17,805 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-29 11:00:17,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054801123] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:00:17,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:00:17,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-04-29 11:00:17,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61663887] [2025-04-29 11:00:17,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:00:17,806 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:00:17,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:17,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:00:17,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:00:17,806 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 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-29 11:00:17,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:17,869 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2025-04-29 11:00:17,869 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:00:17,869 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 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) Word has length 38 [2025-04-29 11:00:17,869 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:17,870 INFO L225 Difference]: With dead ends: 103 [2025-04-29 11:00:17,870 INFO L226 Difference]: Without dead ends: 102 [2025-04-29 11:00:17,870 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 71 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:00:17,871 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 16 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:17,871 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 49 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:17,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-04-29 11:00:17,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 81. [2025-04-29 11:00:17,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.1375) internal successors, (91), 80 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:17,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2025-04-29 11:00:17,874 INFO L79 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 38 [2025-04-29 11:00:17,874 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:17,874 INFO L485 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2025-04-29 11:00:17,875 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 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-29 11:00:17,875 INFO L278 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2025-04-29 11:00:17,875 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-29 11:00:17,875 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:17,875 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:17,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-29 11:00:18,075 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:18,076 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:18,076 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:18,076 INFO L85 PathProgramCache]: Analyzing trace with hash -2108411895, now seen corresponding path program 1 times [2025-04-29 11:00:18,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:18,076 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967835777] [2025-04-29 11:00:18,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:18,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:18,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:00:18,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:00:18,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:18,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:18,211 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-29 11:00:18,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:18,211 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967835777] [2025-04-29 11:00:18,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967835777] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:00:18,211 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419702732] [2025-04-29 11:00:18,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:18,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:18,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:00:18,214 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:00:18,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-29 11:00:18,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:00:18,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:00:18,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:18,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:18,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-29 11:00:18,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:00:18,305 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-29 11:00:18,305 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:00:18,383 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-29 11:00:18,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419702732] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:00:18,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:00:18,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 16 [2025-04-29 11:00:18,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453192452] [2025-04-29 11:00:18,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:00:18,384 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-29 11:00:18,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:18,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-29 11:00:18,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:00:18,385 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:18,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:18,452 INFO L93 Difference]: Finished difference Result 122 states and 137 transitions. [2025-04-29 11:00:18,452 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:00:18,452 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-04-29 11:00:18,452 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:18,453 INFO L225 Difference]: With dead ends: 122 [2025-04-29 11:00:18,453 INFO L226 Difference]: Without dead ends: 66 [2025-04-29 11:00:18,453 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 80 SyntacticMatches, 9 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:00:18,453 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:18,453 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 154 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:00:18,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-04-29 11:00:18,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-04-29 11:00:18,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 65 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:18,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2025-04-29 11:00:18,456 INFO L79 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 46 [2025-04-29 11:00:18,456 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:18,456 INFO L485 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2025-04-29 11:00:18,456 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:18,456 INFO L278 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2025-04-29 11:00:18,456 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-04-29 11:00:18,456 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:18,457 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:18,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-29 11:00:18,657 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-29 11:00:18,657 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:18,658 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:18,658 INFO L85 PathProgramCache]: Analyzing trace with hash 335222414, now seen corresponding path program 2 times [2025-04-29 11:00:18,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:18,658 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813910964] [2025-04-29 11:00:18,658 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:00:18,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:18,663 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-04-29 11:00:18,669 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:00:18,669 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:00:18,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:18,799 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 26 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-29 11:00:18,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:18,799 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813910964] [2025-04-29 11:00:18,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813910964] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:00:18,799 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466282074] [2025-04-29 11:00:18,799 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:00:18,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:18,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:00:18,801 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:00:18,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-29 11:00:18,836 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-04-29 11:00:18,850 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:00:18,850 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:00:18,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:18,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-29 11:00:18,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:00:18,929 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 30 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-29 11:00:18,929 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:00:19,012 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 30 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-29 11:00:19,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466282074] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:00:19,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:00:19,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2025-04-29 11:00:19,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331126322] [2025-04-29 11:00:19,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:00:19,013 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-29 11:00:19,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:19,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-29 11:00:19,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:00:19,013 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:19,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:19,157 INFO L93 Difference]: Finished difference Result 122 states and 138 transitions. [2025-04-29 11:00:19,157 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-29 11:00:19,157 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2025-04-29 11:00:19,157 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:19,158 INFO L225 Difference]: With dead ends: 122 [2025-04-29 11:00:19,158 INFO L226 Difference]: Without dead ends: 85 [2025-04-29 11:00:19,158 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 83 SyntacticMatches, 10 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2025-04-29 11:00:19,159 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 48 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:19,159 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 88 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:00:19,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-04-29 11:00:19,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2025-04-29 11:00:19,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.131578947368421) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:19,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2025-04-29 11:00:19,163 INFO L79 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 49 [2025-04-29 11:00:19,163 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:19,163 INFO L485 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2025-04-29 11:00:19,163 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:19,163 INFO L278 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2025-04-29 11:00:19,163 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-29 11:00:19,164 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:19,164 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:19,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-29 11:00:19,368 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-04-29 11:00:19,368 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-04-29 11:00:19,368 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:19,368 INFO L85 PathProgramCache]: Analyzing trace with hash -261734541, now seen corresponding path program 3 times [2025-04-29 11:00:19,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:19,369 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357002252] [2025-04-29 11:00:19,369 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:00:19,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:19,375 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 4 equivalence classes. [2025-04-29 11:00:19,379 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 56 statements. [2025-04-29 11:00:19,379 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-29 11:00:19,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:19,440 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 34 proven. 24 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-29 11:00:19,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:19,441 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357002252] [2025-04-29 11:00:19,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357002252] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:00:19,441 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823720417] [2025-04-29 11:00:19,441 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:00:19,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:19,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:00:19,443 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:00:19,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-29 11:00:19,481 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 4 equivalence classes. [2025-04-29 11:00:19,491 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 56 statements. [2025-04-29 11:00:19,491 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-29 11:00:19,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:19,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-29 11:00:19,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:00:19,546 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 34 proven. 24 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-29 11:00:19,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:00:19,640 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 34 proven. 24 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-29 11:00:19,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823720417] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:00:19,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:00:19,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-04-29 11:00:19,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051650067] [2025-04-29 11:00:19,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:00:19,641 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-29 11:00:19,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:19,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-29 11:00:19,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:00:19,641 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:19,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:19,825 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2025-04-29 11:00:19,826 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:00:19,826 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-04-29 11:00:19,826 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:19,826 INFO L225 Difference]: With dead ends: 77 [2025-04-29 11:00:19,826 INFO L226 Difference]: Without dead ends: 0 [2025-04-29 11:00:19,826 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2025-04-29 11:00:19,827 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 36 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:19,827 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 78 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:00:19,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-29 11:00:19,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-29 11:00:19,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:19,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-29 11:00:19,827 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2025-04-29 11:00:19,827 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:19,827 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-29 11:00:19,827 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:19,827 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-29 11:00:19,828 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-29 11:00:19,829 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2025-04-29 11:00:19,831 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2025-04-29 11:00:19,831 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2025-04-29 11:00:19,831 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2025-04-29 11:00:19,831 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2025-04-29 11:00:19,831 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2025-04-29 11:00:19,831 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2025-04-29 11:00:19,831 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2025-04-29 11:00:19,832 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2025-04-29 11:00:19,832 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2025-04-29 11:00:19,832 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2025-04-29 11:00:19,832 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2025-04-29 11:00:19,832 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2025-04-29 11:00:19,832 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2025-04-29 11:00:19,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-29 11:00:20,036 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-04-29 11:00:20,038 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:20,040 INFO L312 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-04-29 11:00:20,155 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:00:20,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:00:20 BoogieIcfgContainer [2025-04-29 11:00:20,173 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:00:20,173 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:00:20,173 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:00:20,174 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:00:20,174 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:00:13" (3/4) ... [2025-04-29 11:00:20,176 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 11:00:20,183 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-04-29 11:00:20,183 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-04-29 11:00:20,183 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-29 11:00:20,183 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-04-29 11:00:20,247 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:00:20,248 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:00:20,248 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:00:20,248 INFO L158 Benchmark]: Toolchain (without parser) took 7710.96ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 100.1MB in the end (delta: 23.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2025-04-29 11:00:20,248 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:00:20,248 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.59ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 109.8MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:00:20,248 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.53ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 108.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:00:20,248 INFO L158 Benchmark]: Boogie Preprocessor took 74.46ms. Allocated memory is still 167.8MB. Free memory was 108.4MB in the beginning and 106.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:00:20,248 INFO L158 Benchmark]: RCFGBuilder took 293.53ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 94.0MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:00:20,249 INFO L158 Benchmark]: TraceAbstraction took 7069.70ms. Allocated memory is still 167.8MB. Free memory was 93.1MB in the beginning and 106.7MB in the end (delta: -13.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:00:20,249 INFO L158 Benchmark]: Witness Printer took 74.32ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 100.1MB in the end (delta: 6.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:00:20,249 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 167.59ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 109.8MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.53ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 108.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 74.46ms. Allocated memory is still 167.8MB. Free memory was 108.4MB in the beginning and 106.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 293.53ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 94.0MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7069.70ms. Allocated memory is still 167.8MB. Free memory was 93.1MB in the beginning and 106.7MB in the end (delta: -13.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 74.32ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 100.1MB in the end (delta: 6.6MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 9]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 9]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 12]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 12]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 10]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 10]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 9]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 9]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 41 locations, 45 edges, 14 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 25, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 248 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 248 mSDsluCounter, 2444 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1838 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1796 IncrementalHoareTripleChecker+Invalid, 1823 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 606 mSDtfsCounter, 1796 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 745 GetRequests, 541 SyntacticMatches, 37 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=17, InterpolantAutomatonStates: 183, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 103 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 851 NumberOfCodeBlocks, 678 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1111 ConstructedInterpolants, 0 QuantifiedInterpolants, 2735 SizeOfPredicates, 16 NumberOfNonLiveVariables, 851 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 44 InterpolantComputations, 16 PerfectInterpolantSequences, 1050/1382 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((((((k == 1) && (array_size <= 2147483647)) && (1 <= array_size)) || (((2 <= k) && (array_size <= 2147483647)) && (3 <= array_size))) || (((array_size <= 2147483647) && (k == 0)) && (1 <= array_size))) || (((array_size <= 2147483647) && (2 == k)) && (1 <= array_size))) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: (((((2 <= i) && (1 <= j)) && (j <= 2147483647)) && (i <= 2147483646)) || ((((i <= 2147483645) && (0 <= i)) && (j <= 2147483646)) && (1 <= j))) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: ((i == 2147483646) || (i < 2147483646)) RESULT: Ultimate proved your program to be correct! [2025-04-29 11:00:20,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE