./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-zilu/benchmark23_conjunctive.i --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/loop-zilu/benchmark23_conjunctive.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c8661b1e533413e4de6576c4feab251d05a672526bd5f59b260c6cb9f9c05939 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 11:28:49,195 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:28:49,289 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 11:28:49,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:28:49,294 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:28:49,322 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:28:49,322 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:28:49,323 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:28:49,325 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:28:49,326 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:28:49,326 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:28:49,326 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:28:49,327 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:28:49,327 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:28:49,329 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:28:49,329 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:28:49,330 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 11:28:49,330 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 11:28:49,330 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:28:49,331 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 11:28:49,332 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:28:49,332 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 11:28:49,333 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:28:49,333 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 11:28:49,333 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:28:49,334 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 11:28:49,334 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:28:49,334 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 11:28:49,334 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 11:28:49,335 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:28:49,335 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:28:49,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:28:49,336 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:28:49,336 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:28:49,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:28:49,336 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:28:49,337 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:28:49,337 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 11:28:49,337 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 11:28:49,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 11:28:49,338 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:28:49,338 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:28:49,338 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:28:49,339 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:28:49,339 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 -> c8661b1e533413e4de6576c4feab251d05a672526bd5f59b260c6cb9f9c05939 [2024-11-09 11:28:49,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:28:49,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:28:49,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:28:49,645 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:28:49,645 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:28:49,647 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-zilu/benchmark23_conjunctive.i [2024-11-09 11:28:51,090 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:28:51,265 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:28:51,266 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark23_conjunctive.i [2024-11-09 11:28:51,275 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9aed995f2/638d25c1f4a84144a289224baf3c75e8/FLAGefac709a6 [2024-11-09 11:28:51,290 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9aed995f2/638d25c1f4a84144a289224baf3c75e8 [2024-11-09 11:28:51,292 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:28:51,294 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:28:51,295 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:28:51,296 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:28:51,302 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:28:51,303 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:28:51" (1/1) ... [2024-11-09 11:28:51,306 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d5938e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:28:51, skipping insertion in model container [2024-11-09 11:28:51,306 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:28:51" (1/1) ... [2024-11-09 11:28:51,326 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:28:51,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:28:51,501 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:28:51,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:28:51,534 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:28:51,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:28:51 WrapperNode [2024-11-09 11:28:51,535 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:28:51,536 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:28:51,536 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:28:51,536 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:28:51,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:28:51" (1/1) ... [2024-11-09 11:28:51,548 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:28:51" (1/1) ... [2024-11-09 11:28:51,561 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 39 [2024-11-09 11:28:51,561 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:28:51,562 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:28:51,562 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:28:51,562 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:28:51,572 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:28:51" (1/1) ... [2024-11-09 11:28:51,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:28:51" (1/1) ... [2024-11-09 11:28:51,573 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:28:51" (1/1) ... [2024-11-09 11:28:51,583 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 11:28:51,583 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:28:51" (1/1) ... [2024-11-09 11:28:51,583 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:28:51" (1/1) ... [2024-11-09 11:28:51,585 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:28:51" (1/1) ... [2024-11-09 11:28:51,588 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:28:51" (1/1) ... [2024-11-09 11:28:51,589 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:28:51" (1/1) ... [2024-11-09 11:28:51,590 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:28:51" (1/1) ... [2024-11-09 11:28:51,591 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:28:51,592 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:28:51,592 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:28:51,592 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:28:51,594 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:28:51" (1/1) ... [2024-11-09 11:28:51,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:28:51,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:28:51,626 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 11:28:51,628 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 11:28:51,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 11:28:51,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 11:28:51,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:28:51,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:28:51,725 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:28:51,727 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:28:51,903 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-09 11:28:51,906 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:28:51,920 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:28:51,922 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 11:28:51,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:28:51 BoogieIcfgContainer [2024-11-09 11:28:51,923 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:28:51,925 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:28:51,925 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:28:51,929 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:28:51,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:28:51" (1/3) ... [2024-11-09 11:28:51,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2867fba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:28:51, skipping insertion in model container [2024-11-09 11:28:51,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:28:51" (2/3) ... [2024-11-09 11:28:51,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2867fba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:28:51, skipping insertion in model container [2024-11-09 11:28:51,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:28:51" (3/3) ... [2024-11-09 11:28:51,933 INFO L112 eAbstractionObserver]: Analyzing ICFG benchmark23_conjunctive.i [2024-11-09 11:28:51,949 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:28:51,949 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-09 11:28:52,010 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:28:52,020 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;@effaa1b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:28:52,021 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-09 11:28:52,025 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.6) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:28:52,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 11:28:52,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:28:52,032 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 11:28:52,033 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:28:52,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:28:52,039 INFO L85 PathProgramCache]: Analyzing trace with hash 28695973, now seen corresponding path program 1 times [2024-11-09 11:28:52,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:28:52,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740781072] [2024-11-09 11:28:52,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:28:52,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:28:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:28:52,193 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 11:28:52,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:28:52,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740781072] [2024-11-09 11:28:52,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740781072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:28:52,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:28:52,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:28:52,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512590197] [2024-11-09 11:28:52,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:28:52,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:28:52,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:28:52,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:28:52,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:28:52,222 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.6) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:28:52,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:28:52,248 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2024-11-09 11:28:52,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:28:52,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 11:28:52,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:28:52,255 INFO L225 Difference]: With dead ends: 27 [2024-11-09 11:28:52,255 INFO L226 Difference]: Without dead ends: 11 [2024-11-09 11:28:52,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:28:52,259 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:28:52,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:28:52,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-11-09 11:28:52,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-11-09 11:28:52,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 1.375) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:28:52,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-11-09 11:28:52,283 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 5 [2024-11-09 11:28:52,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:28:52,283 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-11-09 11:28:52,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:28:52,284 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-11-09 11:28:52,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 11:28:52,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:28:52,284 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 11:28:52,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 11:28:52,285 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:28:52,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:28:52,285 INFO L85 PathProgramCache]: Analyzing trace with hash 889575213, now seen corresponding path program 1 times [2024-11-09 11:28:52,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:28:52,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886538973] [2024-11-09 11:28:52,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:28:52,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:28:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:28:52,336 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 11:28:52,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:28:52,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886538973] [2024-11-09 11:28:52,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886538973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:28:52,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:28:52,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:28:52,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415524746] [2024-11-09 11:28:52,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:28:52,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:28:52,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:28:52,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:28:52,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:28:52,343 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:28:52,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:28:52,361 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-11-09 11:28:52,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:28:52,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 11:28:52,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:28:52,363 INFO L225 Difference]: With dead ends: 15 [2024-11-09 11:28:52,363 INFO L226 Difference]: Without dead ends: 14 [2024-11-09 11:28:52,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:28:52,365 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:28:52,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:28:52,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-09 11:28:52,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-09 11:28:52,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:28:52,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-11-09 11:28:52,376 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 6 [2024-11-09 11:28:52,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:28:52,376 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-11-09 11:28:52,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:28:52,376 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-11-09 11:28:52,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 11:28:52,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:28:52,377 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:28:52,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 11:28:52,377 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:28:52,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:28:52,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1807027879, now seen corresponding path program 1 times [2024-11-09 11:28:52,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:28:52,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352587666] [2024-11-09 11:28:52,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:28:52,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:28:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:28:52,439 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 11:28:52,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:28:52,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352587666] [2024-11-09 11:28:52,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352587666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:28:52,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:28:52,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:28:52,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468576422] [2024-11-09 11:28:52,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:28:52,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:28:52,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:28:52,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:28:52,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:28:52,443 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:28:52,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:28:52,468 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-11-09 11:28:52,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:28:52,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 11:28:52,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:28:52,472 INFO L225 Difference]: With dead ends: 14 [2024-11-09 11:28:52,472 INFO L226 Difference]: Without dead ends: 13 [2024-11-09 11:28:52,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:28:52,474 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:28:52,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 10 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:28:52,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-09 11:28:52,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-09 11:28:52,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 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 11:28:52,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-11-09 11:28:52,481 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 7 [2024-11-09 11:28:52,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:28:52,481 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-11-09 11:28:52,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:28:52,482 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-11-09 11:28:52,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 11:28:52,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:28:52,484 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:28:52,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 11:28:52,485 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:28:52,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:28:52,485 INFO L85 PathProgramCache]: Analyzing trace with hash 183289455, now seen corresponding path program 1 times [2024-11-09 11:28:52,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:28:52,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475562106] [2024-11-09 11:28:52,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:28:52,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:28:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:28:52,537 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 11:28:52,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:28:52,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475562106] [2024-11-09 11:28:52,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475562106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:28:52,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:28:52,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:28:52,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493368289] [2024-11-09 11:28:52,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:28:52,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:28:52,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:28:52,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:28:52,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:28:52,540 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:28:52,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:28:52,562 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2024-11-09 11:28:52,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:28:52,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-09 11:28:52,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:28:52,563 INFO L225 Difference]: With dead ends: 16 [2024-11-09 11:28:52,564 INFO L226 Difference]: Without dead ends: 15 [2024-11-09 11:28:52,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:28:52,565 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:28:52,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:28:52,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-09 11:28:52,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-09 11:28:52,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:28:52,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-09 11:28:52,573 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2024-11-09 11:28:52,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:28:52,573 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-09 11:28:52,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:28:52,574 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-09 11:28:52,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 11:28:52,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:28:52,576 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:28:52,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 11:28:52,576 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:28:52,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:28:52,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1472766433, now seen corresponding path program 1 times [2024-11-09 11:28:52,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:28:52,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757622784] [2024-11-09 11:28:52,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:28:52,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:28:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:28:52,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:28:52,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:28:52,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757622784] [2024-11-09 11:28:52,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757622784] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:28:52,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796411604] [2024-11-09 11:28:52,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:28:52,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:28:52,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:28:52,643 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 11:28:52,645 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 11:28:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:28:52,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 11:28:52,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:28:52,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:28:52,740 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:28:52,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:28:52,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796411604] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:28:52,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:28:52,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-09 11:28:52,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301722250] [2024-11-09 11:28:52,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:28:52,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:28:52,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:28:52,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:28:52,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:28:52,799 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:28:52,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:28:52,841 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2024-11-09 11:28:52,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:28:52,843 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 11:28:52,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:28:52,844 INFO L225 Difference]: With dead ends: 31 [2024-11-09 11:28:52,844 INFO L226 Difference]: Without dead ends: 30 [2024-11-09 11:28:52,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:28:52,845 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:28:52,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 26 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:28:52,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-09 11:28:52,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2024-11-09 11:28:52,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 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 11:28:52,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2024-11-09 11:28:52,857 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 11 [2024-11-09 11:28:52,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:28:52,858 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2024-11-09 11:28:52,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:28:52,858 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2024-11-09 11:28:52,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 11:28:52,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:28:52,859 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-09 11:28:52,877 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 11:28:53,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:28:53,064 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:28:53,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:28:53,065 INFO L85 PathProgramCache]: Analyzing trace with hash -2010663901, now seen corresponding path program 1 times [2024-11-09 11:28:53,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:28:53,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796751739] [2024-11-09 11:28:53,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:28:53,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:28:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:28:53,133 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:28:53,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:28:53,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796751739] [2024-11-09 11:28:53,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796751739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:28:53,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:28:53,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:28:53,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903698658] [2024-11-09 11:28:53,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:28:53,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:28:53,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:28:53,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:28:53,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:28:53,136 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 11:28:53,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:28:53,154 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2024-11-09 11:28:53,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:28:53,155 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 11:28:53,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:28:53,156 INFO L225 Difference]: With dead ends: 28 [2024-11-09 11:28:53,156 INFO L226 Difference]: Without dead ends: 27 [2024-11-09 11:28:53,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:28:53,157 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 1 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:28:53,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 10 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:28:53,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-09 11:28:53,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-09 11:28:53,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:28:53,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-11-09 11:28:53,162 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 13 [2024-11-09 11:28:53,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:28:53,163 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2024-11-09 11:28:53,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 11:28:53,163 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-11-09 11:28:53,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 11:28:53,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:28:53,164 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1] [2024-11-09 11:28:53,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 11:28:53,164 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:28:53,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:28:53,165 INFO L85 PathProgramCache]: Analyzing trace with hash 924342317, now seen corresponding path program 2 times [2024-11-09 11:28:53,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:28:53,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659441477] [2024-11-09 11:28:53,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:28:53,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:28:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:28:53,330 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:28:53,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:28:53,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659441477] [2024-11-09 11:28:53,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659441477] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:28:53,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805160255] [2024-11-09 11:28:53,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:28:53,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:28:53,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:28:53,334 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 11:28:53,335 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 11:28:53,387 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:28:53,388 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:28:53,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 11:28:53,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:28:53,453 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:28:53,455 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:28:53,563 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:28:53,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805160255] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:28:53,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:28:53,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-09 11:28:53,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691419502] [2024-11-09 11:28:53,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:28:53,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 11:28:53,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:28:53,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 11:28:53,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-09 11:28:53,566 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:28:53,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:28:53,625 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2024-11-09 11:28:53,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 11:28:53,626 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-09 11:28:53,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:28:53,628 INFO L225 Difference]: With dead ends: 58 [2024-11-09 11:28:53,630 INFO L226 Difference]: Without dead ends: 57 [2024-11-09 11:28:53,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-09 11:28:53,631 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:28:53,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 40 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:28:53,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-09 11:28:53,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-09 11:28:53,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 0 states have call successors, (0), 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 11:28:53,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2024-11-09 11:28:53,645 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 26 [2024-11-09 11:28:53,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:28:53,645 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2024-11-09 11:28:53,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:28:53,645 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2024-11-09 11:28:53,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-09 11:28:53,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:28:53,648 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1] [2024-11-09 11:28:53,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 11:28:53,848 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 11:28:53,849 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:28:53,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:28:53,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1183028819, now seen corresponding path program 3 times [2024-11-09 11:28:53,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:28:53,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090990064] [2024-11-09 11:28:53,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:28:53,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:28:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:28:54,141 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:28:54,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:28:54,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090990064] [2024-11-09 11:28:54,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090990064] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:28:54,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116391357] [2024-11-09 11:28:54,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 11:28:54,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:28:54,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:28:54,145 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 11:28:54,146 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 11:28:54,205 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-09 11:28:54,206 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:28:54,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 11:28:54,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:28:54,298 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:28:54,299 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:28:54,579 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:28:54,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116391357] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:28:54,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:28:54,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2024-11-09 11:28:54,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119047406] [2024-11-09 11:28:54,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:28:54,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 11:28:54,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:28:54,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 11:28:54,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2024-11-09 11:28:54,583 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand has 24 states, 23 states have (on average 4.782608695652174) internal successors, (110), 24 states have internal predecessors, (110), 0 states have call successors, (0), 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 11:28:54,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:28:54,666 INFO L93 Difference]: Finished difference Result 118 states and 129 transitions. [2024-11-09 11:28:54,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 11:28:54,667 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.782608695652174) internal successors, (110), 24 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-09 11:28:54,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:28:54,669 INFO L225 Difference]: With dead ends: 118 [2024-11-09 11:28:54,669 INFO L226 Difference]: Without dead ends: 117 [2024-11-09 11:28:54,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2024-11-09 11:28:54,670 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:28:54,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 76 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:28:54,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-09 11:28:54,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-09 11:28:54,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.0086206896551724) internal successors, (117), 116 states have internal predecessors, (117), 0 states have call successors, (0), 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 11:28:54,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2024-11-09 11:28:54,686 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 56 [2024-11-09 11:28:54,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:28:54,686 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2024-11-09 11:28:54,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.782608695652174) internal successors, (110), 24 states have internal predecessors, (110), 0 states have call successors, (0), 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 11:28:54,687 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2024-11-09 11:28:54,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 11:28:54,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:28:54,691 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 1, 1, 1, 1] [2024-11-09 11:28:54,707 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 11:28:54,892 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 11:28:54,892 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:28:54,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:28:54,893 INFO L85 PathProgramCache]: Analyzing trace with hash 493726893, now seen corresponding path program 4 times [2024-11-09 11:28:54,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:28:54,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928865493] [2024-11-09 11:28:54,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:28:54,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:28:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:28:55,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:28:55,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:28:55,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928865493] [2024-11-09 11:28:55,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928865493] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:28:55,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395002190] [2024-11-09 11:28:55,622 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 11:28:55,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:28:55,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:28:55,624 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 11:28:55,625 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 11:28:55,710 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 11:28:55,711 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:28:55,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 11:28:55,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:28:55,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:28:55,879 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:28:56,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:28:56,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395002190] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:28:56,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:28:56,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2024-11-09 11:28:56,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171173141] [2024-11-09 11:28:56,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:28:56,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-09 11:28:56,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:28:56,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-09 11:28:56,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-11-09 11:28:56,811 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand has 48 states, 47 states have (on average 4.8936170212765955) internal successors, (230), 48 states have internal predecessors, (230), 0 states have call successors, (0), 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 11:28:56,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:28:56,982 INFO L93 Difference]: Finished difference Result 238 states and 261 transitions. [2024-11-09 11:28:56,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-09 11:28:56,983 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 4.8936170212765955) internal successors, (230), 48 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2024-11-09 11:28:56,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:28:56,985 INFO L225 Difference]: With dead ends: 238 [2024-11-09 11:28:56,985 INFO L226 Difference]: Without dead ends: 237 [2024-11-09 11:28:56,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-11-09 11:28:56,989 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:28:56,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 151 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:28:56,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-09 11:28:57,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2024-11-09 11:28:57,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 236 states have (on average 1.0042372881355932) internal successors, (237), 236 states have internal predecessors, (237), 0 states have call successors, (0), 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 11:28:57,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2024-11-09 11:28:57,013 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 116 [2024-11-09 11:28:57,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:28:57,013 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2024-11-09 11:28:57,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 4.8936170212765955) internal successors, (230), 48 states have internal predecessors, (230), 0 states have call successors, (0), 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 11:28:57,013 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2024-11-09 11:28:57,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-09 11:28:57,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:28:57,019 INFO L215 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 1, 1, 1, 1] [2024-11-09 11:28:57,035 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 11:28:57,223 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 11:28:57,224 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:28:57,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:28:57,224 INFO L85 PathProgramCache]: Analyzing trace with hash 982823597, now seen corresponding path program 5 times [2024-11-09 11:28:57,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:28:57,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099604091] [2024-11-09 11:28:57,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:28:57,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:28:57,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:28:59,433 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:28:59,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:28:59,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099604091] [2024-11-09 11:28:59,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099604091] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:28:59,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251487765] [2024-11-09 11:28:59,434 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 11:28:59,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:28:59,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:28:59,436 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 11:28:59,437 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 11:28:59,596 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2024-11-09 11:28:59,597 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:28:59,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-09 11:28:59,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:28:59,917 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:28:59,917 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:29:02,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:29:02,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251487765] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:29:02,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:29:02,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2024-11-09 11:29:02,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326349190] [2024-11-09 11:29:02,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:29:02,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2024-11-09 11:29:02,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:29:02,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2024-11-09 11:29:02,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2024-11-09 11:29:02,582 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand has 96 states, 95 states have (on average 4.947368421052632) internal successors, (470), 96 states have internal predecessors, (470), 0 states have call successors, (0), 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 11:29:02,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:29:02,919 INFO L93 Difference]: Finished difference Result 478 states and 525 transitions. [2024-11-09 11:29:02,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-11-09 11:29:02,920 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 4.947368421052632) internal successors, (470), 96 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 236 [2024-11-09 11:29:02,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:29:02,923 INFO L225 Difference]: With dead ends: 478 [2024-11-09 11:29:02,923 INFO L226 Difference]: Without dead ends: 477 [2024-11-09 11:29:02,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2024-11-09 11:29:02,926 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:29:02,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 295 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:29:02,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-11-09 11:29:02,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2024-11-09 11:29:02,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 1.0021008403361344) internal successors, (477), 476 states have internal predecessors, (477), 0 states have call successors, (0), 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 11:29:02,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 477 transitions. [2024-11-09 11:29:02,955 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 477 transitions. Word has length 236 [2024-11-09 11:29:02,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:29:02,956 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 477 transitions. [2024-11-09 11:29:02,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 4.947368421052632) internal successors, (470), 96 states have internal predecessors, (470), 0 states have call successors, (0), 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 11:29:02,957 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 477 transitions. [2024-11-09 11:29:02,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2024-11-09 11:29:02,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:29:02,970 INFO L215 NwaCegarLoop]: trace histogram [95, 95, 94, 94, 94, 1, 1, 1, 1] [2024-11-09 11:29:02,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 11:29:03,170 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 11:29:03,171 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:29:03,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:29:03,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1056226989, now seen corresponding path program 6 times [2024-11-09 11:29:03,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:29:03,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220663341] [2024-11-09 11:29:03,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:29:03,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:29:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:29:09,411 INFO L134 CoverageAnalysis]: Checked inductivity of 22137 backedges. 0 proven. 22137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:29:09,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:29:09,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220663341] [2024-11-09 11:29:09,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220663341] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:29:09,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951355382] [2024-11-09 11:29:09,412 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 11:29:09,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:29:09,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:29:09,413 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 11:29:09,414 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 11:29:09,698 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2024-11-09 11:29:09,698 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:29:09,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 1062 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-11-09 11:29:09,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:29:10,276 INFO L134 CoverageAnalysis]: Checked inductivity of 22137 backedges. 0 proven. 22137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:29:10,276 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:29:19,511 INFO L134 CoverageAnalysis]: Checked inductivity of 22137 backedges. 0 proven. 22137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:29:19,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951355382] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:29:19,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:29:19,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2024-11-09 11:29:19,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319543896] [2024-11-09 11:29:19,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:29:19,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2024-11-09 11:29:19,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:29:19,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2024-11-09 11:29:19,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2024-11-09 11:29:19,526 INFO L87 Difference]: Start difference. First operand 477 states and 477 transitions. Second operand has 192 states, 191 states have (on average 4.973821989528796) internal successors, (950), 192 states have internal predecessors, (950), 0 states have call successors, (0), 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 11:29:20,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:29:20,520 INFO L93 Difference]: Finished difference Result 958 states and 1053 transitions. [2024-11-09 11:29:20,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2024-11-09 11:29:20,521 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 191 states have (on average 4.973821989528796) internal successors, (950), 192 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 476 [2024-11-09 11:29:20,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:29:20,524 INFO L225 Difference]: With dead ends: 958 [2024-11-09 11:29:20,525 INFO L226 Difference]: Without dead ends: 957 [2024-11-09 11:29:20,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1046 GetRequests, 856 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2024-11-09 11:29:20,528 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 11:29:20,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 584 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 11:29:20,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2024-11-09 11:29:20,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 957. [2024-11-09 11:29:20,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 956 states have (on average 1.0010460251046025) internal successors, (957), 956 states have internal predecessors, (957), 0 states have call successors, (0), 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 11:29:20,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 957 transitions. [2024-11-09 11:29:20,561 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 957 transitions. Word has length 476 [2024-11-09 11:29:20,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:29:20,562 INFO L471 AbstractCegarLoop]: Abstraction has 957 states and 957 transitions. [2024-11-09 11:29:20,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 191 states have (on average 4.973821989528796) internal successors, (950), 192 states have internal predecessors, (950), 0 states have call successors, (0), 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 11:29:20,563 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 957 transitions. [2024-11-09 11:29:20,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 957 [2024-11-09 11:29:20,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:29:20,586 INFO L215 NwaCegarLoop]: trace histogram [191, 191, 190, 190, 190, 1, 1, 1, 1] [2024-11-09 11:29:20,607 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 11:29:20,787 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 11:29:20,788 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:29:20,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:29:20,788 INFO L85 PathProgramCache]: Analyzing trace with hash 402445997, now seen corresponding path program 7 times [2024-11-09 11:29:20,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:29:20,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23961807] [2024-11-09 11:29:20,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:29:20,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:29:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:29:43,347 INFO L134 CoverageAnalysis]: Checked inductivity of 90345 backedges. 0 proven. 90345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:29:43,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:29:43,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23961807] [2024-11-09 11:29:43,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23961807] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:29:43,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991014930] [2024-11-09 11:29:43,349 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-09 11:29:43,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:29:43,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:29:43,351 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:29:43,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 11:29:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:29:43,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 2118 conjuncts, 202 conjuncts are in the unsatisfiable core [2024-11-09 11:29:43,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:30:06,905 INFO L134 CoverageAnalysis]: Checked inductivity of 90345 backedges. 70140 proven. 0 refuted. 0 times theorem prover too weak. 20205 trivial. 0 not checked. [2024-11-09 11:30:06,906 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:30:06,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991014930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:30:06,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:30:06,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [203] imperfect sequences [192] total 394 [2024-11-09 11:30:06,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471236023] [2024-11-09 11:30:06,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:30:06,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 203 states [2024-11-09 11:30:06,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:30:06,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 203 interpolants. [2024-11-09 11:30:06,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28930, Invalid=125912, Unknown=0, NotChecked=0, Total=154842 [2024-11-09 11:30:06,930 INFO L87 Difference]: Start difference. First operand 957 states and 957 transitions. Second operand has 203 states, 203 states have (on average 2.5123152709359604) internal successors, (510), 203 states have internal predecessors, (510), 0 states have call successors, (0), 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 11:30:09,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:30:09,883 INFO L93 Difference]: Finished difference Result 957 states and 957 transitions. [2024-11-09 11:30:09,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2024-11-09 11:30:09,885 INFO L78 Accepts]: Start accepts. Automaton has has 203 states, 203 states have (on average 2.5123152709359604) internal successors, (510), 203 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 956 [2024-11-09 11:30:09,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:30:09,887 INFO L225 Difference]: With dead ends: 957 [2024-11-09 11:30:09,887 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 11:30:09,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1147 GetRequests, 755 SyntacticMatches, 0 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48090 ImplicationChecksByTransitivity, 34.2s TimeCoverageRelationStatistics Valid=28930, Invalid=125912, Unknown=0, NotChecked=0, Total=154842 [2024-11-09 11:30:09,902 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 4126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 4126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 11:30:09,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 897 Invalid, 4126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4126 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 11:30:09,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 11:30:09,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 11:30:09,903 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 11:30:09,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 11:30:09,904 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 956 [2024-11-09 11:30:09,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:30:09,904 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 11:30:09,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 203 states, 203 states have (on average 2.5123152709359604) internal successors, (510), 203 states have internal predecessors, (510), 0 states have call successors, (0), 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 11:30:09,905 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 11:30:09,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 11:30:09,908 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-09 11:30:09,908 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-09 11:30:09,908 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-09 11:30:09,909 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-09 11:30:09,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 11:30:10,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:30:10,112 INFO L407 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1] [2024-11-09 11:30:10,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 11:30:11,658 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 11:30:11,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:30:11 BoogieIcfgContainer [2024-11-09 11:30:11,706 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 11:30:11,707 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 11:30:11,707 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 11:30:11,707 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 11:30:11,708 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:28:51" (3/4) ... [2024-11-09 11:30:11,711 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 11:30:11,717 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-11-09 11:30:11,717 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 11:30:11,717 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 11:30:11,718 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 11:30:11,809 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 11:30:11,810 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 11:30:11,810 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 11:30:11,811 INFO L158 Benchmark]: Toolchain (without parser) took 80516.66ms. Allocated memory was 176.2MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 126.2MB in the beginning and 781.5MB in the end (delta: -655.3MB). Peak memory consumption was 940.2MB. Max. memory is 16.1GB. [2024-11-09 11:30:11,811 INFO L158 Benchmark]: CDTParser took 0.91ms. Allocated memory is still 100.7MB. Free memory was 65.0MB in the beginning and 65.0MB in the end (delta: 78.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:30:11,811 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.92ms. Allocated memory is still 176.2MB. Free memory was 126.2MB in the beginning and 114.4MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 11:30:11,811 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.28ms. Allocated memory is still 176.2MB. Free memory was 114.4MB in the beginning and 113.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:30:11,812 INFO L158 Benchmark]: Boogie Preprocessor took 29.50ms. Allocated memory is still 176.2MB. Free memory was 113.0MB in the beginning and 110.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:30:11,812 INFO L158 Benchmark]: RCFGBuilder took 331.12ms. Allocated memory is still 176.2MB. Free memory was 110.9MB in the beginning and 143.3MB in the end (delta: -32.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 11:30:11,813 INFO L158 Benchmark]: TraceAbstraction took 79781.25ms. Allocated memory was 176.2MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 142.3MB in the beginning and 785.7MB in the end (delta: -643.4MB). Peak memory consumption was 954.6MB. Max. memory is 16.1GB. [2024-11-09 11:30:11,813 INFO L158 Benchmark]: Witness Printer took 103.24ms. Allocated memory is still 1.8GB. Free memory was 785.7MB in the beginning and 781.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 11:30:11,814 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.91ms. Allocated memory is still 100.7MB. Free memory was 65.0MB in the beginning and 65.0MB in the end (delta: 78.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.92ms. Allocated memory is still 176.2MB. Free memory was 126.2MB in the beginning and 114.4MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.28ms. Allocated memory is still 176.2MB. Free memory was 114.4MB in the beginning and 113.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.50ms. Allocated memory is still 176.2MB. Free memory was 113.0MB in the beginning and 110.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 331.12ms. Allocated memory is still 176.2MB. Free memory was 110.9MB in the beginning and 143.3MB in the end (delta: -32.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 79781.25ms. Allocated memory was 176.2MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 142.3MB in the beginning and 785.7MB in the end (delta: -643.4MB). Peak memory consumption was 954.6MB. Max. memory is 16.1GB. * Witness Printer took 103.24ms. Allocated memory is still 1.8GB. Free memory was 785.7MB in the beginning and 781.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 78.1s, OverallIterations: 12, TraceHistogramMax: 191, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.1s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 2136 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1952 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4981 IncrementalHoareTripleChecker+Invalid, 4990 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 184 mSDtfsCounter, 4981 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3179 GetRequests, 2413 SyntacticMatches, 0 SemanticMatches, 766 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48090 ImplicationChecksByTransitivity, 50.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=957occurred in iteration=11, InterpolantAutomatonStates: 599, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 69.4s InterpolantComputationTime, 3793 NumberOfCodeBlocks, 3793 NumberOfCodeBlocksAsserted, 171 NumberOfCheckSat, 4689 ConstructedInterpolants, 0 QuantifiedInterpolants, 13059 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4233 ConjunctsInSsa, 391 ConjunctsInUnsatCore, 25 InterpolantComputations, 6 PerfectInterpolantSequences, 90350/267608 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 4 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((j <= 118) && (0 <= (j + 2147483648))) && (59 <= i)) || (((0 <= (j + 2147483648)) && (j <= 2147483459)) && (96 <= i))) || (((j <= 138) && (0 <= (j + 2147483648))) && (69 <= i))) || (((0 <= (j + 2147483648)) && (35 <= i)) && (j <= 70))) || (((0 <= (j + 2147483648)) && (65 <= i)) && (j <= 130))) || (((0 <= (j + 2147483648)) && (j <= 146)) && (73 <= i))) || (((0 <= (j + 2147483648)) && (66 <= i)) && (j <= 132))) || (((0 <= (j + 2147483648)) && (j <= 182)) && (91 <= i))) || (((0 <= (j + 2147483648)) && (3 <= i)) && (j <= 6))) || (((0 <= (j + 2147483648)) && (j <= 8)) && (4 <= i))) || (((j <= 164) && (82 <= i)) && (0 <= (j + 2147483648)))) || (((0 <= (j + 2147483648)) && (89 <= i)) && (j <= 178))) || (((0 <= (j + 2147483648)) && (34 <= i)) && (j <= 68))) || (((44 <= i) && (0 <= (j + 2147483648))) && (j <= 88))) || (((0 <= (j + 2147483648)) && (93 <= i)) && (j <= 186))) || (((0 <= (j + 2147483648)) && (j <= 2147483457)) && (95 <= i))) || (((21 <= i) && (0 <= (j + 2147483648))) && (j <= 42))) || (((0 <= (j + 2147483648)) && (23 <= i)) && (j <= 46))) || (((0 <= (j + 2147483648)) && (j <= 2147483465)) && (99 <= i))) || (((0 <= (j + 2147483648)) && (j <= 66)) && (33 <= i))) || (((0 <= (j + 2147483648)) && (28 <= i)) && (j <= 56))) || (((0 <= (j + 2147483648)) && (j <= 18)) && (9 <= i))) || (((0 <= (j + 2147483648)) && (39 <= i)) && (j <= 78))) || (((0 <= (j + 2147483648)) && (j <= 2147483463)) && (98 <= i))) || (((0 <= (j + 2147483648)) && (48 <= i)) && (j <= 96))) || (((0 <= (j + 2147483648)) && (53 <= i)) && (j <= 106))) || (((0 <= (j + 2147483648)) && (20 <= i)) && (j <= 40))) || (((0 <= (j + 2147483648)) && (j <= 44)) && (22 <= i))) || (((0 <= (j + 2147483648)) && (j <= 112)) && (56 <= i))) || (((0 <= (j + 2147483648)) && (45 <= i)) && (j <= 90))) || (((79 <= i) && (0 <= (j + 2147483648))) && (j <= 158))) || (((0 <= (j + 2147483648)) && (58 <= i)) && (j <= 116))) || (((0 <= (j + 2147483648)) && (j <= 64)) && (32 <= i))) || (((0 <= (j + 2147483648)) && (74 <= i)) && (j <= 148))) || (((0 <= (j + 2147483648)) && (j <= 62)) && (31 <= i))) || (((0 <= (j + 2147483648)) && (j <= 50)) && (25 <= i))) || (((0 <= (j + 2147483648)) && (j <= 82)) && (41 <= i))) || (((0 <= (j + 2147483648)) && (57 <= i)) && (j <= 114))) || (((0 <= (j + 2147483648)) && (j <= 140)) && (70 <= i))) || (((j <= 54) && (0 <= (j + 2147483648))) && (27 <= i))) || (((0 <= (j + 2147483648)) && (43 <= i)) && (j <= 86))) || (((0 <= (j + 2147483648)) && (63 <= i)) && (j <= 126))) || (((0 <= (j + 2147483648)) && (13 <= i)) && (j <= 26))) || (((0 <= (j + 2147483648)) && (j <= 160)) && (80 <= i))) || (((0 <= (j + 2147483648)) && (49 <= i)) && (j <= 98))) || (((0 <= (j + 2147483648)) && (51 <= i)) && (j <= 102))) || (((0 <= (j + 2147483648)) && (j <= 142)) && (71 <= i))) || (((86 <= i) && (0 <= (j + 2147483648))) && (j <= 172))) || (((j <= 10) && (0 <= (j + 2147483648))) && (5 <= i))) || (((0 <= (j + 2147483648)) && (10 <= i)) && (j <= 20))) || (((0 <= (j + 2147483648)) && (j <= 32)) && (16 <= i))) || (((0 <= (j + 2147483648)) && (j <= 150)) && (75 <= i))) || (((0 <= (j + 2147483648)) && (88 <= i)) && (j <= 176))) || (((0 <= (j + 2147483648)) && (j <= 92)) && (46 <= i))) || (((0 <= (j + 2147483648)) && (j <= 22)) && (11 <= i))) || (((j <= 170) && (0 <= (j + 2147483648))) && (85 <= i))) || (((0 <= (j + 2147483648)) && (j <= 154)) && (77 <= i))) || (((0 <= (j + 2147483648)) && (37 <= i)) && (j <= 74))) || (((0 <= (j + 2147483648)) && (97 <= i)) && (j <= 2147483461))) || (((0 <= (j + 2147483648)) && (84 <= i)) && (j <= 168))) || (((0 <= (j + 2147483648)) && (j <= 48)) && (24 <= i))) || (((0 <= (j + 2147483648)) && (j <= 16)) && (8 <= i))) || (((0 <= (j + 2147483648)) && (j <= 38)) && (19 <= i))) || (((0 <= (j + 2147483648)) && (100 <= i)) && (j <= 2147483467))) || (((0 <= (j + 2147483648)) && (61 <= i)) && (j <= 122))) || (((0 <= (j + 2147483648)) && (j <= 188)) && (94 <= i))) || (((0 <= (j + 2147483648)) && (j <= 30)) && (15 <= i))) || (((0 <= (j + 2147483648)) && (12 <= i)) && (j <= 24))) || (((0 <= (j + 2147483648)) && (30 <= i)) && (j <= 60))) || (((0 <= (j + 2147483648)) && (j <= 108)) && (54 <= i))) || (((0 <= (j + 2147483648)) && (6 <= i)) && (j <= 12))) || (((0 <= (j + 2147483648)) && (j <= 136)) && (68 <= i))) || (((0 <= (j + 2147483648)) && (87 <= i)) && (j <= 174))) || (((0 <= (j + 2147483648)) && (26 <= i)) && (j <= 52))) || (((0 <= (j + 2147483648)) && (42 <= i)) && (j <= 84))) || (((0 <= (j + 2147483648)) && (50 <= i)) && (j <= 100))) || (((0 <= (j + 2147483648)) && (1 <= i)) && (j <= 2))) || (((j <= 104) && (0 <= (j + 2147483648))) && (52 <= i))) || (((0 <= (j + 2147483648)) && (40 <= i)) && (j <= 80))) || (((0 <= (j + 2147483648)) && (72 <= i)) && (j <= 144))) || (((0 <= (j + 2147483648)) && (17 <= i)) && (j <= 34))) || (((0 <= (j + 2147483648)) && (64 <= i)) && (j <= 128))) || (((0 <= (j + 2147483648)) && (7 <= i)) && (j <= 14))) || (((0 <= (j + 2147483648)) && (j <= 124)) && (62 <= i))) || (((55 <= i) && (0 <= (j + 2147483648))) && (j <= 110))) || (((0 <= (j + 2147483648)) && (47 <= i)) && (j <= 94))) || (((0 <= (j + 2147483648)) && (j <= 4)) && (2 <= i))) || (((0 <= (j + 2147483648)) && (38 <= i)) && (j <= 76))) || (((0 <= (j + 2147483648)) && (14 <= i)) && (j <= 28))) || (((j <= 120) && (0 <= (j + 2147483648))) && (60 <= i))) || (((0 <= (j + 2147483648)) && (18 <= i)) && (j <= 36))) || (((0 <= (j + 2147483648)) && (76 <= i)) && (j <= 152))) || (((j <= 72) && (0 <= (j + 2147483648))) && (36 <= i))) || (((0 <= (j + 2147483648)) && (i == 0)) && (j <= 0))) || (((0 <= (j + 2147483648)) && (92 <= i)) && (j <= 184))) || (((j <= 58) && (0 <= (j + 2147483648))) && (29 <= i))) || (((0 <= (j + 2147483648)) && (j <= 134)) && (67 <= i))) || (((0 <= (j + 2147483648)) && (j <= 166)) && (83 <= i))) || (((0 <= (j + 2147483648)) && (j <= 162)) && (81 <= i))) || (((0 <= (j + 2147483648)) && (j <= 156)) && (78 <= i))) || (((90 <= i) && (0 <= (j + 2147483648))) && (j <= 180))) RESULT: Ultimate proved your program to be correct! [2024-11-09 11:30:11,841 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