./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-zilu/benchmark01_conjunctive.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3289d67d 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/benchmark01_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 1b503f9744330c40db60063d7713649b00b515fae7df517a0a6da071e866822e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 04:12:22,254 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 04:12:22,314 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-17 04:12:22,317 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 04:12:22,318 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 04:12:22,347 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 04:12:22,348 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 04:12:22,349 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 04:12:22,349 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 04:12:22,350 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 04:12:22,351 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 04:12:22,352 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 04:12:22,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 04:12:22,352 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 04:12:22,353 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 04:12:22,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 04:12:22,355 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 04:12:22,355 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 04:12:22,355 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 04:12:22,355 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 04:12:22,356 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 04:12:22,356 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 04:12:22,360 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 04:12:22,360 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 04:12:22,360 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 04:12:22,360 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 04:12:22,361 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 04:12:22,361 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 04:12:22,361 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 04:12:22,361 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 04:12:22,362 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 04:12:22,362 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 04:12:22,362 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 04:12:22,362 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 04:12:22,362 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 04:12:22,363 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 04:12:22,363 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 04:12:22,363 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 04:12:22,363 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 04:12:22,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 04:12:22,364 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 04:12:22,367 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 04:12:22,367 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 04:12:22,368 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 04:12:22,368 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 -> 1b503f9744330c40db60063d7713649b00b515fae7df517a0a6da071e866822e [2024-11-17 04:12:22,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 04:12:22,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 04:12:22,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 04:12:22,592 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 04:12:22,592 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 04:12:22,593 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-zilu/benchmark01_conjunctive.i [2024-11-17 04:12:24,015 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 04:12:24,163 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 04:12:24,164 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark01_conjunctive.i [2024-11-17 04:12:24,170 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f530f4ceb/5c05d69db44f4462925d541275a5e732/FLAG6fb6a93c0 [2024-11-17 04:12:24,194 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f530f4ceb/5c05d69db44f4462925d541275a5e732 [2024-11-17 04:12:24,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 04:12:24,197 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 04:12:24,199 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 04:12:24,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 04:12:24,212 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 04:12:24,213 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:12:24" (1/1) ... [2024-11-17 04:12:24,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fde3b90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:12:24, skipping insertion in model container [2024-11-17 04:12:24,215 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:12:24" (1/1) ... [2024-11-17 04:12:24,244 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 04:12:24,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 04:12:24,412 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 04:12:24,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 04:12:24,439 INFO L204 MainTranslator]: Completed translation [2024-11-17 04:12:24,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:12:24 WrapperNode [2024-11-17 04:12:24,439 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 04:12:24,440 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 04:12:24,440 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 04:12:24,440 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 04:12:24,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:12:24" (1/1) ... [2024-11-17 04:12:24,452 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:12:24" (1/1) ... [2024-11-17 04:12:24,465 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 38 [2024-11-17 04:12:24,465 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 04:12:24,466 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 04:12:24,466 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 04:12:24,466 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 04:12:24,473 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:12:24" (1/1) ... [2024-11-17 04:12:24,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:12:24" (1/1) ... [2024-11-17 04:12:24,474 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:12:24" (1/1) ... [2024-11-17 04:12:24,481 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-17 04:12:24,482 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:12:24" (1/1) ... [2024-11-17 04:12:24,482 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:12:24" (1/1) ... [2024-11-17 04:12:24,483 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:12:24" (1/1) ... [2024-11-17 04:12:24,484 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:12:24" (1/1) ... [2024-11-17 04:12:24,484 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:12:24" (1/1) ... [2024-11-17 04:12:24,485 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:12:24" (1/1) ... [2024-11-17 04:12:24,486 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 04:12:24,486 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 04:12:24,486 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 04:12:24,486 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 04:12:24,487 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:12:24" (1/1) ... [2024-11-17 04:12:24,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 04:12:24,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:12:24,512 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-17 04:12:24,536 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-17 04:12:24,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 04:12:24,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 04:12:24,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 04:12:24,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 04:12:24,624 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 04:12:24,626 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 04:12:24,695 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-17 04:12:24,696 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 04:12:24,704 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 04:12:24,704 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 04:12:24,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 04:12:24 BoogieIcfgContainer [2024-11-17 04:12:24,705 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 04:12:24,706 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 04:12:24,706 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 04:12:24,709 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 04:12:24,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 04:12:24" (1/3) ... [2024-11-17 04:12:24,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14eb27b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:12:24, skipping insertion in model container [2024-11-17 04:12:24,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:12:24" (2/3) ... [2024-11-17 04:12:24,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14eb27b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:12:24, skipping insertion in model container [2024-11-17 04:12:24,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 04:12:24" (3/3) ... [2024-11-17 04:12:24,711 INFO L112 eAbstractionObserver]: Analyzing ICFG benchmark01_conjunctive.i [2024-11-17 04:12:24,722 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 04:12:24,722 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-17 04:12:24,759 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 04:12:24,766 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;@f179ecc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 04:12:24,766 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-17 04:12:24,769 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:12:24,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 04:12:24,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:12:24,773 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 04:12:24,774 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 04:12:24,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:12:24,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1537350618, now seen corresponding path program 1 times [2024-11-17 04:12:24,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:12:24,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458796837] [2024-11-17 04:12:24,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:12:24,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:12:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:12:24,906 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-17 04:12:24,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:12:24,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458796837] [2024-11-17 04:12:24,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458796837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:12:24,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:12:24,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 04:12:24,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667440710] [2024-11-17 04:12:24,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:12:24,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 04:12:24,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:12:24,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 04:12:24,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 04:12:24,929 INFO L87 Difference]: Start difference. First operand has 18 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-17 04:12:24,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:12:24,967 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2024-11-17 04:12:24,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 04:12:24,969 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-17 04:12:24,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:12:24,977 INFO L225 Difference]: With dead ends: 25 [2024-11-17 04:12:24,977 INFO L226 Difference]: Without dead ends: 9 [2024-11-17 04:12:24,980 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-17 04:12:24,983 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 17 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-17 04:12:24,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 17 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:12:24,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-17 04:12:25,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-17 04:12:25,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:12:25,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-17 04:12:25,007 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2024-11-17 04:12:25,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:12:25,008 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-17 04:12:25,008 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-17 04:12:25,008 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-17 04:12:25,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-17 04:12:25,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:12:25,009 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:12:25,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 04:12:25,009 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 04:12:25,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:12:25,010 INFO L85 PathProgramCache]: Analyzing trace with hash 413228882, now seen corresponding path program 1 times [2024-11-17 04:12:25,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:12:25,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035236816] [2024-11-17 04:12:25,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:12:25,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:12:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:12:25,067 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-17 04:12:25,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:12:25,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035236816] [2024-11-17 04:12:25,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035236816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:12:25,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:12:25,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 04:12:25,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161318172] [2024-11-17 04:12:25,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:12:25,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 04:12:25,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:12:25,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 04:12:25,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 04:12:25,073 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:12:25,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:12:25,092 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-11-17 04:12:25,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 04:12:25,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-17 04:12:25,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:12:25,093 INFO L225 Difference]: With dead ends: 15 [2024-11-17 04:12:25,093 INFO L226 Difference]: Without dead ends: 14 [2024-11-17 04:12:25,093 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-17 04:12:25,098 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 04:12:25,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 9 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:12:25,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-17 04:12:25,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2024-11-17 04:12:25,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) 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-17 04:12:25,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-11-17 04:12:25,102 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 7 [2024-11-17 04:12:25,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:12:25,103 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-11-17 04:12:25,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:12:25,103 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-11-17 04:12:25,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-17 04:12:25,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:12:25,104 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-17 04:12:25,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 04:12:25,105 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 04:12:25,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:12:25,106 INFO L85 PathProgramCache]: Analyzing trace with hash -887038314, now seen corresponding path program 1 times [2024-11-17 04:12:25,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:12:25,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804655132] [2024-11-17 04:12:25,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:12:25,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:12:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:12:25,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:12:25,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:12:25,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804655132] [2024-11-17 04:12:25,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804655132] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:12:25,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628039601] [2024-11-17 04:12:25,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:12:25,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:12:25,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:12:25,227 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-17 04:12:25,233 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-17 04:12:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:12:25,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 04:12:25,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:12:25,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:12:25,420 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 04:12:25,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:12:25,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628039601] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 04:12:25,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 04:12:25,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2024-11-17 04:12:25,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168966510] [2024-11-17 04:12:25,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 04:12:25,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 04:12:25,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:12:25,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 04:12:25,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-17 04:12:25,468 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:12:25,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:12:25,526 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2024-11-17 04:12:25,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 04:12:25,527 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-17 04:12:25,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:12:25,527 INFO L225 Difference]: With dead ends: 29 [2024-11-17 04:12:25,528 INFO L226 Difference]: Without dead ends: 28 [2024-11-17 04:12:25,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2024-11-17 04:12:25,529 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 3 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 04:12:25,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 17 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:12:25,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-17 04:12:25,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-17 04:12:25,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:12:25,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2024-11-17 04:12:25,536 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 12 [2024-11-17 04:12:25,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:12:25,536 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2024-11-17 04:12:25,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:12:25,537 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2024-11-17 04:12:25,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-17 04:12:25,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:12:25,538 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1] [2024-11-17 04:12:25,550 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-17 04:12:25,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:12:25,742 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 04:12:25,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:12:25,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1142953042, now seen corresponding path program 2 times [2024-11-17 04:12:25,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:12:25,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100127952] [2024-11-17 04:12:25,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:12:25,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:12:25,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:12:25,920 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:12:25,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:12:25,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100127952] [2024-11-17 04:12:25,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100127952] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:12:25,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101660932] [2024-11-17 04:12:25,921 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 04:12:25,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:12:25,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:12:25,923 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-17 04:12:25,924 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-17 04:12:25,968 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 04:12:25,968 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 04:12:25,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-17 04:12:25,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:12:26,170 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:12:26,174 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 04:12:26,303 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:12:26,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101660932] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 04:12:26,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 04:12:26,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2024-11-17 04:12:26,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273302482] [2024-11-17 04:12:26,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 04:12:26,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-17 04:12:26,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:12:26,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-17 04:12:26,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=158, Unknown=0, NotChecked=0, Total=272 [2024-11-17 04:12:26,308 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 17 states, 16 states have (on average 4.8125) internal successors, (77), 17 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:12:26,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:12:26,371 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2024-11-17 04:12:26,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 04:12:26,372 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.8125) internal successors, (77), 17 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-17 04:12:26,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:12:26,373 INFO L225 Difference]: With dead ends: 59 [2024-11-17 04:12:26,374 INFO L226 Difference]: Without dead ends: 58 [2024-11-17 04:12:26,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=175, Unknown=0, NotChecked=0, Total=306 [2024-11-17 04:12:26,376 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 3 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 04:12:26,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 32 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:12:26,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-17 04:12:26,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-17 04:12:26,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 57 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:12:26,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2024-11-17 04:12:26,387 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 27 [2024-11-17 04:12:26,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:12:26,387 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2024-11-17 04:12:26,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.8125) internal successors, (77), 17 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:12:26,388 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2024-11-17 04:12:26,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-17 04:12:26,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:12:26,391 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1, 1, 1] [2024-11-17 04:12:26,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-17 04:12:26,591 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,SelfDestructingSolverStorable3 [2024-11-17 04:12:26,592 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 04:12:26,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:12:26,592 INFO L85 PathProgramCache]: Analyzing trace with hash 611759058, now seen corresponding path program 3 times [2024-11-17 04:12:26,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:12:26,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020398348] [2024-11-17 04:12:26,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:12:26,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:12:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:12:26,930 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:12:26,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:12:26,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020398348] [2024-11-17 04:12:26,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020398348] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:12:26,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162323237] [2024-11-17 04:12:26,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 04:12:26,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:12:26,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:12:26,934 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-17 04:12:26,935 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-17 04:12:26,987 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-17 04:12:26,987 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 04:12:26,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-17 04:12:26,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:12:27,329 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:12:27,329 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 04:12:27,695 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:12:27,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162323237] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 04:12:27,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 04:12:27,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2024-11-17 04:12:27,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024168874] [2024-11-17 04:12:27,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 04:12:27,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-17 04:12:27,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:12:27,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-17 04:12:27,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=510, Invalid=680, Unknown=0, NotChecked=0, Total=1190 [2024-11-17 04:12:27,700 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand has 35 states, 34 states have (on average 4.911764705882353) internal successors, (167), 35 states have internal predecessors, (167), 0 states have call successors, (0), 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-17 04:12:27,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:12:27,795 INFO L93 Difference]: Finished difference Result 119 states and 130 transitions. [2024-11-17 04:12:27,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-17 04:12:27,796 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 4.911764705882353) internal successors, (167), 35 states have internal predecessors, (167), 0 states have call successors, (0), 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 57 [2024-11-17 04:12:27,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:12:27,797 INFO L225 Difference]: With dead ends: 119 [2024-11-17 04:12:27,797 INFO L226 Difference]: Without dead ends: 118 [2024-11-17 04:12:27,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=545, Invalid=715, Unknown=0, NotChecked=0, Total=1260 [2024-11-17 04:12:27,798 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:12:27,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 62 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:12:27,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-17 04:12:27,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-17 04:12:27,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.0085470085470085) internal successors, (118), 117 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:12:27,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2024-11-17 04:12:27,807 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 57 [2024-11-17 04:12:27,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:12:27,807 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2024-11-17 04:12:27,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 4.911764705882353) internal successors, (167), 35 states have internal predecessors, (167), 0 states have call successors, (0), 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-17 04:12:27,807 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2024-11-17 04:12:27,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-17 04:12:27,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:12:27,809 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1, 1, 1] [2024-11-17 04:12:27,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-17 04:12:28,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:12:28,010 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 04:12:28,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:12:28,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1743229650, now seen corresponding path program 4 times [2024-11-17 04:12:28,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:12:28,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181402402] [2024-11-17 04:12:28,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:12:28,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:12:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:12:29,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:12:29,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:12:29,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181402402] [2024-11-17 04:12:29,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181402402] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:12:29,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509988467] [2024-11-17 04:12:29,259 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 04:12:29,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:12:29,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:12:29,263 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-17 04:12:29,266 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-17 04:12:29,331 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 04:12:29,331 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 04:12:29,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-17 04:12:29,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:12:30,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:12:30,231 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 04:12:31,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:12:31,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509988467] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 04:12:31,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 04:12:31,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 70 [2024-11-17 04:12:31,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7064552] [2024-11-17 04:12:31,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 04:12:31,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-11-17 04:12:31,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:12:31,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-11-17 04:12:31,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1926, Invalid=3044, Unknown=0, NotChecked=0, Total=4970 [2024-11-17 04:12:31,623 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand has 71 states, 70 states have (on average 4.957142857142857) internal successors, (347), 71 states have internal predecessors, (347), 0 states have call successors, (0), 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-17 04:12:31,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:12:31,782 INFO L93 Difference]: Finished difference Result 159 states and 166 transitions. [2024-11-17 04:12:31,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-17 04:12:31,782 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 70 states have (on average 4.957142857142857) internal successors, (347), 71 states have internal predecessors, (347), 0 states have call successors, (0), 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 117 [2024-11-17 04:12:31,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:12:31,784 INFO L225 Difference]: With dead ends: 159 [2024-11-17 04:12:31,784 INFO L226 Difference]: Without dead ends: 158 [2024-11-17 04:12:31,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1997, Invalid=3115, Unknown=0, NotChecked=0, Total=5112 [2024-11-17 04:12:31,786 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:12:31,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 96 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:12:31,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-17 04:12:31,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2024-11-17 04:12:31,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.0063694267515924) internal successors, (158), 157 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:12:31,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2024-11-17 04:12:31,800 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 117 [2024-11-17 04:12:31,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:12:31,801 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2024-11-17 04:12:31,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 70 states have (on average 4.957142857142857) internal successors, (347), 71 states have internal predecessors, (347), 0 states have call successors, (0), 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-17 04:12:31,801 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2024-11-17 04:12:31,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-17 04:12:31,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:12:31,805 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1, 1, 1] [2024-11-17 04:12:31,828 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-17 04:12:32,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:12:32,008 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 04:12:32,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:12:32,008 INFO L85 PathProgramCache]: Analyzing trace with hash 874446034, now seen corresponding path program 5 times [2024-11-17 04:12:32,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:12:32,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514906985] [2024-11-17 04:12:32,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:12:32,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:12:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 04:12:32,095 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 04:12:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 04:12:32,175 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 04:12:32,175 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 04:12:32,176 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-17 04:12:32,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-17 04:12:32,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 04:12:32,180 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1] [2024-11-17 04:12:32,213 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 04:12:32,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 04:12:32 BoogieIcfgContainer [2024-11-17 04:12:32,215 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 04:12:32,216 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 04:12:32,216 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 04:12:32,216 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 04:12:32,216 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 04:12:24" (3/4) ... [2024-11-17 04:12:32,217 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-17 04:12:32,280 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-17 04:12:32,282 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 04:12:32,283 INFO L158 Benchmark]: Toolchain (without parser) took 8085.53ms. Allocated memory was 151.0MB in the beginning and 310.4MB in the end (delta: 159.4MB). Free memory was 81.5MB in the beginning and 260.0MB in the end (delta: -178.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 04:12:32,283 INFO L158 Benchmark]: CDTParser took 0.85ms. Allocated memory is still 151.0MB. Free memory was 101.5MB in the beginning and 101.3MB in the end (delta: 170.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 04:12:32,283 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.40ms. Allocated memory is still 151.0MB. Free memory was 81.3MB in the beginning and 69.3MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-17 04:12:32,284 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.02ms. Allocated memory is still 151.0MB. Free memory was 69.1MB in the beginning and 67.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 04:12:32,284 INFO L158 Benchmark]: Boogie Preprocessor took 20.11ms. Allocated memory is still 151.0MB. Free memory was 67.7MB in the beginning and 66.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 04:12:32,285 INFO L158 Benchmark]: IcfgBuilder took 218.66ms. Allocated memory is still 151.0MB. Free memory was 66.3MB in the beginning and 113.5MB in the end (delta: -47.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-17 04:12:32,285 INFO L158 Benchmark]: TraceAbstraction took 7509.06ms. Allocated memory was 151.0MB in the beginning and 310.4MB in the end (delta: 159.4MB). Free memory was 113.0MB in the beginning and 265.2MB in the end (delta: -152.3MB). Peak memory consumption was 141.9MB. Max. memory is 16.1GB. [2024-11-17 04:12:32,285 INFO L158 Benchmark]: Witness Printer took 66.76ms. Allocated memory is still 310.4MB. Free memory was 265.2MB in the beginning and 260.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-17 04:12:32,286 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.85ms. Allocated memory is still 151.0MB. Free memory was 101.5MB in the beginning and 101.3MB in the end (delta: 170.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 240.40ms. Allocated memory is still 151.0MB. Free memory was 81.3MB in the beginning and 69.3MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.02ms. Allocated memory is still 151.0MB. Free memory was 69.1MB in the beginning and 67.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.11ms. Allocated memory is still 151.0MB. Free memory was 67.7MB in the beginning and 66.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 218.66ms. Allocated memory is still 151.0MB. Free memory was 66.3MB in the beginning and 113.5MB in the end (delta: -47.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7509.06ms. Allocated memory was 151.0MB in the beginning and 310.4MB in the end (delta: 159.4MB). Free memory was 113.0MB in the beginning and 265.2MB in the end (delta: -152.3MB). Peak memory consumption was 141.9MB. Max. memory is 16.1GB. * Witness Printer took 66.76ms. Allocated memory is still 310.4MB. Free memory was 265.2MB in the beginning and 260.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 24]: integer overflow possible integer overflow possible We found a FailurePath: [L20] int x = __VERIFIER_nondet_int(); [L21] int y = __VERIFIER_nondet_int(); [L22] COND FALSE !(!(x==1 && y==1)) VAL [x=1, y=1] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y VAL [x=1, y=1] [L24] x=x+y [L25] y=x VAL [x=2, y=2] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y VAL [x=2, y=2] [L24] x=x+y [L25] y=x VAL [x=4, y=4] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y VAL [x=4, y=4] [L24] x=x+y [L25] y=x VAL [x=8, y=8] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y VAL [x=8, y=8] [L24] x=x+y [L25] y=x VAL [x=16, y=16] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y VAL [x=16, y=16] [L24] x=x+y [L25] y=x VAL [x=32, y=32] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y VAL [x=32, y=32] [L24] x=x+y [L25] y=x VAL [x=64, y=64] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y VAL [x=64, y=64] [L24] x=x+y [L25] y=x VAL [x=128, y=128] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y VAL [x=128, y=128] [L24] x=x+y [L25] y=x VAL [x=256, y=256] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y VAL [x=256, y=256] [L24] x=x+y [L25] y=x VAL [x=512, y=512] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y VAL [x=512, y=512] [L24] x=x+y [L25] y=x VAL [x=1024, y=1024] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y VAL [x=1024, y=1024] [L24] x=x+y [L25] y=x VAL [x=2048, y=2048] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y VAL [x=2048, y=2048] [L24] x=x+y [L25] y=x VAL [x=4096, y=4096] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y VAL [x=4096, y=4096] [L24] x=x+y [L25] y=x VAL [x=8192, y=8192] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y VAL [x=8192, y=8192] [L24] x=x+y [L25] y=x VAL [x=16384, y=16384] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y VAL [x=16384, y=16384] [L24] x=x+y [L25] y=x VAL [x=32768, y=32768] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y VAL [x=32768, y=32768] [L24] x=x+y [L25] y=x VAL [x=65536, y=65536] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y VAL [x=65536, y=65536] [L24] x=x+y [L25] y=x VAL [x=131072, y=131072] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y VAL [x=131072, y=131072] [L24] x=x+y [L25] y=x VAL [x=262144, y=262144] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y VAL [x=262144, y=262144] [L24] x=x+y [L25] y=x VAL [x=524288, y=524288] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y VAL [x=524288, y=524288] [L24] x=x+y [L25] y=x VAL [x=1048576, y=1048576] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y VAL [x=1048576, y=1048576] [L24] x=x+y [L25] y=x VAL [x=2097152, y=2097152] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y VAL [x=2097152, y=2097152] [L24] x=x+y [L25] y=x VAL [x=4194304, y=4194304] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y VAL [x=4194304, y=4194304] [L24] x=x+y [L25] y=x VAL [x=8388608, y=8388608] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y VAL [x=8388608, y=8388608] [L24] x=x+y [L25] y=x VAL [x=16777216, y=16777216] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y VAL [x=16777216, y=16777216] [L24] x=x+y [L25] y=x VAL [x=33554432, y=33554432] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y VAL [x=33554432, y=33554432] [L24] x=x+y [L25] y=x VAL [x=67108864, y=67108864] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y VAL [x=67108864, y=67108864] [L24] x=x+y [L25] y=x VAL [x=134217728, y=134217728] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y VAL [x=134217728, y=134217728] [L24] x=x+y [L25] y=x VAL [x=268435456, y=268435456] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y VAL [x=268435456, y=268435456] [L24] x=x+y [L25] y=x VAL [x=536870912, y=536870912] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y VAL [x=536870912, y=536870912] [L24] x=x+y [L25] y=x VAL [x=1073741824, y=1073741824] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] x+y - UnprovableResult [Line: 24]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 7, TraceHistogramMax: 31, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 233 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 191 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 307 IncrementalHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 42 mSDtfsCounter, 307 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 471 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=6, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 596 NumberOfCodeBlocks, 596 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 638 ConstructedInterpolants, 0 QuantifiedInterpolants, 3842 SizeOfPredicates, 8 NumberOfNonLiveVariables, 412 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 0/4674 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-17 04:12:32,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)