./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/MenloPark.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed 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-crafted/MenloPark.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 6dae4b60aa9efa1955ef5fbb576e87a787ed072bbe9c11eb4417a5220402d102 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:41:11,102 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:41:11,152 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 01:41:11,156 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:41:11,156 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:41:11,170 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:41:11,171 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:41:11,171 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:41:11,171 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:41:11,171 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:41:11,171 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:41:11,171 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:41:11,172 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:41:11,172 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:41:11,172 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:41:11,172 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:41:11,172 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:41:11,172 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:41:11,172 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:41:11,172 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:41:11,172 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:41:11,172 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:41:11,172 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:41:11,172 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:41:11,172 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:41:11,172 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:41:11,172 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:41:11,172 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:41:11,172 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:41:11,172 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:41:11,172 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:41:11,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:41:11,173 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:41:11,173 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:41:11,173 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:41:11,173 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:41:11,173 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:41:11,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:41:11,173 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:41:11,173 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:41:11,173 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:41:11,173 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:41:11,173 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 -> 6dae4b60aa9efa1955ef5fbb576e87a787ed072bbe9c11eb4417a5220402d102 [2025-03-09 01:41:11,384 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:41:11,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:41:11,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:41:11,394 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:41:11,394 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:41:11,395 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/MenloPark.c [2025-03-09 01:41:12,533 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af2ae1880/578bf3788db44f969589367b8cb2ab1d/FLAG29137dfc0 [2025-03-09 01:41:12,731 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:41:12,736 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/MenloPark.c [2025-03-09 01:41:12,747 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af2ae1880/578bf3788db44f969589367b8cb2ab1d/FLAG29137dfc0 [2025-03-09 01:41:12,797 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af2ae1880/578bf3788db44f969589367b8cb2ab1d [2025-03-09 01:41:12,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:41:12,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:41:12,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:41:12,807 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:41:12,811 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:41:12,813 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:41:12" (1/1) ... [2025-03-09 01:41:12,813 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cae1d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:41:12, skipping insertion in model container [2025-03-09 01:41:12,814 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:41:12" (1/1) ... [2025-03-09 01:41:12,824 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:41:12,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:41:12,921 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:41:12,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:41:12,939 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:41:12,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:41:12 WrapperNode [2025-03-09 01:41:12,940 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:41:12,941 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:41:12,941 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:41:12,941 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:41:12,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:41:12" (1/1) ... [2025-03-09 01:41:12,948 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:41:12" (1/1) ... [2025-03-09 01:41:12,957 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2025-03-09 01:41:12,958 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:41:12,959 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:41:12,959 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:41:12,959 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:41:12,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:41:12" (1/1) ... [2025-03-09 01:41:12,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:41:12" (1/1) ... [2025-03-09 01:41:12,964 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:41:12" (1/1) ... [2025-03-09 01:41:12,967 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-09 01:41:12,967 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:41:12" (1/1) ... [2025-03-09 01:41:12,967 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:41:12" (1/1) ... [2025-03-09 01:41:12,968 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:41:12" (1/1) ... [2025-03-09 01:41:12,969 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:41:12" (1/1) ... [2025-03-09 01:41:12,969 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:41:12" (1/1) ... [2025-03-09 01:41:12,969 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:41:12" (1/1) ... [2025-03-09 01:41:12,970 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:41:12,971 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:41:12,971 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:41:12,971 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:41:12,971 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:41:12" (1/1) ... [2025-03-09 01:41:12,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:41:12,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:41:12,994 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-09 01:41:12,997 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-09 01:41:13,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:41:13,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:41:13,059 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:41:13,061 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:41:13,153 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-09 01:41:13,153 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:41:13,162 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:41:13,162 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:41:13,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:41:13 BoogieIcfgContainer [2025-03-09 01:41:13,163 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:41:13,165 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:41:13,165 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:41:13,168 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:41:13,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:41:12" (1/3) ... [2025-03-09 01:41:13,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10f5ccfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:41:13, skipping insertion in model container [2025-03-09 01:41:13,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:41:12" (2/3) ... [2025-03-09 01:41:13,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10f5ccfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:41:13, skipping insertion in model container [2025-03-09 01:41:13,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:41:13" (3/3) ... [2025-03-09 01:41:13,171 INFO L128 eAbstractionObserver]: Analyzing ICFG MenloPark.c [2025-03-09 01:41:13,183 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:41:13,184 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG MenloPark.c that has 1 procedures, 18 locations, 1 initial locations, 1 loop locations, and 6 error locations. [2025-03-09 01:41:13,228 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:41:13,238 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;@7f843917, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:41:13,239 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 01:41:13,243 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 17 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-09 01:41:13,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 01:41:13,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:41:13,247 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 01:41:13,247 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-09 01:41:13,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:41:13,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1445823, now seen corresponding path program 1 times [2025-03-09 01:41:13,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:41:13,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201295717] [2025-03-09 01:41:13,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:41:13,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:41:13,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:41:13,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:41:13,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:41:13,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:13,380 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-09 01:41:13,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:41:13,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201295717] [2025-03-09 01:41:13,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201295717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:41:13,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:41:13,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:41:13,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749169340] [2025-03-09 01:41:13,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:41:13,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:41:13,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:41:13,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:41:13,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:41:13,407 INFO L87 Difference]: Start difference. First operand has 18 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 17 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) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 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-09 01:41:13,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:41:13,473 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2025-03-09 01:41:13,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:41:13,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2025-03-09 01:41:13,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:41:13,478 INFO L225 Difference]: With dead ends: 25 [2025-03-09 01:41:13,479 INFO L226 Difference]: Without dead ends: 20 [2025-03-09 01:41:13,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:41:13,482 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:41:13,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 25 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:41:13,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-09 01:41:13,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2025-03-09 01:41:13,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:41:13,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2025-03-09 01:41:13,505 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 4 [2025-03-09 01:41:13,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:41:13,506 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2025-03-09 01:41:13,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 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-09 01:41:13,506 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2025-03-09 01:41:13,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 01:41:13,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:41:13,507 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 01:41:13,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:41:13,508 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-09 01:41:13,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:41:13,508 INFO L85 PathProgramCache]: Analyzing trace with hash 44820494, now seen corresponding path program 1 times [2025-03-09 01:41:13,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:41:13,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741923836] [2025-03-09 01:41:13,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:41:13,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:41:13,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:41:13,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:41:13,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:41:13,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:13,546 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-09 01:41:13,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:41:13,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741923836] [2025-03-09 01:41:13,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741923836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:41:13,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:41:13,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:41:13,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562197689] [2025-03-09 01:41:13,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:41:13,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:41:13,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:41:13,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:41:13,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:41:13,549 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:41:13,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:41:13,571 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2025-03-09 01:41:13,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:41:13,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-09 01:41:13,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:41:13,572 INFO L225 Difference]: With dead ends: 19 [2025-03-09 01:41:13,572 INFO L226 Difference]: Without dead ends: 18 [2025-03-09 01:41:13,572 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-09 01:41:13,573 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:41:13,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:41:13,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-09 01:41:13,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-09 01:41:13,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.5) internal successors, (18), 17 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-09 01:41:13,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2025-03-09 01:41:13,576 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 5 [2025-03-09 01:41:13,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:41:13,577 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2025-03-09 01:41:13,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:41:13,577 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2025-03-09 01:41:13,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 01:41:13,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:41:13,577 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:41:13,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:41:13,577 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:41:13,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:41:13,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1389435293, now seen corresponding path program 1 times [2025-03-09 01:41:13,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:41:13,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282355089] [2025-03-09 01:41:13,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:41:13,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:41:13,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:41:13,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:41:13,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:41:13,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:13,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:13,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:41:13,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282355089] [2025-03-09 01:41:13,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282355089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:41:13,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:41:13,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:41:13,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575863346] [2025-03-09 01:41:13,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:41:13,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:41:13,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:41:13,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:41:13,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:41:13,617 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:41:13,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:41:13,644 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2025-03-09 01:41:13,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:41:13,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-09 01:41:13,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:41:13,647 INFO L225 Difference]: With dead ends: 21 [2025-03-09 01:41:13,647 INFO L226 Difference]: Without dead ends: 20 [2025-03-09 01:41:13,648 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-09 01:41:13,649 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:41:13,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 12 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:41:13,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-09 01:41:13,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2025-03-09 01:41:13,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 18 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-09 01:41:13,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2025-03-09 01:41:13,655 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 6 [2025-03-09 01:41:13,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:41:13,655 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2025-03-09 01:41:13,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:41:13,655 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2025-03-09 01:41:13,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 01:41:13,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:41:13,656 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:41:13,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:41:13,656 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:41:13,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:41:13,657 INFO L85 PathProgramCache]: Analyzing trace with hash 122821100, now seen corresponding path program 1 times [2025-03-09 01:41:13,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:41:13,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144250502] [2025-03-09 01:41:13,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:41:13,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:41:13,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:41:13,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:41:13,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:41:13,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:13,706 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-09 01:41:13,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:41:13,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144250502] [2025-03-09 01:41:13,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144250502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:41:13,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:41:13,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:41:13,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294138111] [2025-03-09 01:41:13,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:41:13,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:41:13,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:41:13,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:41:13,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:41:13,707 INFO L87 Difference]: Start difference. First operand 19 states and 19 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-09 01:41:13,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:41:13,729 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2025-03-09 01:41:13,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:41:13,729 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-09 01:41:13,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:41:13,730 INFO L225 Difference]: With dead ends: 21 [2025-03-09 01:41:13,730 INFO L226 Difference]: Without dead ends: 20 [2025-03-09 01:41:13,730 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-09 01:41:13,732 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 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-09 01:41:13,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:41:13,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-09 01:41:13,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-09 01:41:13,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 19 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:41:13,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2025-03-09 01:41:13,739 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 7 [2025-03-09 01:41:13,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:41:13,740 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2025-03-09 01:41:13,740 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-09 01:41:13,740 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2025-03-09 01:41:13,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 01:41:13,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:41:13,740 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:41:13,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:41:13,741 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:41:13,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:41:13,741 INFO L85 PathProgramCache]: Analyzing trace with hash -487513221, now seen corresponding path program 1 times [2025-03-09 01:41:13,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:41:13,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364449177] [2025-03-09 01:41:13,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:41:13,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:41:13,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:41:13,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:41:13,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:41:13,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:13,768 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-09 01:41:13,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:41:13,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364449177] [2025-03-09 01:41:13,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364449177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:41:13,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:41:13,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:41:13,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041690013] [2025-03-09 01:41:13,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:41:13,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:41:13,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:41:13,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:41:13,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:41:13,769 INFO L87 Difference]: Start difference. First operand 20 states and 20 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-09 01:41:13,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:41:13,783 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2025-03-09 01:41:13,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:41:13,783 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-09 01:41:13,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:41:13,783 INFO L225 Difference]: With dead ends: 23 [2025-03-09 01:41:13,783 INFO L226 Difference]: Without dead ends: 22 [2025-03-09 01:41:13,784 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-09 01:41:13,784 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:41:13,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 16 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:41:13,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-09 01:41:13,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2025-03-09 01:41:13,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.4) internal successors, (21), 20 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-09 01:41:13,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2025-03-09 01:41:13,786 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 8 [2025-03-09 01:41:13,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:41:13,788 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2025-03-09 01:41:13,788 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-09 01:41:13,788 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2025-03-09 01:41:13,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 01:41:13,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:41:13,789 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:41:13,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:41:13,789 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:41:13,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:41:13,790 INFO L85 PathProgramCache]: Analyzing trace with hash 2066959306, now seen corresponding path program 1 times [2025-03-09 01:41:13,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:41:13,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775790652] [2025-03-09 01:41:13,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:41:13,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:41:13,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:41:13,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:41:13,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:41:13,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:13,828 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-09 01:41:13,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:41:13,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775790652] [2025-03-09 01:41:13,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775790652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:41:13,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:41:13,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:41:13,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263511903] [2025-03-09 01:41:13,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:41:13,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:41:13,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:41:13,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:41:13,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:41:13,830 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-09 01:41:13,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:41:13,846 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2025-03-09 01:41:13,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:41:13,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-09 01:41:13,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:41:13,847 INFO L225 Difference]: With dead ends: 23 [2025-03-09 01:41:13,848 INFO L226 Difference]: Without dead ends: 22 [2025-03-09 01:41:13,848 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-09 01:41:13,848 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:41:13,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:41:13,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-09 01:41:13,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-09 01:41:13,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.375) internal successors, (22), 21 states have internal predecessors, (22), 0 states have call successors, (0), 0 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-09 01:41:13,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2025-03-09 01:41:13,853 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 9 [2025-03-09 01:41:13,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:41:13,853 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2025-03-09 01:41:13,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-09 01:41:13,853 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2025-03-09 01:41:13,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-09 01:41:13,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:41:13,854 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:41:13,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:41:13,854 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:41:13,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:41:13,855 INFO L85 PathProgramCache]: Analyzing trace with hash 2073001832, now seen corresponding path program 1 times [2025-03-09 01:41:13,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:41:13,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547881656] [2025-03-09 01:41:13,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:41:13,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:41:13,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:41:13,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:41:13,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:41:13,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:13,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:13,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:41:13,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547881656] [2025-03-09 01:41:13,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547881656] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:41:13,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124742961] [2025-03-09 01:41:13,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:41:13,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:41:13,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:41:13,904 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-09 01:41:13,906 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-09 01:41:13,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:41:13,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:41:13,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:41:13,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:13,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:41:13,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:41:14,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:14,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:41:14,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:14,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124742961] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:41:14,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:41:14,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-09 01:41:14,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217745412] [2025-03-09 01:41:14,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:41:14,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:41:14,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:41:14,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:41:14,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:41:14,069 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 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-09 01:41:14,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:41:14,151 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2025-03-09 01:41:14,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:41:14,152 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-09 01:41:14,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:41:14,152 INFO L225 Difference]: With dead ends: 27 [2025-03-09 01:41:14,152 INFO L226 Difference]: Without dead ends: 26 [2025-03-09 01:41:14,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:41:14,153 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 16 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:41:14,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 22 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:41:14,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-09 01:41:14,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2025-03-09 01:41:14,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 20 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-09 01:41:14,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2025-03-09 01:41:14,155 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 11 [2025-03-09 01:41:14,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:41:14,156 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2025-03-09 01:41:14,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 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-09 01:41:14,156 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2025-03-09 01:41:14,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 01:41:14,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:41:14,156 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:41:14,162 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-09 01:41:14,357 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-09 01:41:14,357 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:41:14,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:41:14,357 INFO L85 PathProgramCache]: Analyzing trace with hash -161452667, now seen corresponding path program 1 times [2025-03-09 01:41:14,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:41:14,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718492426] [2025-03-09 01:41:14,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:41:14,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:41:14,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:41:14,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:41:14,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:41:14,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:14,414 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-09 01:41:14,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:41:14,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718492426] [2025-03-09 01:41:14,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718492426] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:41:14,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206606928] [2025-03-09 01:41:14,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:41:14,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:41:14,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:41:14,417 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-09 01:41:14,418 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-09 01:41:14,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:41:14,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:41:14,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:41:14,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:14,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:41:14,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:41:14,529 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-09 01:41:14,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:41:14,570 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-09 01:41:14,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206606928] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:41:14,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:41:14,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-09 01:41:14,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961758847] [2025-03-09 01:41:14,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:41:14,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:41:14,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:41:14,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:41:14,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:41:14,571 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 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-09 01:41:14,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:41:14,632 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2025-03-09 01:41:14,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:41:14,632 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 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 12 [2025-03-09 01:41:14,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:41:14,632 INFO L225 Difference]: With dead ends: 27 [2025-03-09 01:41:14,633 INFO L226 Difference]: Without dead ends: 26 [2025-03-09 01:41:14,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:41:14,633 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 19 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.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:41:14,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 19 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:41:14,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-09 01:41:14,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2025-03-09 01:41:14,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 23 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-09 01:41:14,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2025-03-09 01:41:14,635 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 12 [2025-03-09 01:41:14,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:41:14,635 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2025-03-09 01:41:14,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 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-09 01:41:14,636 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2025-03-09 01:41:14,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 01:41:14,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:41:14,636 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:41:14,642 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-09 01:41:14,840 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,SelfDestructingSolverStorable7 [2025-03-09 01:41:14,840 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:41:14,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:41:14,840 INFO L85 PathProgramCache]: Analyzing trace with hash -710065402, now seen corresponding path program 1 times [2025-03-09 01:41:14,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:41:14,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317647372] [2025-03-09 01:41:14,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:41:14,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:41:14,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:41:14,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:41:14,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:41:14,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:14,872 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-09 01:41:14,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:41:14,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317647372] [2025-03-09 01:41:14,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317647372] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:41:14,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411818750] [2025-03-09 01:41:14,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:41:14,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:41:14,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:41:14,875 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-09 01:41:14,876 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-09 01:41:14,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:41:14,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:41:14,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:41:14,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:14,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:41:14,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:41:14,914 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-09 01:41:14,914 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:41:14,945 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-09 01:41:14,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411818750] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:41:14,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:41:14,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 01:41:14,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214597743] [2025-03-09 01:41:14,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:41:14,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 01:41:14,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:41:14,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 01:41:14,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:41:14,947 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 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-09 01:41:15,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:41:15,039 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2025-03-09 01:41:15,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:41:15,039 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 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-09 01:41:15,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:41:15,040 INFO L225 Difference]: With dead ends: 32 [2025-03-09 01:41:15,040 INFO L226 Difference]: Without dead ends: 31 [2025-03-09 01:41:15,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:41:15,041 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 18 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:41:15,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 15 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:41:15,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-09 01:41:15,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2025-03-09 01:41:15,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 22 states have internal predecessors, (23), 0 states have call successors, (0), 0 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-09 01:41:15,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2025-03-09 01:41:15,046 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 13 [2025-03-09 01:41:15,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:41:15,047 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2025-03-09 01:41:15,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 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-09 01:41:15,048 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2025-03-09 01:41:15,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-09 01:41:15,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:41:15,048 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:41:15,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 01:41:15,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:41:15,249 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-09 01:41:15,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:41:15,249 INFO L85 PathProgramCache]: Analyzing trace with hash -537191005, now seen corresponding path program 1 times [2025-03-09 01:41:15,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:41:15,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065607158] [2025-03-09 01:41:15,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:41:15,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:41:15,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:41:15,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:41:15,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:41:15,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:15,287 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:15,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:41:15,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065607158] [2025-03-09 01:41:15,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065607158] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:41:15,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118392461] [2025-03-09 01:41:15,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:41:15,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:41:15,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:41:15,291 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-09 01:41:15,292 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-09 01:41:15,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:41:15,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:41:15,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:41:15,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:15,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:41:15,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:41:15,331 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:15,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:41:15,360 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:15,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118392461] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:41:15,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:41:15,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 01:41:15,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863327171] [2025-03-09 01:41:15,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:41:15,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 01:41:15,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:41:15,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 01:41:15,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:41:15,361 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:41:15,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:41:15,409 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2025-03-09 01:41:15,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:41:15,410 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-09 01:41:15,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:41:15,410 INFO L225 Difference]: With dead ends: 23 [2025-03-09 01:41:15,410 INFO L226 Difference]: Without dead ends: 22 [2025-03-09 01:41:15,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:41:15,410 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 8 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:41:15,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 10 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:41:15,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-09 01:41:15,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-09 01:41:15,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 0 states have call successors, (0), 0 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-09 01:41:15,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2025-03-09 01:41:15,413 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 14 [2025-03-09 01:41:15,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:41:15,413 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2025-03-09 01:41:15,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:41:15,413 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2025-03-09 01:41:15,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 01:41:15,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:41:15,413 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 01:41:15,419 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-09 01:41:15,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:41:15,618 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-09 01:41:15,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:41:15,618 INFO L85 PathProgramCache]: Analyzing trace with hash 526948004, now seen corresponding path program 1 times [2025-03-09 01:41:15,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:41:15,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789861312] [2025-03-09 01:41:15,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:41:15,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:41:15,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:41:15,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:41:15,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:41:15,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:15,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:15,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:41:15,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789861312] [2025-03-09 01:41:15,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789861312] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:41:15,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903012915] [2025-03-09 01:41:15,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:41:15,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:41:15,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:41:15,645 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-09 01:41:15,647 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-09 01:41:15,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:41:15,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:41:15,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:41:15,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:15,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:41:15,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:41:15,687 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:15,687 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:41:15,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:15,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903012915] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:41:15,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:41:15,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-09 01:41:15,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926642657] [2025-03-09 01:41:15,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:41:15,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:41:15,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:41:15,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:41:15,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:41:15,712 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 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-09 01:41:15,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:41:15,739 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2025-03-09 01:41:15,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:41:15,740 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-09 01:41:15,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:41:15,740 INFO L225 Difference]: With dead ends: 31 [2025-03-09 01:41:15,740 INFO L226 Difference]: Without dead ends: 29 [2025-03-09 01:41:15,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:41:15,741 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:41:15,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 21 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:41:15,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-09 01:41:15,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2025-03-09 01:41:15,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 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-09 01:41:15,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2025-03-09 01:41:15,747 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 15 [2025-03-09 01:41:15,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:41:15,747 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2025-03-09 01:41:15,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 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-09 01:41:15,748 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2025-03-09 01:41:15,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 01:41:15,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:41:15,748 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-09 01:41:15,754 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-09 01:41:15,948 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,SelfDestructingSolverStorable10 [2025-03-09 01:41:15,949 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-09 01:41:15,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:41:15,949 INFO L85 PathProgramCache]: Analyzing trace with hash -844481087, now seen corresponding path program 1 times [2025-03-09 01:41:15,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:41:15,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400612088] [2025-03-09 01:41:15,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:41:15,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:41:15,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:41:15,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:41:15,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:41:15,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:15,967 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:15,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:41:15,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400612088] [2025-03-09 01:41:15,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400612088] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:41:15,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116126082] [2025-03-09 01:41:15,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:41:15,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:41:15,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:41:15,970 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-09 01:41:15,971 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-09 01:41:15,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:41:15,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:41:15,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:41:15,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:15,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:41:15,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:41:16,005 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:16,005 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:41:16,034 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:16,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116126082] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:41:16,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:41:16,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-09 01:41:16,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544242970] [2025-03-09 01:41:16,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:41:16,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:41:16,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:41:16,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:41:16,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:41:16,036 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-09 01:41:16,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:41:16,047 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2025-03-09 01:41:16,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:41:16,048 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 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-09 01:41:16,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:41:16,048 INFO L225 Difference]: With dead ends: 28 [2025-03-09 01:41:16,048 INFO L226 Difference]: Without dead ends: 27 [2025-03-09 01:41:16,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:41:16,049 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:41:16,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 8 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:41:16,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-09 01:41:16,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2025-03-09 01:41:16,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:41:16,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2025-03-09 01:41:16,055 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 16 [2025-03-09 01:41:16,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:41:16,055 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2025-03-09 01:41:16,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-09 01:41:16,055 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2025-03-09 01:41:16,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-09 01:41:16,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:41:16,056 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1] [2025-03-09 01:41:16,065 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-09 01:41:16,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:41:16,260 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:41:16,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:41:16,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1982342190, now seen corresponding path program 2 times [2025-03-09 01:41:16,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:41:16,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521750003] [2025-03-09 01:41:16,261 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:41:16,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:41:16,264 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:41:16,267 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:41:16,267 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:41:16,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:16,319 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:16,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:41:16,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521750003] [2025-03-09 01:41:16,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521750003] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:41:16,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69787760] [2025-03-09 01:41:16,320 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:41:16,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:41:16,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:41:16,322 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-09 01:41:16,323 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-09 01:41:16,337 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:41:16,342 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:41:16,342 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:41:16,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:16,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 01:41:16,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:41:16,487 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:16,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:41:16,560 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:16,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69787760] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:41:16,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:41:16,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 17 [2025-03-09 01:41:16,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415503829] [2025-03-09 01:41:16,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:41:16,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 01:41:16,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:41:16,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 01:41:16,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2025-03-09 01:41:16,562 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 18 states, 17 states have (on average 3.235294117647059) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 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-09 01:41:16,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:41:16,749 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2025-03-09 01:41:16,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:41:16,749 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.235294117647059) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 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-09 01:41:16,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:41:16,749 INFO L225 Difference]: With dead ends: 42 [2025-03-09 01:41:16,749 INFO L226 Difference]: Without dead ends: 41 [2025-03-09 01:41:16,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2025-03-09 01:41:16,750 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 17 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:41:16,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 12 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:41:16,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-09 01:41:16,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-09 01:41:16,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:41:16,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2025-03-09 01:41:16,754 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 19 [2025-03-09 01:41:16,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:41:16,754 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2025-03-09 01:41:16,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.235294117647059) internal successors, (55), 18 states have internal predecessors, (55), 0 states have call successors, (0), 0 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-09 01:41:16,754 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2025-03-09 01:41:16,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-09 01:41:16,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:41:16,755 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 1, 1, 1] [2025-03-09 01:41:16,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 01:41:16,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:41:16,956 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:41:16,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:41:16,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1668881083, now seen corresponding path program 3 times [2025-03-09 01:41:16,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:41:16,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427443796] [2025-03-09 01:41:16,957 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:41:16,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:41:16,964 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 6 equivalence classes. [2025-03-09 01:41:16,974 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 01:41:16,974 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-09 01:41:16,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:17,161 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:41:17,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:41:17,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427443796] [2025-03-09 01:41:17,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427443796] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:41:17,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771492844] [2025-03-09 01:41:17,162 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:41:17,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:41:17,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:41:17,164 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-09 01:41:17,165 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-09 01:41:17,182 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 6 equivalence classes. [2025-03-09 01:41:17,190 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 01:41:17,190 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-09 01:41:17,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:41:17,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:41:17,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:41:17,341 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 12 proven. 61 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 01:41:17,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:41:17,481 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-09 01:41:17,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771492844] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:41:17,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:41:17,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 6] total 25 [2025-03-09 01:41:17,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162784178] [2025-03-09 01:41:17,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:41:17,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-09 01:41:17,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:41:17,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-09 01:41:17,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2025-03-09 01:41:17,484 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 26 states, 25 states have (on average 3.64) internal successors, (91), 26 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:41:18,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:41:18,041 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2025-03-09 01:41:18,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-09 01:41:18,042 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.64) internal successors, (91), 26 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-09 01:41:18,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:41:18,042 INFO L225 Difference]: With dead ends: 43 [2025-03-09 01:41:18,042 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 01:41:18,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=327, Invalid=1395, Unknown=0, NotChecked=0, Total=1722 [2025-03-09 01:41:18,044 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 40 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:41:18,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 22 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:41:18,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 01:41:18,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 01:41:18,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:41:18,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 01:41:18,045 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2025-03-09 01:41:18,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:41:18,045 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 01:41:18,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.64) internal successors, (91), 26 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:41:18,045 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 01:41:18,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 01:41:18,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-09 01:41:18,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-09 01:41:18,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-09 01:41:18,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-09 01:41:18,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-09 01:41:18,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-09 01:41:18,055 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-09 01:41:18,249 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,SelfDestructingSolverStorable13 [2025-03-09 01:41:18,252 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:41:18,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 01:41:18,336 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:41:18,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:41:18 BoogieIcfgContainer [2025-03-09 01:41:18,348 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:41:18,349 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:41:18,349 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:41:18,349 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:41:18,350 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:41:13" (3/4) ... [2025-03-09 01:41:18,351 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 01:41:18,357 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-09 01:41:18,358 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 01:41:18,358 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-09 01:41:18,412 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 01:41:18,412 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 01:41:18,412 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:41:18,413 INFO L158 Benchmark]: Toolchain (without parser) took 5611.52ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 77.8MB in the end (delta: 28.4MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2025-03-09 01:41:18,413 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory was 125.2MB in the beginning and 124.9MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:41:18,413 INFO L158 Benchmark]: CACSL2BoogieTranslator took 136.52ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 96.3MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:41:18,414 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.35ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 95.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:41:18,414 INFO L158 Benchmark]: Boogie Preprocessor took 11.10ms. Allocated memory is still 142.6MB. Free memory is still 95.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:41:18,414 INFO L158 Benchmark]: IcfgBuilder took 192.14ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 85.2MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:41:18,414 INFO L158 Benchmark]: TraceAbstraction took 5183.30ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 83.1MB in the end (delta: 921.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:41:18,414 INFO L158 Benchmark]: Witness Printer took 63.94ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 77.8MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:41:18,415 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory was 125.2MB in the beginning and 124.9MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 136.52ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 96.3MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.35ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 95.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 11.10ms. Allocated memory is still 142.6MB. Free memory is still 95.1MB. There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 192.14ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 85.2MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5183.30ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 83.1MB in the end (delta: 921.0kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 63.94ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 77.8MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 18 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 14, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 123 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 123 mSDsluCounter, 229 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 125 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1043 IncrementalHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 104 mSDtfsCounter, 1043 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 363 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=13, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 28 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 319 NumberOfCodeBlocks, 319 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 429 ConstructedInterpolants, 0 QuantifiedInterpolants, 2274 SizeOfPredicates, 6 NumberOfNonLiveVariables, 286 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 30 InterpolantComputations, 6 PerfectInterpolantSequences, 44/375 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 22]: Location Invariant Derived location invariant: ((((x <= 2147483647) && (z == 1)) && (y == 100)) || (((y == 99) && (0 == ((long) z + 1))) && (x <= 2147483547))) RESULT: Ultimate proved your program to be correct! [2025-03-09 01:41:18,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE