./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-numeric/twisted.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 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 ../sv-benchmarks/c/termination-numeric/twisted.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1b68c797f7da07f29717590596e5fa31674f85e16d7b32a9335da92aff43a272 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:33:45,681 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:33:45,734 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 10:33:45,737 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:33:45,737 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:33:45,752 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:33:45,753 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:33:45,753 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:33:45,753 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:33:45,753 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:33:45,753 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:33:45,755 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:33:45,755 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:33:45,755 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:33:45,756 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:33:45,756 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:33:45,756 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:33:45,756 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:33:45,756 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:33:45,757 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:33:45,757 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:33:45,757 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:33:45,757 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:33:45,757 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:33:45,757 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:33:45,757 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:33:45,757 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:33:45,757 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:33:45,757 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:33:45,758 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:33:45,758 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:33:45,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:33:45,758 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:33:45,758 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:33:45,758 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:33:45,758 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:33:45,758 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:33:45,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:33:45,759 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:33:45,759 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:33:45,759 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:33:45,759 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:33:45,759 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1b68c797f7da07f29717590596e5fa31674f85e16d7b32a9335da92aff43a272 [2025-03-04 10:33:45,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:33:45,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:33:46,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:33:46,001 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:33:46,001 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:33:46,003 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/twisted.c [2025-03-04 10:33:47,171 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6d40b38a/d9e283150ca548afbdea49d3a3070e5b/FLAG977e273da [2025-03-04 10:33:47,412 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:33:47,414 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/twisted.c [2025-03-04 10:33:47,421 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6d40b38a/d9e283150ca548afbdea49d3a3070e5b/FLAG977e273da [2025-03-04 10:33:47,735 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6d40b38a/d9e283150ca548afbdea49d3a3070e5b [2025-03-04 10:33:47,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:33:47,737 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:33:47,738 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:33:47,738 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:33:47,742 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:33:47,742 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:33:47" (1/1) ... [2025-03-04 10:33:47,744 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b865710 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:47, skipping insertion in model container [2025-03-04 10:33:47,744 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:33:47" (1/1) ... [2025-03-04 10:33:47,754 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:33:47,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:33:47,858 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:33:47,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:33:47,876 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:33:47,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:47 WrapperNode [2025-03-04 10:33:47,877 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:33:47,878 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:33:47,878 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:33:47,878 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:33:47,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:47" (1/1) ... [2025-03-04 10:33:47,885 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:47" (1/1) ... [2025-03-04 10:33:47,896 INFO L138 Inliner]: procedures = 5, calls = 3, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 46 [2025-03-04 10:33:47,896 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:33:47,897 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:33:47,897 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:33:47,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:33:47,901 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:47" (1/1) ... [2025-03-04 10:33:47,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:47" (1/1) ... [2025-03-04 10:33:47,902 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:47" (1/1) ... [2025-03-04 10:33:47,906 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 10:33:47,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:47" (1/1) ... [2025-03-04 10:33:47,909 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:47" (1/1) ... [2025-03-04 10:33:47,910 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:47" (1/1) ... [2025-03-04 10:33:47,911 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:47" (1/1) ... [2025-03-04 10:33:47,911 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:47" (1/1) ... [2025-03-04 10:33:47,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:47" (1/1) ... [2025-03-04 10:33:47,914 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:33:47,914 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:33:47,917 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:33:47,917 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:33:47,918 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:47" (1/1) ... [2025-03-04 10:33:47,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:33:47,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:47,945 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-03-04 10:33:47,949 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-03-04 10:33:47,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:33:47,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:33:48,004 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:33:48,006 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:33:48,100 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L24: havoc main_#t~nondet2#1;havoc main_#t~nondet3#1;havoc main_#t~ret4#1; [2025-03-04 10:33:48,105 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-04 10:33:48,106 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:33:48,115 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:33:48,115 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:33:48,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:33:48 BoogieIcfgContainer [2025-03-04 10:33:48,116 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:33:48,120 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:33:48,120 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:33:48,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:33:48,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:33:47" (1/3) ... [2025-03-04 10:33:48,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41c6c38a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:33:48, skipping insertion in model container [2025-03-04 10:33:48,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:47" (2/3) ... [2025-03-04 10:33:48,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41c6c38a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:33:48, skipping insertion in model container [2025-03-04 10:33:48,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:33:48" (3/3) ... [2025-03-04 10:33:48,125 INFO L128 eAbstractionObserver]: Analyzing ICFG twisted.c [2025-03-04 10:33:48,135 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:33:48,136 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG twisted.c that has 1 procedures, 26 locations, 1 initial locations, 2 loop locations, and 6 error locations. [2025-03-04 10:33:48,179 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:33:48,190 INFO L333 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;@69456545, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:33:48,190 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 10:33:48,194 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:48,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 10:33:48,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:48,199 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:33:48,199 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:48,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:48,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1892354077, now seen corresponding path program 1 times [2025-03-04 10:33:48,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:48,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629615536] [2025-03-04 10:33:48,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:48,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:48,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:33:48,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:33:48,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:48,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:48,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:48,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:48,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629615536] [2025-03-04 10:33:48,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629615536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:33:48,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:33:48,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:33:48,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100812575] [2025-03-04 10:33:48,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:33:48,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:33:48,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:48,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:33:48,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:33:48,377 INFO L87 Difference]: Start difference. First operand has 26 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:48,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:48,439 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2025-03-04 10:33:48,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:33:48,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 10:33:48,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:48,445 INFO L225 Difference]: With dead ends: 26 [2025-03-04 10:33:48,445 INFO L226 Difference]: Without dead ends: 21 [2025-03-04 10:33:48,447 INFO L434 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-03-04 10:33:48,451 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 15 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:48,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 29 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:48,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-04 10:33:48,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-04 10:33:48,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.5) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:48,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2025-03-04 10:33:48,476 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 6 [2025-03-04 10:33:48,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:48,476 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2025-03-04 10:33:48,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:48,476 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2025-03-04 10:33:48,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 10:33:48,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:48,476 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:48,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:33:48,478 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:48,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:48,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1466565762, now seen corresponding path program 1 times [2025-03-04 10:33:48,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:48,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405076155] [2025-03-04 10:33:48,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:48,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:48,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:33:48,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:33:48,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:48,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:48,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:48,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:48,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405076155] [2025-03-04 10:33:48,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405076155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:33:48,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:33:48,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:33:48,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237142467] [2025-03-04 10:33:48,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:33:48,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:33:48,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:48,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:33:48,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:33:48,523 INFO L87 Difference]: Start difference. First operand 21 states and 24 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-03-04 10:33:48,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:48,569 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2025-03-04 10:33:48,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:33:48,570 INFO L78 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-03-04 10:33:48,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:48,571 INFO L225 Difference]: With dead ends: 37 [2025-03-04 10:33:48,571 INFO L226 Difference]: Without dead ends: 36 [2025-03-04 10:33:48,571 INFO L434 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-03-04 10:33:48,572 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:48,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 37 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:48,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-04 10:33:48,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2025-03-04 10:33:48,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:48,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2025-03-04 10:33:48,577 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 7 [2025-03-04 10:33:48,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:48,577 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2025-03-04 10:33:48,577 INFO L472 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-03-04 10:33:48,577 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2025-03-04 10:33:48,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 10:33:48,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:48,578 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:48,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:33:48,578 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:48,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:48,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1466544886, now seen corresponding path program 1 times [2025-03-04 10:33:48,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:48,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220466052] [2025-03-04 10:33:48,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:48,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:48,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:33:48,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:33:48,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:48,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:48,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:48,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:48,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220466052] [2025-03-04 10:33:48,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220466052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:33:48,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:33:48,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:33:48,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138062831] [2025-03-04 10:33:48,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:33:48,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:33:48,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:48,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:33:48,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:33:48,626 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:48,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:48,676 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2025-03-04 10:33:48,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:33:48,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 10:33:48,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:48,677 INFO L225 Difference]: With dead ends: 41 [2025-03-04 10:33:48,677 INFO L226 Difference]: Without dead ends: 40 [2025-03-04 10:33:48,677 INFO L434 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-03-04 10:33:48,678 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 3 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:48,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 24 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:48,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-04 10:33:48,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2025-03-04 10:33:48,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.46875) internal successors, (47), 36 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:48,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2025-03-04 10:33:48,687 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 7 [2025-03-04 10:33:48,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:48,687 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2025-03-04 10:33:48,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:48,688 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2025-03-04 10:33:48,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 10:33:48,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:48,688 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:48,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:33:48,688 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:48,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:48,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1781748124, now seen corresponding path program 1 times [2025-03-04 10:33:48,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:48,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367756448] [2025-03-04 10:33:48,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:48,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:48,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:33:48,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:33:48,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:48,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:48,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:48,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:48,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367756448] [2025-03-04 10:33:48,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367756448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:33:48,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:33:48,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:33:48,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697716444] [2025-03-04 10:33:48,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:33:48,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:33:48,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:48,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:33:48,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:33:48,739 INFO L87 Difference]: Start difference. First operand 37 states and 47 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-03-04 10:33:48,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:48,761 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2025-03-04 10:33:48,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:33:48,761 INFO L78 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-03-04 10:33:48,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:48,761 INFO L225 Difference]: With dead ends: 37 [2025-03-04 10:33:48,761 INFO L226 Difference]: Without dead ends: 36 [2025-03-04 10:33:48,762 INFO L434 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-03-04 10:33:48,762 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:48,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 28 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:48,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-04 10:33:48,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-04 10:33:48,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.40625) internal successors, (45), 35 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:48,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2025-03-04 10:33:48,766 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 8 [2025-03-04 10:33:48,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:48,767 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2025-03-04 10:33:48,767 INFO L472 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-03-04 10:33:48,767 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2025-03-04 10:33:48,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 10:33:48,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:48,767 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:48,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:33:48,767 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:48,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:48,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1781748765, now seen corresponding path program 1 times [2025-03-04 10:33:48,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:48,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546799540] [2025-03-04 10:33:48,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:48,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:48,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:33:48,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:33:48,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:48,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:48,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:48,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:48,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546799540] [2025-03-04 10:33:48,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546799540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:33:48,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:33:48,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:33:48,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085826910] [2025-03-04 10:33:48,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:33:48,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:33:48,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:48,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:33:48,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:33:48,810 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-03-04 10:33:48,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:48,842 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2025-03-04 10:33:48,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:33:48,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-03-04 10:33:48,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:48,843 INFO L225 Difference]: With dead ends: 40 [2025-03-04 10:33:48,843 INFO L226 Difference]: Without dead ends: 37 [2025-03-04 10:33:48,843 INFO L434 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-03-04 10:33:48,843 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:48,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 23 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:48,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-04 10:33:48,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2025-03-04 10:33:48,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:48,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2025-03-04 10:33:48,850 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 8 [2025-03-04 10:33:48,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:48,850 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2025-03-04 10:33:48,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-03-04 10:33:48,850 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2025-03-04 10:33:48,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 10:33:48,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:48,850 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:48,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:33:48,851 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:48,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:48,851 INFO L85 PathProgramCache]: Analyzing trace with hash -600383021, now seen corresponding path program 1 times [2025-03-04 10:33:48,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:48,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608666841] [2025-03-04 10:33:48,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:48,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:48,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:33:48,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:33:48,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:48,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:48,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:48,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:48,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608666841] [2025-03-04 10:33:48,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608666841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:33:48,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:33:48,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:33:48,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624536524] [2025-03-04 10:33:48,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:33:48,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:33:48,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:48,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:33:48,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:33:48,908 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:48,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:48,941 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2025-03-04 10:33:48,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:33:48,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 10:33:48,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:48,942 INFO L225 Difference]: With dead ends: 54 [2025-03-04 10:33:48,942 INFO L226 Difference]: Without dead ends: 53 [2025-03-04 10:33:48,942 INFO L434 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-03-04 10:33:48,943 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 9 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:48,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 42 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:48,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-04 10:33:48,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2025-03-04 10:33:48,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.326086956521739) internal successors, (61), 49 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:48,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2025-03-04 10:33:48,948 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 9 [2025-03-04 10:33:48,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:48,948 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2025-03-04 10:33:48,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:48,948 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2025-03-04 10:33:48,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 10:33:48,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:48,948 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:48,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:33:48,949 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:48,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:48,949 INFO L85 PathProgramCache]: Analyzing trace with hash 772594114, now seen corresponding path program 1 times [2025-03-04 10:33:48,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:48,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132371080] [2025-03-04 10:33:48,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:48,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:48,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:33:48,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:33:48,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:48,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:49,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:49,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:49,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132371080] [2025-03-04 10:33:49,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132371080] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:49,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947624806] [2025-03-04 10:33:49,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:49,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:49,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:49,015 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-03-04 10:33:49,017 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-03-04 10:33:49,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:33:49,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:33:49,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:49,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:49,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:33:49,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:49,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:49,090 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:49,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:49,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947624806] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:49,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:49,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 10:33:49,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700529774] [2025-03-04 10:33:49,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:49,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:33:49,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:49,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:33:49,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:33:49,131 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:49,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:49,224 INFO L93 Difference]: Finished difference Result 114 states and 148 transitions. [2025-03-04 10:33:49,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:33:49,225 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-04 10:33:49,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:49,226 INFO L225 Difference]: With dead ends: 114 [2025-03-04 10:33:49,226 INFO L226 Difference]: Without dead ends: 113 [2025-03-04 10:33:49,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:33:49,227 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 49 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:49,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 59 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:49,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-04 10:33:49,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 90. [2025-03-04 10:33:49,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 89 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:49,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 115 transitions. [2025-03-04 10:33:49,236 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 115 transitions. Word has length 11 [2025-03-04 10:33:49,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:49,236 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 115 transitions. [2025-03-04 10:33:49,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:49,237 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 115 transitions. [2025-03-04 10:33:49,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 10:33:49,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:49,238 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:49,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:33:49,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:49,439 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:49,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:49,439 INFO L85 PathProgramCache]: Analyzing trace with hash 772614990, now seen corresponding path program 1 times [2025-03-04 10:33:49,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:49,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355801891] [2025-03-04 10:33:49,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:49,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:49,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:33:49,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:33:49,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:49,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:49,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:49,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:49,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355801891] [2025-03-04 10:33:49,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355801891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:33:49,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:33:49,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:33:49,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141844435] [2025-03-04 10:33:49,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:33:49,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:33:49,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:49,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:33:49,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:33:49,494 INFO L87 Difference]: Start difference. First operand 90 states and 115 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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-03-04 10:33:49,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:49,542 INFO L93 Difference]: Finished difference Result 94 states and 119 transitions. [2025-03-04 10:33:49,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:33:49,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-04 10:33:49,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:49,543 INFO L225 Difference]: With dead ends: 94 [2025-03-04 10:33:49,543 INFO L226 Difference]: Without dead ends: 93 [2025-03-04 10:33:49,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:33:49,544 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:49,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 28 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:49,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-04 10:33:49,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2025-03-04 10:33:49,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 90 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:49,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 116 transitions. [2025-03-04 10:33:49,550 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 116 transitions. Word has length 11 [2025-03-04 10:33:49,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:49,550 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 116 transitions. [2025-03-04 10:33:49,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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-03-04 10:33:49,550 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 116 transitions. [2025-03-04 10:33:49,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 10:33:49,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:49,551 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:49,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:33:49,551 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:49,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:49,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1818739111, now seen corresponding path program 1 times [2025-03-04 10:33:49,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:49,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188324291] [2025-03-04 10:33:49,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:49,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:49,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:33:49,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:33:49,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:49,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:49,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:49,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:49,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188324291] [2025-03-04 10:33:49,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188324291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:33:49,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:33:49,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:33:49,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693833379] [2025-03-04 10:33:49,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:33:49,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:33:49,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:49,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:33:49,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:33:49,603 INFO L87 Difference]: Start difference. First operand 91 states and 116 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:49,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:49,643 INFO L93 Difference]: Finished difference Result 95 states and 119 transitions. [2025-03-04 10:33:49,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:33:49,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 10:33:49,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:49,644 INFO L225 Difference]: With dead ends: 95 [2025-03-04 10:33:49,644 INFO L226 Difference]: Without dead ends: 92 [2025-03-04 10:33:49,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:33:49,645 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:49,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 26 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:49,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-04 10:33:49,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2025-03-04 10:33:49,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 85 states have (on average 1.3294117647058823) internal successors, (113), 88 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:49,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 113 transitions. [2025-03-04 10:33:49,650 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 113 transitions. Word has length 12 [2025-03-04 10:33:49,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:49,650 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 113 transitions. [2025-03-04 10:33:49,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:49,651 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions. [2025-03-04 10:33:49,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 10:33:49,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:49,651 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:49,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:33:49,651 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:49,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:49,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1064495767, now seen corresponding path program 1 times [2025-03-04 10:33:49,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:49,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65398961] [2025-03-04 10:33:49,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:49,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:49,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:33:49,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:33:49,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:49,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:49,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:49,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:49,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65398961] [2025-03-04 10:33:49,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65398961] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:49,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23669242] [2025-03-04 10:33:49,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:49,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:49,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:49,690 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-03-04 10:33:49,691 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-03-04 10:33:49,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:33:49,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:33:49,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:49,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:49,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:33:49,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:49,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:49,732 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:49,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:49,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23669242] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:49,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:49,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 10:33:49,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369020393] [2025-03-04 10:33:49,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:49,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:33:49,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:49,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:33:49,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:33:49,774 INFO L87 Difference]: Start difference. First operand 89 states and 113 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:49,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:49,835 INFO L93 Difference]: Finished difference Result 250 states and 334 transitions. [2025-03-04 10:33:49,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:33:49,836 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-04 10:33:49,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:49,836 INFO L225 Difference]: With dead ends: 250 [2025-03-04 10:33:49,836 INFO L226 Difference]: Without dead ends: 249 [2025-03-04 10:33:49,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:33:49,837 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 57 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:49,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 108 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:49,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-04 10:33:49,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 239. [2025-03-04 10:33:49,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 235 states have (on average 1.327659574468085) internal successors, (312), 238 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:49,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 312 transitions. [2025-03-04 10:33:49,848 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 312 transitions. Word has length 13 [2025-03-04 10:33:49,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:49,848 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 312 transitions. [2025-03-04 10:33:49,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:49,848 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 312 transitions. [2025-03-04 10:33:49,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 10:33:49,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:49,849 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:49,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:33:50,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 10:33:50,050 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:50,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:50,054 INFO L85 PathProgramCache]: Analyzing trace with hash 821180624, now seen corresponding path program 1 times [2025-03-04 10:33:50,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:50,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666926975] [2025-03-04 10:33:50,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:50,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:50,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:33:50,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:33:50,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:50,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:50,107 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:50,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:50,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666926975] [2025-03-04 10:33:50,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666926975] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:50,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042311451] [2025-03-04 10:33:50,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:50,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:50,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:50,110 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-03-04 10:33:50,111 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-03-04 10:33:50,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:33:50,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:33:50,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:50,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:50,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:33:50,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:50,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:50,233 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:33:50,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042311451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:33:50,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:33:50,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-04 10:33:50,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271866258] [2025-03-04 10:33:50,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:33:50,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:33:50,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:50,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:33:50,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:33:50,235 INFO L87 Difference]: Start difference. First operand 239 states and 312 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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-03-04 10:33:50,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:50,302 INFO L93 Difference]: Finished difference Result 283 states and 369 transitions. [2025-03-04 10:33:50,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:33:50,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-04 10:33:50,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:50,304 INFO L225 Difference]: With dead ends: 283 [2025-03-04 10:33:50,304 INFO L226 Difference]: Without dead ends: 282 [2025-03-04 10:33:50,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:33:50,305 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:50,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 30 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:50,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-04 10:33:50,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 276. [2025-03-04 10:33:50,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 272 states have (on average 1.3308823529411764) internal successors, (362), 275 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:50,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 362 transitions. [2025-03-04 10:33:50,323 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 362 transitions. Word has length 15 [2025-03-04 10:33:50,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:50,323 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 362 transitions. [2025-03-04 10:33:50,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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-03-04 10:33:50,323 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 362 transitions. [2025-03-04 10:33:50,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 10:33:50,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:50,324 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:50,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:33:50,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:50,524 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:50,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:50,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1338354325, now seen corresponding path program 1 times [2025-03-04 10:33:50,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:50,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583551554] [2025-03-04 10:33:50,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:50,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:50,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:33:50,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:33:50,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:50,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:50,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:50,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:50,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583551554] [2025-03-04 10:33:50,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583551554] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:50,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444437762] [2025-03-04 10:33:50,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:50,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:50,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:50,584 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-03-04 10:33:50,586 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-03-04 10:33:50,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:33:50,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:33:50,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:50,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:50,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:33:50,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:50,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:50,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:50,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:50,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444437762] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:50,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:50,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-03-04 10:33:50,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089797974] [2025-03-04 10:33:50,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:50,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:33:50,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:50,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:33:50,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:33:50,771 INFO L87 Difference]: Start difference. First operand 276 states and 362 transitions. Second operand has 17 states, 16 states have (on average 2.875) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:50,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:50,850 INFO L93 Difference]: Finished difference Result 279 states and 364 transitions. [2025-03-04 10:33:50,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:33:50,850 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.875) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 10:33:50,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:50,851 INFO L225 Difference]: With dead ends: 279 [2025-03-04 10:33:50,851 INFO L226 Difference]: Without dead ends: 276 [2025-03-04 10:33:50,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:33:50,852 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:50,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 66 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:50,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-03-04 10:33:50,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2025-03-04 10:33:50,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 272 states have (on average 1.3235294117647058) internal successors, (360), 275 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:50,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 360 transitions. [2025-03-04 10:33:50,861 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 360 transitions. Word has length 16 [2025-03-04 10:33:50,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:50,861 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 360 transitions. [2025-03-04 10:33:50,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.875) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:50,861 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 360 transitions. [2025-03-04 10:33:50,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 10:33:50,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:50,862 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:50,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:51,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:51,063 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:51,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:51,063 INFO L85 PathProgramCache]: Analyzing trace with hash -313204457, now seen corresponding path program 1 times [2025-03-04 10:33:51,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:51,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589155504] [2025-03-04 10:33:51,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:51,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:51,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:33:51,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:33:51,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:51,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:51,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:51,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:51,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589155504] [2025-03-04 10:33:51,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589155504] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:51,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590194631] [2025-03-04 10:33:51,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:51,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:51,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:51,095 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-03-04 10:33:51,097 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-03-04 10:33:51,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:33:51,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:33:51,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:51,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:51,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:33:51,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:51,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:51,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:51,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:51,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590194631] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:51,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:51,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 10:33:51,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155853636] [2025-03-04 10:33:51,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:51,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:33:51,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:51,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:33:51,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:33:51,222 INFO L87 Difference]: Start difference. First operand 276 states and 360 transitions. Second operand has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:51,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:51,299 INFO L93 Difference]: Finished difference Result 304 states and 393 transitions. [2025-03-04 10:33:51,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:33:51,299 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 10:33:51,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:51,300 INFO L225 Difference]: With dead ends: 304 [2025-03-04 10:33:51,300 INFO L226 Difference]: Without dead ends: 297 [2025-03-04 10:33:51,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:33:51,301 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:51,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 42 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:51,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-03-04 10:33:51,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 292. [2025-03-04 10:33:51,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 288 states have (on average 1.3125) internal successors, (378), 291 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:51,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 378 transitions. [2025-03-04 10:33:51,308 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 378 transitions. Word has length 16 [2025-03-04 10:33:51,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:51,308 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 378 transitions. [2025-03-04 10:33:51,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:51,309 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 378 transitions. [2025-03-04 10:33:51,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 10:33:51,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:51,309 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:51,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:51,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 10:33:51,510 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:51,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:51,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1697082604, now seen corresponding path program 1 times [2025-03-04 10:33:51,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:51,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442645709] [2025-03-04 10:33:51,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:51,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:51,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:33:51,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:33:51,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:51,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:51,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:51,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:51,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442645709] [2025-03-04 10:33:51,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442645709] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:51,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603740420] [2025-03-04 10:33:51,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:51,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:51,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:51,571 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-03-04 10:33:51,572 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-03-04 10:33:51,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:33:51,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:33:51,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:51,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:51,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:33:51,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:51,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:51,677 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:33:51,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603740420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:33:51,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:33:51,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2025-03-04 10:33:51,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728959568] [2025-03-04 10:33:51,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:33:51,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:33:51,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:51,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:33:51,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:33:51,678 INFO L87 Difference]: Start difference. First operand 292 states and 378 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:51,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:51,750 INFO L93 Difference]: Finished difference Result 526 states and 687 transitions. [2025-03-04 10:33:51,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:33:51,751 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-04 10:33:51,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:51,753 INFO L225 Difference]: With dead ends: 526 [2025-03-04 10:33:51,753 INFO L226 Difference]: Without dead ends: 525 [2025-03-04 10:33:51,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:33:51,753 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:51,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 40 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:51,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-03-04 10:33:51,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 469. [2025-03-04 10:33:51,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 465 states have (on average 1.3204301075268816) internal successors, (614), 468 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:51,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 614 transitions. [2025-03-04 10:33:51,765 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 614 transitions. Word has length 19 [2025-03-04 10:33:51,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:51,765 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 614 transitions. [2025-03-04 10:33:51,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:51,765 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 614 transitions. [2025-03-04 10:33:51,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 10:33:51,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:51,765 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:51,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:51,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:51,970 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:51,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:51,970 INFO L85 PathProgramCache]: Analyzing trace with hash 190956564, now seen corresponding path program 2 times [2025-03-04 10:33:51,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:51,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078623372] [2025-03-04 10:33:51,970 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:51,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:51,974 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 10:33:51,977 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 19 statements. [2025-03-04 10:33:51,977 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:33:51,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:52,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:33:52,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:52,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078623372] [2025-03-04 10:33:52,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078623372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:33:52,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:33:52,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:33:52,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414218860] [2025-03-04 10:33:52,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:33:52,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:33:52,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:52,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:33:52,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:33:52,013 INFO L87 Difference]: Start difference. First operand 469 states and 614 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:52,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:52,075 INFO L93 Difference]: Finished difference Result 469 states and 614 transitions. [2025-03-04 10:33:52,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:33:52,076 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-04 10:33:52,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:52,078 INFO L225 Difference]: With dead ends: 469 [2025-03-04 10:33:52,078 INFO L226 Difference]: Without dead ends: 468 [2025-03-04 10:33:52,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:33:52,079 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 18 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:52,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 26 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:52,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-03-04 10:33:52,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 271. [2025-03-04 10:33:52,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 268 states have (on average 1.3059701492537314) internal successors, (350), 270 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:52,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 350 transitions. [2025-03-04 10:33:52,089 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 350 transitions. Word has length 19 [2025-03-04 10:33:52,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:52,090 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 350 transitions. [2025-03-04 10:33:52,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:52,090 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 350 transitions. [2025-03-04 10:33:52,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 10:33:52,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:52,090 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:52,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 10:33:52,090 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:52,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:52,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1069953197, now seen corresponding path program 1 times [2025-03-04 10:33:52,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:52,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43350361] [2025-03-04 10:33:52,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:52,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:52,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:33:52,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:33:52,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:52,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:52,146 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:52,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:52,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43350361] [2025-03-04 10:33:52,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43350361] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:52,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763995424] [2025-03-04 10:33:52,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:52,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:52,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:52,148 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-03-04 10:33:52,150 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-03-04 10:33:52,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:33:52,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:33:52,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:52,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:52,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:33:52,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:52,243 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:52,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:52,301 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:52,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763995424] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:52,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:52,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-03-04 10:33:52,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967325842] [2025-03-04 10:33:52,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:52,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:33:52,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:52,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:33:52,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:33:52,302 INFO L87 Difference]: Start difference. First operand 271 states and 350 transitions. Second operand has 17 states, 16 states have (on average 3.625) internal successors, (58), 17 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:52,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:52,413 INFO L93 Difference]: Finished difference Result 317 states and 406 transitions. [2025-03-04 10:33:52,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:33:52,414 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.625) internal successors, (58), 17 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-04 10:33:52,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:52,415 INFO L225 Difference]: With dead ends: 317 [2025-03-04 10:33:52,415 INFO L226 Difference]: Without dead ends: 308 [2025-03-04 10:33:52,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:33:52,415 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 24 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:52,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 50 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:52,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-04 10:33:52,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 275. [2025-03-04 10:33:52,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 272 states have (on average 1.2977941176470589) internal successors, (353), 274 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:52,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 353 transitions. [2025-03-04 10:33:52,424 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 353 transitions. Word has length 20 [2025-03-04 10:33:52,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:52,424 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 353 transitions. [2025-03-04 10:33:52,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.625) internal successors, (58), 17 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:52,424 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 353 transitions. [2025-03-04 10:33:52,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 10:33:52,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:52,425 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:52,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:52,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:52,626 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:52,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:52,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1363694351, now seen corresponding path program 1 times [2025-03-04 10:33:52,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:52,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615091839] [2025-03-04 10:33:52,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:52,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:52,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:33:52,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:33:52,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:52,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:52,642 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:33:52,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:52,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615091839] [2025-03-04 10:33:52,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615091839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:33:52,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:33:52,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:33:52,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143502094] [2025-03-04 10:33:52,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:33:52,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:33:52,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:52,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:33:52,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:33:52,645 INFO L87 Difference]: Start difference. First operand 275 states and 353 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:52,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:52,671 INFO L93 Difference]: Finished difference Result 570 states and 741 transitions. [2025-03-04 10:33:52,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:33:52,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-04 10:33:52,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:52,672 INFO L225 Difference]: With dead ends: 570 [2025-03-04 10:33:52,672 INFO L226 Difference]: Without dead ends: 372 [2025-03-04 10:33:52,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:33:52,673 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 30 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-03-04 10:33:52,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 30 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:52,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-03-04 10:33:52,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 296. [2025-03-04 10:33:52,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 293 states have (on average 1.286689419795222) internal successors, (377), 295 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:52,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 377 transitions. [2025-03-04 10:33:52,698 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 377 transitions. Word has length 24 [2025-03-04 10:33:52,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:52,698 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 377 transitions. [2025-03-04 10:33:52,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:52,698 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 377 transitions. [2025-03-04 10:33:52,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 10:33:52,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:52,699 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:52,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 10:33:52,699 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:52,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:52,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1292826851, now seen corresponding path program 2 times [2025-03-04 10:33:52,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:52,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811823265] [2025-03-04 10:33:52,700 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:52,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:52,703 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 10:33:52,706 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:33:52,706 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:52,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:52,818 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:52,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:52,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811823265] [2025-03-04 10:33:52,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811823265] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:52,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320094564] [2025-03-04 10:33:52,818 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:52,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:52,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:52,821 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:52,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:33:52,842 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 10:33:52,848 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:33:52,848 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:52,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:52,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:33:52,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:52,876 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:52,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:52,994 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:52,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320094564] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:52,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:52,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2025-03-04 10:33:52,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799114763] [2025-03-04 10:33:52,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:52,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:33:52,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:52,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:33:52,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:33:52,995 INFO L87 Difference]: Start difference. First operand 296 states and 377 transitions. Second operand has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 22 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:53,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:53,090 INFO L93 Difference]: Finished difference Result 678 states and 893 transitions. [2025-03-04 10:33:53,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 10:33:53,090 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 22 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-04 10:33:53,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:53,092 INFO L225 Difference]: With dead ends: 678 [2025-03-04 10:33:53,092 INFO L226 Difference]: Without dead ends: 677 [2025-03-04 10:33:53,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:33:53,093 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 193 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:53,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 184 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:53,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2025-03-04 10:33:53,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 650. [2025-03-04 10:33:53,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 647 states have (on average 1.3060278207109737) internal successors, (845), 649 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:53,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 845 transitions. [2025-03-04 10:33:53,122 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 845 transitions. Word has length 25 [2025-03-04 10:33:53,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:53,122 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 845 transitions. [2025-03-04 10:33:53,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 22 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:53,122 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 845 transitions. [2025-03-04 10:33:53,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 10:33:53,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:53,123 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:53,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:53,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 10:33:53,323 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:53,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:53,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1402588725, now seen corresponding path program 1 times [2025-03-04 10:33:53,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:53,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188498206] [2025-03-04 10:33:53,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:53,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:53,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:33:53,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:33:53,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:53,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:53,416 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:53,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:53,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188498206] [2025-03-04 10:33:53,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188498206] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:53,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702807160] [2025-03-04 10:33:53,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:53,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:53,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:53,419 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:53,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:33:53,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:33:53,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:33:53,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:53,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:53,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:33:53,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:53,573 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:53,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:53,686 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:53,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702807160] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:53,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:53,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2025-03-04 10:33:53,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934587818] [2025-03-04 10:33:53,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:53,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 10:33:53,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:53,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 10:33:53,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=626, Unknown=0, NotChecked=0, Total=812 [2025-03-04 10:33:53,689 INFO L87 Difference]: Start difference. First operand 650 states and 845 transitions. Second operand has 29 states, 28 states have (on average 2.9285714285714284) internal successors, (82), 29 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:53,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:53,840 INFO L93 Difference]: Finished difference Result 752 states and 970 transitions. [2025-03-04 10:33:53,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 10:33:53,840 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.9285714285714284) internal successors, (82), 29 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-04 10:33:53,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:53,842 INFO L225 Difference]: With dead ends: 752 [2025-03-04 10:33:53,842 INFO L226 Difference]: Without dead ends: 739 [2025-03-04 10:33:53,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=670, Unknown=0, NotChecked=0, Total=870 [2025-03-04 10:33:53,843 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 51 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:53,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 51 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:53,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2025-03-04 10:33:53,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 677. [2025-03-04 10:33:53,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 674 states have (on average 1.3071216617210681) internal successors, (881), 676 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:53,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 881 transitions. [2025-03-04 10:33:53,861 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 881 transitions. Word has length 28 [2025-03-04 10:33:53,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:53,861 INFO L471 AbstractCegarLoop]: Abstraction has 677 states and 881 transitions. [2025-03-04 10:33:53,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.9285714285714284) internal successors, (82), 29 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:53,862 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 881 transitions. [2025-03-04 10:33:53,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 10:33:53,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:53,862 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:53,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 10:33:54,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:54,063 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:54,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:54,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1056488139, now seen corresponding path program 2 times [2025-03-04 10:33:54,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:54,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743545285] [2025-03-04 10:33:54,063 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:54,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:54,066 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 10:33:54,069 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:33:54,069 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:54,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:54,156 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:54,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:54,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743545285] [2025-03-04 10:33:54,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743545285] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:54,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840234095] [2025-03-04 10:33:54,157 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:54,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:54,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:54,159 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:54,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:33:54,182 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 10:33:54,189 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:33:54,189 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:54,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:54,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:33:54,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:54,311 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:54,311 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:54,440 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:54,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840234095] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:54,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:54,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2025-03-04 10:33:54,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152216449] [2025-03-04 10:33:54,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:54,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 10:33:54,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:54,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 10:33:54,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=626, Unknown=0, NotChecked=0, Total=812 [2025-03-04 10:33:54,442 INFO L87 Difference]: Start difference. First operand 677 states and 881 transitions. Second operand has 29 states, 28 states have (on average 2.9285714285714284) internal successors, (82), 29 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:54,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:54,658 INFO L93 Difference]: Finished difference Result 953 states and 1217 transitions. [2025-03-04 10:33:54,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 10:33:54,659 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.9285714285714284) internal successors, (82), 29 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-04 10:33:54,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:54,661 INFO L225 Difference]: With dead ends: 953 [2025-03-04 10:33:54,661 INFO L226 Difference]: Without dead ends: 940 [2025-03-04 10:33:54,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=256, Invalid=866, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 10:33:54,662 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 76 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:54,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 50 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:54,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2025-03-04 10:33:54,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 879. [2025-03-04 10:33:54,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 876 states have (on average 1.2831050228310503) internal successors, (1124), 878 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:54,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1124 transitions. [2025-03-04 10:33:54,687 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1124 transitions. Word has length 28 [2025-03-04 10:33:54,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:54,687 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1124 transitions. [2025-03-04 10:33:54,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.9285714285714284) internal successors, (82), 29 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:54,688 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1124 transitions. [2025-03-04 10:33:54,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 10:33:54,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:54,688 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:54,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:54,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:54,889 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:54,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:54,889 INFO L85 PathProgramCache]: Analyzing trace with hash -882903724, now seen corresponding path program 1 times [2025-03-04 10:33:54,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:54,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117165387] [2025-03-04 10:33:54,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:54,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:54,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:33:54,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:33:54,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:54,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:54,985 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:54,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:54,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117165387] [2025-03-04 10:33:54,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117165387] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:54,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589251149] [2025-03-04 10:33:54,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:54,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:54,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:54,988 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:54,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:33:55,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:33:55,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:33:55,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:55,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:55,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:33:55,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:55,047 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:55,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:55,150 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:55,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589251149] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:55,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:55,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2025-03-04 10:33:55,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962062589] [2025-03-04 10:33:55,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:55,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:33:55,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:55,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:33:55,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:33:55,151 INFO L87 Difference]: Start difference. First operand 879 states and 1124 transitions. Second operand has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:55,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:55,318 INFO L93 Difference]: Finished difference Result 2673 states and 3490 transitions. [2025-03-04 10:33:55,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 10:33:55,319 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-04 10:33:55,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:55,326 INFO L225 Difference]: With dead ends: 2673 [2025-03-04 10:33:55,326 INFO L226 Difference]: Without dead ends: 2672 [2025-03-04 10:33:55,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:33:55,327 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 145 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:55,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 138 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:55,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2025-03-04 10:33:55,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1306. [2025-03-04 10:33:55,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1306 states, 1303 states have (on average 1.2877973906369915) internal successors, (1678), 1305 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:55,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1678 transitions. [2025-03-04 10:33:55,384 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1678 transitions. Word has length 31 [2025-03-04 10:33:55,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:55,384 INFO L471 AbstractCegarLoop]: Abstraction has 1306 states and 1678 transitions. [2025-03-04 10:33:55,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:55,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1678 transitions. [2025-03-04 10:33:55,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 10:33:55,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:55,385 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:55,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 10:33:55,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 10:33:55,589 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:55,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:55,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1290880633, now seen corresponding path program 1 times [2025-03-04 10:33:55,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:55,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904115431] [2025-03-04 10:33:55,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:55,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:55,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:33:55,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:33:55,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:55,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:55,706 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:55,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:55,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904115431] [2025-03-04 10:33:55,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904115431] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:55,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426391013] [2025-03-04 10:33:55,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:55,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:55,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:55,710 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:55,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:33:55,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:33:55,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:33:55,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:55,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:55,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:33:55,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:55,882 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:55,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:56,019 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:56,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426391013] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:56,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:56,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2025-03-04 10:33:56,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728836278] [2025-03-04 10:33:56,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:56,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-04 10:33:56,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:56,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-04 10:33:56,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=938, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 10:33:56,021 INFO L87 Difference]: Start difference. First operand 1306 states and 1678 transitions. Second operand has 35 states, 34 states have (on average 2.764705882352941) internal successors, (94), 35 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:56,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:56,239 INFO L93 Difference]: Finished difference Result 1601 states and 2037 transitions. [2025-03-04 10:33:56,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 10:33:56,241 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.764705882352941) internal successors, (94), 35 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-04 10:33:56,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:56,244 INFO L225 Difference]: With dead ends: 1601 [2025-03-04 10:33:56,244 INFO L226 Difference]: Without dead ends: 1584 [2025-03-04 10:33:56,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=296, Invalid=1110, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 10:33:56,248 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 87 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:56,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 64 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:56,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2025-03-04 10:33:56,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1434. [2025-03-04 10:33:56,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1431 states have (on average 1.280922431865828) internal successors, (1833), 1433 states have internal predecessors, (1833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:56,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1833 transitions. [2025-03-04 10:33:56,286 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1833 transitions. Word has length 32 [2025-03-04 10:33:56,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:56,286 INFO L471 AbstractCegarLoop]: Abstraction has 1434 states and 1833 transitions. [2025-03-04 10:33:56,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.764705882352941) internal successors, (94), 35 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:56,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1833 transitions. [2025-03-04 10:33:56,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 10:33:56,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:56,288 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:56,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:56,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 10:33:56,489 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:56,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:56,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1827184641, now seen corresponding path program 2 times [2025-03-04 10:33:56,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:56,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731544478] [2025-03-04 10:33:56,490 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:56,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:56,494 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-04 10:33:56,498 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:33:56,498 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:56,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:56,667 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:56,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:56,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731544478] [2025-03-04 10:33:56,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731544478] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:56,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153211040] [2025-03-04 10:33:56,668 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:56,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:56,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:56,671 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:56,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:33:56,692 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-04 10:33:56,699 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:33:56,700 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:56,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:56,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:33:56,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:56,929 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:56,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:57,124 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:57,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153211040] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:57,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:57,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 46 [2025-03-04 10:33:57,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792685025] [2025-03-04 10:33:57,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:57,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-04 10:33:57,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:57,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-04 10:33:57,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=432, Invalid=1730, Unknown=0, NotChecked=0, Total=2162 [2025-03-04 10:33:57,125 INFO L87 Difference]: Start difference. First operand 1434 states and 1833 transitions. Second operand has 47 states, 46 states have (on average 2.5652173913043477) internal successors, (118), 47 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:57,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:57,457 INFO L93 Difference]: Finished difference Result 2130 states and 2688 transitions. [2025-03-04 10:33:57,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-04 10:33:57,457 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.5652173913043477) internal successors, (118), 47 states have internal predecessors, (118), 0 states have call successors, (0), 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 40 [2025-03-04 10:33:57,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:57,462 INFO L225 Difference]: With dead ends: 2130 [2025-03-04 10:33:57,462 INFO L226 Difference]: Without dead ends: 2115 [2025-03-04 10:33:57,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1195 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=574, Invalid=2288, Unknown=0, NotChecked=0, Total=2862 [2025-03-04 10:33:57,463 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 169 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:57,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 79 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:33:57,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2115 states. [2025-03-04 10:33:57,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2115 to 1692. [2025-03-04 10:33:57,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1692 states, 1689 states have (on average 1.2693901716992304) internal successors, (2144), 1691 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:57,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1692 states and 2144 transitions. [2025-03-04 10:33:57,534 INFO L78 Accepts]: Start accepts. Automaton has 1692 states and 2144 transitions. Word has length 40 [2025-03-04 10:33:57,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:57,534 INFO L471 AbstractCegarLoop]: Abstraction has 1692 states and 2144 transitions. [2025-03-04 10:33:57,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.5652173913043477) internal successors, (118), 47 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:57,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 2144 transitions. [2025-03-04 10:33:57,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 10:33:57,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:57,536 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:57,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 10:33:57,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 10:33:57,740 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:57,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:57,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1270053573, now seen corresponding path program 1 times [2025-03-04 10:33:57,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:57,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483789363] [2025-03-04 10:33:57,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:57,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:57,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 10:33:57,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:33:57,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:57,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:57,939 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:57,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:57,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483789363] [2025-03-04 10:33:57,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483789363] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:57,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676291466] [2025-03-04 10:33:57,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:57,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:57,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:57,942 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:57,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:33:57,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 10:33:57,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:33:57,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:57,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:57,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 10:33:57,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:58,194 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:58,194 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:58,463 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:58,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676291466] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:58,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:58,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 52 [2025-03-04 10:33:58,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814319476] [2025-03-04 10:33:58,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:58,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-04 10:33:58,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:58,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-04 10:33:58,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=2186, Unknown=0, NotChecked=0, Total=2756 [2025-03-04 10:33:58,465 INFO L87 Difference]: Start difference. First operand 1692 states and 2144 transitions. Second operand has 53 states, 52 states have (on average 2.5) internal successors, (130), 53 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:58,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:58,867 INFO L93 Difference]: Finished difference Result 2869 states and 3582 transitions. [2025-03-04 10:33:58,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-04 10:33:58,867 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.5) internal successors, (130), 53 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-04 10:33:58,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:58,873 INFO L225 Difference]: With dead ends: 2869 [2025-03-04 10:33:58,873 INFO L226 Difference]: Without dead ends: 2842 [2025-03-04 10:33:58,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1665 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=832, Invalid=3200, Unknown=0, NotChecked=0, Total=4032 [2025-03-04 10:33:58,874 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 232 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:58,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 106 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:33:58,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2842 states. [2025-03-04 10:33:58,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2842 to 2378. [2025-03-04 10:33:58,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2378 states, 2375 states have (on average 1.263157894736842) internal successors, (3000), 2377 states have internal predecessors, (3000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:58,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2378 states to 2378 states and 3000 transitions. [2025-03-04 10:33:58,964 INFO L78 Accepts]: Start accepts. Automaton has 2378 states and 3000 transitions. Word has length 44 [2025-03-04 10:33:58,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:58,964 INFO L471 AbstractCegarLoop]: Abstraction has 2378 states and 3000 transitions. [2025-03-04 10:33:58,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.5) internal successors, (130), 53 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:58,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2378 states and 3000 transitions. [2025-03-04 10:33:58,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 10:33:58,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:58,966 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:58,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:59,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:59,167 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:59,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:59,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1780303429, now seen corresponding path program 1 times [2025-03-04 10:33:59,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:59,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974258402] [2025-03-04 10:33:59,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:59,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:59,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 10:33:59,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:33:59,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:59,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:59,350 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:59,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:59,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974258402] [2025-03-04 10:33:59,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974258402] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:59,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009824606] [2025-03-04 10:33:59,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:59,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:59,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:59,353 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:59,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 10:33:59,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 10:33:59,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:33:59,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:59,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:59,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 10:33:59,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:59,608 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:59,609 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:59,855 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:59,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009824606] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:59,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:59,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 52 [2025-03-04 10:33:59,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275635208] [2025-03-04 10:33:59,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:59,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-04 10:33:59,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:59,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-04 10:33:59,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=610, Invalid=2146, Unknown=0, NotChecked=0, Total=2756 [2025-03-04 10:33:59,857 INFO L87 Difference]: Start difference. First operand 2378 states and 3000 transitions. Second operand has 53 states, 52 states have (on average 2.5) internal successors, (130), 53 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:00,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:00,224 INFO L93 Difference]: Finished difference Result 2743 states and 3440 transitions. [2025-03-04 10:34:00,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-04 10:34:00,227 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.5) internal successors, (130), 53 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-04 10:34:00,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:00,234 INFO L225 Difference]: With dead ends: 2743 [2025-03-04 10:34:00,234 INFO L226 Difference]: Without dead ends: 2722 [2025-03-04 10:34:00,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1353 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=637, Invalid=2225, Unknown=0, NotChecked=0, Total=2862 [2025-03-04 10:34:00,236 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 140 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:00,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 88 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:34:00,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2722 states. [2025-03-04 10:34:00,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2722 to 2482. [2025-03-04 10:34:00,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2482 states, 2479 states have (on average 1.2609923356192012) internal successors, (3126), 2481 states have internal predecessors, (3126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:00,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2482 states to 2482 states and 3126 transitions. [2025-03-04 10:34:00,339 INFO L78 Accepts]: Start accepts. Automaton has 2482 states and 3126 transitions. Word has length 44 [2025-03-04 10:34:00,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:00,339 INFO L471 AbstractCegarLoop]: Abstraction has 2482 states and 3126 transitions. [2025-03-04 10:34:00,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.5) internal successors, (130), 53 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:00,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2482 states and 3126 transitions. [2025-03-04 10:34:00,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 10:34:00,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:00,341 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-04 10:34:00,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 10:34:00,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:00,542 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:34:00,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:00,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1137122625, now seen corresponding path program 2 times [2025-03-04 10:34:00,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:00,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855500768] [2025-03-04 10:34:00,542 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:34:00,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:00,545 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-04 10:34:00,548 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:34:00,548 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:34:00,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:00,659 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:00,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:00,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855500768] [2025-03-04 10:34:00,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855500768] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:00,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930399740] [2025-03-04 10:34:00,659 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:34:00,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:00,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:00,661 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:34:00,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 10:34:00,686 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-04 10:34:00,694 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:34:00,694 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:34:00,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:00,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:34:00,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:34:00,860 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:00,860 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:34:01,017 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:01,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930399740] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:34:01,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:34:01,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 40 [2025-03-04 10:34:01,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375949910] [2025-03-04 10:34:01,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:34:01,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-04 10:34:01,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:01,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-04 10:34:01,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=1306, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 10:34:01,019 INFO L87 Difference]: Start difference. First operand 2482 states and 3126 transitions. Second operand has 41 states, 40 states have (on average 3.25) internal successors, (130), 41 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:01,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:01,387 INFO L93 Difference]: Finished difference Result 3864 states and 4788 transitions. [2025-03-04 10:34:01,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-04 10:34:01,387 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.25) internal successors, (130), 41 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-04 10:34:01,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:01,395 INFO L225 Difference]: With dead ends: 3864 [2025-03-04 10:34:01,395 INFO L226 Difference]: Without dead ends: 3847 [2025-03-04 10:34:01,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 888 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=464, Invalid=1792, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 10:34:01,397 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 83 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:01,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 97 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:34:01,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3847 states. [2025-03-04 10:34:01,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3847 to 2958. [2025-03-04 10:34:01,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2958 states, 2955 states have (on average 1.2602368866328257) internal successors, (3724), 2957 states have internal predecessors, (3724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:01,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2958 states to 2958 states and 3724 transitions. [2025-03-04 10:34:01,504 INFO L78 Accepts]: Start accepts. Automaton has 2958 states and 3724 transitions. Word has length 44 [2025-03-04 10:34:01,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:01,504 INFO L471 AbstractCegarLoop]: Abstraction has 2958 states and 3724 transitions. [2025-03-04 10:34:01,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.25) internal successors, (130), 41 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:01,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2958 states and 3724 transitions. [2025-03-04 10:34:01,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 10:34:01,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:01,506 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:34:01,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 10:34:01,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 10:34:01,707 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:34:01,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:01,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1677916809, now seen corresponding path program 3 times [2025-03-04 10:34:01,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:01,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925717036] [2025-03-04 10:34:01,708 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:34:01,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:01,711 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 5 equivalence classes. [2025-03-04 10:34:01,719 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 40 of 48 statements. [2025-03-04 10:34:01,719 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 10:34:01,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:01,886 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 2 proven. 42 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:34:01,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:01,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925717036] [2025-03-04 10:34:01,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925717036] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:01,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10805318] [2025-03-04 10:34:01,887 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:34:01,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:01,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:01,889 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:34:01,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 10:34:01,920 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 5 equivalence classes. [2025-03-04 10:34:01,929 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 40 of 48 statements. [2025-03-04 10:34:01,929 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 10:34:01,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:01,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:34:01,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:34:02,047 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:34:02,047 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:34:02,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10805318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:34:02,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:34:02,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 19 [2025-03-04 10:34:02,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303496804] [2025-03-04 10:34:02,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:34:02,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:34:02,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:02,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:34:02,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:34:02,048 INFO L87 Difference]: Start difference. First operand 2958 states and 3724 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:02,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:02,177 INFO L93 Difference]: Finished difference Result 4186 states and 5269 transitions. [2025-03-04 10:34:02,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:34:02,178 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-04 10:34:02,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:02,181 INFO L225 Difference]: With dead ends: 4186 [2025-03-04 10:34:02,181 INFO L226 Difference]: Without dead ends: 1778 [2025-03-04 10:34:02,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:34:02,184 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 37 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:02,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 63 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:34:02,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2025-03-04 10:34:02,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1740. [2025-03-04 10:34:02,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1740 states, 1737 states have (on average 1.1894070236039147) internal successors, (2066), 1739 states have internal predecessors, (2066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:02,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1740 states and 2066 transitions. [2025-03-04 10:34:02,265 INFO L78 Accepts]: Start accepts. Automaton has 1740 states and 2066 transitions. Word has length 48 [2025-03-04 10:34:02,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:02,265 INFO L471 AbstractCegarLoop]: Abstraction has 1740 states and 2066 transitions. [2025-03-04 10:34:02,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:02,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1740 states and 2066 transitions. [2025-03-04 10:34:02,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 10:34:02,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:02,266 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:34:02,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 10:34:02,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 10:34:02,467 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:34:02,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:02,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1508581509, now seen corresponding path program 3 times [2025-03-04 10:34:02,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:02,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431414276] [2025-03-04 10:34:02,467 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:34:02,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:02,471 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 11 equivalence classes. [2025-03-04 10:34:02,473 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 49 statements. [2025-03-04 10:34:02,474 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:34:02,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:02,511 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 10:34:02,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:02,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431414276] [2025-03-04 10:34:02,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431414276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:34:02,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:34:02,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:34:02,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808730262] [2025-03-04 10:34:02,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:34:02,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:34:02,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:02,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:34:02,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:34:02,512 INFO L87 Difference]: Start difference. First operand 1740 states and 2066 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:02,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:02,584 INFO L93 Difference]: Finished difference Result 1791 states and 2118 transitions. [2025-03-04 10:34:02,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:34:02,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-03-04 10:34:02,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:02,588 INFO L225 Difference]: With dead ends: 1791 [2025-03-04 10:34:02,588 INFO L226 Difference]: Without dead ends: 1609 [2025-03-04 10:34:02,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:34:02,590 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:02,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 29 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:34:02,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2025-03-04 10:34:02,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1508. [2025-03-04 10:34:02,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1508 states, 1505 states have (on average 1.1940199335548172) internal successors, (1797), 1507 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:02,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 1797 transitions. [2025-03-04 10:34:02,689 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 1797 transitions. Word has length 49 [2025-03-04 10:34:02,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:02,689 INFO L471 AbstractCegarLoop]: Abstraction has 1508 states and 1797 transitions. [2025-03-04 10:34:02,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:02,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 1797 transitions. [2025-03-04 10:34:02,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 10:34:02,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:02,690 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:34:02,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 10:34:02,690 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:34:02,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:02,691 INFO L85 PathProgramCache]: Analyzing trace with hash 479284339, now seen corresponding path program 2 times [2025-03-04 10:34:02,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:02,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83259374] [2025-03-04 10:34:02,691 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:34:02,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:02,694 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-04 10:34:02,699 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 10:34:02,699 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:34:02,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:02,930 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:02,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:02,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83259374] [2025-03-04 10:34:02,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83259374] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:02,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419797802] [2025-03-04 10:34:02,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:34:02,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:02,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:02,933 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:34:02,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 10:34:02,956 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-04 10:34:02,966 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 10:34:02,966 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:34:02,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:02,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:34:02,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:34:03,259 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:03,260 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:34:03,593 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:03,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419797802] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:34:03,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:34:03,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 58 [2025-03-04 10:34:03,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208337848] [2025-03-04 10:34:03,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:34:03,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-03-04 10:34:03,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:03,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-03-04 10:34:03,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=676, Invalid=2746, Unknown=0, NotChecked=0, Total=3422 [2025-03-04 10:34:03,595 INFO L87 Difference]: Start difference. First operand 1508 states and 1797 transitions. Second operand has 59 states, 58 states have (on average 2.8620689655172415) internal successors, (166), 59 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:03,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:03,809 INFO L93 Difference]: Finished difference Result 1824 states and 2156 transitions. [2025-03-04 10:34:03,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-04 10:34:03,809 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 2.8620689655172415) internal successors, (166), 59 states have internal predecessors, (166), 0 states have call successors, (0), 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-03-04 10:34:03,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:03,813 INFO L225 Difference]: With dead ends: 1824 [2025-03-04 10:34:03,813 INFO L226 Difference]: Without dead ends: 1807 [2025-03-04 10:34:03,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1736 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=676, Invalid=2746, Unknown=0, NotChecked=0, Total=3422 [2025-03-04 10:34:03,814 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 74 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:03,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 77 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:34:03,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1807 states. [2025-03-04 10:34:03,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1807 to 1540. [2025-03-04 10:34:03,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1540 states, 1537 states have (on average 1.1951854261548471) internal successors, (1837), 1539 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:03,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 1837 transitions. [2025-03-04 10:34:03,860 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 1837 transitions. Word has length 56 [2025-03-04 10:34:03,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:03,860 INFO L471 AbstractCegarLoop]: Abstraction has 1540 states and 1837 transitions. [2025-03-04 10:34:03,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 2.8620689655172415) internal successors, (166), 59 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:03,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 1837 transitions. [2025-03-04 10:34:03,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 10:34:03,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:03,861 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2025-03-04 10:34:03,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-04 10:34:04,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 10:34:04,065 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:34:04,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:04,065 INFO L85 PathProgramCache]: Analyzing trace with hash -346888017, now seen corresponding path program 2 times [2025-03-04 10:34:04,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:04,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536309452] [2025-03-04 10:34:04,065 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:34:04,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:04,068 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 60 statements into 2 equivalence classes. [2025-03-04 10:34:04,072 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 10:34:04,072 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:34:04,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:04,337 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:04,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:04,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536309452] [2025-03-04 10:34:04,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536309452] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:04,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753494489] [2025-03-04 10:34:04,338 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:34:04,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:04,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:04,342 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:34:04,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 10:34:04,365 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 60 statements into 2 equivalence classes. [2025-03-04 10:34:04,375 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 10:34:04,375 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:34:04,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:04,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 10:34:04,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:34:04,729 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:04,729 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:34:05,128 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:05,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753494489] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:34:05,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:34:05,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 64 [2025-03-04 10:34:05,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687854715] [2025-03-04 10:34:05,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:34:05,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-03-04 10:34:05,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:05,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-03-04 10:34:05,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=822, Invalid=3338, Unknown=0, NotChecked=0, Total=4160 [2025-03-04 10:34:05,130 INFO L87 Difference]: Start difference. First operand 1540 states and 1837 transitions. Second operand has 65 states, 64 states have (on average 2.78125) internal successors, (178), 65 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:05,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:05,487 INFO L93 Difference]: Finished difference Result 2664 states and 3181 transitions. [2025-03-04 10:34:05,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-04 10:34:05,487 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 2.78125) internal successors, (178), 65 states have internal predecessors, (178), 0 states have call successors, (0), 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 60 [2025-03-04 10:34:05,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:05,494 INFO L225 Difference]: With dead ends: 2664 [2025-03-04 10:34:05,494 INFO L226 Difference]: Without dead ends: 2639 [2025-03-04 10:34:05,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2225 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=891, Invalid=3665, Unknown=0, NotChecked=0, Total=4556 [2025-03-04 10:34:05,496 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 140 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:05,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 93 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:34:05,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2639 states. [2025-03-04 10:34:05,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2639 to 2056. [2025-03-04 10:34:05,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2056 states, 2053 states have (on average 1.1919142717973696) internal successors, (2447), 2055 states have internal predecessors, (2447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:05,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2447 transitions. [2025-03-04 10:34:05,597 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2447 transitions. Word has length 60 [2025-03-04 10:34:05,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:05,597 INFO L471 AbstractCegarLoop]: Abstraction has 2056 states and 2447 transitions. [2025-03-04 10:34:05,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 2.78125) internal successors, (178), 65 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:05,597 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2447 transitions. [2025-03-04 10:34:05,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 10:34:05,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:05,599 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 9, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:34:05,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-04 10:34:05,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:05,803 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:34:05,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:05,803 INFO L85 PathProgramCache]: Analyzing trace with hash 948100833, now seen corresponding path program 3 times [2025-03-04 10:34:05,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:05,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659895994] [2025-03-04 10:34:05,803 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:34:05,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:05,808 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 72 statements into 9 equivalence classes. [2025-03-04 10:34:05,817 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 48 of 72 statements. [2025-03-04 10:34:05,817 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 10:34:05,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:05,919 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 120 proven. 14 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-04 10:34:05,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:05,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659895994] [2025-03-04 10:34:05,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659895994] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:05,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723795867] [2025-03-04 10:34:05,920 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:34:05,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:05,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:05,922 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:34:05,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 10:34:05,952 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 72 statements into 9 equivalence classes. [2025-03-04 10:34:05,961 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 48 of 72 statements. [2025-03-04 10:34:05,961 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 10:34:05,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:05,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:34:05,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:34:05,989 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 116 proven. 20 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 10:34:05,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:34:06,088 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 122 proven. 10 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-04 10:34:06,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723795867] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:34:06,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:34:06,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 14 [2025-03-04 10:34:06,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084412609] [2025-03-04 10:34:06,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:34:06,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:34:06,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:06,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:34:06,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:34:06,090 INFO L87 Difference]: Start difference. First operand 2056 states and 2447 transitions. Second operand has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 14 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:06,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:06,198 INFO L93 Difference]: Finished difference Result 2537 states and 2988 transitions. [2025-03-04 10:34:06,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:34:06,198 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 14 states have internal predecessors, (73), 0 states have call successors, (0), 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 72 [2025-03-04 10:34:06,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:06,199 INFO L225 Difference]: With dead ends: 2537 [2025-03-04 10:34:06,199 INFO L226 Difference]: Without dead ends: 497 [2025-03-04 10:34:06,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:34:06,201 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 57 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:06,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 128 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:34:06,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-03-04 10:34:06,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 385. [2025-03-04 10:34:06,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 382 states have (on average 1.1020942408376964) internal successors, (421), 384 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:06,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 421 transitions. [2025-03-04 10:34:06,226 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 421 transitions. Word has length 72 [2025-03-04 10:34:06,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:06,226 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 421 transitions. [2025-03-04 10:34:06,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 14 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:06,226 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 421 transitions. [2025-03-04 10:34:06,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 10:34:06,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:06,227 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-03-04 10:34:06,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-04 10:34:06,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-03-04 10:34:06,432 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:34:06,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:06,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1670920285, now seen corresponding path program 4 times [2025-03-04 10:34:06,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:06,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915500156] [2025-03-04 10:34:06,432 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:34:06,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:06,438 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 80 statements into 2 equivalence classes. [2025-03-04 10:34:06,452 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 10:34:06,455 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:34:06,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:06,861 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:06,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:06,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915500156] [2025-03-04 10:34:06,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915500156] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:06,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101855813] [2025-03-04 10:34:06,861 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:34:06,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:06,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:06,863 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:34:06,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 10:34:06,892 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 80 statements into 2 equivalence classes. [2025-03-04 10:34:06,906 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 10:34:06,906 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:34:06,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:06,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 10:34:06,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:34:07,481 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:07,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:34:08,155 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:08,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101855813] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:34:08,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:34:08,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 88 [2025-03-04 10:34:08,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062854518] [2025-03-04 10:34:08,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:34:08,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2025-03-04 10:34:08,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:08,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2025-03-04 10:34:08,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1510, Invalid=6322, Unknown=0, NotChecked=0, Total=7832 [2025-03-04 10:34:08,157 INFO L87 Difference]: Start difference. First operand 385 states and 421 transitions. Second operand has 89 states, 88 states have (on average 2.7045454545454546) internal successors, (238), 89 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:08,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:08,408 INFO L93 Difference]: Finished difference Result 404 states and 439 transitions. [2025-03-04 10:34:08,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-03-04 10:34:08,409 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 88 states have (on average 2.7045454545454546) internal successors, (238), 89 states have internal predecessors, (238), 0 states have call successors, (0), 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 80 [2025-03-04 10:34:08,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:08,410 INFO L225 Difference]: With dead ends: 404 [2025-03-04 10:34:08,410 INFO L226 Difference]: Without dead ends: 385 [2025-03-04 10:34:08,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4226 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1510, Invalid=6322, Unknown=0, NotChecked=0, Total=7832 [2025-03-04 10:34:08,413 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 75 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:08,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 118 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:34:08,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-04 10:34:08,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 349. [2025-03-04 10:34:08,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 346 states have (on average 1.0867052023121386) internal successors, (376), 348 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:08,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 376 transitions. [2025-03-04 10:34:08,435 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 376 transitions. Word has length 80 [2025-03-04 10:34:08,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:08,435 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 376 transitions. [2025-03-04 10:34:08,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 88 states have (on average 2.7045454545454546) internal successors, (238), 89 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:08,435 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 376 transitions. [2025-03-04 10:34:08,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-04 10:34:08,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:08,436 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 1, 1, 1] [2025-03-04 10:34:08,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-04 10:34:08,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:08,637 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:34:08,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:08,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1055615631, now seen corresponding path program 1 times [2025-03-04 10:34:08,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:08,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796680934] [2025-03-04 10:34:08,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:34:08,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:08,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 10:34:08,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 10:34:08,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:34:08,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:08,866 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 0 proven. 430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:08,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:08,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796680934] [2025-03-04 10:34:08,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796680934] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:08,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329965046] [2025-03-04 10:34:08,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:34:08,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:08,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:08,868 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:34:08,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 10:34:08,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 10:34:08,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 10:34:08,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:34:08,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:08,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 10:34:08,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:34:08,982 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 0 proven. 430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:08,982 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:34:09,353 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 0 proven. 430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:09,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329965046] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:34:09,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:34:09,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2025-03-04 10:34:09,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199123472] [2025-03-04 10:34:09,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:34:09,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-04 10:34:09,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:09,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-04 10:34:09,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2025-03-04 10:34:09,354 INFO L87 Difference]: Start difference. First operand 349 states and 376 transitions. Second operand has 46 states, 45 states have (on average 3.933333333333333) internal successors, (177), 46 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:09,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:09,475 INFO L93 Difference]: Finished difference Result 681 states and 774 transitions. [2025-03-04 10:34:09,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-04 10:34:09,475 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 3.933333333333333) internal successors, (177), 46 states have internal predecessors, (177), 0 states have call successors, (0), 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 89 [2025-03-04 10:34:09,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:09,477 INFO L225 Difference]: With dead ends: 681 [2025-03-04 10:34:09,477 INFO L226 Difference]: Without dead ends: 680 [2025-03-04 10:34:09,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2025-03-04 10:34:09,477 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 472 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:09,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 308 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:34:09,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2025-03-04 10:34:09,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 637. [2025-03-04 10:34:09,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 634 states have (on average 1.138801261829653) internal successors, (722), 636 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:09,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 722 transitions. [2025-03-04 10:34:09,509 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 722 transitions. Word has length 89 [2025-03-04 10:34:09,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:09,509 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 722 transitions. [2025-03-04 10:34:09,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 3.933333333333333) internal successors, (177), 46 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:09,509 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 722 transitions. [2025-03-04 10:34:09,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 10:34:09,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:09,510 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1] [2025-03-04 10:34:09,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-03-04 10:34:09,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:09,714 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:34:09,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:09,714 INFO L85 PathProgramCache]: Analyzing trace with hash 791635528, now seen corresponding path program 2 times [2025-03-04 10:34:09,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:09,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772687008] [2025-03-04 10:34:09,714 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:34:09,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:09,718 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 91 statements into 2 equivalence classes. [2025-03-04 10:34:09,723 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 10:34:09,723 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:34:09,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:10,013 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 343 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:10,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:10,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772687008] [2025-03-04 10:34:10,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772687008] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:10,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210650272] [2025-03-04 10:34:10,013 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:34:10,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:10,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:10,015 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:34:10,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-04 10:34:10,042 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 91 statements into 2 equivalence classes. [2025-03-04 10:34:10,054 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 10:34:10,054 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:34:10,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:10,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 10:34:10,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:34:10,137 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 343 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:10,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:34:10,598 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 343 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:10,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210650272] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:34:10,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:34:10,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2025-03-04 10:34:10,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444476250] [2025-03-04 10:34:10,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:34:10,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-04 10:34:10,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:10,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-04 10:34:10,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=1801, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 10:34:10,599 INFO L87 Difference]: Start difference. First operand 637 states and 722 transitions. Second operand has 50 states, 49 states have (on average 3.693877551020408) internal successors, (181), 50 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:10,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:10,861 INFO L93 Difference]: Finished difference Result 2220 states and 2468 transitions. [2025-03-04 10:34:10,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-03-04 10:34:10,862 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 3.693877551020408) internal successors, (181), 50 states have internal predecessors, (181), 0 states have call successors, (0), 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 91 [2025-03-04 10:34:10,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:10,864 INFO L225 Difference]: With dead ends: 2220 [2025-03-04 10:34:10,864 INFO L226 Difference]: Without dead ends: 2219 [2025-03-04 10:34:10,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=649, Invalid=1801, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 10:34:10,865 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 220 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:10,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 204 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:34:10,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2219 states. [2025-03-04 10:34:10,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2219 to 637. [2025-03-04 10:34:10,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 634 states have (on average 1.1167192429022081) internal successors, (708), 636 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:10,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 708 transitions. [2025-03-04 10:34:10,901 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 708 transitions. Word has length 91 [2025-03-04 10:34:10,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:10,901 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 708 transitions. [2025-03-04 10:34:10,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 3.693877551020408) internal successors, (181), 50 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:10,902 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 708 transitions. [2025-03-04 10:34:10,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 10:34:10,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:10,902 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 8, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:34:10,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-04 10:34:11,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:11,103 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:34:11,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:11,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1489961, now seen corresponding path program 3 times [2025-03-04 10:34:11,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:11,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096900704] [2025-03-04 10:34:11,103 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:34:11,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:11,107 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 96 statements into 9 equivalence classes. [2025-03-04 10:34:11,114 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 10:34:11,114 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-04 10:34:11,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:11,421 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 0 proven. 348 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:11,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:11,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096900704] [2025-03-04 10:34:11,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096900704] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:11,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832794852] [2025-03-04 10:34:11,422 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:34:11,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:11,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:11,424 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:34:11,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-04 10:34:11,453 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 96 statements into 9 equivalence classes. [2025-03-04 10:34:11,468 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 10:34:11,468 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-04 10:34:11,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:11,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 10:34:11,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:34:11,949 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 0 proven. 348 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:11,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:34:12,426 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 0 proven. 348 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:12,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832794852] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:34:12,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:34:12,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 82 [2025-03-04 10:34:12,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849420102] [2025-03-04 10:34:12,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:34:12,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2025-03-04 10:34:12,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:12,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2025-03-04 10:34:12,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1308, Invalid=5498, Unknown=0, NotChecked=0, Total=6806 [2025-03-04 10:34:12,429 INFO L87 Difference]: Start difference. First operand 637 states and 708 transitions. Second operand has 83 states, 82 states have (on average 3.4878048780487805) internal successors, (286), 83 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:12,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:12,651 INFO L93 Difference]: Finished difference Result 832 states and 915 transitions. [2025-03-04 10:34:12,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-03-04 10:34:12,652 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 82 states have (on average 3.4878048780487805) internal successors, (286), 83 states have internal predecessors, (286), 0 states have call successors, (0), 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 96 [2025-03-04 10:34:12,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:12,653 INFO L225 Difference]: With dead ends: 832 [2025-03-04 10:34:12,653 INFO L226 Difference]: Without dead ends: 811 [2025-03-04 10:34:12,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3658 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1308, Invalid=5498, Unknown=0, NotChecked=0, Total=6806 [2025-03-04 10:34:12,654 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 54 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:12,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 118 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:34:12,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2025-03-04 10:34:12,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 727. [2025-03-04 10:34:12,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 724 states have (on average 1.1022099447513811) internal successors, (798), 726 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:12,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 798 transitions. [2025-03-04 10:34:12,694 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 798 transitions. Word has length 96 [2025-03-04 10:34:12,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:12,694 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 798 transitions. [2025-03-04 10:34:12,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 82 states have (on average 3.4878048780487805) internal successors, (286), 83 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:12,694 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 798 transitions. [2025-03-04 10:34:12,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 10:34:12,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:12,695 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2025-03-04 10:34:12,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-04 10:34:12,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:12,895 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:34:12,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:12,896 INFO L85 PathProgramCache]: Analyzing trace with hash -416369345, now seen corresponding path program 4 times [2025-03-04 10:34:12,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:12,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576451777] [2025-03-04 10:34:12,896 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:34:12,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:12,900 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 120 statements into 2 equivalence classes. [2025-03-04 10:34:12,918 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 10:34:12,919 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:34:12,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:13,451 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 0 proven. 504 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:13,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:13,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576451777] [2025-03-04 10:34:13,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576451777] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:13,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087955378] [2025-03-04 10:34:13,452 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:34:13,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:13,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:13,453 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:34:13,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-04 10:34:13,479 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 120 statements into 2 equivalence classes. [2025-03-04 10:34:13,494 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 10:34:13,494 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:34:13,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:13,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 10:34:13,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:34:14,268 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 0 proven. 504 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:14,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:34:15,164 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 0 proven. 504 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:15,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087955378] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:34:15,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:34:15,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 118 [2025-03-04 10:34:15,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915419218] [2025-03-04 10:34:15,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:34:15,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 119 states [2025-03-04 10:34:15,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:15,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2025-03-04 10:34:15,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2520, Invalid=11522, Unknown=0, NotChecked=0, Total=14042 [2025-03-04 10:34:15,166 INFO L87 Difference]: Start difference. First operand 727 states and 798 transitions. Second operand has 119 states, 118 states have (on average 3.0338983050847457) internal successors, (358), 119 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:15,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:15,475 INFO L93 Difference]: Finished difference Result 876 states and 960 transitions. [2025-03-04 10:34:15,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2025-03-04 10:34:15,476 INFO L78 Accepts]: Start accepts. Automaton has has 119 states, 118 states have (on average 3.0338983050847457) internal successors, (358), 119 states have internal predecessors, (358), 0 states have call successors, (0), 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 120 [2025-03-04 10:34:15,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:15,477 INFO L225 Difference]: With dead ends: 876 [2025-03-04 10:34:15,477 INFO L226 Difference]: Without dead ends: 853 [2025-03-04 10:34:15,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7912 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2520, Invalid=11522, Unknown=0, NotChecked=0, Total=14042 [2025-03-04 10:34:15,478 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 120 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:15,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 133 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:34:15,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2025-03-04 10:34:15,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 679. [2025-03-04 10:34:15,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 676 states have (on average 1.1050295857988166) internal successors, (747), 678 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:15,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 747 transitions. [2025-03-04 10:34:15,514 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 747 transitions. Word has length 120 [2025-03-04 10:34:15,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:15,514 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 747 transitions. [2025-03-04 10:34:15,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 119 states, 118 states have (on average 3.0338983050847457) internal successors, (358), 119 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:15,514 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 747 transitions. [2025-03-04 10:34:15,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 10:34:15,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:15,515 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1] [2025-03-04 10:34:15,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-04 10:34:15,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-03-04 10:34:15,716 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:34:15,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:15,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1381428395, now seen corresponding path program 2 times [2025-03-04 10:34:15,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:15,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009787571] [2025-03-04 10:34:15,716 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:34:15,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:15,720 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 160 statements into 2 equivalence classes. [2025-03-04 10:34:15,723 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 10:34:15,723 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:34:15,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:15,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 1350 trivial. 0 not checked. [2025-03-04 10:34:15,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:15,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009787571] [2025-03-04 10:34:15,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009787571] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:15,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294081695] [2025-03-04 10:34:15,762 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:34:15,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:15,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:15,764 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:34:15,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-04 10:34:15,793 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 160 statements into 2 equivalence classes. [2025-03-04 10:34:15,812 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 10:34:15,812 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:34:15,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:15,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 10:34:15,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:34:16,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:16,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:34:17,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:17,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294081695] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:34:17,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:34:17,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 40, 40] total 80 [2025-03-04 10:34:17,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529285414] [2025-03-04 10:34:17,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:34:17,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2025-03-04 10:34:17,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:17,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2025-03-04 10:34:17,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1681, Invalid=4799, Unknown=0, NotChecked=0, Total=6480 [2025-03-04 10:34:17,155 INFO L87 Difference]: Start difference. First operand 679 states and 747 transitions. Second operand has 81 states, 80 states have (on average 4.1125) internal successors, (329), 81 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:18,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:18,173 INFO L93 Difference]: Finished difference Result 1022 states and 1125 transitions. [2025-03-04 10:34:18,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2025-03-04 10:34:18,174 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 80 states have (on average 4.1125) internal successors, (329), 81 states have internal predecessors, (329), 0 states have call successors, (0), 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 160 [2025-03-04 10:34:18,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:18,175 INFO L225 Difference]: With dead ends: 1022 [2025-03-04 10:34:18,175 INFO L226 Difference]: Without dead ends: 981 [2025-03-04 10:34:18,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5530 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3258, Invalid=10784, Unknown=0, NotChecked=0, Total=14042 [2025-03-04 10:34:18,176 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 144 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:18,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 126 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:34:18,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2025-03-04 10:34:18,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 852. [2025-03-04 10:34:18,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 849 states have (on average 1.0848056537102473) internal successors, (921), 851 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:18,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 921 transitions. [2025-03-04 10:34:18,229 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 921 transitions. Word has length 160 [2025-03-04 10:34:18,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:18,230 INFO L471 AbstractCegarLoop]: Abstraction has 852 states and 921 transitions. [2025-03-04 10:34:18,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 80 states have (on average 4.1125) internal successors, (329), 81 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:18,230 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 921 transitions. [2025-03-04 10:34:18,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 10:34:18,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:18,230 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:34:18,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-03-04 10:34:18,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-04 10:34:18,431 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:34:18,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:18,431 INFO L85 PathProgramCache]: Analyzing trace with hash -552871133, now seen corresponding path program 5 times [2025-03-04 10:34:18,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:18,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531744520] [2025-03-04 10:34:18,431 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:34:18,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:18,436 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 168 statements into 20 equivalence classes. [2025-03-04 10:34:18,447 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 10:34:18,449 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2025-03-04 10:34:18,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:19,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1448 backedges. 0 proven. 1448 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:19,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:19,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531744520] [2025-03-04 10:34:19,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531744520] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:19,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725724863] [2025-03-04 10:34:19,174 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:34:19,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:19,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:19,176 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:34:19,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-04 10:34:19,203 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 168 statements into 20 equivalence classes. [2025-03-04 10:34:19,225 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 10:34:19,226 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2025-03-04 10:34:19,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:19,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-04 10:34:19,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:34:20,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1448 backedges. 0 proven. 1448 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:20,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:34:21,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1448 backedges. 0 proven. 1448 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:21,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725724863] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:34:21,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:34:21,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 130 [2025-03-04 10:34:21,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260492694] [2025-03-04 10:34:21,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:34:21,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 131 states [2025-03-04 10:34:21,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:21,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2025-03-04 10:34:21,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3612, Invalid=13418, Unknown=0, NotChecked=0, Total=17030 [2025-03-04 10:34:21,393 INFO L87 Difference]: Start difference. First operand 852 states and 921 transitions. Second operand has 131 states, 130 states have (on average 3.8615384615384616) internal successors, (502), 131 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:21,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:21,804 INFO L93 Difference]: Finished difference Result 1457 states and 1579 transitions. [2025-03-04 10:34:21,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2025-03-04 10:34:21,804 INFO L78 Accepts]: Start accepts. Automaton has has 131 states, 130 states have (on average 3.8615384615384616) internal successors, (502), 131 states have internal predecessors, (502), 0 states have call successors, (0), 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 168 [2025-03-04 10:34:21,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:21,806 INFO L225 Difference]: With dead ends: 1457 [2025-03-04 10:34:21,806 INFO L226 Difference]: Without dead ends: 1416 [2025-03-04 10:34:21,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9346 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3612, Invalid=13418, Unknown=0, NotChecked=0, Total=17030 [2025-03-04 10:34:21,807 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 109 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:21,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 162 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:34:21,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2025-03-04 10:34:21,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1280. [2025-03-04 10:34:21,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1277 states have (on average 1.0689115113547376) internal successors, (1365), 1279 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:21,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1365 transitions. [2025-03-04 10:34:21,908 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1365 transitions. Word has length 168 [2025-03-04 10:34:21,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:21,908 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1365 transitions. [2025-03-04 10:34:21,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 131 states, 130 states have (on average 3.8615384615384616) internal successors, (502), 131 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:21,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1365 transitions. [2025-03-04 10:34:21,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-04 10:34:21,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:21,909 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2025-03-04 10:34:21,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-03-04 10:34:22,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-04 10:34:22,110 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:34:22,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:22,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1711680247, now seen corresponding path program 5 times [2025-03-04 10:34:22,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:22,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597408204] [2025-03-04 10:34:22,110 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:34:22,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:22,115 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 176 statements into 16 equivalence classes. [2025-03-04 10:34:22,143 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 10:34:22,143 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2025-03-04 10:34:22,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:23,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1324 backedges. 0 proven. 1324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:23,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:23,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597408204] [2025-03-04 10:34:23,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597408204] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:23,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143950037] [2025-03-04 10:34:23,564 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:34:23,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:23,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:23,566 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:34:23,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-04 10:34:23,595 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 176 statements into 16 equivalence classes. [2025-03-04 10:34:23,631 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 10:34:23,631 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2025-03-04 10:34:23,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:23,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-03-04 10:34:23,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:34:25,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1324 backedges. 0 proven. 1324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:25,249 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:34:27,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1324 backedges. 0 proven. 1324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:27,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143950037] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:34:27,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:34:27,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 196 [2025-03-04 10:34:27,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27452985] [2025-03-04 10:34:27,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:34:27,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 197 states [2025-03-04 10:34:27,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:27,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 197 interpolants. [2025-03-04 10:34:27,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7018, Invalid=31594, Unknown=0, NotChecked=0, Total=38612 [2025-03-04 10:34:27,890 INFO L87 Difference]: Start difference. First operand 1280 states and 1365 transitions. Second operand has 197 states, 196 states have (on average 2.683673469387755) internal successors, (526), 197 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:28,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:28,520 INFO L93 Difference]: Finished difference Result 1323 states and 1407 transitions. [2025-03-04 10:34:28,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2025-03-04 10:34:28,520 INFO L78 Accepts]: Start accepts. Automaton has has 197 states, 196 states have (on average 2.683673469387755) internal successors, (526), 197 states have internal predecessors, (526), 0 states have call successors, (0), 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 176 [2025-03-04 10:34:28,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:28,523 INFO L225 Difference]: With dead ends: 1323 [2025-03-04 10:34:28,523 INFO L226 Difference]: Without dead ends: 1280 [2025-03-04 10:34:28,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22388 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7018, Invalid=31594, Unknown=0, NotChecked=0, Total=38612 [2025-03-04 10:34:28,524 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 268 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:28,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 197 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:34:28,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2025-03-04 10:34:28,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1018. [2025-03-04 10:34:28,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1015 states have (on average 1.0660098522167487) internal successors, (1082), 1017 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:28,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1082 transitions. [2025-03-04 10:34:28,617 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1082 transitions. Word has length 176 [2025-03-04 10:34:28,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:28,617 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 1082 transitions. [2025-03-04 10:34:28,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 197 states, 196 states have (on average 2.683673469387755) internal successors, (526), 197 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:28,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1082 transitions. [2025-03-04 10:34:28,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-04 10:34:28,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:28,618 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 22, 22, 1, 1, 1] [2025-03-04 10:34:28,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-03-04 10:34:28,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-04 10:34:28,819 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:34:28,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:28,819 INFO L85 PathProgramCache]: Analyzing trace with hash 790473175, now seen corresponding path program 2 times [2025-03-04 10:34:28,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:28,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921830303] [2025-03-04 10:34:28,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:34:28,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:28,828 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 185 statements into 2 equivalence classes. [2025-03-04 10:34:28,828 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 185 statements. [2025-03-04 10:34:28,828 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:34:28,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:28,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2025-03-04 10:34:28,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:28,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921830303] [2025-03-04 10:34:28,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921830303] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:28,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904001858] [2025-03-04 10:34:28,839 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:34:28,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:28,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:28,841 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:34:28,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-04 10:34:28,868 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 185 statements into 2 equivalence classes. [2025-03-04 10:34:28,870 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 185 statements. [2025-03-04 10:34:28,870 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:34:28,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:28,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:34:28,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:34:28,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2025-03-04 10:34:28,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:34:29,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2025-03-04 10:34:29,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904001858] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:34:29,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:34:29,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-03-04 10:34:29,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895350795] [2025-03-04 10:34:29,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:34:29,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:34:29,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:29,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:34:29,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:34:29,099 INFO L87 Difference]: Start difference. First operand 1018 states and 1082 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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-03-04 10:34:29,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:29,179 INFO L93 Difference]: Finished difference Result 1018 states and 1082 transitions. [2025-03-04 10:34:29,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:34:29,179 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 185 [2025-03-04 10:34:29,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:29,180 INFO L225 Difference]: With dead ends: 1018 [2025-03-04 10:34:29,180 INFO L226 Difference]: Without dead ends: 836 [2025-03-04 10:34:29,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 367 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:34:29,181 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 22 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:29,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 44 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:34:29,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2025-03-04 10:34:29,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 660. [2025-03-04 10:34:29,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 658 states have (on average 1.0638297872340425) internal successors, (700), 659 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:29,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 700 transitions. [2025-03-04 10:34:29,228 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 700 transitions. Word has length 185 [2025-03-04 10:34:29,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:29,228 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 700 transitions. [2025-03-04 10:34:29,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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-03-04 10:34:29,228 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 700 transitions. [2025-03-04 10:34:29,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-04 10:34:29,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:29,229 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 20, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:34:29,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-03-04 10:34:29,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-04 10:34:29,429 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:34:29,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:29,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1994001521, now seen corresponding path program 6 times [2025-03-04 10:34:29,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:29,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709258417] [2025-03-04 10:34:29,430 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:34:29,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:29,435 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 192 statements into 21 equivalence classes. [2025-03-04 10:34:29,448 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 10:34:29,448 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2025-03-04 10:34:29,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:30,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1788 backedges. 0 proven. 1788 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:30,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:30,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709258417] [2025-03-04 10:34:30,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709258417] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:30,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189004718] [2025-03-04 10:34:30,328 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:34:30,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:30,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:30,330 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:34:30,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-03-04 10:34:30,358 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 192 statements into 21 equivalence classes. [2025-03-04 10:34:30,386 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 10:34:30,386 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2025-03-04 10:34:30,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:30,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-04 10:34:30,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:34:31,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1788 backedges. 0 proven. 1788 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:31,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:34:33,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1788 backedges. 0 proven. 1788 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:33,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189004718] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:34:33,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:34:33,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 154 [2025-03-04 10:34:33,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528191640] [2025-03-04 10:34:33,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:34:33,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 155 states [2025-03-04 10:34:33,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:33,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2025-03-04 10:34:33,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4788, Invalid=19082, Unknown=0, NotChecked=0, Total=23870 [2025-03-04 10:34:33,180 INFO L87 Difference]: Start difference. First operand 660 states and 700 transitions. Second operand has 155 states, 154 states have (on average 3.727272727272727) internal successors, (574), 155 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:33,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:33,674 INFO L93 Difference]: Finished difference Result 1288 states and 1349 transitions. [2025-03-04 10:34:33,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2025-03-04 10:34:33,675 INFO L78 Accepts]: Start accepts. Automaton has has 155 states, 154 states have (on average 3.727272727272727) internal successors, (574), 155 states have internal predecessors, (574), 0 states have call successors, (0), 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 192 [2025-03-04 10:34:33,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:33,677 INFO L225 Difference]: With dead ends: 1288 [2025-03-04 10:34:33,677 INFO L226 Difference]: Without dead ends: 1243 [2025-03-04 10:34:33,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13414 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4788, Invalid=19082, Unknown=0, NotChecked=0, Total=23870 [2025-03-04 10:34:33,678 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 107 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:33,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 186 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:34:33,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2025-03-04 10:34:33,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 692. [2025-03-04 10:34:33,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 690 states have (on average 1.0608695652173914) internal successors, (732), 691 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:33,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 732 transitions. [2025-03-04 10:34:33,750 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 732 transitions. Word has length 192 [2025-03-04 10:34:33,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:33,750 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 732 transitions. [2025-03-04 10:34:33,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 155 states, 154 states have (on average 3.727272727272727) internal successors, (574), 155 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:33,750 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 732 transitions. [2025-03-04 10:34:33,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-04 10:34:33,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:33,751 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 25, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1] [2025-03-04 10:34:33,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-03-04 10:34:33,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2025-03-04 10:34:33,952 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:34:33,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:33,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1019574634, now seen corresponding path program 3 times [2025-03-04 10:34:33,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:33,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371942159] [2025-03-04 10:34:33,952 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:34:33,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:33,957 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 203 statements into 18 equivalence classes. [2025-03-04 10:34:33,983 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) and asserted 203 of 203 statements. [2025-03-04 10:34:33,984 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2025-03-04 10:34:33,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:35,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1827 backedges. 0 proven. 1827 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:35,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:35,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371942159] [2025-03-04 10:34:35,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371942159] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:35,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400760796] [2025-03-04 10:34:35,144 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:34:35,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:35,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:35,146 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:34:35,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-03-04 10:34:35,178 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 203 statements into 18 equivalence classes. [2025-03-04 10:34:35,223 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) and asserted 203 of 203 statements. [2025-03-04 10:34:35,223 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2025-03-04 10:34:35,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:35,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-04 10:34:35,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:34:35,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1827 backedges. 0 proven. 1827 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:35,388 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:34:36,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1827 backedges. 0 proven. 1827 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:36,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400760796] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:34:36,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:34:36,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2025-03-04 10:34:36,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897392490] [2025-03-04 10:34:36,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:34:36,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 106 states [2025-03-04 10:34:36,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:36,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2025-03-04 10:34:36,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2861, Invalid=8269, Unknown=0, NotChecked=0, Total=11130 [2025-03-04 10:34:36,932 INFO L87 Difference]: Start difference. First operand 692 states and 732 transitions. Second operand has 106 states, 105 states have (on average 3.857142857142857) internal successors, (405), 106 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:37,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:37,673 INFO L93 Difference]: Finished difference Result 2672 states and 2759 transitions. [2025-03-04 10:34:37,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2025-03-04 10:34:37,674 INFO L78 Accepts]: Start accepts. Automaton has has 106 states, 105 states have (on average 3.857142857142857) internal successors, (405), 106 states have internal predecessors, (405), 0 states have call successors, (0), 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 203 [2025-03-04 10:34:37,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:37,677 INFO L225 Difference]: With dead ends: 2672 [2025-03-04 10:34:37,677 INFO L226 Difference]: Without dead ends: 2671 [2025-03-04 10:34:37,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3226 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2861, Invalid=8269, Unknown=0, NotChecked=0, Total=11130 [2025-03-04 10:34:37,679 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 381 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:37,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 353 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:34:37,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2671 states. [2025-03-04 10:34:37,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2671 to 781. [2025-03-04 10:34:37,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 779 states have (on average 1.0462130937098844) internal successors, (815), 780 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:37,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 815 transitions. [2025-03-04 10:34:37,759 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 815 transitions. Word has length 203 [2025-03-04 10:34:37,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:37,759 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 815 transitions. [2025-03-04 10:34:37,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 106 states, 105 states have (on average 3.857142857142857) internal successors, (405), 106 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:37,759 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 815 transitions. [2025-03-04 10:34:37,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-04 10:34:37,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:37,760 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 17, 10, 10, 10, 5, 5, 5, 1, 1, 1, 1, 1] [2025-03-04 10:34:37,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-03-04 10:34:37,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:37,960 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:34:37,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:37,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1261665033, now seen corresponding path program 7 times [2025-03-04 10:34:37,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:37,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395033878] [2025-03-04 10:34:37,961 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:34:37,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:37,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-04 10:34:37,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-04 10:34:37,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:34:37,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:39,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1944 backedges. 0 proven. 1944 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:39,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:39,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395033878] [2025-03-04 10:34:39,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395033878] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:39,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642401378] [2025-03-04 10:34:39,253 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:34:39,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:39,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:39,254 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:34:39,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-03-04 10:34:39,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-04 10:34:39,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-04 10:34:39,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:34:39,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:39,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-04 10:34:39,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:34:40,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1944 backedges. 0 proven. 1944 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:40,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:34:43,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1944 backedges. 0 proven. 1944 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:43,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642401378] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:34:43,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:34:43,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 190 [2025-03-04 10:34:43,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288783772] [2025-03-04 10:34:43,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:34:43,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 191 states [2025-03-04 10:34:43,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:43,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 191 interpolants. [2025-03-04 10:34:43,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6576, Invalid=29714, Unknown=0, NotChecked=0, Total=36290 [2025-03-04 10:34:43,237 INFO L87 Difference]: Start difference. First operand 781 states and 815 transitions. Second operand has 191 states, 190 states have (on average 3.4) internal successors, (646), 191 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:43,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:43,953 INFO L93 Difference]: Finished difference Result 1475 states and 1530 transitions. [2025-03-04 10:34:43,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2025-03-04 10:34:43,953 INFO L78 Accepts]: Start accepts. Automaton has has 191 states, 190 states have (on average 3.4) internal successors, (646), 191 states have internal predecessors, (646), 0 states have call successors, (0), 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 216 [2025-03-04 10:34:43,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:43,955 INFO L225 Difference]: With dead ends: 1475 [2025-03-04 10:34:43,955 INFO L226 Difference]: Without dead ends: 1430 [2025-03-04 10:34:43,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21052 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6576, Invalid=29714, Unknown=0, NotChecked=0, Total=36290 [2025-03-04 10:34:43,957 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 164 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:43,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 198 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:34:43,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2025-03-04 10:34:44,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 781. [2025-03-04 10:34:44,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 779 states have (on average 1.0462130937098844) internal successors, (815), 780 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:44,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 815 transitions. [2025-03-04 10:34:44,069 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 815 transitions. Word has length 216 [2025-03-04 10:34:44,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:44,070 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 815 transitions. [2025-03-04 10:34:44,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 191 states, 190 states have (on average 3.4) internal successors, (646), 191 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:44,070 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 815 transitions. [2025-03-04 10:34:44,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-04 10:34:44,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:44,071 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2025-03-04 10:34:44,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-03-04 10:34:44,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:44,272 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:34:44,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:44,272 INFO L85 PathProgramCache]: Analyzing trace with hash 79980999, now seen corresponding path program 8 times [2025-03-04 10:34:44,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:44,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958489136] [2025-03-04 10:34:44,272 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:34:44,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:44,279 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 264 statements into 2 equivalence classes. [2025-03-04 10:34:44,296 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 264 of 264 statements. [2025-03-04 10:34:44,296 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:34:44,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:46,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2688 backedges. 0 proven. 2688 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:46,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:46,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958489136] [2025-03-04 10:34:46,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958489136] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:46,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362387620] [2025-03-04 10:34:46,726 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:34:46,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:46,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:46,728 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:34:46,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-03-04 10:34:46,762 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 264 statements into 2 equivalence classes. [2025-03-04 10:34:46,798 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 264 of 264 statements. [2025-03-04 10:34:46,798 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:34:46,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:46,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-03-04 10:34:46,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:34:49,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2688 backedges. 0 proven. 2688 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:49,521 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:34:53,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2688 backedges. 0 proven. 2688 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:53,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362387620] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:34:53,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:34:53,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 262 [2025-03-04 10:34:53,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017294244] [2025-03-04 10:34:53,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:34:53,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 263 states [2025-03-04 10:34:53,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:53,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 263 interpolants. [2025-03-04 10:34:53,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11880, Invalid=57026, Unknown=0, NotChecked=0, Total=68906 [2025-03-04 10:34:53,618 INFO L87 Difference]: Start difference. First operand 781 states and 815 transitions. Second operand has 263 states, 262 states have (on average 3.015267175572519) internal successors, (790), 263 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:54,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:54,922 INFO L93 Difference]: Finished difference Result 1307 states and 1362 transitions. [2025-03-04 10:34:54,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2025-03-04 10:34:54,922 INFO L78 Accepts]: Start accepts. Automaton has has 263 states, 262 states have (on average 3.015267175572519) internal successors, (790), 263 states have internal predecessors, (790), 0 states have call successors, (0), 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 264 [2025-03-04 10:34:54,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:54,924 INFO L225 Difference]: With dead ends: 1307 [2025-03-04 10:34:54,924 INFO L226 Difference]: Without dead ends: 1260 [2025-03-04 10:34:54,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40864 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11880, Invalid=57026, Unknown=0, NotChecked=0, Total=68906 [2025-03-04 10:34:54,927 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 250 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:54,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 260 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1124 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:34:54,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2025-03-04 10:34:55,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 781. [2025-03-04 10:34:55,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 779 states have (on average 1.0449293966623876) internal successors, (814), 780 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:55,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 814 transitions. [2025-03-04 10:34:55,064 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 814 transitions. Word has length 264 [2025-03-04 10:34:55,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:55,064 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 814 transitions. [2025-03-04 10:34:55,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 263 states, 262 states have (on average 3.015267175572519) internal successors, (790), 263 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:55,064 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 814 transitions. [2025-03-04 10:34:55,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2025-03-04 10:34:55,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:55,066 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 43, 43, 43, 43, 43, 43, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:34:55,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2025-03-04 10:34:55,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2025-03-04 10:34:55,270 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:34:55,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:55,270 INFO L85 PathProgramCache]: Analyzing trace with hash 547191443, now seen corresponding path program 9 times [2025-03-04 10:34:55,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:55,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318923744] [2025-03-04 10:34:55,270 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:34:55,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:55,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 360 statements into 44 equivalence classes. [2025-03-04 10:34:55,294 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) and asserted 360 of 360 statements. [2025-03-04 10:34:55,294 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2025-03-04 10:34:55,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:58,268 INFO L134 CoverageAnalysis]: Checked inductivity of 7400 backedges. 0 proven. 7400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:34:58,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:58,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318923744] [2025-03-04 10:34:58,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318923744] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:58,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405865727] [2025-03-04 10:34:58,268 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:34:58,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:58,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:58,270 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:34:58,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-03-04 10:34:58,303 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 360 statements into 44 equivalence classes. [2025-03-04 10:34:58,364 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) and asserted 360 of 360 statements. [2025-03-04 10:34:58,365 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2025-03-04 10:34:58,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:58,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 93 conjuncts are in the unsatisfiable core [2025-03-04 10:34:58,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:35:01,511 INFO L134 CoverageAnalysis]: Checked inductivity of 7400 backedges. 0 proven. 7400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:35:01,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:35:06,476 INFO L134 CoverageAnalysis]: Checked inductivity of 7400 backedges. 0 proven. 7400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:35:06,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405865727] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:35:06,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:35:06,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 274 [2025-03-04 10:35:06,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220453605] [2025-03-04 10:35:06,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:35:06,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 275 states [2025-03-04 10:35:06,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:35:06,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 275 interpolants. [2025-03-04 10:35:06,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16332, Invalid=59018, Unknown=0, NotChecked=0, Total=75350 [2025-03-04 10:35:06,486 INFO L87 Difference]: Start difference. First operand 781 states and 814 transitions. Second operand has 275 states, 274 states have (on average 3.934306569343066) internal successors, (1078), 275 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:35:08,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:35:08,030 INFO L93 Difference]: Finished difference Result 1859 states and 1935 transitions. [2025-03-04 10:35:08,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2025-03-04 10:35:08,031 INFO L78 Accepts]: Start accepts. Automaton has has 275 states, 274 states have (on average 3.934306569343066) internal successors, (1078), 275 states have internal predecessors, (1078), 0 states have call successors, (0), 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 360 [2025-03-04 10:35:08,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:35:08,033 INFO L225 Difference]: With dead ends: 1859 [2025-03-04 10:35:08,033 INFO L226 Difference]: Without dead ends: 1770 [2025-03-04 10:35:08,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 810 GetRequests, 537 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42730 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=16332, Invalid=59018, Unknown=0, NotChecked=0, Total=75350 [2025-03-04 10:35:08,037 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 351 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:35:08,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 272 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1001 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:35:08,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2025-03-04 10:35:08,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1133. [2025-03-04 10:35:08,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 1131 states have (on average 1.030946065428824) internal successors, (1166), 1132 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:35:08,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1166 transitions. [2025-03-04 10:35:08,398 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1166 transitions. Word has length 360 [2025-03-04 10:35:08,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:35:08,398 INFO L471 AbstractCegarLoop]: Abstraction has 1133 states and 1166 transitions. [2025-03-04 10:35:08,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 275 states, 274 states have (on average 3.934306569343066) internal successors, (1078), 275 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:35:08,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1166 transitions. [2025-03-04 10:35:08,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2025-03-04 10:35:08,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:35:08,400 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2025-03-04 10:35:08,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2025-03-04 10:35:08,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:35:08,600 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:35:08,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:35:08,601 INFO L85 PathProgramCache]: Analyzing trace with hash 869391969, now seen corresponding path program 6 times [2025-03-04 10:35:08,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:35:08,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400729666] [2025-03-04 10:35:08,601 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:35:08,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:35:08,607 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 368 statements into 32 equivalence classes. [2025-03-04 10:35:08,727 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 32 check-sat command(s) and asserted 368 of 368 statements. [2025-03-04 10:35:08,727 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 32 check-sat command(s) [2025-03-04 10:35:08,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:35:14,887 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:35:14,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:35:14,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400729666] [2025-03-04 10:35:14,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400729666] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:35:14,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465207691] [2025-03-04 10:35:14,888 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:35:14,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:35:14,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:35:14,909 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:35:14,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-03-04 10:35:14,983 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 368 statements into 32 equivalence classes. [2025-03-04 10:35:15,088 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 32 check-sat command(s) and asserted 368 of 368 statements. [2025-03-04 10:35:15,088 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 32 check-sat command(s) [2025-03-04 10:35:15,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:35:15,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 139 conjuncts are in the unsatisfiable core [2025-03-04 10:35:15,096 INFO L279 TraceCheckSpWp]: Computing forward predicates...