./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/byte_add-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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/bitvector/byte_add-2.i -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 ac64f5b077f8251002b0bb05f1aba070a52d8bbef53fa94e35704949c96b0f7c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 10:03:41,519 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 10:03:41,576 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-19 10:03:41,581 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 10:03:41,582 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 10:03:41,602 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 10:03:41,602 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 10:03:41,603 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 10:03:41,603 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 10:03:41,604 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 10:03:41,605 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 10:03:41,605 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 10:03:41,605 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 10:03:41,606 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 10:03:41,606 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 10:03:41,607 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 10:03:41,607 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 10:03:41,608 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 10:03:41,608 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 10:03:41,610 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 10:03:41,611 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 10:03:41,611 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 10:03:41,611 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 10:03:41,612 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 10:03:41,612 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 10:03:41,612 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 10:03:41,612 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 10:03:41,612 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 10:03:41,613 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 10:03:41,613 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 10:03:41,613 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 10:03:41,613 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 10:03:41,613 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 10:03:41,613 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 10:03:41,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:03:41,614 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 10:03:41,614 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 10:03:41,614 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 10:03:41,614 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 10:03:41,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 10:03:41,614 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 10:03:41,615 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 10:03:41,615 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 10:03:41,616 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 10:03:41,616 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> ac64f5b077f8251002b0bb05f1aba070a52d8bbef53fa94e35704949c96b0f7c [2024-11-19 10:03:41,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 10:03:41,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 10:03:41,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 10:03:41,846 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 10:03:41,847 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 10:03:41,848 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add-2.i [2024-11-19 10:03:43,108 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 10:03:43,258 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 10:03:43,259 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-2.i [2024-11-19 10:03:43,265 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/616081e90/41b8f6573b144dc0a29933781006fc53/FLAGca0b63881 [2024-11-19 10:03:43,277 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/616081e90/41b8f6573b144dc0a29933781006fc53 [2024-11-19 10:03:43,279 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 10:03:43,281 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 10:03:43,283 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 10:03:43,283 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 10:03:43,291 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 10:03:43,292 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:03:43" (1/1) ... [2024-11-19 10:03:43,292 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74d5a63b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:03:43, skipping insertion in model container [2024-11-19 10:03:43,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:03:43" (1/1) ... [2024-11-19 10:03:43,313 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 10:03:43,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:03:43,512 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 10:03:43,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:03:43,559 INFO L204 MainTranslator]: Completed translation [2024-11-19 10:03:43,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:03:43 WrapperNode [2024-11-19 10:03:43,560 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 10:03:43,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 10:03:43,562 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 10:03:43,562 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 10:03:43,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:03:43" (1/1) ... [2024-11-19 10:03:43,576 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:03:43" (1/1) ... [2024-11-19 10:03:43,628 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 192 [2024-11-19 10:03:43,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 10:03:43,629 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 10:03:43,642 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 10:03:43,644 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 10:03:43,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:03:43" (1/1) ... [2024-11-19 10:03:43,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:03:43" (1/1) ... [2024-11-19 10:03:43,655 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:03:43" (1/1) ... [2024-11-19 10:03:43,677 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 10:03:43,678 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:03:43" (1/1) ... [2024-11-19 10:03:43,678 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:03:43" (1/1) ... [2024-11-19 10:03:43,688 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:03:43" (1/1) ... [2024-11-19 10:03:43,694 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:03:43" (1/1) ... [2024-11-19 10:03:43,698 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:03:43" (1/1) ... [2024-11-19 10:03:43,704 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:03:43" (1/1) ... [2024-11-19 10:03:43,707 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 10:03:43,711 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 10:03:43,711 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 10:03:43,711 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 10:03:43,712 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:03:43" (1/1) ... [2024-11-19 10:03:43,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:03:43,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:03:43,745 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) [2024-11-19 10:03:43,749 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 [2024-11-19 10:03:43,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 10:03:43,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 10:03:43,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 10:03:43,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 10:03:43,852 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 10:03:43,854 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 10:03:44,207 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2024-11-19 10:03:44,207 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 10:03:44,224 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 10:03:44,224 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 10:03:44,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:03:44 BoogieIcfgContainer [2024-11-19 10:03:44,225 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 10:03:44,226 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 10:03:44,226 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 10:03:44,229 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 10:03:44,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:03:43" (1/3) ... [2024-11-19 10:03:44,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d9a01f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:03:44, skipping insertion in model container [2024-11-19 10:03:44,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:03:43" (2/3) ... [2024-11-19 10:03:44,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d9a01f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:03:44, skipping insertion in model container [2024-11-19 10:03:44,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:03:44" (3/3) ... [2024-11-19 10:03:44,234 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add-2.i [2024-11-19 10:03:44,247 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 10:03:44,247 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2024-11-19 10:03:44,298 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 10:03:44,303 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;@fa3c6a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 10:03:44,303 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2024-11-19 10:03:44,307 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 90 states have (on average 1.8666666666666667) internal successors, (168), 131 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:44,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 10:03:44,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:44,314 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 10:03:44,314 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:44,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:44,319 INFO L85 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2024-11-19 10:03:44,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:44,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423669903] [2024-11-19 10:03:44,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:44,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:44,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:03:44,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:44,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423669903] [2024-11-19 10:03:44,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423669903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:44,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:03:44,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 10:03:44,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118431879] [2024-11-19 10:03:44,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:44,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 10:03:44,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:44,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 10:03:44,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 10:03:44,515 INFO L87 Difference]: Start difference. First operand has 132 states, 90 states have (on average 1.8666666666666667) internal successors, (168), 131 states have internal predecessors, (168), 0 states have call successors, (0), 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 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:44,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:44,537 INFO L93 Difference]: Finished difference Result 167 states and 226 transitions. [2024-11-19 10:03:44,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 10:03:44,539 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-19 10:03:44,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:44,546 INFO L225 Difference]: With dead ends: 167 [2024-11-19 10:03:44,546 INFO L226 Difference]: Without dead ends: 79 [2024-11-19 10:03:44,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 10:03:44,553 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:44,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:03:44,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-19 10:03:44,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-19 10:03:44,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 78 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:44,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 109 transitions. [2024-11-19 10:03:44,590 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 109 transitions. Word has length 4 [2024-11-19 10:03:44,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:44,590 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 109 transitions. [2024-11-19 10:03:44,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:44,590 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 109 transitions. [2024-11-19 10:03:44,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 10:03:44,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:44,591 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:44,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 10:03:44,592 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:44,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:44,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1213044638, now seen corresponding path program 1 times [2024-11-19 10:03:44,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:44,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697070187] [2024-11-19 10:03:44,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:44,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:44,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:44,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:03:44,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:44,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697070187] [2024-11-19 10:03:44,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697070187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:44,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:03:44,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:03:44,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969133057] [2024-11-19 10:03:44,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:44,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:03:44,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:44,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:03:44,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:03:44,767 INFO L87 Difference]: Start difference. First operand 79 states and 109 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:44,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:44,896 INFO L93 Difference]: Finished difference Result 165 states and 240 transitions. [2024-11-19 10:03:44,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:03:44,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-19 10:03:44,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:44,897 INFO L225 Difference]: With dead ends: 165 [2024-11-19 10:03:44,898 INFO L226 Difference]: Without dead ends: 108 [2024-11-19 10:03:44,898 INFO L431 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 [2024-11-19 10:03:44,899 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 30 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:44,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 149 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:03:44,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-19 10:03:44,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2024-11-19 10:03:44,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:44,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 138 transitions. [2024-11-19 10:03:44,907 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 138 transitions. Word has length 19 [2024-11-19 10:03:44,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:44,908 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 138 transitions. [2024-11-19 10:03:44,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:44,908 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 138 transitions. [2024-11-19 10:03:44,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 10:03:44,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:44,909 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:44,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 10:03:44,910 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:44,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:44,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1776244864, now seen corresponding path program 1 times [2024-11-19 10:03:44,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:44,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365387111] [2024-11-19 10:03:44,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:44,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:45,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:03:45,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:45,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365387111] [2024-11-19 10:03:45,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365387111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:45,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:03:45,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:03:45,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838447945] [2024-11-19 10:03:45,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:45,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:03:45,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:45,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:03:45,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:03:45,060 INFO L87 Difference]: Start difference. First operand 104 states and 138 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:45,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:45,263 INFO L93 Difference]: Finished difference Result 234 states and 345 transitions. [2024-11-19 10:03:45,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:03:45,263 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-19 10:03:45,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:45,264 INFO L225 Difference]: With dead ends: 234 [2024-11-19 10:03:45,265 INFO L226 Difference]: Without dead ends: 177 [2024-11-19 10:03:45,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:03:45,266 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 114 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:45,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 205 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 10:03:45,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-19 10:03:45,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 129. [2024-11-19 10:03:45,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.3671875) internal successors, (175), 128 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:45,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 175 transitions. [2024-11-19 10:03:45,282 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 175 transitions. Word has length 26 [2024-11-19 10:03:45,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:45,283 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 175 transitions. [2024-11-19 10:03:45,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:45,283 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 175 transitions. [2024-11-19 10:03:45,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 10:03:45,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:45,284 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:45,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 10:03:45,284 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:45,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:45,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1932025242, now seen corresponding path program 1 times [2024-11-19 10:03:45,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:45,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667542233] [2024-11-19 10:03:45,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:45,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:45,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:45,439 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 10:03:45,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:45,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667542233] [2024-11-19 10:03:45,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667542233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:45,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:03:45,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:03:45,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490779545] [2024-11-19 10:03:45,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:45,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:03:45,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:45,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:03:45,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:03:45,443 INFO L87 Difference]: Start difference. First operand 129 states and 175 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:45,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:45,556 INFO L93 Difference]: Finished difference Result 335 states and 454 transitions. [2024-11-19 10:03:45,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:03:45,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 33 [2024-11-19 10:03:45,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:45,558 INFO L225 Difference]: With dead ends: 335 [2024-11-19 10:03:45,559 INFO L226 Difference]: Without dead ends: 231 [2024-11-19 10:03:45,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:03:45,560 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 110 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 310 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 [2024-11-19 10:03:45,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 310 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:03:45,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-19 10:03:45,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 142. [2024-11-19 10:03:45,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.3546099290780143) internal successors, (191), 141 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:45,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 191 transitions. [2024-11-19 10:03:45,576 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 191 transitions. Word has length 33 [2024-11-19 10:03:45,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:45,576 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 191 transitions. [2024-11-19 10:03:45,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:45,576 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 191 transitions. [2024-11-19 10:03:45,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 10:03:45,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:45,578 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:45,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 10:03:45,578 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:45,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:45,578 INFO L85 PathProgramCache]: Analyzing trace with hash 880692086, now seen corresponding path program 1 times [2024-11-19 10:03:45,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:45,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450165472] [2024-11-19 10:03:45,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:45,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:45,670 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 10:03:45,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:45,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450165472] [2024-11-19 10:03:45,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450165472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:45,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:03:45,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:03:45,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442410226] [2024-11-19 10:03:45,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:45,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:03:45,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:45,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:03:45,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:03:45,680 INFO L87 Difference]: Start difference. First operand 142 states and 191 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:45,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:45,806 INFO L93 Difference]: Finished difference Result 341 states and 460 transitions. [2024-11-19 10:03:45,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:03:45,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-19 10:03:45,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:45,808 INFO L225 Difference]: With dead ends: 341 [2024-11-19 10:03:45,808 INFO L226 Difference]: Without dead ends: 237 [2024-11-19 10:03:45,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:03:45,811 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 99 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:45,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 300 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:03:45,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-19 10:03:45,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 155. [2024-11-19 10:03:45,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.3311688311688312) internal successors, (205), 154 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:45,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 205 transitions. [2024-11-19 10:03:45,824 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 205 transitions. Word has length 36 [2024-11-19 10:03:45,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:45,824 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 205 transitions. [2024-11-19 10:03:45,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:45,824 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 205 transitions. [2024-11-19 10:03:45,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 10:03:45,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:45,825 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:45,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 10:03:45,826 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:45,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:45,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1757161921, now seen corresponding path program 1 times [2024-11-19 10:03:45,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:45,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416069519] [2024-11-19 10:03:45,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:45,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:45,930 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:03:45,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:45,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416069519] [2024-11-19 10:03:45,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416069519] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:03:45,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798730104] [2024-11-19 10:03:45,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:45,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:03:45,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:03:45,934 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) [2024-11-19 10:03:45,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 10:03:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:45,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:03:45,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:03:46,048 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 10:03:46,049 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:03:46,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798730104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:46,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:03:46,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-19 10:03:46,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999490985] [2024-11-19 10:03:46,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:46,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:03:46,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:46,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:03:46,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:03:46,052 INFO L87 Difference]: Start difference. First operand 155 states and 205 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 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) [2024-11-19 10:03:46,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:46,193 INFO L93 Difference]: Finished difference Result 310 states and 439 transitions. [2024-11-19 10:03:46,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:03:46,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 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 39 [2024-11-19 10:03:46,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:46,194 INFO L225 Difference]: With dead ends: 310 [2024-11-19 10:03:46,194 INFO L226 Difference]: Without dead ends: 208 [2024-11-19 10:03:46,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:03:46,195 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 48 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:46,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 247 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:03:46,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-19 10:03:46,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 186. [2024-11-19 10:03:46,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.308108108108108) internal successors, (242), 185 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:46,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 242 transitions. [2024-11-19 10:03:46,202 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 242 transitions. Word has length 39 [2024-11-19 10:03:46,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:46,202 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 242 transitions. [2024-11-19 10:03:46,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 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) [2024-11-19 10:03:46,203 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 242 transitions. [2024-11-19 10:03:46,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-19 10:03:46,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:46,207 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:46,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 10:03:46,408 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,SelfDestructingSolverStorable5 [2024-11-19 10:03:46,408 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:46,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:46,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1239804479, now seen corresponding path program 1 times [2024-11-19 10:03:46,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:46,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410838156] [2024-11-19 10:03:46,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:46,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:46,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:46,553 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:03:46,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:46,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410838156] [2024-11-19 10:03:46,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410838156] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:03:46,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902178448] [2024-11-19 10:03:46,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:46,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:03:46,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:03:46,557 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) [2024-11-19 10:03:46,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 10:03:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:46,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:03:46,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:03:46,627 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 10:03:46,627 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:03:46,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902178448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:46,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:03:46,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-19 10:03:46,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997737355] [2024-11-19 10:03:46,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:46,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:03:46,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:46,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:03:46,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:03:46,629 INFO L87 Difference]: Start difference. First operand 186 states and 242 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 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) [2024-11-19 10:03:46,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:46,766 INFO L93 Difference]: Finished difference Result 372 states and 507 transitions. [2024-11-19 10:03:46,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:03:46,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 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 46 [2024-11-19 10:03:46,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:46,767 INFO L225 Difference]: With dead ends: 372 [2024-11-19 10:03:46,767 INFO L226 Difference]: Without dead ends: 239 [2024-11-19 10:03:46,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:03:46,768 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 47 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:46,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 247 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:03:46,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-19 10:03:46,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 211. [2024-11-19 10:03:46,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.2904761904761906) internal successors, (271), 210 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:46,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 271 transitions. [2024-11-19 10:03:46,775 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 271 transitions. Word has length 46 [2024-11-19 10:03:46,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:46,775 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 271 transitions. [2024-11-19 10:03:46,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 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) [2024-11-19 10:03:46,775 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 271 transitions. [2024-11-19 10:03:46,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-19 10:03:46,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:46,776 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:46,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 10:03:46,980 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,SelfDestructingSolverStorable6 [2024-11-19 10:03:46,981 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:46,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:46,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1676819835, now seen corresponding path program 1 times [2024-11-19 10:03:46,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:46,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780521838] [2024-11-19 10:03:46,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:46,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:47,053 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-19 10:03:47,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:47,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780521838] [2024-11-19 10:03:47,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780521838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:47,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:03:47,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:03:47,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077952349] [2024-11-19 10:03:47,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:47,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:03:47,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:47,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:03:47,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:03:47,057 INFO L87 Difference]: Start difference. First operand 211 states and 271 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 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) [2024-11-19 10:03:47,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:47,065 INFO L93 Difference]: Finished difference Result 258 states and 328 transitions. [2024-11-19 10:03:47,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:03:47,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 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 53 [2024-11-19 10:03:47,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:47,066 INFO L225 Difference]: With dead ends: 258 [2024-11-19 10:03:47,066 INFO L226 Difference]: Without dead ends: 185 [2024-11-19 10:03:47,067 INFO L431 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 [2024-11-19 10:03:47,067 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 16 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:47,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 225 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:03:47,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-19 10:03:47,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-11-19 10:03:47,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.2771739130434783) internal successors, (235), 184 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:47,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 235 transitions. [2024-11-19 10:03:47,076 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 235 transitions. Word has length 53 [2024-11-19 10:03:47,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:47,077 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 235 transitions. [2024-11-19 10:03:47,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 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) [2024-11-19 10:03:47,077 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 235 transitions. [2024-11-19 10:03:47,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-19 10:03:47,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:47,081 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:47,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 10:03:47,081 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:47,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:47,082 INFO L85 PathProgramCache]: Analyzing trace with hash 2137686151, now seen corresponding path program 1 times [2024-11-19 10:03:47,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:47,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716306705] [2024-11-19 10:03:47,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:47,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:47,200 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-19 10:03:47,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:47,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716306705] [2024-11-19 10:03:47,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716306705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:47,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:03:47,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 10:03:47,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438215316] [2024-11-19 10:03:47,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:47,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:03:47,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:47,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:03:47,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:03:47,201 INFO L87 Difference]: Start difference. First operand 185 states and 235 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:47,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:47,329 INFO L93 Difference]: Finished difference Result 480 states and 612 transitions. [2024-11-19 10:03:47,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 10:03:47,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-19 10:03:47,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:47,331 INFO L225 Difference]: With dead ends: 480 [2024-11-19 10:03:47,331 INFO L226 Difference]: Without dead ends: 346 [2024-11-19 10:03:47,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:03:47,332 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 152 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:47,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 197 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:03:47,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-19 10:03:47,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 227. [2024-11-19 10:03:47,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.2743362831858407) internal successors, (288), 226 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:47,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 288 transitions. [2024-11-19 10:03:47,343 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 288 transitions. Word has length 65 [2024-11-19 10:03:47,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:47,344 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 288 transitions. [2024-11-19 10:03:47,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:47,344 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 288 transitions. [2024-11-19 10:03:47,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-19 10:03:47,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:47,345 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:47,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 10:03:47,345 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:47,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:47,346 INFO L85 PathProgramCache]: Analyzing trace with hash -2110196596, now seen corresponding path program 1 times [2024-11-19 10:03:47,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:47,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399258507] [2024-11-19 10:03:47,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:47,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:47,442 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 10:03:47,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:47,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399258507] [2024-11-19 10:03:47,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399258507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:47,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:03:47,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:03:47,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270501703] [2024-11-19 10:03:47,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:47,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:03:47,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:47,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:03:47,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:03:47,444 INFO L87 Difference]: Start difference. First operand 227 states and 288 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:47,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:47,492 INFO L93 Difference]: Finished difference Result 513 states and 651 transitions. [2024-11-19 10:03:47,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:03:47,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-19 10:03:47,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:47,494 INFO L225 Difference]: With dead ends: 513 [2024-11-19 10:03:47,494 INFO L226 Difference]: Without dead ends: 337 [2024-11-19 10:03:47,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:03:47,496 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 68 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:47,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 387 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:03:47,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-19 10:03:47,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 249. [2024-11-19 10:03:47,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 1.2983870967741935) internal successors, (322), 248 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:47,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 322 transitions. [2024-11-19 10:03:47,517 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 322 transitions. Word has length 68 [2024-11-19 10:03:47,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:47,517 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 322 transitions. [2024-11-19 10:03:47,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:47,517 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 322 transitions. [2024-11-19 10:03:47,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-19 10:03:47,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:47,518 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:47,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 10:03:47,518 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:47,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:47,519 INFO L85 PathProgramCache]: Analyzing trace with hash -301960682, now seen corresponding path program 1 times [2024-11-19 10:03:47,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:47,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280041224] [2024-11-19 10:03:47,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:47,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:47,637 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 10:03:47,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:47,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280041224] [2024-11-19 10:03:47,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280041224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:47,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:03:47,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 10:03:47,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236455027] [2024-11-19 10:03:47,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:47,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:03:47,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:47,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:03:47,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:03:47,638 INFO L87 Difference]: Start difference. First operand 249 states and 322 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:47,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:47,804 INFO L93 Difference]: Finished difference Result 685 states and 891 transitions. [2024-11-19 10:03:47,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 10:03:47,805 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-11-19 10:03:47,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:47,808 INFO L225 Difference]: With dead ends: 685 [2024-11-19 10:03:47,808 INFO L226 Difference]: Without dead ends: 482 [2024-11-19 10:03:47,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:03:47,809 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 162 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:47,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 232 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:03:47,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-11-19 10:03:47,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 407. [2024-11-19 10:03:47,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 1.2857142857142858) internal successors, (522), 406 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:47,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 522 transitions. [2024-11-19 10:03:47,819 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 522 transitions. Word has length 74 [2024-11-19 10:03:47,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:47,819 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 522 transitions. [2024-11-19 10:03:47,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:47,820 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 522 transitions. [2024-11-19 10:03:47,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-19 10:03:47,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:47,821 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:47,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 10:03:47,821 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:47,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:47,821 INFO L85 PathProgramCache]: Analyzing trace with hash -326786310, now seen corresponding path program 1 times [2024-11-19 10:03:47,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:47,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131242546] [2024-11-19 10:03:47,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:47,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:47,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:47,912 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-19 10:03:47,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:47,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131242546] [2024-11-19 10:03:47,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131242546] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:03:47,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376732456] [2024-11-19 10:03:47,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:47,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:03:47,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:03:47,914 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) [2024-11-19 10:03:47,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 10:03:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:47,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 10:03:47,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:03:48,049 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 10:03:48,049 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:03:48,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376732456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:48,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:03:48,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-19 10:03:48,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659749416] [2024-11-19 10:03:48,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:48,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:03:48,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:48,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:03:48,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:03:48,050 INFO L87 Difference]: Start difference. First operand 407 states and 522 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:48,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:48,124 INFO L93 Difference]: Finished difference Result 1047 states and 1341 transitions. [2024-11-19 10:03:48,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:03:48,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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 74 [2024-11-19 10:03:48,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:48,127 INFO L225 Difference]: With dead ends: 1047 [2024-11-19 10:03:48,127 INFO L226 Difference]: Without dead ends: 649 [2024-11-19 10:03:48,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:03:48,129 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 49 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:48,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 177 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:03:48,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2024-11-19 10:03:48,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 555. [2024-11-19 10:03:48,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 554 states have (on average 1.2761732851985559) internal successors, (707), 554 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:48,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 707 transitions. [2024-11-19 10:03:48,143 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 707 transitions. Word has length 74 [2024-11-19 10:03:48,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:48,144 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 707 transitions. [2024-11-19 10:03:48,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:48,144 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 707 transitions. [2024-11-19 10:03:48,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-19 10:03:48,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:48,148 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:48,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 10:03:48,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:03:48,349 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:48,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:48,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1468144829, now seen corresponding path program 1 times [2024-11-19 10:03:48,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:48,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456178293] [2024-11-19 10:03:48,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:48,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:48,490 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 10:03:48,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:48,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456178293] [2024-11-19 10:03:48,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456178293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:48,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:03:48,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 10:03:48,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025999197] [2024-11-19 10:03:48,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:48,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:03:48,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:48,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:03:48,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:03:48,491 INFO L87 Difference]: Start difference. First operand 555 states and 707 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:48,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:48,698 INFO L93 Difference]: Finished difference Result 1345 states and 1704 transitions. [2024-11-19 10:03:48,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 10:03:48,699 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-11-19 10:03:48,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:48,701 INFO L225 Difference]: With dead ends: 1345 [2024-11-19 10:03:48,701 INFO L226 Difference]: Without dead ends: 794 [2024-11-19 10:03:48,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:03:48,702 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 156 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:48,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 349 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 10:03:48,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2024-11-19 10:03:48,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 696. [2024-11-19 10:03:48,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 695 states have (on average 1.2618705035971223) internal successors, (877), 695 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:48,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 877 transitions. [2024-11-19 10:03:48,720 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 877 transitions. Word has length 74 [2024-11-19 10:03:48,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:48,720 INFO L471 AbstractCegarLoop]: Abstraction has 696 states and 877 transitions. [2024-11-19 10:03:48,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:48,721 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 877 transitions. [2024-11-19 10:03:48,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-19 10:03:48,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:48,722 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:48,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 10:03:48,722 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:48,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:48,723 INFO L85 PathProgramCache]: Analyzing trace with hash 2112281364, now seen corresponding path program 1 times [2024-11-19 10:03:48,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:48,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629995469] [2024-11-19 10:03:48,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:48,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:48,853 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-19 10:03:48,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:48,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629995469] [2024-11-19 10:03:48,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629995469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:48,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:03:48,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 10:03:48,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830493274] [2024-11-19 10:03:48,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:48,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 10:03:48,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:48,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 10:03:48,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:03:48,855 INFO L87 Difference]: Start difference. First operand 696 states and 877 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:49,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:49,109 INFO L93 Difference]: Finished difference Result 1731 states and 2171 transitions. [2024-11-19 10:03:49,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 10:03:49,110 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-19 10:03:49,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:49,113 INFO L225 Difference]: With dead ends: 1731 [2024-11-19 10:03:49,113 INFO L226 Difference]: Without dead ends: 961 [2024-11-19 10:03:49,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2024-11-19 10:03:49,114 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 198 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:49,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 319 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 10:03:49,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2024-11-19 10:03:49,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 826. [2024-11-19 10:03:49,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 825 states have (on average 1.2642424242424242) internal successors, (1043), 825 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:49,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1043 transitions. [2024-11-19 10:03:49,135 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1043 transitions. Word has length 80 [2024-11-19 10:03:49,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:49,135 INFO L471 AbstractCegarLoop]: Abstraction has 826 states and 1043 transitions. [2024-11-19 10:03:49,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:49,135 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1043 transitions. [2024-11-19 10:03:49,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-19 10:03:49,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:49,136 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:49,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 10:03:49,137 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:49,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:49,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1262585566, now seen corresponding path program 1 times [2024-11-19 10:03:49,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:49,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333174747] [2024-11-19 10:03:49,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:49,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:49,233 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 10:03:49,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:49,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333174747] [2024-11-19 10:03:49,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333174747] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:03:49,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597664977] [2024-11-19 10:03:49,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:49,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:03:49,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:03:49,235 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) [2024-11-19 10:03:49,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 10:03:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:49,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 10:03:49,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:03:49,350 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 26 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 10:03:49,350 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:03:49,419 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 10:03:49,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597664977] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:03:49,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:03:49,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2024-11-19 10:03:49,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999062182] [2024-11-19 10:03:49,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:03:49,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 10:03:49,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:49,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 10:03:49,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-19 10:03:49,421 INFO L87 Difference]: Start difference. First operand 826 states and 1043 transitions. Second operand has 10 states, 9 states have (on average 12.444444444444445) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:50,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:50,597 INFO L93 Difference]: Finished difference Result 4972 states and 6140 transitions. [2024-11-19 10:03:50,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-11-19 10:03:50,597 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 12.444444444444445) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-19 10:03:50,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:50,608 INFO L225 Difference]: With dead ends: 4972 [2024-11-19 10:03:50,608 INFO L226 Difference]: Without dead ends: 4016 [2024-11-19 10:03:50,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=592, Invalid=2600, Unknown=0, NotChecked=0, Total=3192 [2024-11-19 10:03:50,611 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 842 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:50,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 1470 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 10:03:50,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4016 states. [2024-11-19 10:03:50,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4016 to 1079. [2024-11-19 10:03:50,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 1078 states have (on average 1.4063079777365493) internal successors, (1516), 1078 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:50,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1516 transitions. [2024-11-19 10:03:50,663 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1516 transitions. Word has length 80 [2024-11-19 10:03:50,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:50,663 INFO L471 AbstractCegarLoop]: Abstraction has 1079 states and 1516 transitions. [2024-11-19 10:03:50,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 12.444444444444445) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:50,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1516 transitions. [2024-11-19 10:03:50,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-19 10:03:50,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:50,665 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:50,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 10:03:50,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-19 10:03:50,866 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:50,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:50,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1514248837, now seen corresponding path program 1 times [2024-11-19 10:03:50,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:50,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857786015] [2024-11-19 10:03:50,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:50,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:50,985 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 10:03:50,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:50,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857786015] [2024-11-19 10:03:50,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857786015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:50,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:03:50,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 10:03:50,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712787157] [2024-11-19 10:03:50,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:50,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 10:03:50,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:50,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 10:03:50,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:03:50,987 INFO L87 Difference]: Start difference. First operand 1079 states and 1516 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:51,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:51,226 INFO L93 Difference]: Finished difference Result 2425 states and 3400 transitions. [2024-11-19 10:03:51,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 10:03:51,227 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-19 10:03:51,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:51,231 INFO L225 Difference]: With dead ends: 2425 [2024-11-19 10:03:51,232 INFO L226 Difference]: Without dead ends: 1331 [2024-11-19 10:03:51,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2024-11-19 10:03:51,234 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 254 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:51,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 306 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 10:03:51,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2024-11-19 10:03:51,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1239. [2024-11-19 10:03:51,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1238 states have (on average 1.4103392568659128) internal successors, (1746), 1238 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:51,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1746 transitions. [2024-11-19 10:03:51,266 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1746 transitions. Word has length 80 [2024-11-19 10:03:51,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:51,266 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 1746 transitions. [2024-11-19 10:03:51,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:51,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1746 transitions. [2024-11-19 10:03:51,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 10:03:51,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:51,280 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:51,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 10:03:51,280 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:51,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:51,280 INFO L85 PathProgramCache]: Analyzing trace with hash -468213532, now seen corresponding path program 1 times [2024-11-19 10:03:51,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:51,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702337346] [2024-11-19 10:03:51,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:51,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:51,427 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-19 10:03:51,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:51,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702337346] [2024-11-19 10:03:51,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702337346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:51,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:03:51,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 10:03:51,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809703593] [2024-11-19 10:03:51,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:51,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:03:51,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:51,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:03:51,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:03:51,428 INFO L87 Difference]: Start difference. First operand 1239 states and 1746 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:51,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:51,622 INFO L93 Difference]: Finished difference Result 3836 states and 5402 transitions. [2024-11-19 10:03:51,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:03:51,623 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-11-19 10:03:51,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:51,632 INFO L225 Difference]: With dead ends: 3836 [2024-11-19 10:03:51,632 INFO L226 Difference]: Without dead ends: 3649 [2024-11-19 10:03:51,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:03:51,634 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 219 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:51,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 458 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:03:51,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3649 states. [2024-11-19 10:03:51,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3649 to 1239. [2024-11-19 10:03:51,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1238 states have (on average 1.4103392568659128) internal successors, (1746), 1238 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:51,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1746 transitions. [2024-11-19 10:03:51,691 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1746 transitions. Word has length 86 [2024-11-19 10:03:51,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:51,691 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 1746 transitions. [2024-11-19 10:03:51,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:51,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1746 transitions. [2024-11-19 10:03:51,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 10:03:51,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:51,693 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:51,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 10:03:51,693 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:51,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:51,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1893852281, now seen corresponding path program 1 times [2024-11-19 10:03:51,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:51,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975344832] [2024-11-19 10:03:51,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:51,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:51,861 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-19 10:03:51,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:51,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975344832] [2024-11-19 10:03:51,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975344832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:51,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:03:51,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 10:03:51,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044626720] [2024-11-19 10:03:51,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:51,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:03:51,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:51,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:03:51,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:03:51,863 INFO L87 Difference]: Start difference. First operand 1239 states and 1746 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:52,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:52,110 INFO L93 Difference]: Finished difference Result 3828 states and 5390 transitions. [2024-11-19 10:03:52,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:03:52,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-11-19 10:03:52,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:52,120 INFO L225 Difference]: With dead ends: 3828 [2024-11-19 10:03:52,120 INFO L226 Difference]: Without dead ends: 3632 [2024-11-19 10:03:52,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:03:52,122 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 181 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:52,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 408 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:03:52,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3632 states. [2024-11-19 10:03:52,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3632 to 1239. [2024-11-19 10:03:52,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1238 states have (on average 1.4103392568659128) internal successors, (1746), 1238 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:52,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1746 transitions. [2024-11-19 10:03:52,186 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1746 transitions. Word has length 86 [2024-11-19 10:03:52,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:52,186 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 1746 transitions. [2024-11-19 10:03:52,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:52,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1746 transitions. [2024-11-19 10:03:52,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-19 10:03:52,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:52,188 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:52,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 10:03:52,188 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:52,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:52,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1148768933, now seen corresponding path program 1 times [2024-11-19 10:03:52,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:52,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127795151] [2024-11-19 10:03:52,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:52,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:52,340 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-19 10:03:52,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:52,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127795151] [2024-11-19 10:03:52,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127795151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:52,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:03:52,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 10:03:52,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152766273] [2024-11-19 10:03:52,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:52,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:03:52,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:52,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:03:52,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:03:52,342 INFO L87 Difference]: Start difference. First operand 1239 states and 1746 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:52,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:52,707 INFO L93 Difference]: Finished difference Result 5049 states and 7113 transitions. [2024-11-19 10:03:52,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 10:03:52,707 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-11-19 10:03:52,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:52,720 INFO L225 Difference]: With dead ends: 5049 [2024-11-19 10:03:52,720 INFO L226 Difference]: Without dead ends: 4862 [2024-11-19 10:03:52,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:03:52,722 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 329 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:52,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 708 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 10:03:52,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4862 states. [2024-11-19 10:03:52,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4862 to 1239. [2024-11-19 10:03:52,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1238 states have (on average 1.4103392568659128) internal successors, (1746), 1238 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:52,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1746 transitions. [2024-11-19 10:03:52,785 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1746 transitions. Word has length 89 [2024-11-19 10:03:52,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:52,785 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 1746 transitions. [2024-11-19 10:03:52,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:52,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1746 transitions. [2024-11-19 10:03:52,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-19 10:03:52,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:52,786 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:52,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 10:03:52,787 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:52,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:52,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1153171285, now seen corresponding path program 1 times [2024-11-19 10:03:52,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:52,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107746975] [2024-11-19 10:03:52,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:52,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:52,914 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-19 10:03:52,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:52,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107746975] [2024-11-19 10:03:52,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107746975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:52,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:03:52,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 10:03:52,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277953380] [2024-11-19 10:03:52,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:52,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:03:52,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:52,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:03:52,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:03:52,917 INFO L87 Difference]: Start difference. First operand 1239 states and 1746 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:53,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:53,281 INFO L93 Difference]: Finished difference Result 5031 states and 7088 transitions. [2024-11-19 10:03:53,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 10:03:53,282 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-11-19 10:03:53,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:53,305 INFO L225 Difference]: With dead ends: 5031 [2024-11-19 10:03:53,305 INFO L226 Difference]: Without dead ends: 4835 [2024-11-19 10:03:53,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:03:53,311 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 271 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:53,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 606 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 10:03:53,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4835 states. [2024-11-19 10:03:53,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4835 to 1239. [2024-11-19 10:03:53,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1238 states have (on average 1.4103392568659128) internal successors, (1746), 1238 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:53,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1746 transitions. [2024-11-19 10:03:53,383 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1746 transitions. Word has length 89 [2024-11-19 10:03:53,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:53,383 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 1746 transitions. [2024-11-19 10:03:53,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:53,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1746 transitions. [2024-11-19 10:03:53,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-19 10:03:53,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:53,385 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:53,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 10:03:53,386 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:53,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:53,386 INFO L85 PathProgramCache]: Analyzing trace with hash 786075514, now seen corresponding path program 1 times [2024-11-19 10:03:53,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:53,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178686938] [2024-11-19 10:03:53,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:53,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:53,545 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-19 10:03:53,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:53,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178686938] [2024-11-19 10:03:53,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178686938] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:03:53,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39427459] [2024-11-19 10:03:53,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:53,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:03:53,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:03:53,546 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) [2024-11-19 10:03:53,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 10:03:53,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:53,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 10:03:53,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:03:53,681 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-19 10:03:53,681 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:03:53,789 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 40 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-19 10:03:53,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39427459] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:03:53,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:03:53,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 6] total 11 [2024-11-19 10:03:53,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290510022] [2024-11-19 10:03:53,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:03:53,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 10:03:53,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:53,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 10:03:53,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-19 10:03:53,791 INFO L87 Difference]: Start difference. First operand 1239 states and 1746 transitions. Second operand has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:54,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:54,411 INFO L93 Difference]: Finished difference Result 4734 states and 6934 transitions. [2024-11-19 10:03:54,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-19 10:03:54,412 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-11-19 10:03:54,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:54,417 INFO L225 Difference]: With dead ends: 4734 [2024-11-19 10:03:54,417 INFO L226 Difference]: Without dead ends: 3519 [2024-11-19 10:03:54,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2024-11-19 10:03:54,420 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 505 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:54,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 426 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 10:03:54,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3519 states. [2024-11-19 10:03:54,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3519 to 2697. [2024-11-19 10:03:54,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2697 states, 2696 states have (on average 1.3171364985163205) internal successors, (3551), 2696 states have internal predecessors, (3551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:54,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2697 states to 2697 states and 3551 transitions. [2024-11-19 10:03:54,516 INFO L78 Accepts]: Start accepts. Automaton has 2697 states and 3551 transitions. Word has length 89 [2024-11-19 10:03:54,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:54,516 INFO L471 AbstractCegarLoop]: Abstraction has 2697 states and 3551 transitions. [2024-11-19 10:03:54,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:54,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2697 states and 3551 transitions. [2024-11-19 10:03:54,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-19 10:03:54,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:54,518 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:54,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 10:03:54,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:03:54,722 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:54,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:54,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1857009734, now seen corresponding path program 1 times [2024-11-19 10:03:54,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:54,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523070216] [2024-11-19 10:03:54,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:54,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:54,899 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-19 10:03:54,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:54,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523070216] [2024-11-19 10:03:54,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523070216] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:03:54,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006837142] [2024-11-19 10:03:54,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:54,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:03:54,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:03:54,902 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) [2024-11-19 10:03:54,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 10:03:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:54,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 10:03:54,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:03:55,016 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 10:03:55,016 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:03:55,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006837142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:55,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:03:55,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-11-19 10:03:55,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688669515] [2024-11-19 10:03:55,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:55,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:03:55,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:55,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:03:55,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:03:55,017 INFO L87 Difference]: Start difference. First operand 2697 states and 3551 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:55,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:55,219 INFO L93 Difference]: Finished difference Result 5700 states and 7489 transitions. [2024-11-19 10:03:55,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:03:55,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-11-19 10:03:55,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:55,228 INFO L225 Difference]: With dead ends: 5700 [2024-11-19 10:03:55,228 INFO L226 Difference]: Without dead ends: 5251 [2024-11-19 10:03:55,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:03:55,231 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 47 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:55,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 236 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:03:55,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5251 states. [2024-11-19 10:03:55,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5251 to 4333. [2024-11-19 10:03:55,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4333 states, 4332 states have (on average 1.3206371191135735) internal successors, (5721), 4332 states have internal predecessors, (5721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:55,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4333 states to 4333 states and 5721 transitions. [2024-11-19 10:03:55,420 INFO L78 Accepts]: Start accepts. Automaton has 4333 states and 5721 transitions. Word has length 89 [2024-11-19 10:03:55,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:55,420 INFO L471 AbstractCegarLoop]: Abstraction has 4333 states and 5721 transitions. [2024-11-19 10:03:55,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:55,420 INFO L276 IsEmpty]: Start isEmpty. Operand 4333 states and 5721 transitions. [2024-11-19 10:03:55,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-19 10:03:55,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:55,423 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:55,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 10:03:55,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:03:55,628 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:55,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:55,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1487226441, now seen corresponding path program 1 times [2024-11-19 10:03:55,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:55,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9827185] [2024-11-19 10:03:55,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:55,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:55,771 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-19 10:03:55,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:55,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9827185] [2024-11-19 10:03:55,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9827185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:55,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:03:55,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 10:03:55,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697117794] [2024-11-19 10:03:55,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:55,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 10:03:55,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:55,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 10:03:55,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:03:55,773 INFO L87 Difference]: Start difference. First operand 4333 states and 5721 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:56,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:56,331 INFO L93 Difference]: Finished difference Result 9861 states and 13068 transitions. [2024-11-19 10:03:56,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 10:03:56,332 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-11-19 10:03:56,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:56,346 INFO L225 Difference]: With dead ends: 9861 [2024-11-19 10:03:56,346 INFO L226 Difference]: Without dead ends: 9619 [2024-11-19 10:03:56,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-19 10:03:56,351 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 437 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:56,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1019 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 10:03:56,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9619 states. [2024-11-19 10:03:56,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9619 to 4312. [2024-11-19 10:03:56,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4312 states, 4311 states have (on average 1.3208072372999304) internal successors, (5694), 4311 states have internal predecessors, (5694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:56,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4312 states to 4312 states and 5694 transitions. [2024-11-19 10:03:56,579 INFO L78 Accepts]: Start accepts. Automaton has 4312 states and 5694 transitions. Word has length 91 [2024-11-19 10:03:56,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:56,579 INFO L471 AbstractCegarLoop]: Abstraction has 4312 states and 5694 transitions. [2024-11-19 10:03:56,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:56,580 INFO L276 IsEmpty]: Start isEmpty. Operand 4312 states and 5694 transitions. [2024-11-19 10:03:56,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-19 10:03:56,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:56,582 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:56,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 10:03:56,582 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:56,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:56,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1983181657, now seen corresponding path program 1 times [2024-11-19 10:03:56,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:56,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028773553] [2024-11-19 10:03:56,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:56,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:56,740 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-19 10:03:56,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:56,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028773553] [2024-11-19 10:03:56,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028773553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:56,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:03:56,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 10:03:56,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518655026] [2024-11-19 10:03:56,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:56,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 10:03:56,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:56,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 10:03:56,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:03:56,741 INFO L87 Difference]: Start difference. First operand 4312 states and 5694 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:57,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:57,426 INFO L93 Difference]: Finished difference Result 10981 states and 14399 transitions. [2024-11-19 10:03:57,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 10:03:57,426 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-11-19 10:03:57,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:57,442 INFO L225 Difference]: With dead ends: 10981 [2024-11-19 10:03:57,442 INFO L226 Difference]: Without dead ends: 10588 [2024-11-19 10:03:57,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-19 10:03:57,448 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 351 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:57,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 848 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 10:03:57,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10588 states. [2024-11-19 10:03:57,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10588 to 4300. [2024-11-19 10:03:57,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4300 states, 4299 states have (on average 1.3217027215631543) internal successors, (5682), 4299 states have internal predecessors, (5682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:57,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4300 states to 4300 states and 5682 transitions. [2024-11-19 10:03:57,676 INFO L78 Accepts]: Start accepts. Automaton has 4300 states and 5682 transitions. Word has length 91 [2024-11-19 10:03:57,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:57,676 INFO L471 AbstractCegarLoop]: Abstraction has 4300 states and 5682 transitions. [2024-11-19 10:03:57,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:57,677 INFO L276 IsEmpty]: Start isEmpty. Operand 4300 states and 5682 transitions. [2024-11-19 10:03:57,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-19 10:03:57,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:57,679 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:57,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 10:03:57,680 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:57,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:57,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1314407751, now seen corresponding path program 1 times [2024-11-19 10:03:57,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:57,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645610822] [2024-11-19 10:03:57,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:57,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:57,798 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 10:03:57,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:57,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645610822] [2024-11-19 10:03:57,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645610822] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:03:57,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483359730] [2024-11-19 10:03:57,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:57,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:03:57,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:03:57,804 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) [2024-11-19 10:03:57,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 10:03:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:57,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 10:03:57,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:03:57,931 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 10:03:57,931 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:03:57,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483359730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:03:57,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:03:57,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-11-19 10:03:57,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594276543] [2024-11-19 10:03:57,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:03:57,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:03:57,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:57,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:03:57,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:03:57,933 INFO L87 Difference]: Start difference. First operand 4300 states and 5682 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:58,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:03:58,213 INFO L93 Difference]: Finished difference Result 8194 states and 10761 transitions. [2024-11-19 10:03:58,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:03:58,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 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 92 [2024-11-19 10:03:58,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:03:58,226 INFO L225 Difference]: With dead ends: 8194 [2024-11-19 10:03:58,226 INFO L226 Difference]: Without dead ends: 7745 [2024-11-19 10:03:58,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:03:58,228 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 91 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:03:58,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 353 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:03:58,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7745 states. [2024-11-19 10:03:58,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7745 to 4300. [2024-11-19 10:03:58,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4300 states, 4299 states have (on average 1.3217027215631543) internal successors, (5682), 4299 states have internal predecessors, (5682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:58,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4300 states to 4300 states and 5682 transitions. [2024-11-19 10:03:58,406 INFO L78 Accepts]: Start accepts. Automaton has 4300 states and 5682 transitions. Word has length 92 [2024-11-19 10:03:58,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:03:58,406 INFO L471 AbstractCegarLoop]: Abstraction has 4300 states and 5682 transitions. [2024-11-19 10:03:58,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:03:58,407 INFO L276 IsEmpty]: Start isEmpty. Operand 4300 states and 5682 transitions. [2024-11-19 10:03:58,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 10:03:58,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:03:58,409 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:03:58,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-19 10:03:58,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:03:58,611 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:03:58,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:03:58,611 INFO L85 PathProgramCache]: Analyzing trace with hash 207179917, now seen corresponding path program 1 times [2024-11-19 10:03:58,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:03:58,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605915860] [2024-11-19 10:03:58,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:58,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:03:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:58,756 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 10:03:58,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:03:58,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605915860] [2024-11-19 10:03:58,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605915860] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:03:58,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365566189] [2024-11-19 10:03:58,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:03:58,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:03:58,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:03:58,759 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) [2024-11-19 10:03:58,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 10:03:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:03:58,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 10:03:58,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:03:58,941 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-19 10:03:58,941 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:03:59,111 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 42 proven. 28 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 10:03:59,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365566189] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:03:59,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:03:59,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 10] total 17 [2024-11-19 10:03:59,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699404476] [2024-11-19 10:03:59,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:03:59,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 10:03:59,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:03:59,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 10:03:59,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-19 10:03:59,113 INFO L87 Difference]: Start difference. First operand 4300 states and 5682 transitions. Second operand has 17 states, 17 states have (on average 9.058823529411764) internal successors, (154), 17 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:04:00,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:00,473 INFO L93 Difference]: Finished difference Result 8261 states and 10881 transitions. [2024-11-19 10:04:00,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-19 10:04:00,473 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 9.058823529411764) internal successors, (154), 17 states have internal predecessors, (154), 0 states have call successors, (0), 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 95 [2024-11-19 10:04:00,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:00,481 INFO L225 Difference]: With dead ends: 8261 [2024-11-19 10:04:00,481 INFO L226 Difference]: Without dead ends: 4777 [2024-11-19 10:04:00,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 181 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=492, Invalid=1860, Unknown=0, NotChecked=0, Total=2352 [2024-11-19 10:04:00,487 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 1499 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:00,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1499 Valid, 1025 Invalid, 1251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 10:04:00,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4777 states. [2024-11-19 10:04:00,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4777 to 3536. [2024-11-19 10:04:00,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3536 states, 3535 states have (on average 1.2888260254596888) internal successors, (4556), 3535 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:04:00,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3536 states to 3536 states and 4556 transitions. [2024-11-19 10:04:00,701 INFO L78 Accepts]: Start accepts. Automaton has 3536 states and 4556 transitions. Word has length 95 [2024-11-19 10:04:00,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:00,702 INFO L471 AbstractCegarLoop]: Abstraction has 3536 states and 4556 transitions. [2024-11-19 10:04:00,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.058823529411764) internal successors, (154), 17 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:04:00,702 INFO L276 IsEmpty]: Start isEmpty. Operand 3536 states and 4556 transitions. [2024-11-19 10:04:00,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 10:04:00,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:00,706 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:00,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-19 10:04:00,909 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,SelfDestructingSolverStorable25 [2024-11-19 10:04:00,909 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:04:00,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:00,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1252848633, now seen corresponding path program 1 times [2024-11-19 10:04:00,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:00,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602319188] [2024-11-19 10:04:00,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:00,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:01,084 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 10:04:01,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:01,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602319188] [2024-11-19 10:04:01,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602319188] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:04:01,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468677192] [2024-11-19 10:04:01,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:01,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:04:01,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:04:01,086 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) [2024-11-19 10:04:01,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 10:04:01,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:01,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 10:04:01,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:04:01,267 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-19 10:04:01,267 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:04:01,438 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-19 10:04:01,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468677192] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:04:01,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:04:01,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 10] total 18 [2024-11-19 10:04:01,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997848948] [2024-11-19 10:04:01,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:04:01,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 10:04:01,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:01,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 10:04:01,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2024-11-19 10:04:01,440 INFO L87 Difference]: Start difference. First operand 3536 states and 4556 transitions. Second operand has 18 states, 18 states have (on average 8.833333333333334) internal successors, (159), 18 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:04:02,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:02,698 INFO L93 Difference]: Finished difference Result 10340 states and 13233 transitions. [2024-11-19 10:04:02,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-19 10:04:02,699 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.833333333333334) internal successors, (159), 18 states have internal predecessors, (159), 0 states have call successors, (0), 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 95 [2024-11-19 10:04:02,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:02,707 INFO L225 Difference]: With dead ends: 10340 [2024-11-19 10:04:02,707 INFO L226 Difference]: Without dead ends: 5859 [2024-11-19 10:04:02,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 180 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=394, Invalid=1246, Unknown=0, NotChecked=0, Total=1640 [2024-11-19 10:04:02,711 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 1663 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1663 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:02,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1663 Valid, 732 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 10:04:02,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5859 states. [2024-11-19 10:04:02,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5859 to 4813. [2024-11-19 10:04:02,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4813 states, 4812 states have (on average 1.2676641729010807) internal successors, (6100), 4812 states have internal predecessors, (6100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:04:02,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4813 states to 4813 states and 6100 transitions. [2024-11-19 10:04:02,927 INFO L78 Accepts]: Start accepts. Automaton has 4813 states and 6100 transitions. Word has length 95 [2024-11-19 10:04:02,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:02,927 INFO L471 AbstractCegarLoop]: Abstraction has 4813 states and 6100 transitions. [2024-11-19 10:04:02,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.833333333333334) internal successors, (159), 18 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:04:02,927 INFO L276 IsEmpty]: Start isEmpty. Operand 4813 states and 6100 transitions. [2024-11-19 10:04:02,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-19 10:04:02,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:02,930 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:02,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-19 10:04:03,130 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,SelfDestructingSolverStorable26 [2024-11-19 10:04:03,130 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2024-11-19 10:04:03,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:03,131 INFO L85 PathProgramCache]: Analyzing trace with hash 2031167465, now seen corresponding path program 1 times [2024-11-19 10:04:03,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:03,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431370383] [2024-11-19 10:04:03,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:03,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 10:04:03,185 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 10:04:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 10:04:03,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 10:04:03,239 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 10:04:03,240 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 41 remaining) [2024-11-19 10:04:03,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 41 remaining) [2024-11-19 10:04:03,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 41 remaining) [2024-11-19 10:04:03,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 41 remaining) [2024-11-19 10:04:03,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 41 remaining) [2024-11-19 10:04:03,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 41 remaining) [2024-11-19 10:04:03,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 41 remaining) [2024-11-19 10:04:03,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 41 remaining) [2024-11-19 10:04:03,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 41 remaining) [2024-11-19 10:04:03,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 41 remaining) [2024-11-19 10:04:03,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 41 remaining) [2024-11-19 10:04:03,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 41 remaining) [2024-11-19 10:04:03,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 41 remaining) [2024-11-19 10:04:03,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 41 remaining) [2024-11-19 10:04:03,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 41 remaining) [2024-11-19 10:04:03,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 41 remaining) [2024-11-19 10:04:03,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 41 remaining) [2024-11-19 10:04:03,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 41 remaining) [2024-11-19 10:04:03,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 41 remaining) [2024-11-19 10:04:03,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 41 remaining) [2024-11-19 10:04:03,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 41 remaining) [2024-11-19 10:04:03,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 41 remaining) [2024-11-19 10:04:03,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 41 remaining) [2024-11-19 10:04:03,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 41 remaining) [2024-11-19 10:04:03,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 41 remaining) [2024-11-19 10:04:03,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 41 remaining) [2024-11-19 10:04:03,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 41 remaining) [2024-11-19 10:04:03,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 41 remaining) [2024-11-19 10:04:03,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 41 remaining) [2024-11-19 10:04:03,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 41 remaining) [2024-11-19 10:04:03,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 41 remaining) [2024-11-19 10:04:03,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 41 remaining) [2024-11-19 10:04:03,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 41 remaining) [2024-11-19 10:04:03,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 41 remaining) [2024-11-19 10:04:03,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 41 remaining) [2024-11-19 10:04:03,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 41 remaining) [2024-11-19 10:04:03,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 41 remaining) [2024-11-19 10:04:03,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 41 remaining) [2024-11-19 10:04:03,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 41 remaining) [2024-11-19 10:04:03,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 41 remaining) [2024-11-19 10:04:03,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 41 remaining) [2024-11-19 10:04:03,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 10:04:03,248 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:03,316 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 10:04:03,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:04:03 BoogieIcfgContainer [2024-11-19 10:04:03,322 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 10:04:03,323 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 10:04:03,323 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 10:04:03,323 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 10:04:03,324 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:03:44" (3/4) ... [2024-11-19 10:04:03,324 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 10:04:03,399 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 10:04:03,401 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 10:04:03,402 INFO L158 Benchmark]: Toolchain (without parser) took 20121.45ms. Allocated memory was 176.2MB in the beginning and 704.6MB in the end (delta: 528.5MB). Free memory was 104.5MB in the beginning and 264.1MB in the end (delta: -159.6MB). Peak memory consumption was 372.7MB. Max. memory is 16.1GB. [2024-11-19 10:04:03,402 INFO L158 Benchmark]: CDTParser took 0.99ms. Allocated memory is still 176.2MB. Free memory was 129.8MB in the beginning and 129.6MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 10:04:03,402 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.61ms. Allocated memory is still 176.2MB. Free memory was 104.3MB in the beginning and 89.4MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 10:04:03,402 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.45ms. Allocated memory is still 176.2MB. Free memory was 89.4MB in the beginning and 143.4MB in the end (delta: -54.0MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2024-11-19 10:04:03,402 INFO L158 Benchmark]: Boogie Preprocessor took 80.78ms. Allocated memory is still 176.2MB. Free memory was 143.4MB in the beginning and 143.0MB in the end (delta: 415.3kB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2024-11-19 10:04:03,403 INFO L158 Benchmark]: RCFGBuilder took 514.03ms. Allocated memory is still 176.2MB. Free memory was 143.0MB in the beginning and 114.7MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-19 10:04:03,403 INFO L158 Benchmark]: TraceAbstraction took 19096.31ms. Allocated memory was 176.2MB in the beginning and 704.6MB in the end (delta: 528.5MB). Free memory was 113.6MB in the beginning and 271.4MB in the end (delta: -157.8MB). Peak memory consumption was 371.8MB. Max. memory is 16.1GB. [2024-11-19 10:04:03,403 INFO L158 Benchmark]: Witness Printer took 78.34ms. Allocated memory is still 704.6MB. Free memory was 271.4MB in the beginning and 264.1MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-19 10:04:03,404 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.99ms. Allocated memory is still 176.2MB. Free memory was 129.8MB in the beginning and 129.6MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.61ms. Allocated memory is still 176.2MB. Free memory was 104.3MB in the beginning and 89.4MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.45ms. Allocated memory is still 176.2MB. Free memory was 89.4MB in the beginning and 143.4MB in the end (delta: -54.0MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.78ms. Allocated memory is still 176.2MB. Free memory was 143.4MB in the beginning and 143.0MB in the end (delta: 415.3kB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * RCFGBuilder took 514.03ms. Allocated memory is still 176.2MB. Free memory was 143.0MB in the beginning and 114.7MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 19096.31ms. Allocated memory was 176.2MB in the beginning and 704.6MB in the end (delta: 528.5MB). Free memory was 113.6MB in the beginning and 271.4MB in the end (delta: -157.8MB). Peak memory consumption was 371.8MB. Max. memory is 16.1GB. * Witness Printer took 78.34ms. Allocated memory is still 704.6MB. Free memory was 271.4MB in the beginning and 264.1MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 116]: integer overflow possible integer overflow possible We found a FailurePath: [L124] unsigned int a, b, r; [L126] a = __VERIFIER_nondet_uint() [L127] b = __VERIFIER_nondet_uint() [L129] CALL mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, na=4] [L59] COND TRUE a3 == (unsigned char)0 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, na=4] [L60] EXPR na - 1 [L60] na = na - 1 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, na=3] [L61] COND TRUE a2 == (unsigned char)0 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, na=3] [L62] EXPR na - 1 [L62] na = na - 1 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, na=2] [L63] COND TRUE a1 == (unsigned char)0 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, na=2] [L64] EXPR na - 1 [L64] na = na - 1 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, na=1] [L68] nb = (unsigned char)4 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, na=1, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, na=1, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=0, na=1, nb=4] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=0, na=1, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=0, na=1, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=0, na=1, nb=4, partial_sum=0] [L84] EXPR partial_sum + a0 [L84] partial_sum = partial_sum + a0 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=0, na=1, nb=4, partial_sum=3] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=0, na=1, nb=4, partial_sum=3] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=0, na=1, nb=4, partial_sum=3] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=0, na=1, nb=4, partial_sum=3] [L89] COND TRUE i < nb VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=0, na=1, nb=4, partial_sum=3] [L90] COND TRUE i == (unsigned char)0 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=0, na=1, nb=4, partial_sum=3] [L90] EXPR partial_sum + b0 [L90] partial_sum = partial_sum + b0 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=0, na=1, nb=4, partial_sum=256] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=0, na=1, nb=4, partial_sum=256] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=0, na=1, nb=4, partial_sum=256] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=0, na=1, nb=4, partial_sum=256] [L95] COND TRUE partial_sum > ((unsigned char)254) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=1, i=0, na=1, nb=4, partial_sum=0] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=1, i=0, na=1, nb=4, partial_sum=0, r0=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=1, i=0, na=1, nb=4, partial_sum=0, r0=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=1, i=0, na=1, nb=4, partial_sum=0, r0=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=1, i=0, na=1, nb=4, partial_sum=0, r0=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0] [L83] COND FALSE !(i < na) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0] [L89] COND TRUE i < nb VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0] [L91] COND TRUE i == (unsigned char)1 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0] [L91] EXPR partial_sum + b1 [L91] partial_sum = partial_sum + b1 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=1, na=1, nb=4, partial_sum=256, r0=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=1, na=1, nb=4, partial_sum=256, r0=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=1, na=1, nb=4, partial_sum=256, r0=0] [L95] COND TRUE partial_sum > ((unsigned char)254) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=0] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=1, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=0, r1=0] [L83] COND FALSE !(i < na) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=0, r1=0] [L89] COND TRUE i < nb VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=0, r1=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=0, r1=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=0, r1=0] [L92] COND TRUE i == (unsigned char)2 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=0, r1=0] [L92] EXPR partial_sum + b2 [L92] partial_sum = partial_sum + b2 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=2, na=1, nb=4, partial_sum=256, r0=0, r1=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=2, na=1, nb=4, partial_sum=256, r0=0, r1=0] [L95] COND TRUE partial_sum > ((unsigned char)254) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=1, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=1, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=1, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=1, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=1, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=1, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L83] COND FALSE !(i < na) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L89] COND TRUE i < nb VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L93] COND TRUE i == (unsigned char)3 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L93] EXPR partial_sum + b3 [L93] partial_sum = partial_sum + b3 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L95] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=3, na=1, nb=4, r0=0, r1=0, r2=0, r3=128] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, carry=0, i=4, na=1, nb=4, r0=0, r1=0, r2=0, r3=128] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, i=4, r0=0, r1=0, r2=0, r3=128] [L107] COND FALSE !(i < (unsigned char)4) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, r0=0, r1=0, r2=0, r3=128] [L116] EXPR r1 << 8U VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, r0=0, r1=0, r2=0, r3=128] [L116] EXPR r0 | (r1 << 8U) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, r2=0, r3=128] [L116] EXPR r2 << 16U VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, r2=0, r3=128] [L116] r0 | (r1 << 8U) | (r2 << 16U) VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127, r3=128] [L116] r3 << 24U VAL [a0=3, a1=0, a2=0, a3=0, b0=2147483645, b1=8388607, b2=32767, b3=127] - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: 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, 132 locations, 41 error locations. Started 1 CEGAR loops. OverallTime: 19.0s, OverallIterations: 28, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7938 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7938 mSDsluCounter, 12062 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8659 mSDsCounter, 637 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7566 IncrementalHoareTripleChecker+Invalid, 8203 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 637 mSolverCounterUnsat, 3403 mSDtfsCounter, 7566 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1432 GetRequests, 1145 SyntacticMatches, 6 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2229 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4813occurred in iteration=27, InterpolantAutomatonStates: 285, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 27 MinimizatonAttempts, 35000 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 2639 NumberOfCodeBlocks, 2639 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2861 ConstructedInterpolants, 0 QuantifiedInterpolants, 7288 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1573 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 40 InterpolantComputations, 23 PerfectInterpolantSequences, 2362/2575 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-19 10:04:03,439 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)