./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/verifythis/elimination_max_rec.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d 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/verifythis/elimination_max_rec.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1d89bfe4b4c4586e423a8e3ebdbb120ac074219803de53807cd9f075553c6e3a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 12:20:17,526 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 12:20:17,645 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 12:20:17,654 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 12:20:17,656 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 12:20:17,686 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 12:20:17,689 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 12:20:17,689 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 12:20:17,690 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 12:20:17,691 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 12:20:17,691 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 12:20:17,692 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 12:20:17,692 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 12:20:17,693 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 12:20:17,693 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 12:20:17,696 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 12:20:17,696 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 12:20:17,696 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 12:20:17,696 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 12:20:17,697 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 12:20:17,697 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 12:20:17,698 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 12:20:17,699 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 12:20:17,699 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 12:20:17,700 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 12:20:17,703 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 12:20:17,703 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 12:20:17,704 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 12:20:17,704 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 12:20:17,704 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 12:20:17,704 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 12:20:17,705 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 12:20:17,705 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 12:20:17,705 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 12:20:17,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 12:20:17,706 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 12:20:17,706 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 12:20:17,706 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 12:20:17,706 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 12:20:17,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 12:20:17,707 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 12:20:17,709 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 12:20:17,709 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 12:20:17,710 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 12:20:17,710 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 -> 1d89bfe4b4c4586e423a8e3ebdbb120ac074219803de53807cd9f075553c6e3a [2024-11-09 12:20:18,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 12:20:18,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 12:20:18,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 12:20:18,044 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 12:20:18,044 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 12:20:18,045 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max_rec.c [2024-11-09 12:20:19,748 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 12:20:19,951 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 12:20:19,952 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec.c [2024-11-09 12:20:19,967 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f2af6a49/51ed566651ee40b0a093241c4cb66fde/FLAG972e6e739 [2024-11-09 12:20:20,330 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f2af6a49/51ed566651ee40b0a093241c4cb66fde [2024-11-09 12:20:20,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 12:20:20,333 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 12:20:20,336 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 12:20:20,336 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 12:20:20,341 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 12:20:20,342 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:20:20" (1/1) ... [2024-11-09 12:20:20,343 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d41b08b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:20, skipping insertion in model container [2024-11-09 12:20:20,345 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:20:20" (1/1) ... [2024-11-09 12:20:20,363 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 12:20:20,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 12:20:20,549 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 12:20:20,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 12:20:20,586 INFO L204 MainTranslator]: Completed translation [2024-11-09 12:20:20,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:20 WrapperNode [2024-11-09 12:20:20,587 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 12:20:20,588 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 12:20:20,588 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 12:20:20,588 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 12:20:20,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:20" (1/1) ... [2024-11-09 12:20:20,606 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:20" (1/1) ... [2024-11-09 12:20:20,625 INFO L138 Inliner]: procedures = 19, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 33 [2024-11-09 12:20:20,626 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 12:20:20,627 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 12:20:20,627 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 12:20:20,627 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 12:20:20,636 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:20" (1/1) ... [2024-11-09 12:20:20,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:20" (1/1) ... [2024-11-09 12:20:20,640 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:20" (1/1) ... [2024-11-09 12:20:20,653 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-09 12:20:20,653 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:20" (1/1) ... [2024-11-09 12:20:20,653 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:20" (1/1) ... [2024-11-09 12:20:20,657 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:20" (1/1) ... [2024-11-09 12:20:20,659 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:20" (1/1) ... [2024-11-09 12:20:20,660 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:20" (1/1) ... [2024-11-09 12:20:20,660 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:20" (1/1) ... [2024-11-09 12:20:20,666 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 12:20:20,667 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 12:20:20,667 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 12:20:20,667 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 12:20:20,668 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:20" (1/1) ... [2024-11-09 12:20:20,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 12:20:20,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:20:20,695 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-09 12:20:20,698 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-09 12:20:20,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 12:20:20,752 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 12:20:20,753 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 12:20:20,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 12:20:20,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 12:20:20,753 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-11-09 12:20:20,753 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-11-09 12:20:20,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 12:20:20,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 12:20:20,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 12:20:20,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 12:20:20,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 12:20:20,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 12:20:20,756 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 12:20:20,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 12:20:20,838 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 12:20:20,841 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 12:20:21,111 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-09 12:20:21,111 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 12:20:21,181 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 12:20:21,184 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 12:20:21,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:20:21 BoogieIcfgContainer [2024-11-09 12:20:21,185 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 12:20:21,188 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 12:20:21,192 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 12:20:21,196 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 12:20:21,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:20:20" (1/3) ... [2024-11-09 12:20:21,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb39b8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:20:21, skipping insertion in model container [2024-11-09 12:20:21,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:20" (2/3) ... [2024-11-09 12:20:21,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb39b8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:20:21, skipping insertion in model container [2024-11-09 12:20:21,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:20:21" (3/3) ... [2024-11-09 12:20:21,208 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2024-11-09 12:20:21,237 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 12:20:21,237 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-09 12:20:21,294 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 12:20:21,307 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;@325174bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 12:20:21,307 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-09 12:20:21,313 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 34 states have internal predecessors, (38), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 12:20:21,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 12:20:21,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:21,321 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:20:21,322 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 12:20:21,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:21,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1445398111, now seen corresponding path program 1 times [2024-11-09 12:20:21,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:21,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125315829] [2024-11-09 12:20:21,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:21,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:21,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:20:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:21,564 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-09 12:20:21,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:21,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125315829] [2024-11-09 12:20:21,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125315829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:20:21,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:20:21,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 12:20:21,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986783054] [2024-11-09 12:20:21,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:20:21,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 12:20:21,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:21,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 12:20:21,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 12:20:21,608 INFO L87 Difference]: Start difference. First operand has 44 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 34 states have internal predecessors, (38), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 12:20:21,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:21,643 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2024-11-09 12:20:21,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 12:20:21,645 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-09 12:20:21,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:21,653 INFO L225 Difference]: With dead ends: 84 [2024-11-09 12:20:21,654 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 12:20:21,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 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-09 12:20:21,663 INFO L432 NwaCegarLoop]: 47 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, 47 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-09 12:20:21,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:20:21,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 12:20:21,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-09 12:20:21,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 26 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 12:20:21,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2024-11-09 12:20:21,710 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 10 [2024-11-09 12:20:21,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:21,712 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2024-11-09 12:20:21,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 12:20:21,713 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2024-11-09 12:20:21,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 12:20:21,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:21,715 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:20:21,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 12:20:21,716 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 12:20:21,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:21,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1502656413, now seen corresponding path program 1 times [2024-11-09 12:20:21,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:21,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223932588] [2024-11-09 12:20:21,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:21,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:21,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:21,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:20:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:22,060 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-09 12:20:22,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:22,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223932588] [2024-11-09 12:20:22,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223932588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:20:22,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:20:22,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 12:20:22,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3179832] [2024-11-09 12:20:22,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:20:22,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 12:20:22,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:22,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 12:20:22,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 12:20:22,064 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 12:20:22,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:22,111 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2024-11-09 12:20:22,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 12:20:22,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-09 12:20:22,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:22,113 INFO L225 Difference]: With dead ends: 32 [2024-11-09 12:20:22,114 INFO L226 Difference]: Without dead ends: 30 [2024-11-09 12:20:22,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 12:20:22,116 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:20:22,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 97 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:20:22,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-09 12:20:22,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-09 12:20:22,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.25) internal successors, (25), 24 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 12:20:22,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2024-11-09 12:20:22,125 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 10 [2024-11-09 12:20:22,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:22,126 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2024-11-09 12:20:22,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 12:20:22,126 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2024-11-09 12:20:22,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 12:20:22,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:22,127 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] [2024-11-09 12:20:22,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 12:20:22,127 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 12:20:22,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:22,129 INFO L85 PathProgramCache]: Analyzing trace with hash -209049016, now seen corresponding path program 1 times [2024-11-09 12:20:22,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:22,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176439612] [2024-11-09 12:20:22,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:22,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:22,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:20:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:22,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 12:20:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:22,248 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-09 12:20:22,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:22,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176439612] [2024-11-09 12:20:22,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176439612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:20:22,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:20:22,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 12:20:22,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599880169] [2024-11-09 12:20:22,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:20:22,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 12:20:22,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:22,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 12:20:22,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 12:20:22,252 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 12:20:22,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:22,325 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2024-11-09 12:20:22,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 12:20:22,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2024-11-09 12:20:22,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:22,328 INFO L225 Difference]: With dead ends: 45 [2024-11-09 12:20:22,328 INFO L226 Difference]: Without dead ends: 43 [2024-11-09 12:20:22,329 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-09 12:20:22,330 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 17 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:20:22,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 100 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:20:22,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-09 12:20:22,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2024-11-09 12:20:22,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 32 states have internal predecessors, (36), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 12:20:22,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2024-11-09 12:20:22,346 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 22 [2024-11-09 12:20:22,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:22,348 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-11-09 12:20:22,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 12:20:22,349 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2024-11-09 12:20:22,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 12:20:22,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:22,353 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] [2024-11-09 12:20:22,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 12:20:22,354 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 12:20:22,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:22,355 INFO L85 PathProgramCache]: Analyzing trace with hash -209048824, now seen corresponding path program 1 times [2024-11-09 12:20:22,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:22,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591203434] [2024-11-09 12:20:22,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:22,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:22,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:20:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:22,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 12:20:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:22,542 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-09 12:20:22,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:22,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591203434] [2024-11-09 12:20:22,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591203434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:20:22,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:20:22,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 12:20:22,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507073652] [2024-11-09 12:20:22,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:20:22,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 12:20:22,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:22,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 12:20:22,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 12:20:22,546 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 12:20:22,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:22,641 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2024-11-09 12:20:22,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 12:20:22,642 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2024-11-09 12:20:22,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:22,643 INFO L225 Difference]: With dead ends: 43 [2024-11-09 12:20:22,643 INFO L226 Difference]: Without dead ends: 42 [2024-11-09 12:20:22,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-09 12:20:22,645 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:20:22,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 142 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:20:22,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-09 12:20:22,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2024-11-09 12:20:22,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 32 states have internal predecessors, (35), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 12:20:22,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2024-11-09 12:20:22,655 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 22 [2024-11-09 12:20:22,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:22,655 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2024-11-09 12:20:22,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 12:20:22,656 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2024-11-09 12:20:22,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 12:20:22,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:22,657 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] [2024-11-09 12:20:22,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 12:20:22,657 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 12:20:22,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:22,658 INFO L85 PathProgramCache]: Analyzing trace with hash 2109421121, now seen corresponding path program 1 times [2024-11-09 12:20:22,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:22,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250420897] [2024-11-09 12:20:22,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:22,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:22,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:20:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:22,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 12:20:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:22,801 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-09 12:20:22,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:22,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250420897] [2024-11-09 12:20:22,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250420897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:20:22,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:20:22,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 12:20:22,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774839141] [2024-11-09 12:20:22,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:20:22,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:20:22,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:22,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:20:22,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 12:20:22,804 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 12:20:22,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:22,868 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2024-11-09 12:20:22,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:20:22,869 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-11-09 12:20:22,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:22,870 INFO L225 Difference]: With dead ends: 40 [2024-11-09 12:20:22,870 INFO L226 Difference]: Without dead ends: 39 [2024-11-09 12:20:22,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 12:20:22,872 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:20:22,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 80 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:20:22,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-09 12:20:22,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-09 12:20:22,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 31 states have internal predecessors, (33), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 12:20:22,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2024-11-09 12:20:22,883 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 23 [2024-11-09 12:20:22,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:22,885 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2024-11-09 12:20:22,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 12:20:22,885 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2024-11-09 12:20:22,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 12:20:22,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:22,886 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:20:22,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 12:20:22,887 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 12:20:22,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:22,887 INFO L85 PathProgramCache]: Analyzing trace with hash 767373436, now seen corresponding path program 1 times [2024-11-09 12:20:22,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:22,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381089711] [2024-11-09 12:20:22,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:22,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:22,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:20:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:23,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 12:20:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:23,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 12:20:23,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:23,008 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:20:23,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:23,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381089711] [2024-11-09 12:20:23,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381089711] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:20:23,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043625626] [2024-11-09 12:20:23,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:23,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:20:23,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:20:23,018 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-09 12:20:23,029 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-09 12:20:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:23,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 12:20:23,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:20:23,183 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:20:23,183 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:20:23,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043625626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:20:23,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:20:23,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2024-11-09 12:20:23,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906440898] [2024-11-09 12:20:23,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:20:23,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 12:20:23,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:23,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 12:20:23,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-09 12:20:23,185 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 12:20:23,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:23,275 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2024-11-09 12:20:23,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 12:20:23,276 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2024-11-09 12:20:23,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:23,277 INFO L225 Difference]: With dead ends: 40 [2024-11-09 12:20:23,277 INFO L226 Difference]: Without dead ends: 39 [2024-11-09 12:20:23,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-11-09 12:20:23,278 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 28 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:20:23,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 126 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:20:23,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-09 12:20:23,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2024-11-09 12:20:23,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 30 states have internal predecessors, (32), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 12:20:23,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2024-11-09 12:20:23,284 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 34 [2024-11-09 12:20:23,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:23,284 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2024-11-09 12:20:23,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 12:20:23,285 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2024-11-09 12:20:23,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 12:20:23,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:23,286 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:20:23,309 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-09 12:20:23,486 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-09 12:20:23,487 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 12:20:23,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:23,488 INFO L85 PathProgramCache]: Analyzing trace with hash 767373628, now seen corresponding path program 1 times [2024-11-09 12:20:23,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:23,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871388572] [2024-11-09 12:20:23,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:23,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:23,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:20:23,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:23,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 12:20:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:23,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 12:20:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:23,637 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:20:23,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:23,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871388572] [2024-11-09 12:20:23,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871388572] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:20:23,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738347393] [2024-11-09 12:20:23,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:23,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:20:23,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:20:23,644 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-09 12:20:23,646 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-09 12:20:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:23,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 12:20:23,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:20:23,817 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:20:23,818 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:20:23,963 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:20:23,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738347393] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:20:23,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:20:23,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2024-11-09 12:20:23,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576264273] [2024-11-09 12:20:23,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:20:23,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 12:20:23,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:23,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 12:20:23,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2024-11-09 12:20:23,967 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 16 states have internal predecessors, (45), 9 states have call successors, (13), 7 states have call predecessors, (13), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 12:20:24,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:24,222 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2024-11-09 12:20:24,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 12:20:24,222 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 16 states have internal predecessors, (45), 9 states have call successors, (13), 7 states have call predecessors, (13), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 34 [2024-11-09 12:20:24,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:24,223 INFO L225 Difference]: With dead ends: 40 [2024-11-09 12:20:24,223 INFO L226 Difference]: Without dead ends: 39 [2024-11-09 12:20:24,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=222, Invalid=900, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 12:20:24,225 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 87 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:20:24,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 177 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:20:24,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-09 12:20:24,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2024-11-09 12:20:24,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 12:20:24,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-09 12:20:24,231 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 34 [2024-11-09 12:20:24,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:24,231 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-09 12:20:24,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 16 states have internal predecessors, (45), 9 states have call successors, (13), 7 states have call predecessors, (13), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 12:20:24,232 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-09 12:20:24,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 12:20:24,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:24,232 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:20:24,250 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-09 12:20:24,433 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-09 12:20:24,434 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 12:20:24,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:24,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1981227193, now seen corresponding path program 1 times [2024-11-09 12:20:24,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:24,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603987254] [2024-11-09 12:20:24,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:24,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:24,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:20:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:24,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 12:20:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:24,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 12:20:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:24,538 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:20:24,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:24,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603987254] [2024-11-09 12:20:24,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603987254] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:20:24,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406361294] [2024-11-09 12:20:24,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:24,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:20:24,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:20:24,544 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-09 12:20:24,555 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-09 12:20:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:24,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 12:20:24,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:20:24,668 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:20:24,669 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:20:24,755 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:20:24,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406361294] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:20:24,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:20:24,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-11-09 12:20:24,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801124129] [2024-11-09 12:20:24,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:20:24,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 12:20:24,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:24,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 12:20:24,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2024-11-09 12:20:24,758 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 17 states, 16 states have (on average 2.625) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 12:20:24,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:24,976 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2024-11-09 12:20:24,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 12:20:24,977 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.625) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 35 [2024-11-09 12:20:24,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:24,978 INFO L225 Difference]: With dead ends: 72 [2024-11-09 12:20:24,978 INFO L226 Difference]: Without dead ends: 71 [2024-11-09 12:20:24,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=586, Unknown=0, NotChecked=0, Total=756 [2024-11-09 12:20:24,979 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 69 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:20:24,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 183 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:20:24,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-09 12:20:24,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2024-11-09 12:20:24,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 53 states have internal predecessors, (58), 12 states have call successors, (12), 7 states have call predecessors, (12), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 12:20:24,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2024-11-09 12:20:24,989 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 35 [2024-11-09 12:20:24,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:24,990 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2024-11-09 12:20:24,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.625) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 12:20:24,990 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2024-11-09 12:20:24,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 12:20:24,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:24,992 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:20:25,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 12:20:25,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:20:25,196 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 12:20:25,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:25,197 INFO L85 PathProgramCache]: Analyzing trace with hash -910052309, now seen corresponding path program 2 times [2024-11-09 12:20:25,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:25,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452948602] [2024-11-09 12:20:25,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:25,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:25,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:20:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:25,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 12:20:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:25,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 12:20:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:25,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 12:20:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:25,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 12:20:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:25,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 12:20:25,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:25,560 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:20:25,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:25,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452948602] [2024-11-09 12:20:25,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452948602] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:20:25,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276952066] [2024-11-09 12:20:25,561 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 12:20:25,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:20:25,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:20:25,566 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-09 12:20:25,575 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-09 12:20:25,665 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 12:20:25,665 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 12:20:25,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 12:20:25,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:20:25,791 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:20:25,792 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:20:26,679 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:20:26,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276952066] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:20:26,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:20:26,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 34 [2024-11-09 12:20:26,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656956145] [2024-11-09 12:20:26,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:20:26,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-09 12:20:26,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:26,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-09 12:20:26,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=958, Unknown=0, NotChecked=0, Total=1190 [2024-11-09 12:20:26,689 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand has 35 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 24 states have internal predecessors, (78), 12 states have call successors, (23), 12 states have call predecessors, (23), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 12:20:27,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:27,995 INFO L93 Difference]: Finished difference Result 138 states and 164 transitions. [2024-11-09 12:20:27,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-09 12:20:27,996 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 24 states have internal predecessors, (78), 12 states have call successors, (23), 12 states have call predecessors, (23), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 71 [2024-11-09 12:20:27,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:27,997 INFO L225 Difference]: With dead ends: 138 [2024-11-09 12:20:27,998 INFO L226 Difference]: Without dead ends: 137 [2024-11-09 12:20:28,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1060 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=830, Invalid=3202, Unknown=0, NotChecked=0, Total=4032 [2024-11-09 12:20:28,001 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 240 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 12:20:28,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 272 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 12:20:28,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-09 12:20:28,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 127. [2024-11-09 12:20:28,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 100 states have (on average 1.12) internal successors, (112), 101 states have internal predecessors, (112), 24 states have call successors, (24), 13 states have call predecessors, (24), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 12:20:28,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 148 transitions. [2024-11-09 12:20:28,016 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 148 transitions. Word has length 71 [2024-11-09 12:20:28,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:28,017 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 148 transitions. [2024-11-09 12:20:28,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 24 states have internal predecessors, (78), 12 states have call successors, (23), 12 states have call predecessors, (23), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 12:20:28,018 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 148 transitions. [2024-11-09 12:20:28,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 12:20:28,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:28,023 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:20:28,042 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-09 12:20:28,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:20:28,228 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 12:20:28,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:28,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1007192077, now seen corresponding path program 3 times [2024-11-09 12:20:28,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:28,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984186724] [2024-11-09 12:20:28,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:28,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:29,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:20:29,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:29,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 12:20:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:29,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 12:20:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:29,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 12:20:29,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:29,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 12:20:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:29,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 12:20:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:29,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 12:20:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:29,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 12:20:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:29,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 12:20:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:29,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 12:20:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:29,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 12:20:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:29,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-09 12:20:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:29,365 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 430 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 12:20:29,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:29,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984186724] [2024-11-09 12:20:29,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984186724] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:20:29,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534469094] [2024-11-09 12:20:29,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 12:20:29,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:20:29,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:20:29,370 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-09 12:20:29,377 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-09 12:20:29,563 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-09 12:20:29,563 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 12:20:29,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-09 12:20:29,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:20:29,741 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 430 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 12:20:29,741 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:20:30,724 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 430 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 12:20:30,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534469094] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:20:30,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:20:30,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 70 [2024-11-09 12:20:30,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154688498] [2024-11-09 12:20:30,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:20:30,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-11-09 12:20:30,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:30,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-11-09 12:20:30,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=898, Invalid=4072, Unknown=0, NotChecked=0, Total=4970 [2024-11-09 12:20:30,730 INFO L87 Difference]: Start difference. First operand 127 states and 148 transitions. Second operand has 71 states, 70 states have (on average 2.142857142857143) internal successors, (150), 48 states have internal predecessors, (150), 24 states have call successors, (47), 24 states have call predecessors, (47), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 12:20:32,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:32,878 INFO L93 Difference]: Finished difference Result 270 states and 326 transitions. [2024-11-09 12:20:32,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2024-11-09 12:20:32,879 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 70 states have (on average 2.142857142857143) internal successors, (150), 48 states have internal predecessors, (150), 24 states have call successors, (47), 24 states have call predecessors, (47), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Word has length 143 [2024-11-09 12:20:32,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:32,882 INFO L225 Difference]: With dead ends: 270 [2024-11-09 12:20:32,882 INFO L226 Difference]: Without dead ends: 269 [2024-11-09 12:20:32,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5116 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3662, Invalid=14698, Unknown=0, NotChecked=0, Total=18360 [2024-11-09 12:20:32,890 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 732 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 12:20:32,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 365 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 12:20:32,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-09 12:20:32,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 247. [2024-11-09 12:20:32,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 196 states have (on average 1.1224489795918366) internal successors, (220), 197 states have internal predecessors, (220), 48 states have call successors, (48), 25 states have call predecessors, (48), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 12:20:32,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 292 transitions. [2024-11-09 12:20:32,911 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 292 transitions. Word has length 143 [2024-11-09 12:20:32,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:32,911 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 292 transitions. [2024-11-09 12:20:32,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 70 states have (on average 2.142857142857143) internal successors, (150), 48 states have internal predecessors, (150), 24 states have call successors, (47), 24 states have call predecessors, (47), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 12:20:32,912 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 292 transitions. [2024-11-09 12:20:32,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2024-11-09 12:20:32,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:32,915 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:20:32,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 12:20:33,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 12:20:33,120 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-09 12:20:33,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:33,121 INFO L85 PathProgramCache]: Analyzing trace with hash 594503555, now seen corresponding path program 4 times [2024-11-09 12:20:33,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:33,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557783385] [2024-11-09 12:20:33,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:33,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:36,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:20:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:36,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 12:20:36,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:36,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 12:20:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:36,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 12:20:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:36,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 12:20:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:36,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 12:20:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:36,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 12:20:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:36,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 12:20:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:36,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 12:20:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:36,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 12:20:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:36,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 12:20:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:36,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-09 12:20:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:36,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-09 12:20:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:36,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-09 12:20:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:36,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-09 12:20:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:36,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-09 12:20:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:36,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-09 12:20:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:36,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-11-09 12:20:36,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:36,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-11-09 12:20:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:36,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-11-09 12:20:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:36,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-09 12:20:36,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:36,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-09 12:20:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:36,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-11-09 12:20:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:36,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-11-09 12:20:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:36,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3014 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 12:20:36,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:36,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557783385] [2024-11-09 12:20:36,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557783385] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:20:36,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350999952] [2024-11-09 12:20:36,741 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 12:20:36,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:20:36,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:20:36,747 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-09 12:20:36,748 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-09 12:20:36,986 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 12:20:36,986 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 12:20:37,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 1141 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-09 12:20:37,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:20:37,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3014 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 2904 trivial. 0 not checked. [2024-11-09 12:20:37,453 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:20:38,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3014 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 2904 trivial. 0 not checked. [2024-11-09 12:20:38,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350999952] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:20:38,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:20:38,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 6, 6] total 80 [2024-11-09 12:20:38,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899173831] [2024-11-09 12:20:38,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:20:38,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2024-11-09 12:20:38,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:38,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2024-11-09 12:20:38,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1015, Invalid=5465, Unknown=0, NotChecked=0, Total=6480 [2024-11-09 12:20:38,010 INFO L87 Difference]: Start difference. First operand 247 states and 292 transitions. Second operand has 81 states, 80 states have (on average 2.275) internal successors, (182), 56 states have internal predecessors, (182), 30 states have call successors, (57), 26 states have call predecessors, (57), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 12:20:51,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:51,400 INFO L93 Difference]: Finished difference Result 545 states and 643 transitions. [2024-11-09 12:20:51,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 268 states. [2024-11-09 12:20:51,401 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 80 states have (on average 2.275) internal successors, (182), 56 states have internal predecessors, (182), 30 states have call successors, (57), 26 states have call predecessors, (57), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Word has length 287 [2024-11-09 12:20:51,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:51,403 INFO L225 Difference]: With dead ends: 545 [2024-11-09 12:20:51,403 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 12:20:51,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 975 GetRequests, 633 SyntacticMatches, 0 SemanticMatches, 342 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40496 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=21775, Invalid=96217, Unknown=0, NotChecked=0, Total=117992 [2024-11-09 12:20:51,423 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 2091 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2091 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 12:20:51,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2091 Valid, 320 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 12:20:51,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 12:20:51,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 12:20:51,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:20:51,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 12:20:51,425 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 287 [2024-11-09 12:20:51,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:51,426 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 12:20:51,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 80 states have (on average 2.275) internal successors, (182), 56 states have internal predecessors, (182), 30 states have call successors, (57), 26 states have call predecessors, (57), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 12:20:51,426 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 12:20:51,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 12:20:51,430 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-09 12:20:51,430 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-09 12:20:51,430 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-09 12:20:51,431 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-09 12:20:51,431 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-09 12:20:51,431 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-09 12:20:51,452 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-09 12:20:51,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:20:51,640 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:20:51,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 12:21:01,488 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 12:21:01,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:21:01 BoogieIcfgContainer [2024-11-09 12:21:01,509 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 12:21:01,510 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 12:21:01,510 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 12:21:01,510 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 12:21:01,511 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:20:21" (3/4) ... [2024-11-09 12:21:01,513 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 12:21:01,517 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-09 12:21:01,517 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2024-11-09 12:21:01,517 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-09 12:21:01,521 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-11-09 12:21:01,521 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 12:21:01,522 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 12:21:01,523 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 12:21:01,622 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 12:21:01,622 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 12:21:01,622 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 12:21:01,623 INFO L158 Benchmark]: Toolchain (without parser) took 41289.79ms. Allocated memory was 201.3MB in the beginning and 895.5MB in the end (delta: 694.2MB). Free memory was 132.6MB in the beginning and 717.1MB in the end (delta: -584.4MB). Peak memory consumption was 111.4MB. Max. memory is 16.1GB. [2024-11-09 12:21:01,623 INFO L158 Benchmark]: CDTParser took 1.32ms. Allocated memory is still 117.4MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 12:21:01,624 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.09ms. Allocated memory is still 201.3MB. Free memory was 132.4MB in the beginning and 120.0MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 12:21:01,624 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.30ms. Allocated memory is still 201.3MB. Free memory was 120.0MB in the beginning and 118.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 12:21:01,624 INFO L158 Benchmark]: Boogie Preprocessor took 39.60ms. Allocated memory is still 201.3MB. Free memory was 118.3MB in the beginning and 116.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 12:21:01,624 INFO L158 Benchmark]: RCFGBuilder took 518.36ms. Allocated memory is still 201.3MB. Free memory was 116.5MB in the beginning and 170.0MB in the end (delta: -53.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 12:21:01,625 INFO L158 Benchmark]: TraceAbstraction took 40320.70ms. Allocated memory was 201.3MB in the beginning and 895.5MB in the end (delta: 694.2MB). Free memory was 169.1MB in the beginning and 722.3MB in the end (delta: -553.2MB). Peak memory consumption was 541.1MB. Max. memory is 16.1GB. [2024-11-09 12:21:01,625 INFO L158 Benchmark]: Witness Printer took 112.65ms. Allocated memory is still 895.5MB. Free memory was 722.3MB in the beginning and 717.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 12:21:01,629 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.32ms. Allocated memory is still 117.4MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.09ms. Allocated memory is still 201.3MB. Free memory was 132.4MB in the beginning and 120.0MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.30ms. Allocated memory is still 201.3MB. Free memory was 120.0MB in the beginning and 118.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.60ms. Allocated memory is still 201.3MB. Free memory was 118.3MB in the beginning and 116.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 518.36ms. Allocated memory is still 201.3MB. Free memory was 116.5MB in the beginning and 170.0MB in the end (delta: -53.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 40320.70ms. Allocated memory was 201.3MB in the beginning and 895.5MB in the end (delta: 694.2MB). Free memory was 169.1MB in the beginning and 722.3MB in the end (delta: -553.2MB). Peak memory consumption was 541.1MB. Max. memory is 16.1GB. * Witness Printer took 112.65ms. Allocated memory is still 895.5MB. Free memory was 722.3MB in the beginning and 717.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 44 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 30.4s, OverallIterations: 11, TraceHistogramMax: 23, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 17.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3302 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3302 mSDsluCounter, 1909 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1629 mSDsCounter, 357 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1531 IncrementalHoareTripleChecker+Invalid, 1888 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 357 mSolverCounterUnsat, 280 mSDtfsCounter, 1531 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1875 GetRequests, 1242 SyntacticMatches, 0 SemanticMatches, 633 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47053 ImplicationChecksByTransitivity, 19.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=10, InterpolantAutomatonStates: 464, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 44 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 1295 NumberOfCodeBlocks, 1295 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1843 ConstructedInterpolants, 0 QuantifiedInterpolants, 4075 SizeOfPredicates, 49 NumberOfNonLiveVariables, 2473 ConjunctsInSsa, 139 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 7642/11420 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 - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - ProcedureContractResult [Line: 7]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) - ProcedureContractResult [Line: 16]: Procedure Contract for check Derived contract for procedure check. Requires: ((((1 <= y) && (1 <= x)) && (y <= 2147483646)) || ((y <= 2147483646) && (x == 0))) Ensures: ((((1 <= y) && (1 <= x)) && (y <= 2147483646)) || ((y <= 2147483646) && (x == 0))) RESULT: Ultimate proved your program to be correct! [2024-11-09 12:21:01,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE