./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-nla/hard2-both-nt.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 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-nla/hard2-both-nt.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 23ac641bc90237de255e915a5ed362430f6ac59f0f6642be7f9d8479ff0a7576 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:53:34,476 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:53:34,538 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 14:53:34,547 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:53:34,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:53:34,575 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:53:34,576 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:53:34,576 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:53:34,576 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:53:34,577 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:53:34,577 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:53:34,577 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:53:34,578 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:53:34,578 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:53:34,578 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:53:34,578 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:53:34,578 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:53:34,578 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:53:34,578 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:53:34,578 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:53:34,578 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:53:34,578 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:53:34,578 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:53:34,578 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:53:34,578 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:53:34,578 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:53:34,578 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:53:34,578 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:53:34,578 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:53:34,578 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:53:34,578 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:53:34,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:53:34,579 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:53:34,579 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:53:34,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:53:34,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:53:34,579 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:53:34,579 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:53:34,579 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:53:34,579 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:53:34,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:53:34,579 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:53:34,579 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:53:34,579 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:53:34,579 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:53:34,579 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 23ac641bc90237de255e915a5ed362430f6ac59f0f6642be7f9d8479ff0a7576 [2025-03-17 14:53:34,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:53:34,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:53:34,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:53:34,829 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:53:34,830 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:53:34,831 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-nla/hard2-both-nt.c [2025-03-17 14:53:36,030 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d71389dec/16cb296b25a24aee9bdf7a4fc4d8e892/FLAGa260906ba [2025-03-17 14:53:36,216 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:53:36,217 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-nla/hard2-both-nt.c [2025-03-17 14:53:36,226 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d71389dec/16cb296b25a24aee9bdf7a4fc4d8e892/FLAGa260906ba [2025-03-17 14:53:36,257 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d71389dec/16cb296b25a24aee9bdf7a4fc4d8e892 [2025-03-17 14:53:36,259 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:53:36,261 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:53:36,262 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:53:36,262 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:53:36,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:53:36,267 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:53:36" (1/1) ... [2025-03-17 14:53:36,268 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@289f5586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:36, skipping insertion in model container [2025-03-17 14:53:36,268 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:53:36" (1/1) ... [2025-03-17 14:53:36,281 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:53:36,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:53:36,416 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:53:36,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:53:36,439 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:53:36,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:36 WrapperNode [2025-03-17 14:53:36,440 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:53:36,441 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:53:36,442 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:53:36,442 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:53:36,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:36" (1/1) ... [2025-03-17 14:53:36,451 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:36" (1/1) ... [2025-03-17 14:53:36,464 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 50 [2025-03-17 14:53:36,465 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:53:36,466 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:53:36,466 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:53:36,466 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:53:36,472 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:36" (1/1) ... [2025-03-17 14:53:36,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:36" (1/1) ... [2025-03-17 14:53:36,478 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:36" (1/1) ... [2025-03-17 14:53:36,483 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-17 14:53:36,487 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:36" (1/1) ... [2025-03-17 14:53:36,487 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:36" (1/1) ... [2025-03-17 14:53:36,488 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:36" (1/1) ... [2025-03-17 14:53:36,489 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:36" (1/1) ... [2025-03-17 14:53:36,490 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:36" (1/1) ... [2025-03-17 14:53:36,490 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:36" (1/1) ... [2025-03-17 14:53:36,496 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:53:36,497 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:53:36,497 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:53:36,497 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:53:36,498 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:36" (1/1) ... [2025-03-17 14:53:36,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:53:36,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:53:36,533 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-17 14:53:36,538 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-17 14:53:36,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:53:36,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:53:36,593 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:53:36,594 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:53:36,781 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2025-03-17 14:53:36,782 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:53:36,791 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:53:36,791 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:53:36,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:53:36 BoogieIcfgContainer [2025-03-17 14:53:36,791 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:53:36,793 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:53:36,794 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:53:36,798 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:53:36,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:53:36" (1/3) ... [2025-03-17 14:53:36,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad86bbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:53:36, skipping insertion in model container [2025-03-17 14:53:36,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:36" (2/3) ... [2025-03-17 14:53:36,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad86bbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:53:36, skipping insertion in model container [2025-03-17 14:53:36,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:53:36" (3/3) ... [2025-03-17 14:53:36,800 INFO L128 eAbstractionObserver]: Analyzing ICFG hard2-both-nt.c [2025-03-17 14:53:36,813 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:53:36,814 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hard2-both-nt.c that has 1 procedures, 43 locations, 1 initial locations, 2 loop locations, and 18 error locations. [2025-03-17 14:53:36,858 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:53:36,869 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;@71a05e6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:53:36,869 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-17 14:53:36,873 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 42 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:53:36,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 14:53:36,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:53:36,878 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 14:53:36,878 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:53:36,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:53:36,883 INFO L85 PathProgramCache]: Analyzing trace with hash 2399, now seen corresponding path program 1 times [2025-03-17 14:53:36,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:53:36,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617820851] [2025-03-17 14:53:36,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:53:36,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:53:36,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 14:53:36,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 14:53:36,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:53:36,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 14:53:36,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1124059288] [2025-03-17 14:53:36,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:53:36,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:53:36,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:53:36,963 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-17 14:53:36,979 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-17 14:53:37,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 14:53:37,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 14:53:37,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:53:37,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:53:37,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:53:37,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:53:37,051 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-17 14:53:37,051 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:53:37,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:53:37,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617820851] [2025-03-17 14:53:37,052 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 14:53:37,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124059288] [2025-03-17 14:53:37,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124059288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:53:37,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:53:37,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:53:37,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327282994] [2025-03-17 14:53:37,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:53:37,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:53:37,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:53:37,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:53:37,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:53:37,074 INFO L87 Difference]: Start difference. First operand has 43 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 42 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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-17 14:53:37,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:53:37,155 INFO L93 Difference]: Finished difference Result 96 states and 112 transitions. [2025-03-17 14:53:37,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:53:37,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2025-03-17 14:53:37,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:53:37,162 INFO L225 Difference]: With dead ends: 96 [2025-03-17 14:53:37,162 INFO L226 Difference]: Without dead ends: 60 [2025-03-17 14:53:37,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-17 14:53:37,166 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:53:37,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 42 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:53:37,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-17 14:53:37,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2025-03-17 14:53:37,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.763157894736842) internal successors, (67), 55 states have internal predecessors, (67), 0 states have call successors, (0), 0 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-17 14:53:37,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2025-03-17 14:53:37,193 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 2 [2025-03-17 14:53:37,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:53:37,193 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2025-03-17 14:53:37,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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-17 14:53:37,193 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2025-03-17 14:53:37,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 14:53:37,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:53:37,194 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 14:53:37,200 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-17 14:53:37,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 14:53:37,395 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:53:37,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:53:37,395 INFO L85 PathProgramCache]: Analyzing trace with hash 71478464, now seen corresponding path program 1 times [2025-03-17 14:53:37,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:53:37,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233507711] [2025-03-17 14:53:37,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:53:37,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:53:37,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:53:37,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:53:37,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:53:37,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 14:53:37,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [220117371] [2025-03-17 14:53:37,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:53:37,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:53:37,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:53:37,404 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-17 14:53:37,406 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-17 14:53:37,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:53:37,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:53:37,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:53:37,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:53:37,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:53:37,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:53:37,444 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-17 14:53:37,445 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:53:37,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:53:37,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233507711] [2025-03-17 14:53:37,446 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 14:53:37,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220117371] [2025-03-17 14:53:37,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220117371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:53:37,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:53:37,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:53:37,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327379664] [2025-03-17 14:53:37,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:53:37,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:53:37,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:53:37,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:53:37,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:53:37,448 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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-17 14:53:37,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:53:37,482 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2025-03-17 14:53:37,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:53:37,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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-17 14:53:37,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:53:37,483 INFO L225 Difference]: With dead ends: 78 [2025-03-17 14:53:37,483 INFO L226 Difference]: Without dead ends: 76 [2025-03-17 14:53:37,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-17 14:53:37,484 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 31 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:53:37,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 45 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:53:37,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-17 14:53:37,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2025-03-17 14:53:37,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.7083333333333333) internal successors, (82), 65 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:53:37,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2025-03-17 14:53:37,489 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 5 [2025-03-17 14:53:37,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:53:37,489 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2025-03-17 14:53:37,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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-17 14:53:37,490 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2025-03-17 14:53:37,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 14:53:37,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:53:37,490 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 14:53:37,496 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-17 14:53:37,694 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,SelfDestructingSolverStorable1 [2025-03-17 14:53:37,694 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:53:37,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:53:37,695 INFO L85 PathProgramCache]: Analyzing trace with hash 71478504, now seen corresponding path program 1 times [2025-03-17 14:53:37,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:53:37,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16499742] [2025-03-17 14:53:37,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:53:37,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:53:37,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:53:37,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:53:37,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:53:37,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:53:37,752 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-17 14:53:37,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:53:37,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16499742] [2025-03-17 14:53:37,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16499742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:53:37,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:53:37,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:53:37,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404968677] [2025-03-17 14:53:37,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:53:37,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:53:37,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:53:37,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:53:37,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:53:37,753 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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-17 14:53:37,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:53:37,800 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2025-03-17 14:53:37,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:53:37,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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-17 14:53:37,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:53:37,801 INFO L225 Difference]: With dead ends: 72 [2025-03-17 14:53:37,801 INFO L226 Difference]: Without dead ends: 68 [2025-03-17 14:53:37,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-17 14:53:37,802 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:53:37,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 61 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:53:37,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-17 14:53:37,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2025-03-17 14:53:37,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.625) internal successors, (78), 65 states have internal predecessors, (78), 0 states have call successors, (0), 0 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-17 14:53:37,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2025-03-17 14:53:37,808 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 5 [2025-03-17 14:53:37,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:53:37,808 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2025-03-17 14:53:37,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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-17 14:53:37,808 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2025-03-17 14:53:37,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 14:53:37,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:53:37,808 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:53:37,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:53:37,809 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:53:37,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:53:37,809 INFO L85 PathProgramCache]: Analyzing trace with hash -28672994, now seen corresponding path program 1 times [2025-03-17 14:53:37,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:53:37,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083380174] [2025-03-17 14:53:37,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:53:37,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:53:37,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:53:37,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:53:37,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:53:37,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 14:53:37,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [69885526] [2025-03-17 14:53:37,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:53:37,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:53:37,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:53:37,821 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-17 14:53:37,823 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-17 14:53:37,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:53:37,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:53:37,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:53:37,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:53:37,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:53:37,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:53:37,908 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-17 14:53:37,908 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:53:37,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:53:37,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083380174] [2025-03-17 14:53:37,909 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 14:53:37,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69885526] [2025-03-17 14:53:37,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69885526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:53:37,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:53:37,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:53:37,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584750964] [2025-03-17 14:53:37,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:53:37,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:53:37,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:53:37,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:53:37,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:53:37,911 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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-17 14:53:37,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:53:37,959 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2025-03-17 14:53:37,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:53:37,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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-17 14:53:37,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:53:37,960 INFO L225 Difference]: With dead ends: 73 [2025-03-17 14:53:37,960 INFO L226 Difference]: Without dead ends: 72 [2025-03-17 14:53:37,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-17 14:53:37,961 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 25 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:53:37,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 38 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:53:37,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-17 14:53:37,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2025-03-17 14:53:37,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 65 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:53:37,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2025-03-17 14:53:37,966 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 7 [2025-03-17 14:53:37,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:53:37,967 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2025-03-17 14:53:37,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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-17 14:53:37,967 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2025-03-17 14:53:37,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 14:53:37,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:53:37,967 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:53:37,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 14:53:38,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:53:38,168 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:53:38,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:53:38,168 INFO L85 PathProgramCache]: Analyzing trace with hash -888862823, now seen corresponding path program 1 times [2025-03-17 14:53:38,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:53:38,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924869425] [2025-03-17 14:53:38,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:53:38,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:53:38,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:53:38,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:53:38,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:53:38,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 14:53:38,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1850108130] [2025-03-17 14:53:38,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:53:38,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:53:38,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:53:38,176 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-17 14:53:38,178 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-17 14:53:38,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:53:38,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:53:38,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:53:38,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:53:38,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:53:38,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:53:38,250 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-17 14:53:38,250 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:53:38,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:53:38,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924869425] [2025-03-17 14:53:38,251 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 14:53:38,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850108130] [2025-03-17 14:53:38,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850108130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:53:38,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:53:38,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:53:38,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509787475] [2025-03-17 14:53:38,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:53:38,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:53:38,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:53:38,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:53:38,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:53:38,252 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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-17 14:53:38,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:53:38,289 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2025-03-17 14:53:38,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:53:38,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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-17 14:53:38,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:53:38,291 INFO L225 Difference]: With dead ends: 75 [2025-03-17 14:53:38,292 INFO L226 Difference]: Without dead ends: 74 [2025-03-17 14:53:38,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-17 14:53:38,293 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 25 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:53:38,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 35 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:53:38,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-17 14:53:38,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 66. [2025-03-17 14:53:38,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.5416666666666667) internal successors, (74), 65 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:53:38,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2025-03-17 14:53:38,301 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 8 [2025-03-17 14:53:38,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:53:38,301 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2025-03-17 14:53:38,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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-17 14:53:38,304 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2025-03-17 14:53:38,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 14:53:38,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:53:38,305 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:53:38,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 14:53:38,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:53:38,509 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:53:38,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:53:38,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1747725838, now seen corresponding path program 1 times [2025-03-17 14:53:38,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:53:38,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760005683] [2025-03-17 14:53:38,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:53:38,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:53:38,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:53:38,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:53:38,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:53:38,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 14:53:38,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1001869633] [2025-03-17 14:53:38,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:53:38,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:53:38,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:53:38,522 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-17 14:53:38,524 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-17 14:53:38,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:53:38,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:53:38,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:53:38,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:53:38,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:53:38,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:53:38,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:53:38,608 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:53:38,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:53:38,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760005683] [2025-03-17 14:53:38,608 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 14:53:38,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001869633] [2025-03-17 14:53:38,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001869633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:53:38,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:53:38,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:53:38,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320643391] [2025-03-17 14:53:38,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:53:38,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:53:38,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:53:38,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:53:38,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:53:38,610 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand has 4 states, 3 states have (on average 3.0) 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-17 14:53:38,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:53:38,693 INFO L93 Difference]: Finished difference Result 105 states and 127 transitions. [2025-03-17 14:53:38,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:53:38,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) 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-17 14:53:38,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:53:38,695 INFO L225 Difference]: With dead ends: 105 [2025-03-17 14:53:38,695 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 14:53:38,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:53:38,697 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 42 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:53:38,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 56 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:53:38,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 14:53:38,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 94. [2025-03-17 14:53:38,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 78 states have (on average 1.5128205128205128) internal successors, (118), 93 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:53:38,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 118 transitions. [2025-03-17 14:53:38,705 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 118 transitions. Word has length 9 [2025-03-17 14:53:38,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:53:38,705 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 118 transitions. [2025-03-17 14:53:38,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) 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-17 14:53:38,705 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 118 transitions. [2025-03-17 14:53:38,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 14:53:38,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:53:38,705 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:53:38,713 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-17 14:53:38,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:53:38,912 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:53:38,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:53:38,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1655073880, now seen corresponding path program 1 times [2025-03-17 14:53:38,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:53:38,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742494890] [2025-03-17 14:53:38,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:53:38,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:53:38,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:53:38,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:53:38,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:53:38,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 14:53:38,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [481626624] [2025-03-17 14:53:38,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:53:38,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:53:38,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:53:38,929 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-17 14:53:38,931 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-17 14:53:38,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:53:38,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:53:38,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:53:38,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:53:38,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:53:38,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:53:39,008 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-17 14:53:39,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:53:39,180 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-17 14:53:39,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:53:39,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742494890] [2025-03-17 14:53:39,180 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 14:53:39,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481626624] [2025-03-17 14:53:39,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481626624] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:53:39,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:53:39,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2025-03-17 14:53:39,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961743438] [2025-03-17 14:53:39,181 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 14:53:39,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:53:39,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:53:39,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:53:39,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:53:39,182 INFO L87 Difference]: Start difference. First operand 94 states and 118 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 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-17 14:53:39,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:53:39,326 INFO L93 Difference]: Finished difference Result 237 states and 321 transitions. [2025-03-17 14:53:39,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:53:39,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-17 14:53:39,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:53:39,329 INFO L225 Difference]: With dead ends: 237 [2025-03-17 14:53:39,329 INFO L226 Difference]: Without dead ends: 234 [2025-03-17 14:53:39,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:53:39,330 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 118 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:53:39,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 60 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:53:39,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-17 14:53:39,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 162. [2025-03-17 14:53:39,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 146 states have (on average 1.5342465753424657) internal successors, (224), 161 states have internal predecessors, (224), 0 states have call successors, (0), 0 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-17 14:53:39,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 224 transitions. [2025-03-17 14:53:39,352 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 224 transitions. Word has length 10 [2025-03-17 14:53:39,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:53:39,352 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 224 transitions. [2025-03-17 14:53:39,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 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-17 14:53:39,352 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 224 transitions. [2025-03-17 14:53:39,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 14:53:39,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:53:39,352 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:53:39,363 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-17 14:53:39,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:53:39,553 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:53:39,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:53:39,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1388099445, now seen corresponding path program 1 times [2025-03-17 14:53:39,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:53:39,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391783454] [2025-03-17 14:53:39,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:53:39,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:53:39,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:53:39,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:53:39,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:53:39,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:53:39,606 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-17 14:53:39,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:53:39,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391783454] [2025-03-17 14:53:39,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391783454] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:53:39,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771550170] [2025-03-17 14:53:39,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:53:39,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:53:39,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:53:39,608 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-17 14:53:39,610 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-17 14:53:39,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:53:39,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:53:39,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:53:39,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:53:39,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:53:39,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:53:39,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:53:39,649 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:53:39,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771550170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:53:39,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:53:39,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-03-17 14:53:39,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014377605] [2025-03-17 14:53:39,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:53:39,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:53:39,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:53:39,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:53:39,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:53:39,650 INFO L87 Difference]: Start difference. First operand 162 states and 224 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:53:39,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:53:39,703 INFO L93 Difference]: Finished difference Result 170 states and 224 transitions. [2025-03-17 14:53:39,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:53:39,704 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-17 14:53:39,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:53:39,705 INFO L225 Difference]: With dead ends: 170 [2025-03-17 14:53:39,705 INFO L226 Difference]: Without dead ends: 168 [2025-03-17 14:53:39,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-17 14:53:39,706 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 34 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:53:39,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 83 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:53:39,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-17 14:53:39,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 161. [2025-03-17 14:53:39,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 146 states have (on average 1.4726027397260273) internal successors, (215), 160 states have internal predecessors, (215), 0 states have call successors, (0), 0 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-17 14:53:39,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 215 transitions. [2025-03-17 14:53:39,726 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 215 transitions. Word has length 12 [2025-03-17 14:53:39,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:53:39,726 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 215 transitions. [2025-03-17 14:53:39,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:53:39,726 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 215 transitions. [2025-03-17 14:53:39,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 14:53:39,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:53:39,726 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 14:53:39,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 14:53:39,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:53:39,927 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:53:39,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:53:39,943 INFO L85 PathProgramCache]: Analyzing trace with hash 81409839, now seen corresponding path program 1 times [2025-03-17 14:53:39,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:53:39,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856482764] [2025-03-17 14:53:39,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:53:39,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:53:39,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:53:39,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:53:39,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:53:39,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:53:40,008 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-17 14:53:40,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:53:40,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856482764] [2025-03-17 14:53:40,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856482764] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:53:40,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578033855] [2025-03-17 14:53:40,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:53:40,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:53:40,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:53:40,014 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-17 14:53:40,016 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-17 14:53:40,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:53:40,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:53:40,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:53:40,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:53:40,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:53:40,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:53:40,062 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-17 14:53:40,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:53:40,091 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-17 14:53:40,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578033855] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:53:40,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:53:40,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2025-03-17 14:53:40,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182201837] [2025-03-17 14:53:40,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:53:40,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:53:40,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:53:40,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:53:40,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:53:40,093 INFO L87 Difference]: Start difference. First operand 161 states and 215 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 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-17 14:53:40,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:53:40,204 INFO L93 Difference]: Finished difference Result 243 states and 313 transitions. [2025-03-17 14:53:40,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:53:40,205 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 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-17 14:53:40,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:53:40,206 INFO L225 Difference]: With dead ends: 243 [2025-03-17 14:53:40,206 INFO L226 Difference]: Without dead ends: 241 [2025-03-17 14:53:40,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:53:40,207 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 105 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:53:40,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 130 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:53:40,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-03-17 14:53:40,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 211. [2025-03-17 14:53:40,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 196 states have (on average 1.4540816326530612) internal successors, (285), 210 states have internal predecessors, (285), 0 states have call successors, (0), 0 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-17 14:53:40,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 285 transitions. [2025-03-17 14:53:40,220 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 285 transitions. Word has length 13 [2025-03-17 14:53:40,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:53:40,221 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 285 transitions. [2025-03-17 14:53:40,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 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-17 14:53:40,221 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 285 transitions. [2025-03-17 14:53:40,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 14:53:40,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:53:40,221 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:53:40,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 14:53:40,422 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,SelfDestructingSolverStorable8 [2025-03-17 14:53:40,422 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:53:40,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:53:40,423 INFO L85 PathProgramCache]: Analyzing trace with hash -887081769, now seen corresponding path program 1 times [2025-03-17 14:53:40,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:53:40,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927331973] [2025-03-17 14:53:40,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:53:40,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:53:40,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:53:40,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:53:40,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:53:40,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:53:40,461 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-17 14:53:40,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:53:40,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927331973] [2025-03-17 14:53:40,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927331973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:53:40,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:53:40,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:53:40,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267771253] [2025-03-17 14:53:40,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:53:40,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:53:40,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:53:40,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:53:40,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:53:40,463 INFO L87 Difference]: Start difference. First operand 211 states and 285 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:53:40,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:53:40,489 INFO L93 Difference]: Finished difference Result 211 states and 285 transitions. [2025-03-17 14:53:40,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:53:40,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-17 14:53:40,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:53:40,491 INFO L225 Difference]: With dead ends: 211 [2025-03-17 14:53:40,492 INFO L226 Difference]: Without dead ends: 210 [2025-03-17 14:53:40,492 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-17 14:53:40,492 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:53:40,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 53 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:53:40,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-17 14:53:40,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2025-03-17 14:53:40,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 196 states have (on average 1.4234693877551021) internal successors, (279), 209 states have internal predecessors, (279), 0 states have call successors, (0), 0 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-17 14:53:40,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 279 transitions. [2025-03-17 14:53:40,503 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 279 transitions. Word has length 15 [2025-03-17 14:53:40,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:53:40,503 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 279 transitions. [2025-03-17 14:53:40,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:53:40,503 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 279 transitions. [2025-03-17 14:53:40,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 14:53:40,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:53:40,504 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:53:40,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:53:40,504 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:53:40,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:53:40,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1729731088, now seen corresponding path program 1 times [2025-03-17 14:53:40,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:53:40,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134589251] [2025-03-17 14:53:40,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:53:40,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:53:40,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 14:53:40,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 14:53:40,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:53:40,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:53:40,610 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-17 14:53:40,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:53:40,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134589251] [2025-03-17 14:53:40,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134589251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:53:40,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:53:40,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:53:40,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230541791] [2025-03-17 14:53:40,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:53:40,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:53:40,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:53:40,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:53:40,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:53:40,611 INFO L87 Difference]: Start difference. First operand 210 states and 279 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:53:40,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:53:40,678 INFO L93 Difference]: Finished difference Result 246 states and 330 transitions. [2025-03-17 14:53:40,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:53:40,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-17 14:53:40,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:53:40,679 INFO L225 Difference]: With dead ends: 246 [2025-03-17 14:53:40,679 INFO L226 Difference]: Without dead ends: 245 [2025-03-17 14:53:40,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:53:40,681 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:53:40,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 64 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:53:40,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-17 14:53:40,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 222. [2025-03-17 14:53:40,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 208 states have (on average 1.4038461538461537) internal successors, (292), 221 states have internal predecessors, (292), 0 states have call successors, (0), 0 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-17 14:53:40,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 292 transitions. [2025-03-17 14:53:40,692 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 292 transitions. Word has length 16 [2025-03-17 14:53:40,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:53:40,693 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 292 transitions. [2025-03-17 14:53:40,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:53:40,693 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 292 transitions. [2025-03-17 14:53:40,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 14:53:40,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:53:40,694 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:53:40,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:53:40,694 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:53:40,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:53:40,695 INFO L85 PathProgramCache]: Analyzing trace with hash -2082056203, now seen corresponding path program 1 times [2025-03-17 14:53:40,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:53:40,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627676967] [2025-03-17 14:53:40,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:53:40,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:53:40,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:53:40,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:53:40,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:53:40,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:53:40,862 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-17 14:53:40,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:53:40,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627676967] [2025-03-17 14:53:40,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627676967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:53:40,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:53:40,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:53:40,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904167872] [2025-03-17 14:53:40,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:53:40,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:53:40,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:53:40,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:53:40,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:53:40,864 INFO L87 Difference]: Start difference. First operand 222 states and 292 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 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-17 14:53:41,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:53:41,011 INFO L93 Difference]: Finished difference Result 236 states and 307 transitions. [2025-03-17 14:53:41,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:53:41,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-17 14:53:41,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:53:41,013 INFO L225 Difference]: With dead ends: 236 [2025-03-17 14:53:41,014 INFO L226 Difference]: Without dead ends: 235 [2025-03-17 14:53:41,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:53:41,014 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 38 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:53:41,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 55 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:53:41,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-17 14:53:41,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 223. [2025-03-17 14:53:41,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 209 states have (on average 1.3971291866028708) internal successors, (292), 222 states have internal predecessors, (292), 0 states have call successors, (0), 0 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-17 14:53:41,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 292 transitions. [2025-03-17 14:53:41,028 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 292 transitions. Word has length 17 [2025-03-17 14:53:41,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:53:41,028 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 292 transitions. [2025-03-17 14:53:41,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 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-17 14:53:41,029 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 292 transitions. [2025-03-17 14:53:41,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 14:53:41,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:53:41,029 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:53:41,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:53:41,030 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:53:41,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:53:41,030 INFO L85 PathProgramCache]: Analyzing trace with hash -119232882, now seen corresponding path program 1 times [2025-03-17 14:53:41,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:53:41,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409318915] [2025-03-17 14:53:41,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:53:41,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:53:41,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 14:53:41,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 14:53:41,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:53:41,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:53:41,152 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-17 14:53:41,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:53:41,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409318915] [2025-03-17 14:53:41,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409318915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:53:41,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:53:41,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:53:41,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737240259] [2025-03-17 14:53:41,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:53:41,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:53:41,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:53:41,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:53:41,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:53:41,154 INFO L87 Difference]: Start difference. First operand 223 states and 292 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 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-17 14:53:41,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:53:41,356 INFO L93 Difference]: Finished difference Result 236 states and 305 transitions. [2025-03-17 14:53:41,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:53:41,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-17 14:53:41,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:53:41,361 INFO L225 Difference]: With dead ends: 236 [2025-03-17 14:53:41,361 INFO L226 Difference]: Without dead ends: 235 [2025-03-17 14:53:41,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:53:41,364 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 37 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:53:41,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 56 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:53:41,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-17 14:53:41,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 224. [2025-03-17 14:53:41,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 210 states have (on average 1.3904761904761904) internal successors, (292), 223 states have internal predecessors, (292), 0 states have call successors, (0), 0 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-17 14:53:41,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 292 transitions. [2025-03-17 14:53:41,392 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 292 transitions. Word has length 18 [2025-03-17 14:53:41,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:53:41,393 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 292 transitions. [2025-03-17 14:53:41,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 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-17 14:53:41,393 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 292 transitions. [2025-03-17 14:53:41,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 14:53:41,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:53:41,395 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:53:41,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:53:41,395 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:53:41,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:53:41,396 INFO L85 PathProgramCache]: Analyzing trace with hash 598747951, now seen corresponding path program 1 times [2025-03-17 14:53:41,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:53:41,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235818780] [2025-03-17 14:53:41,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:53:41,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:53:41,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:53:41,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:53:41,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:53:41,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 14:53:41,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [472556550] [2025-03-17 14:53:41,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:53:41,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:53:41,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:53:41,419 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:53:41,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 14:53:41,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:53:41,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:53:41,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:53:41,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:53:41,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 14:53:41,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:53:41,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:53:41,661 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:53:42,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:53:42,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:53:42,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235818780] [2025-03-17 14:53:42,578 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 14:53:42,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472556550] [2025-03-17 14:53:42,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472556550] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:53:42,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:53:42,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2025-03-17 14:53:42,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100659305] [2025-03-17 14:53:42,579 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 14:53:42,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:53:42,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:53:42,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:53:42,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:53:42,579 INFO L87 Difference]: Start difference. First operand 224 states and 292 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 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-17 14:53:42,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:53:42,704 INFO L93 Difference]: Finished difference Result 242 states and 313 transitions. [2025-03-17 14:53:42,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:53:42,704 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 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-17 14:53:42,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:53:42,706 INFO L225 Difference]: With dead ends: 242 [2025-03-17 14:53:42,706 INFO L226 Difference]: Without dead ends: 239 [2025-03-17 14:53:42,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:53:42,706 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 78 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:53:42,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 54 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:53:42,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-03-17 14:53:42,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 226. [2025-03-17 14:53:42,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 213 states have (on average 1.3427230046948357) internal successors, (286), 225 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:53:42,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 286 transitions. [2025-03-17 14:53:42,718 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 286 transitions. Word has length 19 [2025-03-17 14:53:42,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:53:42,718 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 286 transitions. [2025-03-17 14:53:42,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 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-17 14:53:42,718 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 286 transitions. [2025-03-17 14:53:42,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 14:53:42,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:53:42,719 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:53:42,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 14:53:42,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-17 14:53:42,920 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:53:42,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:53:42,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1381317292, now seen corresponding path program 1 times [2025-03-17 14:53:42,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:53:42,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143240730] [2025-03-17 14:53:42,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:53:42,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:53:42,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 14:53:42,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:53:42,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:53:42,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 14:53:42,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [672851895] [2025-03-17 14:53:42,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:53:42,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:53:42,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:53:42,931 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:53:42,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 14:53:42,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 14:53:42,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:53:42,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:53:42,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:53:42,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 14:53:42,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:53:43,066 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-17 14:53:43,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:53:43,542 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-17 14:53:43,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:53:43,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143240730] [2025-03-17 14:53:43,542 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 14:53:43,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672851895] [2025-03-17 14:53:43,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672851895] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:53:43,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:53:43,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2025-03-17 14:53:43,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391878626] [2025-03-17 14:53:43,543 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 14:53:43,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:53:43,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:53:43,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:53:43,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:53:43,543 INFO L87 Difference]: Start difference. First operand 226 states and 286 transitions. Second operand has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:53:43,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:53:43,611 INFO L93 Difference]: Finished difference Result 234 states and 292 transitions. [2025-03-17 14:53:43,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:53:43,612 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-17 14:53:43,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:53:43,613 INFO L225 Difference]: With dead ends: 234 [2025-03-17 14:53:43,613 INFO L226 Difference]: Without dead ends: 230 [2025-03-17 14:53:43,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:53:43,613 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 69 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:53:43,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 50 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:53:43,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-17 14:53:43,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 225. [2025-03-17 14:53:43,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 214 states have (on average 1.280373831775701) internal successors, (274), 224 states have internal predecessors, (274), 0 states have call successors, (0), 0 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-17 14:53:43,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 274 transitions. [2025-03-17 14:53:43,621 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 274 transitions. Word has length 20 [2025-03-17 14:53:43,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:53:43,621 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 274 transitions. [2025-03-17 14:53:43,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:53:43,621 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 274 transitions. [2025-03-17 14:53:43,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 14:53:43,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:53:43,621 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:53:43,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 14:53:43,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 14:53:43,826 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:53:43,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:53:43,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1434478068, now seen corresponding path program 1 times [2025-03-17 14:53:43,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:53:43,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667705494] [2025-03-17 14:53:43,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:53:43,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:53:43,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 14:53:43,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:53:43,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:53:43,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:53:43,892 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-17 14:53:43,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:53:43,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667705494] [2025-03-17 14:53:43,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667705494] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:53:43,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568349518] [2025-03-17 14:53:43,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:53:43,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:53:43,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:53:43,898 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:53:43,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 14:53:43,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 14:53:43,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:53:43,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:53:43,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:53:43,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 14:53:43,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:53:43,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:53:43,948 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:53:43,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568349518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:53:43,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:53:43,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2025-03-17 14:53:43,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229808025] [2025-03-17 14:53:43,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:53:43,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:53:43,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:53:43,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:53:43,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:53:43,951 INFO L87 Difference]: Start difference. First operand 225 states and 274 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:53:43,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:53:43,995 INFO L93 Difference]: Finished difference Result 260 states and 313 transitions. [2025-03-17 14:53:43,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:53:43,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-17 14:53:43,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:53:43,997 INFO L225 Difference]: With dead ends: 260 [2025-03-17 14:53:43,997 INFO L226 Difference]: Without dead ends: 213 [2025-03-17 14:53:43,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:53:43,997 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:53:43,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 30 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:53:43,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-17 14:53:44,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2025-03-17 14:53:44,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 202 states have (on average 1.2871287128712872) internal successors, (260), 212 states have internal predecessors, (260), 0 states have call successors, (0), 0 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-17 14:53:44,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 260 transitions. [2025-03-17 14:53:44,008 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 260 transitions. Word has length 20 [2025-03-17 14:53:44,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:53:44,008 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 260 transitions. [2025-03-17 14:53:44,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:53:44,009 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 260 transitions. [2025-03-17 14:53:44,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 14:53:44,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:53:44,009 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1] [2025-03-17 14:53:44,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-17 14:53:44,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 14:53:44,210 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:53:44,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:53:44,210 INFO L85 PathProgramCache]: Analyzing trace with hash 638920186, now seen corresponding path program 1 times [2025-03-17 14:53:44,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:53:44,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615364215] [2025-03-17 14:53:44,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:53:44,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:53:44,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:53:44,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:53:44,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:53:44,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:53:44,256 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:53:44,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:53:44,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615364215] [2025-03-17 14:53:44,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615364215] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:53:44,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104895249] [2025-03-17 14:53:44,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:53:44,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:53:44,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:53:44,259 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:53:44,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 14:53:44,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:53:44,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:53:44,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:53:44,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:53:44,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:53:44,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:53:44,301 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:53:44,302 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:53:44,336 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:53:44,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104895249] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:53:44,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:53:44,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2025-03-17 14:53:44,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852750520] [2025-03-17 14:53:44,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:53:44,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:53:44,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:53:44,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:53:44,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:53:44,338 INFO L87 Difference]: Start difference. First operand 213 states and 260 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:53:44,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:53:44,456 INFO L93 Difference]: Finished difference Result 398 states and 476 transitions. [2025-03-17 14:53:44,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:53:44,456 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-17 14:53:44,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:53:44,457 INFO L225 Difference]: With dead ends: 398 [2025-03-17 14:53:44,458 INFO L226 Difference]: Without dead ends: 396 [2025-03-17 14:53:44,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:53:44,459 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 200 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:53:44,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 143 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:53:44,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-17 14:53:44,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 229. [2025-03-17 14:53:44,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 218 states have (on average 1.2935779816513762) internal successors, (282), 228 states have internal predecessors, (282), 0 states have call successors, (0), 0 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-17 14:53:44,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 282 transitions. [2025-03-17 14:53:44,472 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 282 transitions. Word has length 22 [2025-03-17 14:53:44,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:53:44,472 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 282 transitions. [2025-03-17 14:53:44,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:53:44,472 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 282 transitions. [2025-03-17 14:53:44,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 14:53:44,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:53:44,474 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:53:44,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-17 14:53:44,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 14:53:44,675 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:53:44,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:53:44,675 INFO L85 PathProgramCache]: Analyzing trace with hash -2022035133, now seen corresponding path program 1 times [2025-03-17 14:53:44,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:53:44,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250536908] [2025-03-17 14:53:44,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:53:44,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:53:44,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:53:44,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:53:44,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:53:44,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:53:44,759 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-17 14:53:44,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:53:44,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250536908] [2025-03-17 14:53:44,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250536908] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:53:44,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136617702] [2025-03-17 14:53:44,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:53:44,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:53:44,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:53:44,761 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:53:44,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 14:53:44,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:53:44,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:53:44,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:53:44,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:53:44,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 14:53:44,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:53:44,853 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-17 14:53:44,853 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:53:44,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:53:44,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136617702] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 14:53:44,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:53:44,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 4] total 9 [2025-03-17 14:53:44,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634670135] [2025-03-17 14:53:44,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:53:44,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:53:44,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:53:44,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:53:44,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:53:44,884 INFO L87 Difference]: Start difference. First operand 229 states and 282 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:53:44,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:53:44,908 INFO L93 Difference]: Finished difference Result 229 states and 282 transitions. [2025-03-17 14:53:44,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:53:44,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-17 14:53:44,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:53:44,909 INFO L225 Difference]: With dead ends: 229 [2025-03-17 14:53:44,909 INFO L226 Difference]: Without dead ends: 52 [2025-03-17 14:53:44,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:53:44,910 INFO L435 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:53:44,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:53:44,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-17 14:53:44,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-17 14:53:44,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.08) internal successors, (54), 51 states have internal predecessors, (54), 0 states have call successors, (0), 0 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-17 14:53:44,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2025-03-17 14:53:44,914 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 23 [2025-03-17 14:53:44,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:53:44,914 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2025-03-17 14:53:44,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:53:44,914 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2025-03-17 14:53:44,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 14:53:44,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:53:44,915 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1] [2025-03-17 14:53:44,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-17 14:53:45,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 14:53:45,116 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:53:45,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:53:45,116 INFO L85 PathProgramCache]: Analyzing trace with hash -773111460, now seen corresponding path program 2 times [2025-03-17 14:53:45,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:53:45,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857431098] [2025-03-17 14:53:45,116 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:53:45,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:53:45,120 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-17 14:53:45,123 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 14:53:45,124 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:53:45,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:53:45,196 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:53:45,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:53:45,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857431098] [2025-03-17 14:53:45,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857431098] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:53:45,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449960042] [2025-03-17 14:53:45,197 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:53:45,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:53:45,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:53:45,198 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:53:45,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-17 14:53:45,214 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-17 14:53:45,221 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 14:53:45,221 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:53:45,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:53:45,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 14:53:45,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:53:45,254 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:53:45,255 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:53:45,321 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:53:45,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449960042] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:53:45,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:53:45,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-17 14:53:45,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134737025] [2025-03-17 14:53:45,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:53:45,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:53:45,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:53:45,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:53:45,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:53:45,323 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 13 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:53:45,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:53:45,367 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2025-03-17 14:53:45,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:53:45,368 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-17 14:53:45,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:53:45,368 INFO L225 Difference]: With dead ends: 82 [2025-03-17 14:53:45,368 INFO L226 Difference]: Without dead ends: 81 [2025-03-17 14:53:45,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:53:45,369 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 5 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:53:45,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 51 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:53:45,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-17 14:53:45,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2025-03-17 14:53:45,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 76 states have (on average 1.0657894736842106) internal successors, (81), 77 states have internal predecessors, (81), 0 states have call successors, (0), 0 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-17 14:53:45,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2025-03-17 14:53:45,373 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 34 [2025-03-17 14:53:45,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:53:45,373 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2025-03-17 14:53:45,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:53:45,374 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2025-03-17 14:53:45,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 14:53:45,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:53:45,374 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 1, 1] [2025-03-17 14:53:45,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-17 14:53:45,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:53:45,575 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:53:45,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:53:45,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1381828806, now seen corresponding path program 2 times [2025-03-17 14:53:45,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:53:45,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115756527] [2025-03-17 14:53:45,575 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:53:45,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:53:45,578 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-17 14:53:45,581 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 14:53:45,581 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:53:45,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:53:45,679 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:53:45,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:53:45,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115756527] [2025-03-17 14:53:45,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115756527] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:53:45,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413845499] [2025-03-17 14:53:45,679 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:53:45,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:53:45,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:53:45,681 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:53:45,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-17 14:53:45,697 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-17 14:53:45,700 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 50 statements. [2025-03-17 14:53:45,700 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:53:45,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:53:45,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:53:45,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:53:45,765 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2025-03-17 14:53:45,765 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:53:46,029 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2025-03-17 14:53:46,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413845499] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:53:46,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:53:46,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 3, 3] total 13 [2025-03-17 14:53:46,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387199807] [2025-03-17 14:53:46,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:53:46,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 14:53:46,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:53:46,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 14:53:46,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2025-03-17 14:53:46,030 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 15 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:53:46,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:53:46,235 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2025-03-17 14:53:46,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 14:53:46,235 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-17 14:53:46,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:53:46,236 INFO L225 Difference]: With dead ends: 78 [2025-03-17 14:53:46,236 INFO L226 Difference]: Without dead ends: 77 [2025-03-17 14:53:46,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=641, Unknown=0, NotChecked=0, Total=992 [2025-03-17 14:53:46,237 INFO L435 NwaCegarLoop]: 1 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:53:46,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:53:46,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-17 14:53:46,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-17 14:53:46,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 0 states have call successors, (0), 0 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-17 14:53:46,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2025-03-17 14:53:46,242 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 50 [2025-03-17 14:53:46,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:53:46,243 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2025-03-17 14:53:46,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:53:46,243 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2025-03-17 14:53:46,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-17 14:53:46,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:53:46,244 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 1, 1] [2025-03-17 14:53:46,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-17 14:53:46,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:53:46,444 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:53:46,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:53:46,445 INFO L85 PathProgramCache]: Analyzing trace with hash 720062268, now seen corresponding path program 3 times [2025-03-17 14:53:46,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:53:46,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691812223] [2025-03-17 14:53:46,445 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:53:46,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:53:46,449 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 76 statements into 11 equivalence classes. [2025-03-17 14:53:46,456 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 14:53:46,457 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 14:53:46,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:53:46,595 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:53:46,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:53:46,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691812223] [2025-03-17 14:53:46,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691812223] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:53:46,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885240695] [2025-03-17 14:53:46,595 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:53:46,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:53:46,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:53:46,597 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:53:46,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-17 14:53:46,614 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 76 statements into 11 equivalence classes. [2025-03-17 14:53:46,629 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 14:53:46,630 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 14:53:46,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:53:46,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 14:53:46,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:53:46,730 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:53:46,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:53:46,961 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:53:46,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885240695] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:53:46,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:53:46,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-17 14:53:46,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779459581] [2025-03-17 14:53:46,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:53:46,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 14:53:46,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:53:46,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 14:53:46,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-17 14:53:46,963 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand has 25 states, 24 states have (on average 6.583333333333333) internal successors, (158), 24 states have internal predecessors, (158), 0 states have call successors, (0), 0 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-17 14:53:47,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:53:47,051 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2025-03-17 14:53:47,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 14:53:47,051 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.583333333333333) internal successors, (158), 24 states have internal predecessors, (158), 0 states have call successors, (0), 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 76 [2025-03-17 14:53:47,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:53:47,052 INFO L225 Difference]: With dead ends: 162 [2025-03-17 14:53:47,052 INFO L226 Difference]: Without dead ends: 161 [2025-03-17 14:53:47,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-17 14:53:47,053 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:53:47,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 98 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:53:47,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-17 14:53:47,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2025-03-17 14:53:47,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.00625) internal successors, (161), 160 states have internal predecessors, (161), 0 states have call successors, (0), 0 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-17 14:53:47,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2025-03-17 14:53:47,060 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 76 [2025-03-17 14:53:47,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:53:47,060 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2025-03-17 14:53:47,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.583333333333333) internal successors, (158), 24 states have internal predecessors, (158), 0 states have call successors, (0), 0 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-17 14:53:47,060 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2025-03-17 14:53:47,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 14:53:47,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:53:47,062 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 1, 1] [2025-03-17 14:53:47,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-17 14:53:47,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:53:47,262 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:53:47,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:53:47,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1973859588, now seen corresponding path program 4 times [2025-03-17 14:53:47,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:53:47,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064164597] [2025-03-17 14:53:47,263 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:53:47,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:53:47,268 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 160 statements into 2 equivalence classes. [2025-03-17 14:53:47,275 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 14:53:47,276 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:53:47,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:53:47,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1727 backedges. 0 proven. 1727 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:53:47,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:53:47,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064164597] [2025-03-17 14:53:47,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064164597] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:53:47,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242063339] [2025-03-17 14:53:47,721 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:53:47,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:53:47,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:53:47,723 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:53:47,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-17 14:53:47,743 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 160 statements into 2 equivalence classes. [2025-03-17 14:53:47,767 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 14:53:47,767 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:53:47,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:53:47,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 14:53:47,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:53:47,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1727 backedges. 0 proven. 1727 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:53:47,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:53:48,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1727 backedges. 0 proven. 1727 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:53:48,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242063339] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:53:48,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:53:48,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 46 [2025-03-17 14:53:48,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969130123] [2025-03-17 14:53:48,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:53:48,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-17 14:53:48,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:53:48,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-17 14:53:48,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-17 14:53:48,441 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand has 48 states, 47 states have (on average 6.808510638297872) internal successors, (320), 47 states have internal predecessors, (320), 0 states have call successors, (0), 0 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-17 14:53:48,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:53:48,561 INFO L93 Difference]: Finished difference Result 218 states and 225 transitions. [2025-03-17 14:53:48,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-17 14:53:48,561 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 6.808510638297872) internal successors, (320), 47 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2025-03-17 14:53:48,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:53:48,564 INFO L225 Difference]: With dead ends: 218 [2025-03-17 14:53:48,564 INFO L226 Difference]: Without dead ends: 217 [2025-03-17 14:53:48,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-17 14:53:48,566 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:53:48,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:53:48,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-17 14:53:48,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2025-03-17 14:53:48,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.0046296296296295) internal successors, (217), 216 states have internal predecessors, (217), 0 states have call successors, (0), 0 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-17 14:53:48,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2025-03-17 14:53:48,574 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 160 [2025-03-17 14:53:48,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:53:48,574 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2025-03-17 14:53:48,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 6.808510638297872) internal successors, (320), 47 states have internal predecessors, (320), 0 states have call successors, (0), 0 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-17 14:53:48,575 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2025-03-17 14:53:48,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-17 14:53:48,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:53:48,576 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 1, 1] [2025-03-17 14:53:48,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-17 14:53:48,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:53:48,776 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:53:48,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:53:48,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1879141756, now seen corresponding path program 5 times [2025-03-17 14:53:48,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:53:48,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025959623] [2025-03-17 14:53:48,777 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:53:48,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:53:48,783 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 216 statements into 31 equivalence classes. [2025-03-17 14:53:48,801 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) and asserted 216 of 216 statements. [2025-03-17 14:53:48,801 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2025-03-17 14:53:48,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 14:53:48,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1163458750] [2025-03-17 14:53:48,802 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:53:48,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:53:48,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:53:48,804 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:53:48,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-17 14:53:48,831 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 216 statements into 31 equivalence classes. [2025-03-17 14:53:48,878 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) and asserted 216 of 216 statements. [2025-03-17 14:53:48,878 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2025-03-17 14:53:48,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:53:48,878 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:53:48,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-17 14:53:48,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-17 14:53:48,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:53:48,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:53:48,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 14:53:48,927 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:53:48,928 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2025-03-17 14:53:48,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2025-03-17 14:53:48,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2025-03-17 14:53:48,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2025-03-17 14:53:48,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2025-03-17 14:53:48,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2025-03-17 14:53:48,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2025-03-17 14:53:48,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2025-03-17 14:53:48,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2025-03-17 14:53:48,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2025-03-17 14:53:48,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2025-03-17 14:53:48,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2025-03-17 14:53:48,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2025-03-17 14:53:48,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2025-03-17 14:53:48,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2025-03-17 14:53:48,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2025-03-17 14:53:48,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2025-03-17 14:53:48,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2025-03-17 14:53:48,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-17 14:53:49,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:53:49,134 INFO L422 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:53:49,183 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:53:49,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:53:49 BoogieIcfgContainer [2025-03-17 14:53:49,185 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:53:49,186 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:53:49,186 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:53:49,186 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:53:49,186 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:53:36" (3/4) ... [2025-03-17 14:53:49,187 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-17 14:53:49,238 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 32. [2025-03-17 14:53:49,287 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 14:53:49,288 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 14:53:49,288 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:53:49,288 INFO L158 Benchmark]: Toolchain (without parser) took 13027.93ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 113.5MB in the beginning and 62.3MB in the end (delta: 51.3MB). Peak memory consumption was 85.4MB. Max. memory is 16.1GB. [2025-03-17 14:53:49,288 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:53:49,289 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.85ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 103.1MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:53:49,289 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.73ms. Allocated memory is still 142.6MB. Free memory was 103.1MB in the beginning and 102.1MB in the end (delta: 979.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:53:49,289 INFO L158 Benchmark]: Boogie Preprocessor took 30.62ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 101.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:53:49,289 INFO L158 Benchmark]: IcfgBuilder took 294.42ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 88.3MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 14:53:49,289 INFO L158 Benchmark]: TraceAbstraction took 12391.89ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 87.8MB in the beginning and 73.4MB in the end (delta: 14.4MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. [2025-03-17 14:53:49,289 INFO L158 Benchmark]: Witness Printer took 102.10ms. Allocated memory is still 176.2MB. Free memory was 73.4MB in the beginning and 62.3MB in the end (delta: 11.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 14:53:49,290 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.27ms. Allocated memory is still 201.3MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 178.85ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 103.1MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.73ms. Allocated memory is still 142.6MB. Free memory was 103.1MB in the beginning and 102.1MB in the end (delta: 979.6kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.62ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 101.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 294.42ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 88.3MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12391.89ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 87.8MB in the beginning and 73.4MB in the end (delta: 14.4MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. * Witness Printer took 102.10ms. Allocated memory is still 176.2MB. Free memory was 73.4MB in the beginning and 62.3MB in the end (delta: 11.2MB). Peak memory consumption was 16.8MB. 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 - CounterExampleResult [Line: 39]: integer overflow possible integer overflow possible We found a FailurePath: [L23] int A, B; [L24] int r, d, p, q; [L25] A = __VERIFIER_nondet_int() [L26] B = 1 [L28] r = A [L29] d = B [L30] p = 1 [L31] q = 0 VAL [A=0, B=1, d=1, p=1, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=1, p=1, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=1, p=1, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=2, p=1, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=2, p=2, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=2, p=2, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=2, p=2, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=4, p=2, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=4, p=4, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=4, p=4, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=4, p=4, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=8, p=4, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=8, p=8, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=8, p=8, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=8, p=8, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=16, p=8, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=16, p=16, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=16, p=16, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=16, p=16, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=32, p=16, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=32, p=32, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=32, p=32, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=32, p=32, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=64, p=32, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=64, p=64, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=64, p=64, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=64, p=64, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=128, p=64, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=128, p=128, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=128, p=128, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=128, p=128, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=256, p=128, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=256, p=256, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=256, p=256, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=256, p=256, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=512, p=256, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=512, p=512, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=512, p=512, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=512, p=512, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=1024, p=512, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=1024, p=1024, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=1024, p=1024, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=1024, p=1024, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=2048, p=1024, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=2048, p=2048, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=2048, p=2048, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=2048, p=2048, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=4096, p=2048, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=4096, p=4096, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=4096, p=4096, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=4096, p=4096, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=8192, p=4096, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=8192, p=8192, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=8192, p=8192, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=8192, p=8192, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=16384, p=8192, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=16384, p=16384, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=16384, p=16384, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=16384, p=16384, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=32768, p=16384, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=32768, p=32768, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=32768, p=32768, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=32768, p=32768, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=65536, p=32768, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=65536, p=65536, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=65536, p=65536, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=65536, p=65536, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=131072, p=65536, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=131072, p=131072, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=131072, p=131072, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=131072, p=131072, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=262144, p=131072, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=262144, p=262144, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=262144, p=262144, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=262144, p=262144, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=524288, p=262144, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=524288, p=524288, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=524288, p=524288, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=524288, p=524288, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=1048576, p=524288, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=1048576, p=1048576, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=1048576, p=1048576, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=1048576, p=1048576, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=2097152, p=1048576, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=2097152, p=2097152, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=2097152, p=2097152, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=2097152, p=2097152, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=4194304, p=2097152, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=4194304, p=4194304, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=4194304, p=4194304, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=4194304, p=4194304, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=8388608, p=4194304, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=8388608, p=8388608, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=8388608, p=8388608, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=8388608, p=8388608, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=16777216, p=8388608, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=16777216, p=16777216, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=16777216, p=16777216, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=16777216, p=16777216, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=33554432, p=16777216, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=33554432, p=33554432, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=33554432, p=33554432, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=33554432, p=33554432, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=67108864, p=33554432, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=67108864, p=67108864, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=67108864, p=67108864, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=67108864, p=67108864, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=134217728, p=67108864, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=134217728, p=134217728, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=134217728, p=134217728, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=134217728, p=134217728, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=268435456, p=134217728, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=268435456, p=268435456, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=268435456, p=268435456, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=268435456, p=268435456, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=536870912, p=268435456, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=536870912, p=536870912, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=536870912, p=536870912, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=536870912, p=536870912, q=0, r=0] [L39] EXPR 2 * d [L39] d = 2 * d VAL [A=0, B=1, d=1073741824, p=536870912, q=0, r=0] [L40] EXPR 2 * p [L40] p = 2 * p VAL [A=0, B=1, d=1073741824, p=1073741824, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=1073741824, p=1073741824, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=1073741824, p=1073741824, q=0, r=0] [L39] 2 * d VAL [A=0, B=1, p=1073741824, q=0, r=0] - UnprovableResult [Line: 53]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 53]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 43 locations, 47 edges, 18 error locations. Started 1 CEGAR loops. OverallTime: 12.3s, OverallIterations: 23, TraceHistogramMax: 31, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 867 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 867 mSDsluCounter, 1372 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 891 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1357 IncrementalHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 481 mSDtfsCounter, 1357 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 986 GetRequests, 810 SyntacticMatches, 1 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 937 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229occurred in iteration=17, InterpolantAutomatonStates: 171, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 381 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 1483 NumberOfCodeBlocks, 1441 NumberOfCodeBlocksAsserted, 126 NumberOfCheckSat, 1357 ConstructedInterpolants, 86 QuantifiedInterpolants, 6180 SizeOfPredicates, 14 NumberOfNonLiveVariables, 924 ConjunctsInSsa, 122 ConjunctsInUnsatCore, 41 InterpolantComputations, 13 PerfectInterpolantSequences, 260/7021 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 RESULT: Ultimate proved your program to be incorrect! [2025-03-17 14:53:49,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)