./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 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/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-?-c7c6ca5-m [2024-11-09 11:27:35,996 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:27:36,071 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 11:27:36,076 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:27:36,076 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:27:36,106 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:27:36,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:27:36,107 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:27:36,108 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:27:36,110 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:27:36,111 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:27:36,111 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:27:36,111 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:27:36,114 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:27:36,115 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:27:36,115 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:27:36,115 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 11:27:36,116 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 11:27:36,116 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:27:36,116 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 11:27:36,116 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:27:36,118 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 11:27:36,118 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:27:36,119 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 11:27:36,119 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:27:36,119 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 11:27:36,119 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:27:36,120 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 11:27:36,120 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 11:27:36,120 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:27:36,120 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:27:36,121 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:27:36,121 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:27:36,121 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:27:36,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:27:36,122 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:27:36,122 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:27:36,122 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 11:27:36,123 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 11:27:36,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 11:27:36,124 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:27:36,124 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:27:36,124 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:27:36,124 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:27:36,125 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-09 11:27:36,376 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:27:36,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:27:36,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:27:36,406 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:27:36,406 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:27:36,407 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-09 11:27:37,939 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:27:38,154 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:27:38,155 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark01_conjunctive.i [2024-11-09 11:27:38,168 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f38bb231/641f5cc416e7466fa15284b1fa284eb0/FLAGb31d76416 [2024-11-09 11:27:38,524 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f38bb231/641f5cc416e7466fa15284b1fa284eb0 [2024-11-09 11:27:38,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:27:38,529 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:27:38,532 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:27:38,532 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:27:38,539 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:27:38,539 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:27:38" (1/1) ... [2024-11-09 11:27:38,540 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bfc0c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:38, skipping insertion in model container [2024-11-09 11:27:38,540 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:27:38" (1/1) ... [2024-11-09 11:27:38,562 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:27:38,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:27:38,787 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:27:38,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:27:38,816 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:27:38,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:38 WrapperNode [2024-11-09 11:27:38,816 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:27:38,818 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:27:38,818 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:27:38,818 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:27:38,824 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:27:38" (1/1) ... [2024-11-09 11:27:38,831 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:27:38" (1/1) ... [2024-11-09 11:27:38,844 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 39 [2024-11-09 11:27:38,844 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:27:38,845 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:27:38,845 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:27:38,845 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:27:38,855 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:38" (1/1) ... [2024-11-09 11:27:38,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:38" (1/1) ... [2024-11-09 11:27:38,856 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:38" (1/1) ... [2024-11-09 11:27:38,864 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:27:38,864 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:38" (1/1) ... [2024-11-09 11:27:38,864 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:38" (1/1) ... [2024-11-09 11:27:38,866 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:38" (1/1) ... [2024-11-09 11:27:38,869 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:38" (1/1) ... [2024-11-09 11:27:38,869 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:38" (1/1) ... [2024-11-09 11:27:38,870 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:38" (1/1) ... [2024-11-09 11:27:38,871 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:27:38,874 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:27:38,874 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:27:38,874 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:27:38,875 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:38" (1/1) ... [2024-11-09 11:27:38,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:27:38,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:27:38,904 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:27:38,910 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:27:38,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 11:27:38,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 11:27:38,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:27:38,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:27:39,018 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:27:39,020 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:27:39,166 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-09 11:27:39,167 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:27:39,180 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:27:39,180 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 11:27:39,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:27:39 BoogieIcfgContainer [2024-11-09 11:27:39,181 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:27:39,183 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:27:39,183 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:27:39,186 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:27:39,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:27:38" (1/3) ... [2024-11-09 11:27:39,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b143f67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:27:39, skipping insertion in model container [2024-11-09 11:27:39,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:38" (2/3) ... [2024-11-09 11:27:39,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b143f67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:27:39, skipping insertion in model container [2024-11-09 11:27:39,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:27:39" (3/3) ... [2024-11-09 11:27:39,191 INFO L112 eAbstractionObserver]: Analyzing ICFG benchmark01_conjunctive.i [2024-11-09 11:27:39,211 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:27:39,212 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 11:27:39,275 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:27:39,284 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;@26a187be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:27:39,285 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 11:27:39,289 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 14 states have (on average 1.5) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:27:39,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 11:27:39,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:27:39,299 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 11:27:39,300 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 11:27:39,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:27:39,308 INFO L85 PathProgramCache]: Analyzing trace with hash 889571337, now seen corresponding path program 1 times [2024-11-09 11:27:39,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:27:39,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475821620] [2024-11-09 11:27:39,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:27:39,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:27:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:27:39,531 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:27:39,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:27:39,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475821620] [2024-11-09 11:27:39,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475821620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:27:39,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:27:39,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:27:39,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187405748] [2024-11-09 11:27:39,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:27:39,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:27:39,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:27:39,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:27:39,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:27:39,575 INFO L87 Difference]: Start difference. First operand has 17 states, 14 states have (on average 1.5) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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:27:39,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:27:39,611 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2024-11-09 11:27:39,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:27:39,615 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:27:39,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:27:39,625 INFO L225 Difference]: With dead ends: 24 [2024-11-09 11:27:39,625 INFO L226 Difference]: Without dead ends: 8 [2024-11-09 11:27:39,628 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:27:39,632 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:27:39,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 17 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:27:39,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2024-11-09 11:27:39,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-11-09 11:27:39,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 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:27:39,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-11-09 11:27:39,660 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2024-11-09 11:27:39,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:27:39,661 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-11-09 11:27:39,661 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:27:39,661 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-11-09 11:27:39,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 11:27:39,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:27:39,662 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:27:39,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 11:27:39,662 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 11:27:39,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:27:39,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1806907722, now seen corresponding path program 1 times [2024-11-09 11:27:39,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:27:39,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56936960] [2024-11-09 11:27:39,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:27:39,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:27:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:27:39,758 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:27:39,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:27:39,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56936960] [2024-11-09 11:27:39,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56936960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:27:39,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:27:39,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:27:39,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102864225] [2024-11-09 11:27:39,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:27:39,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:27:39,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:27:39,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:27:39,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:27:39,766 INFO L87 Difference]: Start difference. First operand 8 states and 8 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-09 11:27:39,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:27:39,788 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-11-09 11:27:39,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:27:39,788 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-09 11:27:39,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:27:39,789 INFO L225 Difference]: With dead ends: 13 [2024-11-09 11:27:39,790 INFO L226 Difference]: Without dead ends: 12 [2024-11-09 11:27:39,790 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:27:39,791 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 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:27:39,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:27:39,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-09 11:27:39,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-09 11:27:39,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:27:39,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-09 11:27:39,801 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 7 [2024-11-09 11:27:39,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:27:39,801 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-09 11:27:39,802 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-09 11:27:39,802 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-09 11:27:39,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 11:27:39,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:27:39,804 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2024-11-09 11:27:39,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 11:27:39,804 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 11:27:39,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:27:39,809 INFO L85 PathProgramCache]: Analyzing trace with hash -2120920463, now seen corresponding path program 1 times [2024-11-09 11:27:39,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:27:39,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374989232] [2024-11-09 11:27:39,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:27:39,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:27:39,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:27:39,981 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-09 11:27:39,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:27:39,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374989232] [2024-11-09 11:27:39,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374989232] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:27:39,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202428915] [2024-11-09 11:27:39,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:27:39,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:27:39,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:27:39,987 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:27:39,988 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:27:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:27:40,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:27:40,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:27:40,245 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-09 11:27:40,245 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:27:40,313 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-09 11:27:40,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202428915] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:27:40,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:27:40,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2024-11-09 11:27:40,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180995038] [2024-11-09 11:27:40,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:27:40,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 11:27:40,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:27:40,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 11:27:40,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:27:40,316 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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:27:40,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:27:40,367 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2024-11-09 11:27:40,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:27:40,368 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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:27:40,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:27:40,369 INFO L225 Difference]: With dead ends: 25 [2024-11-09 11:27:40,369 INFO L226 Difference]: Without dead ends: 24 [2024-11-09 11:27:40,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 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-09 11:27:40,370 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:27:40,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:27:40,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-09 11:27:40,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-09 11:27:40,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 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:27:40,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2024-11-09 11:27:40,377 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 11 [2024-11-09 11:27:40,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:27:40,377 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2024-11-09 11:27:40,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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:27:40,377 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2024-11-09 11:27:40,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 11:27:40,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:27:40,378 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1] [2024-11-09 11:27:40,397 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:27:40,583 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-09 11:27:40,584 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 11:27:40,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:27:40,585 INFO L85 PathProgramCache]: Analyzing trace with hash 109648102, now seen corresponding path program 2 times [2024-11-09 11:27:40,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:27:40,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474173330] [2024-11-09 11:27:40,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:27:40,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:27:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:27:40,830 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:27:40,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:27:40,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474173330] [2024-11-09 11:27:40,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474173330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:27:40,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129374463] [2024-11-09 11:27:40,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:27:40,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:27:40,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:27:40,835 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:27:40,837 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:27:40,886 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:27:40,887 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:27:40,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 11:27:40,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:27:41,104 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:27:41,105 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:27:41,273 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:27:41,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129374463] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:27:41,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:27:41,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2024-11-09 11:27:41,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341413385] [2024-11-09 11:27:41,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:27:41,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 11:27:41,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:27:41,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 11:27:41,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=158, Unknown=0, NotChecked=0, Total=272 [2024-11-09 11:27:41,281 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 17 states, 16 states have (on average 4.0625) internal successors, (65), 17 states have internal predecessors, (65), 0 states have call successors, (0), 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:27:41,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:27:41,353 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2024-11-09 11:27:41,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 11:27:41,354 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.0625) internal successors, (65), 17 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-09 11:27:41,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:27:41,355 INFO L225 Difference]: With dead ends: 49 [2024-11-09 11:27:41,355 INFO L226 Difference]: Without dead ends: 48 [2024-11-09 11:27:41,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 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-09 11:27:41,356 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:27:41,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:27:41,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-09 11:27:41,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-09 11:27:41,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 0 states have call successors, (0), 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:27:41,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2024-11-09 11:27:41,363 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 23 [2024-11-09 11:27:41,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:27:41,364 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2024-11-09 11:27:41,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.0625) internal successors, (65), 17 states have internal predecessors, (65), 0 states have call successors, (0), 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:27:41,364 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2024-11-09 11:27:41,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 11:27:41,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:27:41,365 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 1, 1, 1, 1] [2024-11-09 11:27:41,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 11:27:41,569 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-09 11:27:41,570 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 11:27:41,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:27:41,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1903873872, now seen corresponding path program 3 times [2024-11-09 11:27:41,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:27:41,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392438800] [2024-11-09 11:27:41,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:27:41,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:27:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:27:42,058 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:27:42,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:27:42,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392438800] [2024-11-09 11:27:42,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392438800] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:27:42,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288885511] [2024-11-09 11:27:42,059 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 11:27:42,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:27:42,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:27:42,062 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:27:42,063 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:27:42,130 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-09 11:27:42,131 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:27:42,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 11:27:42,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:27:42,626 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:27:42,627 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:27:43,063 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:27:43,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288885511] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:27:43,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:27:43,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2024-11-09 11:27:43,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968984647] [2024-11-09 11:27:43,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:27:43,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-09 11:27:43,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:27:43,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-09 11:27:43,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=510, Invalid=680, Unknown=0, NotChecked=0, Total=1190 [2024-11-09 11:27:43,068 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand has 35 states, 34 states have (on average 4.029411764705882) internal successors, (137), 35 states have internal predecessors, (137), 0 states have call successors, (0), 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:27:43,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:27:43,177 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2024-11-09 11:27:43,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 11:27:43,178 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 4.029411764705882) internal successors, (137), 35 states have internal predecessors, (137), 0 states have call successors, (0), 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 47 [2024-11-09 11:27:43,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:27:43,179 INFO L225 Difference]: With dead ends: 97 [2024-11-09 11:27:43,179 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 11:27:43,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=545, Invalid=715, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 11:27:43,180 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:27:43,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:27:43,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 11:27:43,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-09 11:27:43,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.0105263157894737) internal successors, (96), 95 states have internal predecessors, (96), 0 states have call successors, (0), 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:27:43,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2024-11-09 11:27:43,198 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 47 [2024-11-09 11:27:43,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:27:43,199 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2024-11-09 11:27:43,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 4.029411764705882) internal successors, (137), 35 states have internal predecessors, (137), 0 states have call successors, (0), 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:27:43,200 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2024-11-09 11:27:43,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 11:27:43,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:27:43,202 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 22, 1, 1, 1, 1] [2024-11-09 11:27:43,224 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-09 11:27:43,402 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-09 11:27:43,403 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 11:27:43,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:27:43,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1938940452, now seen corresponding path program 4 times [2024-11-09 11:27:43,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:27:43,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494627568] [2024-11-09 11:27:43,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:27:43,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:27:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:27:44,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 1012 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:27:44,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:27:44,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494627568] [2024-11-09 11:27:44,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494627568] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:27:44,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377860817] [2024-11-09 11:27:44,743 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 11:27:44,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:27:44,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:27:44,750 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:27:44,752 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:27:44,821 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 11:27:44,821 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:27:44,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-09 11:27:44,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:27:45,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 1012 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:27:45,908 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:27:47,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 1012 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:27:47,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377860817] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:27:47,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:27:47,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 70 [2024-11-09 11:27:47,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539810911] [2024-11-09 11:27:47,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:27:47,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-11-09 11:27:47,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:27:47,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-11-09 11:27:47,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1926, Invalid=3044, Unknown=0, NotChecked=0, Total=4970 [2024-11-09 11:27:47,145 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand has 71 states, 70 states have (on average 4.014285714285714) internal successors, (281), 71 states have internal predecessors, (281), 0 states have call successors, (0), 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:27:47,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:27:47,293 INFO L93 Difference]: Finished difference Result 129 states and 136 transitions. [2024-11-09 11:27:47,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-09 11:27:47,294 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 70 states have (on average 4.014285714285714) internal successors, (281), 71 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-11-09 11:27:47,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:27:47,296 INFO L225 Difference]: With dead ends: 129 [2024-11-09 11:27:47,296 INFO L226 Difference]: Without dead ends: 128 [2024-11-09 11:27:47,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1997, Invalid=3115, Unknown=0, NotChecked=0, Total=5112 [2024-11-09 11:27:47,298 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:27:47,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:27:47,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-09 11:27:47,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-09 11:27:47,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.0078740157480315) internal successors, (128), 127 states have internal predecessors, (128), 0 states have call successors, (0), 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:27:47,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2024-11-09 11:27:47,313 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 95 [2024-11-09 11:27:47,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:27:47,314 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2024-11-09 11:27:47,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 70 states have (on average 4.014285714285714) internal successors, (281), 71 states have internal predecessors, (281), 0 states have call successors, (0), 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:27:47,314 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2024-11-09 11:27:47,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 11:27:47,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:27:47,318 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 30, 1, 1, 1, 1] [2024-11-09 11:27:47,335 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:27:47,518 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-09 11:27:47,519 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 11:27:47,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:27:47,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1144586588, now seen corresponding path program 5 times [2024-11-09 11:27:47,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:27:47,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688637080] [2024-11-09 11:27:47,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:27:47,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:27:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 11:27:47,617 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 11:27:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 11:27:47,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 11:27:47,691 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 11:27:47,692 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-09 11:27:47,693 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-09 11:27:47,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 11:27:47,696 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1] [2024-11-09 11:27:47,734 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 11:27:47,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:27:47 BoogieIcfgContainer [2024-11-09 11:27:47,737 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 11:27:47,738 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 11:27:47,738 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 11:27:47,738 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 11:27:47,738 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:27:39" (3/4) ... [2024-11-09 11:27:47,740 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 11:27:47,809 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 11:27:47,810 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 11:27:47,810 INFO L158 Benchmark]: Toolchain (without parser) took 9280.90ms. Allocated memory was 148.9MB in the beginning and 245.4MB in the end (delta: 96.5MB). Free memory was 77.1MB in the beginning and 182.9MB in the end (delta: -105.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:27:47,810 INFO L158 Benchmark]: CDTParser took 0.93ms. Allocated memory is still 148.9MB. Free memory is still 100.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:27:47,811 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.06ms. Allocated memory was 148.9MB in the beginning and 203.4MB in the end (delta: 54.5MB). Free memory was 77.0MB in the beginning and 173.6MB in the end (delta: -96.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 11:27:47,811 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.71ms. Allocated memory is still 203.4MB. Free memory was 173.6MB in the beginning and 172.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:27:47,811 INFO L158 Benchmark]: Boogie Preprocessor took 26.73ms. Allocated memory is still 203.4MB. Free memory was 172.5MB in the beginning and 170.4MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 11:27:47,811 INFO L158 Benchmark]: RCFGBuilder took 307.18ms. Allocated memory is still 203.4MB. Free memory was 170.4MB in the beginning and 159.8MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 11:27:47,811 INFO L158 Benchmark]: TraceAbstraction took 8554.13ms. Allocated memory was 203.4MB in the beginning and 245.4MB in the end (delta: 41.9MB). Free memory was 158.7MB in the beginning and 187.1MB in the end (delta: -28.4MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2024-11-09 11:27:47,812 INFO L158 Benchmark]: Witness Printer took 71.94ms. Allocated memory is still 245.4MB. Free memory was 187.1MB in the beginning and 182.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 11:27:47,816 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.93ms. Allocated memory is still 148.9MB. Free memory is still 100.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.06ms. Allocated memory was 148.9MB in the beginning and 203.4MB in the end (delta: 54.5MB). Free memory was 77.0MB in the beginning and 173.6MB in the end (delta: -96.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.71ms. Allocated memory is still 203.4MB. Free memory was 173.6MB in the beginning and 172.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.73ms. Allocated memory is still 203.4MB. Free memory was 172.5MB in the beginning and 170.4MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 307.18ms. Allocated memory is still 203.4MB. Free memory was 170.4MB in the beginning and 159.8MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 8554.13ms. Allocated memory was 203.4MB in the beginning and 245.4MB in the end (delta: 41.9MB). Free memory was 158.7MB in the beginning and 187.1MB in the end (delta: -28.4MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * Witness Printer took 71.94ms. Allocated memory is still 245.4MB. Free memory was 187.1MB in the beginning and 182.9MB 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 - 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 [L24] x=x+y [L25] y=x VAL [x=2, y=2] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=4, y=4] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=8, y=8] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=16, y=16] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=32, y=32] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=64, y=64] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=128, y=128] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=256, y=256] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=512, y=512] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=1024, y=1024] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=2048, y=2048] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=4096, y=4096] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=8192, y=8192] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=16384, y=16384] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=32768, y=32768] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=65536, y=65536] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=131072, y=131072] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=262144, y=262144] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=524288, y=524288] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=1048576, y=1048576] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=2097152, y=2097152] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=4194304, y=4194304] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=8388608, y=8388608] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=16777216, y=16777216] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=33554432, y=33554432] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=67108864, y=67108864] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=134217728, y=134217728] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=268435456, y=268435456] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [L24] x=x+y [L25] y=x VAL [x=536870912, y=536870912] [L23] COND TRUE __VERIFIER_nondet_bool() [L24] EXPR x+y [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, 17 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 8.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, 2 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 238 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 196 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 229 IncrementalHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 42 mSDtfsCounter, 229 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 397 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 492 NumberOfCodeBlocks, 492 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 527 ConstructedInterpolants, 0 QuantifiedInterpolants, 3147 SizeOfPredicates, 8 NumberOfNonLiveVariables, 412 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 0/3828 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-09 11:27:47,846 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)