./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/loop-zilu/benchmark23_conjunctive.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/loop-zilu/benchmark23_conjunctive.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 61ef2f8a78b1c2af8ddc8defea2954950b17db5e561108fd4a8b6f210c384bc2 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:03:00,119 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:03:00,163 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-04-29 11:03:00,170 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:03:00,170 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:03:00,190 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:03:00,192 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:03:00,192 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:03:00,192 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:03:00,193 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:03:00,193 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:03:00,193 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:03:00,193 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:03:00,193 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:03:00,193 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:03:00,193 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:03:00,193 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:03:00,193 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:03:00,194 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:03:00,194 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:03:00,194 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:03:00,194 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:03:00,194 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:03:00,194 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:03:00,194 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-29 11:03:00,194 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:03:00,194 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:03:00,194 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:03:00,194 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:03:00,195 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:03:00,195 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:03:00,195 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:03:00,195 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:03:00,195 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:03:00,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:03:00,196 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:03:00,196 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:03:00,196 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:03:00,196 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:03:00,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:03:00,196 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:03:00,196 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:03:00,196 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:03:00,196 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:03:00,196 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:03:00,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:03:00,197 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:03:00,197 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:03:00,197 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:03:00,197 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 -> 61ef2f8a78b1c2af8ddc8defea2954950b17db5e561108fd4a8b6f210c384bc2 [2025-04-29 11:03:00,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:03:00,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:03:00,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:03:00,444 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:03:00,445 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:03:00,446 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark23_conjunctive.c [2025-04-29 11:03:01,784 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5cedb07a/c65795e009ad458393e4e3e4fb25d02e/FLAG7a0943e24 [2025-04-29 11:03:01,972 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:03:01,972 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark23_conjunctive.c [2025-04-29 11:03:01,973 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:03:01,977 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5cedb07a/c65795e009ad458393e4e3e4fb25d02e/FLAG7a0943e24 [2025-04-29 11:03:02,785 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5cedb07a/c65795e009ad458393e4e3e4fb25d02e [2025-04-29 11:03:02,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:03:02,788 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:03:02,789 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:03:02,789 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:03:02,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:03:02,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:03:02" (1/1) ... [2025-04-29 11:03:02,793 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76e6c16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:03:02, skipping insertion in model container [2025-04-29 11:03:02,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:03:02" (1/1) ... [2025-04-29 11:03:02,801 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:03:02,927 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:03:02,930 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:03:02,949 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:03:02,958 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:03:02,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:03:02 WrapperNode [2025-04-29 11:03:02,959 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:03:02,960 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:03:02,960 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:03:02,960 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:03:02,964 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:03:02" (1/1) ... [2025-04-29 11:03:02,968 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:03:02" (1/1) ... [2025-04-29 11:03:02,981 INFO L138 Inliner]: procedures = 7, calls = 4, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 29 [2025-04-29 11:03:02,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:03:02,981 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:03:02,981 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:03:02,982 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:03:02,986 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:03:02" (1/1) ... [2025-04-29 11:03:02,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:03:02" (1/1) ... [2025-04-29 11:03:02,987 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:03:02" (1/1) ... [2025-04-29 11:03:02,993 INFO L175 MemorySlicer]: No memory access in input program. [2025-04-29 11:03:02,993 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:03:02" (1/1) ... [2025-04-29 11:03:02,993 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:03:02" (1/1) ... [2025-04-29 11:03:02,994 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:03:02" (1/1) ... [2025-04-29 11:03:02,994 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:03:02" (1/1) ... [2025-04-29 11:03:02,997 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:03:02" (1/1) ... [2025-04-29 11:03:02,997 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:03:02" (1/1) ... [2025-04-29 11:03:02,998 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:03:02" (1/1) ... [2025-04-29 11:03:02,999 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:03:03,000 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:03:03,000 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:03:03,000 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:03:03,001 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:03:02" (1/1) ... [2025-04-29 11:03:03,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:03:03,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:03:03,023 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:03:03,026 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:03:03,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:03:03,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:03:03,078 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:03:03,079 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:03:03,163 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-04-29 11:03:03,163 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:03:03,172 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:03:03,172 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:03:03,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:03:03 BoogieIcfgContainer [2025-04-29 11:03:03,172 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:03:03,174 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:03:03,174 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:03:03,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:03:03,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:03:02" (1/3) ... [2025-04-29 11:03:03,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fcef094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:03:03, skipping insertion in model container [2025-04-29 11:03:03,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:03:02" (2/3) ... [2025-04-29 11:03:03,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fcef094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:03:03, skipping insertion in model container [2025-04-29 11:03:03,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:03:03" (3/3) ... [2025-04-29 11:03:03,179 INFO L128 eAbstractionObserver]: Analyzing ICFG benchmark23_conjunctive.c [2025-04-29 11:03:03,188 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:03:03,190 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG benchmark23_conjunctive.c that has 1 procedures, 18 locations, 20 edges, 1 initial locations, 1 loop locations, and 4 error locations. [2025-04-29 11:03:03,230 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:03:03,241 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;@4e5eea9e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:03:03,242 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-29 11:03:03,245 INFO L278 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:03:03,249 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-29 11:03:03,250 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:03:03,250 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-29 11:03:03,250 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-29 11:03:03,254 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:03:03,254 INFO L85 PathProgramCache]: Analyzing trace with hash 28695813, now seen corresponding path program 1 times [2025-04-29 11:03:03,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:03:03,260 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087989573] [2025-04-29 11:03:03,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:03:03,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:03:03,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-29 11:03:03,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-29 11:03:03,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:03:03,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:03,375 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:03:03,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:03:03,375 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087989573] [2025-04-29 11:03:03,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087989573] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:03:03,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:03:03,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:03:03,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29145660] [2025-04-29 11:03:03,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:03:03,382 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:03:03,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:03:03,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:03:03,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:03:03,397 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:03:03,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:03:03,429 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2025-04-29 11:03:03,430 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:03:03,431 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2025-04-29 11:03:03,431 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:03:03,435 INFO L225 Difference]: With dead ends: 22 [2025-04-29 11:03:03,435 INFO L226 Difference]: Without dead ends: 11 [2025-04-29 11:03:03,436 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:03:03,438 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:03:03,439 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 15 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:03:03,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-04-29 11:03:03,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-04-29 11:03:03,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 1.375) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:03:03,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-04-29 11:03:03,461 INFO L79 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 5 [2025-04-29 11:03:03,462 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:03:03,462 INFO L485 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-04-29 11:03:03,462 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:03:03,462 INFO L278 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-04-29 11:03:03,462 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:03:03,462 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:03:03,462 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:03:03,463 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:03:03,463 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-29 11:03:03,463 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:03:03,463 INFO L85 PathProgramCache]: Analyzing trace with hash 889570248, now seen corresponding path program 1 times [2025-04-29 11:03:03,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:03:03,464 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722249947] [2025-04-29 11:03:03,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:03:03,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:03:03,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:03:03,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:03:03,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:03:03,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:03,487 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:03:03,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:03:03,487 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722249947] [2025-04-29 11:03:03,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722249947] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:03:03,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:03:03,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:03:03,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972229970] [2025-04-29 11:03:03,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:03:03,488 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:03:03,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:03:03,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:03:03,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:03:03,489 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:03:03,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:03:03,499 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2025-04-29 11:03:03,499 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:03:03,499 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-04-29 11:03:03,499 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:03:03,500 INFO L225 Difference]: With dead ends: 15 [2025-04-29 11:03:03,500 INFO L226 Difference]: Without dead ends: 14 [2025-04-29 11:03:03,500 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:03:03,500 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:03:03,501 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:03:03,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-04-29 11:03:03,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-04-29 11:03:03,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 13 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:03:03,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2025-04-29 11:03:03,503 INFO L79 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 6 [2025-04-29 11:03:03,503 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:03:03,504 INFO L485 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2025-04-29 11:03:03,504 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:03:03,504 INFO L278 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2025-04-29 11:03:03,504 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:03:03,504 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:03:03,504 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:03:03,504 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:03:03,504 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-29 11:03:03,505 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:03:03,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1806873959, now seen corresponding path program 1 times [2025-04-29 11:03:03,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:03:03,505 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535297520] [2025-04-29 11:03:03,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:03:03,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:03:03,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:03:03,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:03:03,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:03:03,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:03,542 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:03:03,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:03:03,543 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535297520] [2025-04-29 11:03:03,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535297520] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:03:03,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:03:03,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:03:03,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825257803] [2025-04-29 11:03:03,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:03:03,544 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:03:03,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:03:03,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:03:03,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:03:03,544 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:03:03,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:03:03,565 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-04-29 11:03:03,566 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:03:03,566 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-29 11:03:03,566 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:03:03,566 INFO L225 Difference]: With dead ends: 14 [2025-04-29 11:03:03,566 INFO L226 Difference]: Without dead ends: 13 [2025-04-29 11:03:03,567 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:03:03,567 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 10 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:03:03,568 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 10 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:03:03,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-04-29 11:03:03,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-04-29 11:03:03,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 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:03:03,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2025-04-29 11:03:03,570 INFO L79 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 7 [2025-04-29 11:03:03,570 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:03:03,570 INFO L485 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2025-04-29 11:03:03,570 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:03:03,571 INFO L278 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2025-04-29 11:03:03,571 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-29 11:03:03,571 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:03:03,571 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:03:03,571 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:03:03,571 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-29 11:03:03,572 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:03:03,572 INFO L85 PathProgramCache]: Analyzing trace with hash 178517930, now seen corresponding path program 1 times [2025-04-29 11:03:03,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:03:03,572 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763970426] [2025-04-29 11:03:03,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:03:03,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:03:03,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:03:03,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:03:03,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:03:03,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:03,615 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:03:03,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:03:03,615 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763970426] [2025-04-29 11:03:03,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763970426] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:03:03,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:03:03,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:03:03,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308996448] [2025-04-29 11:03:03,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:03:03,616 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:03:03,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:03:03,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:03:03,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:03:03,617 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:03:03,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:03:03,633 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2025-04-29 11:03:03,634 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:03:03,634 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-04-29 11:03:03,634 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:03:03,634 INFO L225 Difference]: With dead ends: 16 [2025-04-29 11:03:03,634 INFO L226 Difference]: Without dead ends: 15 [2025-04-29 11:03:03,635 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:03:03,635 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 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:03:03,635 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:03:03,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-04-29 11:03:03,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-04-29 11:03:03,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:03:03,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2025-04-29 11:03:03,638 INFO L79 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2025-04-29 11:03:03,638 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:03:03,638 INFO L485 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2025-04-29 11:03:03,638 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:03:03,638 INFO L278 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2025-04-29 11:03:03,638 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-29 11:03:03,639 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:03:03,639 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:03:03,639 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:03:03,639 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-29 11:03:03,639 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:03:03,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1058180961, now seen corresponding path program 1 times [2025-04-29 11:03:03,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:03:03,640 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277414409] [2025-04-29 11:03:03,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:03:03,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:03:03,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:03:03,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:03:03,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:03:03,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:03,683 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:03:03,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:03:03,683 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277414409] [2025-04-29 11:03:03,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277414409] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:03:03,683 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972026266] [2025-04-29 11:03:03,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:03:03,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:03:03,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:03:03,686 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:03:03,688 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:03:03,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:03:03,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:03:03,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:03:03,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:03,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 11:03:03,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:03:03,752 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:03:03,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:03:03,784 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:03:03,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972026266] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:03:03,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:03:03,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-29 11:03:03,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064011866] [2025-04-29 11:03:03,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:03:03,785 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:03:03,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:03:03,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:03:03,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:03:03,786 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:03:03,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:03:03,811 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2025-04-29 11:03:03,812 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:03:03,812 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-29 11:03:03,812 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:03:03,812 INFO L225 Difference]: With dead ends: 31 [2025-04-29 11:03:03,812 INFO L226 Difference]: Without dead ends: 30 [2025-04-29 11:03:03,813 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:03:03,813 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 5 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:03:03,813 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 25 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:03:03,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-04-29 11:03:03,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2025-04-29 11:03:03,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 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:03:03,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2025-04-29 11:03:03,817 INFO L79 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 11 [2025-04-29 11:03:03,817 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:03:03,817 INFO L485 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2025-04-29 11:03:03,817 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:03:03,818 INFO L278 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2025-04-29 11:03:03,818 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-29 11:03:03,818 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:03:03,818 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-04-29 11:03:03,823 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:03:04,020 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:03:04,020 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-29 11:03:04,020 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:03:04,020 INFO L85 PathProgramCache]: Analyzing trace with hash -995344125, now seen corresponding path program 1 times [2025-04-29 11:03:04,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:03:04,020 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109418641] [2025-04-29 11:03:04,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:03:04,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:03:04,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:03:04,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:03:04,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:03:04,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:04,052 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:03:04,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:03:04,052 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109418641] [2025-04-29 11:03:04,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109418641] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:03:04,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:03:04,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:03:04,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846275005] [2025-04-29 11:03:04,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:03:04,053 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:03:04,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:03:04,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:03:04,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:03:04,054 INFO L87 Difference]: Start difference. First operand 28 states and 30 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:03:04,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:03:04,066 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2025-04-29 11:03:04,066 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:03:04,066 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:03:04,066 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:03:04,068 INFO L225 Difference]: With dead ends: 28 [2025-04-29 11:03:04,068 INFO L226 Difference]: Without dead ends: 27 [2025-04-29 11:03:04,069 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:03:04,069 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 1 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:03:04,069 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 10 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:03:04,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-04-29 11:03:04,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-04-29 11:03:04,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 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:03:04,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2025-04-29 11:03:04,077 INFO L79 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 13 [2025-04-29 11:03:04,077 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:03:04,077 INFO L485 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2025-04-29 11:03:04,077 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:03:04,077 INFO L278 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2025-04-29 11:03:04,078 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:03:04,078 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:03:04,078 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1] [2025-04-29 11:03:04,078 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:03:04,079 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-29 11:03:04,079 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:03:04,080 INFO L85 PathProgramCache]: Analyzing trace with hash -496145656, now seen corresponding path program 2 times [2025-04-29 11:03:04,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:03:04,080 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095570619] [2025-04-29 11:03:04,080 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:03:04,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:03:04,086 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-29 11:03:04,109 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:03:04,111 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:03:04,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:04,225 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:04,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:03:04,225 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095570619] [2025-04-29 11:03:04,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095570619] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:03:04,225 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314917808] [2025-04-29 11:03:04,225 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:03:04,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:03:04,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:03:04,228 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:03:04,229 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:03:04,247 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-29 11:03:04,255 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:03:04,255 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:03:04,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:04,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 11:03:04,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:03:04,293 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:04,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:03:04,369 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:04,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314917808] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:03:04,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:03:04,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-29 11:03:04,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941003178] [2025-04-29 11:03:04,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:03:04,371 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:03:04,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:03:04,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:03:04,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:03:04,372 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:03:04,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:03:04,404 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2025-04-29 11:03:04,404 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:03:04,405 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-29 11:03:04,405 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:03:04,405 INFO L225 Difference]: With dead ends: 58 [2025-04-29 11:03:04,405 INFO L226 Difference]: Without dead ends: 57 [2025-04-29 11:03:04,406 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:03:04,406 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:03:04,406 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 38 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:03:04,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-04-29 11:03:04,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-04-29 11:03:04,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 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:03:04,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2025-04-29 11:03:04,411 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 26 [2025-04-29 11:03:04,411 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:03:04,411 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2025-04-29 11:03:04,412 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:03:04,412 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2025-04-29 11:03:04,413 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-29 11:03:04,413 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:03:04,413 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1] [2025-04-29 11:03:04,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 11:03:04,614 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-04-29 11:03:04,614 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-29 11:03:04,614 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:03:04,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1607281128, now seen corresponding path program 3 times [2025-04-29 11:03:04,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:03:04,615 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292609330] [2025-04-29 11:03:04,615 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:03:04,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:03:04,625 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 11 equivalence classes. [2025-04-29 11:03:04,637 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 56 of 56 statements. [2025-04-29 11:03:04,637 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-29 11:03:04,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:04,814 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:04,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:03:04,815 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292609330] [2025-04-29 11:03:04,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292609330] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:03:04,816 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104407992] [2025-04-29 11:03:04,816 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:03:04,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:03:04,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:03:04,818 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:03:04,820 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:03:04,842 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 11 equivalence classes. [2025-04-29 11:03:04,858 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 56 of 56 statements. [2025-04-29 11:03:04,859 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-29 11:03:04,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:04,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-29 11:03:04,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:03:04,953 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:04,953 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:03:05,184 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:05,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104407992] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:03:05,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:03:05,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-04-29 11:03:05,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335146877] [2025-04-29 11:03:05,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:03:05,185 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-29 11:03:05,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:03:05,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-29 11:03:05,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-04-29 11:03:05,186 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand has 24 states, 23 states have (on average 4.782608695652174) internal successors, (110), 24 states have internal predecessors, (110), 0 states have call successors, (0), 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:03:05,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:03:05,270 INFO L93 Difference]: Finished difference Result 118 states and 129 transitions. [2025-04-29 11:03:05,270 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-29 11:03:05,271 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.782608695652174) internal successors, (110), 24 states have internal predecessors, (110), 0 states have call successors, (0), 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:03:05,271 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:03:05,272 INFO L225 Difference]: With dead ends: 118 [2025-04-29 11:03:05,272 INFO L226 Difference]: Without dead ends: 117 [2025-04-29 11:03:05,273 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-04-29 11:03:05,273 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:03:05,274 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 78 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:03:05,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-04-29 11:03:05,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-04-29 11:03:05,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.0086206896551724) internal successors, (117), 116 states have internal predecessors, (117), 0 states have call successors, (0), 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:03:05,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2025-04-29 11:03:05,291 INFO L79 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 56 [2025-04-29 11:03:05,291 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:03:05,291 INFO L485 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2025-04-29 11:03:05,291 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.782608695652174) internal successors, (110), 24 states have internal predecessors, (110), 0 states have call successors, (0), 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:03:05,291 INFO L278 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2025-04-29 11:03:05,293 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-04-29 11:03:05,293 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:03:05,293 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 1, 1, 1, 1] [2025-04-29 11:03:05,300 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:03:05,495 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:03:05,496 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-29 11:03:05,496 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:03:05,496 INFO L85 PathProgramCache]: Analyzing trace with hash 2116472744, now seen corresponding path program 4 times [2025-04-29 11:03:05,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:03:05,496 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392302392] [2025-04-29 11:03:05,496 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:03:05,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:03:05,506 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 116 statements into 2 equivalence classes. [2025-04-29 11:03:05,526 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 116 of 116 statements. [2025-04-29 11:03:05,526 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 11:03:05,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:06,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:06,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:03:06,093 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392302392] [2025-04-29 11:03:06,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392302392] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:03:06,093 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355755285] [2025-04-29 11:03:06,093 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:03:06,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:03:06,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:03:06,096 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:03:06,097 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:03:06,122 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 116 statements into 2 equivalence classes. [2025-04-29 11:03:06,151 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 116 of 116 statements. [2025-04-29 11:03:06,151 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 11:03:06,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:06,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-29 11:03:06,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:03:06,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:06,296 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:03:07,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:07,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355755285] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:03:07,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:03:07,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-04-29 11:03:07,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924997917] [2025-04-29 11:03:07,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:03:07,080 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-04-29 11:03:07,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:03:07,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-04-29 11:03:07,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-04-29 11:03:07,082 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand has 48 states, 47 states have (on average 4.8936170212765955) internal successors, (230), 48 states have internal predecessors, (230), 0 states have call successors, (0), 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:03:07,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:03:07,211 INFO L93 Difference]: Finished difference Result 238 states and 261 transitions. [2025-04-29 11:03:07,211 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-29 11:03:07,211 INFO L79 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 4.8936170212765955) internal successors, (230), 48 states have internal predecessors, (230), 0 states have call successors, (0), 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 116 [2025-04-29 11:03:07,212 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:03:07,213 INFO L225 Difference]: With dead ends: 238 [2025-04-29 11:03:07,213 INFO L226 Difference]: Without dead ends: 237 [2025-04-29 11:03:07,214 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-04-29 11:03:07,214 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:03:07,214 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 148 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:03:07,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-04-29 11:03:07,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2025-04-29 11:03:07,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 236 states have (on average 1.0042372881355932) internal successors, (237), 236 states have internal predecessors, (237), 0 states have call successors, (0), 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:03:07,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2025-04-29 11:03:07,227 INFO L79 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 116 [2025-04-29 11:03:07,228 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:03:07,228 INFO L485 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2025-04-29 11:03:07,228 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 4.8936170212765955) internal successors, (230), 48 states have internal predecessors, (230), 0 states have call successors, (0), 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:03:07,228 INFO L278 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2025-04-29 11:03:07,230 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-04-29 11:03:07,232 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:03:07,232 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 1, 1, 1, 1] [2025-04-29 11:03:07,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 11:03:07,436 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:03:07,436 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-29 11:03:07,437 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:03:07,438 INFO L85 PathProgramCache]: Analyzing trace with hash -607470808, now seen corresponding path program 5 times [2025-04-29 11:03:07,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:03:07,438 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769846499] [2025-04-29 11:03:07,438 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:03:07,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:03:07,454 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 236 statements into 47 equivalence classes. [2025-04-29 11:03:07,531 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 236 of 236 statements. [2025-04-29 11:03:07,531 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-04-29 11:03:07,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:09,075 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:09,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:03:09,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769846499] [2025-04-29 11:03:09,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769846499] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:03:09,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979200907] [2025-04-29 11:03:09,075 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:03:09,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:03:09,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:03:09,077 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:03:09,078 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:03:09,108 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 236 statements into 47 equivalence classes. [2025-04-29 11:03:09,196 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 236 of 236 statements. [2025-04-29 11:03:09,196 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-04-29 11:03:09,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:09,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-04-29 11:03:09,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:03:09,450 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:09,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:03:11,475 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:11,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979200907] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:03:11,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:03:11,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2025-04-29 11:03:11,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962780343] [2025-04-29 11:03:11,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:03:11,476 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-04-29 11:03:11,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:03:11,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-04-29 11:03:11,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-04-29 11:03:11,481 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand has 96 states, 95 states have (on average 4.947368421052632) internal successors, (470), 96 states have internal predecessors, (470), 0 states have call successors, (0), 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:03:11,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:03:11,766 INFO L93 Difference]: Finished difference Result 478 states and 525 transitions. [2025-04-29 11:03:11,766 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-04-29 11:03:11,766 INFO L79 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 4.947368421052632) internal successors, (470), 96 states have internal predecessors, (470), 0 states have call successors, (0), 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 236 [2025-04-29 11:03:11,767 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:03:11,768 INFO L225 Difference]: With dead ends: 478 [2025-04-29 11:03:11,768 INFO L226 Difference]: Without dead ends: 477 [2025-04-29 11:03:11,770 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-04-29 11:03:11,770 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:03:11,770 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 293 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:03:11,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-04-29 11:03:11,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2025-04-29 11:03:11,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 1.0021008403361344) internal successors, (477), 476 states have internal predecessors, (477), 0 states have call successors, (0), 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:03:11,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 477 transitions. [2025-04-29 11:03:11,787 INFO L79 Accepts]: Start accepts. Automaton has 477 states and 477 transitions. Word has length 236 [2025-04-29 11:03:11,787 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:03:11,788 INFO L485 AbstractCegarLoop]: Abstraction has 477 states and 477 transitions. [2025-04-29 11:03:11,788 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 4.947368421052632) internal successors, (470), 96 states have internal predecessors, (470), 0 states have call successors, (0), 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:03:11,788 INFO L278 IsEmpty]: Start isEmpty. Operand 477 states and 477 transitions. [2025-04-29 11:03:11,796 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-04-29 11:03:11,796 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:03:11,796 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 94, 94, 94, 1, 1, 1, 1] [2025-04-29 11:03:11,802 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:03:12,000 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-29 11:03:12,000 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-29 11:03:12,001 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:03:12,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1796543016, now seen corresponding path program 6 times [2025-04-29 11:03:12,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:03:12,001 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599447351] [2025-04-29 11:03:12,001 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 11:03:12,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:03:12,013 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 476 statements into 95 equivalence classes. [2025-04-29 11:03:12,260 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 476 of 476 statements. [2025-04-29 11:03:12,260 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-04-29 11:03:12,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:16,696 INFO L134 CoverageAnalysis]: Checked inductivity of 22137 backedges. 0 proven. 22137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:16,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:03:16,696 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599447351] [2025-04-29 11:03:16,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599447351] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:03:16,696 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736883511] [2025-04-29 11:03:16,696 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 11:03:16,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:03:16,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:03:16,698 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:03:16,699 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:03:16,747 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 476 statements into 95 equivalence classes. [2025-04-29 11:03:16,951 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 476 of 476 statements. [2025-04-29 11:03:16,951 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-04-29 11:03:16,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:16,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-04-29 11:03:16,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:03:17,441 INFO L134 CoverageAnalysis]: Checked inductivity of 22137 backedges. 0 proven. 22137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:17,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:03:24,604 INFO L134 CoverageAnalysis]: Checked inductivity of 22137 backedges. 0 proven. 22137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:24,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736883511] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:03:24,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:03:24,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2025-04-29 11:03:24,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101093915] [2025-04-29 11:03:24,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:03:24,605 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2025-04-29 11:03:24,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:03:24,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-04-29 11:03:24,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-04-29 11:03:24,615 INFO L87 Difference]: Start difference. First operand 477 states and 477 transitions. Second operand has 192 states, 191 states have (on average 4.973821989528796) internal successors, (950), 192 states have internal predecessors, (950), 0 states have call successors, (0), 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:03:25,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:03:25,410 INFO L93 Difference]: Finished difference Result 958 states and 1053 transitions. [2025-04-29 11:03:25,410 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-04-29 11:03:25,411 INFO L79 Accepts]: Start accepts. Automaton has has 192 states, 191 states have (on average 4.973821989528796) internal successors, (950), 192 states have internal predecessors, (950), 0 states have call successors, (0), 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 476 [2025-04-29 11:03:25,412 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:03:25,414 INFO L225 Difference]: With dead ends: 958 [2025-04-29 11:03:25,414 INFO L226 Difference]: Without dead ends: 957 [2025-04-29 11:03:25,417 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1046 GetRequests, 856 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-04-29 11:03:25,418 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:03:25,418 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 583 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:03:25,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2025-04-29 11:03:25,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 957. [2025-04-29 11:03:25,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 956 states have (on average 1.0010460251046025) internal successors, (957), 956 states have internal predecessors, (957), 0 states have call successors, (0), 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:03:25,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 957 transitions. [2025-04-29 11:03:25,442 INFO L79 Accepts]: Start accepts. Automaton has 957 states and 957 transitions. Word has length 476 [2025-04-29 11:03:25,442 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:03:25,442 INFO L485 AbstractCegarLoop]: Abstraction has 957 states and 957 transitions. [2025-04-29 11:03:25,443 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 191 states have (on average 4.973821989528796) internal successors, (950), 192 states have internal predecessors, (950), 0 states have call successors, (0), 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:03:25,443 INFO L278 IsEmpty]: Start isEmpty. Operand 957 states and 957 transitions. [2025-04-29 11:03:25,459 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 957 [2025-04-29 11:03:25,459 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:03:25,460 INFO L218 NwaCegarLoop]: trace histogram [191, 191, 190, 190, 190, 1, 1, 1, 1] [2025-04-29 11:03:25,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-29 11:03:25,664 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:03:25,664 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-29 11:03:25,664 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:03:25,664 INFO L85 PathProgramCache]: Analyzing trace with hash 464764968, now seen corresponding path program 7 times [2025-04-29 11:03:25,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:03:25,665 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069610625] [2025-04-29 11:03:25,665 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-29 11:03:25,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:03:25,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 956 statements into 1 equivalence classes. [2025-04-29 11:03:25,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 956 of 956 statements. [2025-04-29 11:03:25,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:03:25,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:44,324 INFO L134 CoverageAnalysis]: Checked inductivity of 90345 backedges. 0 proven. 90345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:03:44,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:03:44,325 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069610625] [2025-04-29 11:03:44,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069610625] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:03:44,325 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889203504] [2025-04-29 11:03:44,325 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-29 11:03:44,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:03:44,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:03:44,327 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:03:44,329 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:03:44,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 956 statements into 1 equivalence classes. [2025-04-29 11:03:44,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 956 of 956 statements. [2025-04-29 11:03:44,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:03:44,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:03:44,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 2104 conjuncts, 202 conjuncts are in the unsatisfiable core [2025-04-29 11:03:44,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:04:02,601 INFO L134 CoverageAnalysis]: Checked inductivity of 90345 backedges. 70140 proven. 0 refuted. 0 times theorem prover too weak. 20205 trivial. 0 not checked. [2025-04-29 11:04:02,602 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:04:02,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889203504] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:04:02,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:04:02,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [203] imperfect sequences [192] total 394 [2025-04-29 11:04:02,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592172412] [2025-04-29 11:04:02,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:04:02,603 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 203 states [2025-04-29 11:04:02,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:02,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 203 interpolants. [2025-04-29 11:04:02,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28930, Invalid=125912, Unknown=0, NotChecked=0, Total=154842 [2025-04-29 11:04:02,616 INFO L87 Difference]: Start difference. First operand 957 states and 957 transitions. Second operand has 203 states, 203 states have (on average 2.5123152709359604) internal successors, (510), 203 states have internal predecessors, (510), 0 states have call successors, (0), 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:04:04,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:04:04,931 INFO L93 Difference]: Finished difference Result 957 states and 957 transitions. [2025-04-29 11:04:04,931 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2025-04-29 11:04:04,932 INFO L79 Accepts]: Start accepts. Automaton has has 203 states, 203 states have (on average 2.5123152709359604) internal successors, (510), 203 states have internal predecessors, (510), 0 states have call successors, (0), 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 956 [2025-04-29 11:04:04,932 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:04:04,933 INFO L225 Difference]: With dead ends: 957 [2025-04-29 11:04:04,933 INFO L226 Difference]: Without dead ends: 0 [2025-04-29 11:04:04,944 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1147 GetRequests, 755 SyntacticMatches, 0 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48090 ImplicationChecksByTransitivity, 26.7s TimeCoverageRelationStatistics Valid=28930, Invalid=125912, Unknown=0, NotChecked=0, Total=154842 [2025-04-29 11:04:04,945 INFO L437 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 3395 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 3395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-29 11:04:04,945 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 894 Invalid, 3395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3395 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-29 11:04:04,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-29 11:04:04,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-29 11:04:04,946 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:04:04,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-29 11:04:04,946 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 956 [2025-04-29 11:04:04,947 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:04:04,947 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-29 11:04:04,947 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 203 states, 203 states have (on average 2.5123152709359604) internal successors, (510), 203 states have internal predecessors, (510), 0 states have call successors, (0), 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:04:04,947 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-29 11:04:04,947 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-29 11:04:04,950 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-04-29 11:04:04,951 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-04-29 11:04:04,951 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-04-29 11:04:04,951 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-04-29 11:04:04,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-29 11:04:05,152 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:04:05,154 INFO L422 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1] [2025-04-29 11:04:05,155 INFO L312 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-04-29 11:04:06,257 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:04:06,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:04:06 BoogieIcfgContainer [2025-04-29 11:04:06,310 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:04:06,311 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:04:06,311 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:04:06,311 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:04:06,311 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:03:03" (3/4) ... [2025-04-29 11:04:06,313 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 11:04:06,320 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-04-29 11:04:06,321 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-04-29 11:04:06,321 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-29 11:04:06,374 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:04:06,375 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:04:06,375 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:04:06,376 INFO L158 Benchmark]: Toolchain (without parser) took 63586.99ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 113.3MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 176.0MB. Max. memory is 16.1GB. [2025-04-29 11:04:06,376 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:04:06,376 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.03ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 100.5MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:04:06,376 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.34ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 99.0MB in the end (delta: 946.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:04:06,376 INFO L158 Benchmark]: Boogie Preprocessor took 17.95ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 97.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:04:06,376 INFO L158 Benchmark]: RCFGBuilder took 172.45ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 87.7MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:04:06,377 INFO L158 Benchmark]: TraceAbstraction took 63136.41ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 86.8MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 860.5MB. Max. memory is 16.1GB. [2025-04-29 11:04:06,377 INFO L158 Benchmark]: Witness Printer took 64.38ms. Allocated memory is still 1.5GB. Free memory was 1.3GB in the beginning and 1.2GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:04:06,379 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.19ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 170.03ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 100.5MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.34ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 99.0MB in the end (delta: 946.5kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.95ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 97.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 172.45ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 87.7MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 63136.41ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 86.8MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 860.5MB. Max. memory is 16.1GB. * Witness Printer took 64.38ms. Allocated memory is still 1.5GB. Free memory was 1.3GB in the beginning and 1.2GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: 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, 18 locations, 20 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 61.9s, OverallIterations: 12, TraceHistogramMax: 191, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 2123 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1941 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4234 IncrementalHoareTripleChecker+Invalid, 4243 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 182 mSDtfsCounter, 4234 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3179 GetRequests, 2413 SyntacticMatches, 0 SemanticMatches, 766 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48090 ImplicationChecksByTransitivity, 39.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=957occurred in iteration=11, InterpolantAutomatonStates: 599, 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, 12 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 54.8s InterpolantComputationTime, 3793 NumberOfCodeBlocks, 3793 NumberOfCodeBlocksAsserted, 323 NumberOfCheckSat, 4689 ConstructedInterpolants, 0 QuantifiedInterpolants, 13059 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4135 ConjunctsInSsa, 391 ConjunctsInUnsatCore, 25 InterpolantComputations, 6 PerfectInterpolantSequences, 90350/267608 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((j <= 118) && (0 <= (j + 2147483648))) && (59 <= i)) || (((0 <= (j + 2147483648)) && (j <= 2147483459)) && (96 <= i))) || (((j <= 138) && (0 <= (j + 2147483648))) && (69 <= i))) || (((0 <= (j + 2147483648)) && (35 <= i)) && (j <= 70))) || (((0 <= (j + 2147483648)) && (65 <= i)) && (j <= 130))) || (((0 <= (j + 2147483648)) && (j <= 146)) && (73 <= i))) || (((0 <= (j + 2147483648)) && (66 <= i)) && (j <= 132))) || (((0 <= (j + 2147483648)) && (j <= 182)) && (91 <= i))) || (((0 <= (j + 2147483648)) && (3 <= i)) && (j <= 6))) || (((0 <= (j + 2147483648)) && (j <= 8)) && (4 <= i))) || (((j <= 164) && (82 <= i)) && (0 <= (j + 2147483648)))) || (((0 <= (j + 2147483648)) && (89 <= i)) && (j <= 178))) || (((0 <= (j + 2147483648)) && (34 <= i)) && (j <= 68))) || (((44 <= i) && (0 <= (j + 2147483648))) && (j <= 88))) || (((0 <= (j + 2147483648)) && (93 <= i)) && (j <= 186))) || (((0 <= (j + 2147483648)) && (j <= 2147483457)) && (95 <= i))) || (((21 <= i) && (0 <= (j + 2147483648))) && (j <= 42))) || (((0 <= (j + 2147483648)) && (23 <= i)) && (j <= 46))) || (((0 <= (j + 2147483648)) && (j <= 2147483465)) && (99 <= i))) || (((0 <= (j + 2147483648)) && (j <= 66)) && (33 <= i))) || (((0 <= (j + 2147483648)) && (28 <= i)) && (j <= 56))) || (((0 <= (j + 2147483648)) && (j <= 18)) && (9 <= i))) || (((0 <= (j + 2147483648)) && (39 <= i)) && (j <= 78))) || (((0 <= (j + 2147483648)) && (j <= 2147483463)) && (98 <= i))) || (((0 <= (j + 2147483648)) && (48 <= i)) && (j <= 96))) || (((0 <= (j + 2147483648)) && (53 <= i)) && (j <= 106))) || (((0 <= (j + 2147483648)) && (20 <= i)) && (j <= 40))) || (((0 <= (j + 2147483648)) && (j <= 44)) && (22 <= i))) || (((0 <= (j + 2147483648)) && (j <= 112)) && (56 <= i))) || (((0 <= (j + 2147483648)) && (45 <= i)) && (j <= 90))) || (((79 <= i) && (0 <= (j + 2147483648))) && (j <= 158))) || (((0 <= (j + 2147483648)) && (58 <= i)) && (j <= 116))) || (((0 <= (j + 2147483648)) && (j <= 64)) && (32 <= i))) || (((0 <= (j + 2147483648)) && (74 <= i)) && (j <= 148))) || (((0 <= (j + 2147483648)) && (j <= 62)) && (31 <= i))) || (((0 <= (j + 2147483648)) && (j <= 50)) && (25 <= i))) || (((0 <= (j + 2147483648)) && (j <= 82)) && (41 <= i))) || (((0 <= (j + 2147483648)) && (57 <= i)) && (j <= 114))) || (((0 <= (j + 2147483648)) && (j <= 140)) && (70 <= i))) || (((j <= 54) && (0 <= (j + 2147483648))) && (27 <= i))) || (((0 <= (j + 2147483648)) && (43 <= i)) && (j <= 86))) || (((0 <= (j + 2147483648)) && (63 <= i)) && (j <= 126))) || (((0 <= (j + 2147483648)) && (13 <= i)) && (j <= 26))) || (((0 <= (j + 2147483648)) && (j <= 160)) && (80 <= i))) || (((0 <= (j + 2147483648)) && (49 <= i)) && (j <= 98))) || (((0 <= (j + 2147483648)) && (51 <= i)) && (j <= 102))) || (((0 <= (j + 2147483648)) && (j <= 142)) && (71 <= i))) || (((86 <= i) && (0 <= (j + 2147483648))) && (j <= 172))) || (((j <= 10) && (0 <= (j + 2147483648))) && (5 <= i))) || (((0 <= (j + 2147483648)) && (10 <= i)) && (j <= 20))) || (((0 <= (j + 2147483648)) && (j <= 32)) && (16 <= i))) || (((0 <= (j + 2147483648)) && (j <= 150)) && (75 <= i))) || (((0 <= (j + 2147483648)) && (88 <= i)) && (j <= 176))) || (((0 <= (j + 2147483648)) && (j <= 92)) && (46 <= i))) || (((0 <= (j + 2147483648)) && (j <= 22)) && (11 <= i))) || (((j <= 170) && (0 <= (j + 2147483648))) && (85 <= i))) || (((0 <= (j + 2147483648)) && (j <= 154)) && (77 <= i))) || (((0 <= (j + 2147483648)) && (37 <= i)) && (j <= 74))) || (((0 <= (j + 2147483648)) && (97 <= i)) && (j <= 2147483461))) || (((0 <= (j + 2147483648)) && (84 <= i)) && (j <= 168))) || (((0 <= (j + 2147483648)) && (j <= 48)) && (24 <= i))) || (((0 <= (j + 2147483648)) && (j <= 16)) && (8 <= i))) || (((0 <= (j + 2147483648)) && (j <= 38)) && (19 <= i))) || (((0 <= (j + 2147483648)) && (100 <= i)) && (j <= 2147483467))) || (((0 <= (j + 2147483648)) && (61 <= i)) && (j <= 122))) || (((0 <= (j + 2147483648)) && (j <= 188)) && (94 <= i))) || (((0 <= (j + 2147483648)) && (j <= 30)) && (15 <= i))) || (((0 <= (j + 2147483648)) && (12 <= i)) && (j <= 24))) || (((0 <= (j + 2147483648)) && (30 <= i)) && (j <= 60))) || (((0 <= (j + 2147483648)) && (j <= 108)) && (54 <= i))) || (((0 <= (j + 2147483648)) && (6 <= i)) && (j <= 12))) || (((0 <= (j + 2147483648)) && (j <= 136)) && (68 <= i))) || (((0 <= (j + 2147483648)) && (87 <= i)) && (j <= 174))) || (((0 <= (j + 2147483648)) && (26 <= i)) && (j <= 52))) || (((0 <= (j + 2147483648)) && (42 <= i)) && (j <= 84))) || (((0 <= (j + 2147483648)) && (50 <= i)) && (j <= 100))) || (((0 <= (j + 2147483648)) && (1 <= i)) && (j <= 2))) || (((j <= 104) && (0 <= (j + 2147483648))) && (52 <= i))) || (((0 <= (j + 2147483648)) && (40 <= i)) && (j <= 80))) || (((0 <= (j + 2147483648)) && (72 <= i)) && (j <= 144))) || (((0 <= (j + 2147483648)) && (17 <= i)) && (j <= 34))) || (((0 <= (j + 2147483648)) && (64 <= i)) && (j <= 128))) || (((0 <= (j + 2147483648)) && (7 <= i)) && (j <= 14))) || (((0 <= (j + 2147483648)) && (j <= 124)) && (62 <= i))) || (((55 <= i) && (0 <= (j + 2147483648))) && (j <= 110))) || (((0 <= (j + 2147483648)) && (47 <= i)) && (j <= 94))) || (((0 <= (j + 2147483648)) && (j <= 4)) && (2 <= i))) || (((0 <= (j + 2147483648)) && (38 <= i)) && (j <= 76))) || (((0 <= (j + 2147483648)) && (14 <= i)) && (j <= 28))) || (((j <= 120) && (0 <= (j + 2147483648))) && (60 <= i))) || (((0 <= (j + 2147483648)) && (18 <= i)) && (j <= 36))) || (((0 <= (j + 2147483648)) && (76 <= i)) && (j <= 152))) || (((j <= 72) && (0 <= (j + 2147483648))) && (36 <= i))) || (((0 <= (j + 2147483648)) && (i == 0)) && (j <= 0))) || (((0 <= (j + 2147483648)) && (92 <= i)) && (j <= 184))) || (((j <= 58) && (0 <= (j + 2147483648))) && (29 <= i))) || (((0 <= (j + 2147483648)) && (j <= 134)) && (67 <= i))) || (((0 <= (j + 2147483648)) && (j <= 166)) && (83 <= i))) || (((0 <= (j + 2147483648)) && (j <= 162)) && (81 <= i))) || (((0 <= (j + 2147483648)) && (j <= 156)) && (78 <= i))) || (((90 <= i) && (0 <= (j + 2147483648))) && (j <= 180))) RESULT: Ultimate proved your program to be correct! [2025-04-29 11:04:06,397 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