/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-new/count_by_1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 09:39:53,460 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:39:53,462 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:39:53,488 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:39:53,488 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:39:53,489 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:39:53,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:39:53,491 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:39:53,492 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:39:53,492 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:39:53,493 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:39:53,493 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:39:53,494 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:39:53,494 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:39:53,495 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:39:53,496 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:39:53,496 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:39:53,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:39:53,498 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:39:53,499 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:39:53,499 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:39:53,500 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:39:53,500 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:39:53,501 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:39:53,502 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:39:53,503 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:39:53,503 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:39:53,503 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:39:53,504 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:39:53,504 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:39:53,505 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:39:53,505 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:39:53,505 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:39:53,506 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:39:53,506 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:39:53,507 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:39:53,507 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:39:53,507 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:39:53,507 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:39:53,508 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:39:53,508 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:39:53,513 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:39:53,513 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 09:39:53,519 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:39:53,519 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:39:53,520 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:39:53,520 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:39:53,520 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:39:53,520 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:39:53,520 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:39:53,520 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:39:53,520 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:39:53,520 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:39:53,521 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:39:53,521 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:39:53,521 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:39:53,521 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:39:53,521 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:39:53,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:39:53,521 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:39:53,521 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:39:53,522 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:39:53,522 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:39:53,522 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:39:53,522 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:39:53,522 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 09:39:53,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:39:53,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:39:53,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:39:53,714 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:39:53,715 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:39:53,716 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/count_by_1.i [2022-04-08 09:39:53,770 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5a836e81/1e9557114f5f4879b8af9cef2927079e/FLAGbab7bc274 [2022-04-08 09:39:54,121 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:39:54,122 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_1.i [2022-04-08 09:39:54,125 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5a836e81/1e9557114f5f4879b8af9cef2927079e/FLAGbab7bc274 [2022-04-08 09:39:54,134 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5a836e81/1e9557114f5f4879b8af9cef2927079e [2022-04-08 09:39:54,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:39:54,136 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:39:54,137 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:39:54,137 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:39:54,141 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:39:54,141 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:39:54" (1/1) ... [2022-04-08 09:39:54,142 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a3ab94b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:54, skipping insertion in model container [2022-04-08 09:39:54,142 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:39:54" (1/1) ... [2022-04-08 09:39:54,150 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:39:54,160 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:39:54,292 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_1.i[891,904] [2022-04-08 09:39:54,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:39:54,306 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:39:54,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_1.i[891,904] [2022-04-08 09:39:54,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:39:54,328 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:39:54,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:54 WrapperNode [2022-04-08 09:39:54,329 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:39:54,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:39:54,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:39:54,330 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:39:54,341 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:54" (1/1) ... [2022-04-08 09:39:54,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:54" (1/1) ... [2022-04-08 09:39:54,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:54" (1/1) ... [2022-04-08 09:39:54,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:54" (1/1) ... [2022-04-08 09:39:54,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:54" (1/1) ... [2022-04-08 09:39:54,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:54" (1/1) ... [2022-04-08 09:39:54,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:54" (1/1) ... [2022-04-08 09:39:54,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:39:54,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:39:54,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:39:54,352 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:39:54,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:54" (1/1) ... [2022-04-08 09:39:54,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:39:54,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:39:54,375 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 09:39:54,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 09:39:54,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:39:54,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:39:54,402 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:39:54,402 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 09:39:54,402 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 09:39:54,403 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:39:54,403 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:39:54,403 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:39:54,403 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 09:39:54,403 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 09:39:54,404 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:39:54,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:39:54,405 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 09:39:54,405 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:39:54,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 09:39:54,407 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:39:54,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:39:54,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:39:54,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:39:54,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:39:54,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:39:54,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:39:54,461 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:39:54,462 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:39:54,586 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:39:54,602 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:39:54,603 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 09:39:54,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:39:54 BoogieIcfgContainer [2022-04-08 09:39:54,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:39:54,605 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:39:54,605 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:39:54,610 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:39:54,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:39:54" (1/3) ... [2022-04-08 09:39:54,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de4ee36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:39:54, skipping insertion in model container [2022-04-08 09:39:54,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:54" (2/3) ... [2022-04-08 09:39:54,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de4ee36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:39:54, skipping insertion in model container [2022-04-08 09:39:54,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:39:54" (3/3) ... [2022-04-08 09:39:54,612 INFO L111 eAbstractionObserver]: Analyzing ICFG count_by_1.i [2022-04-08 09:39:54,616 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:39:54,616 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 09:39:54,655 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:39:54,669 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 [2022-04-08 09:39:54,669 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 09:39:54,687 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:39:54,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 09:39:54,692 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:39:54,692 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:39:54,693 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:39:54,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:39:54,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1305738320, now seen corresponding path program 1 times [2022-04-08 09:39:54,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:39:54,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1367386869] [2022-04-08 09:39:54,722 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:39:54,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1305738320, now seen corresponding path program 2 times [2022-04-08 09:39:54,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:39:54,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167928238] [2022-04-08 09:39:54,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:39:54,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:39:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:54,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:39:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:54,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {23#true} is VALID [2022-04-08 09:39:54,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-08 09:39:54,882 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #51#return; {23#true} is VALID [2022-04-08 09:39:54,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:39:54,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {23#true} is VALID [2022-04-08 09:39:54,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-08 09:39:54,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #51#return; {23#true} is VALID [2022-04-08 09:39:54,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret2 := main(); {23#true} is VALID [2022-04-08 09:39:54,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} havoc ~i~0;~i~0 := 0; {28#(= main_~i~0 0)} is VALID [2022-04-08 09:39:54,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#(= main_~i~0 0)} assume !(~i~0 < 1000000); {24#false} is VALID [2022-04-08 09:39:54,886 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {24#false} is VALID [2022-04-08 09:39:54,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-08 09:39:54,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-08 09:39:54,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-08 09:39:54,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:39:54,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:39:54,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167928238] [2022-04-08 09:39:54,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167928238] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:39:54,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:39:54,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:39:54,890 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:39:54,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1367386869] [2022-04-08 09:39:54,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1367386869] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:39:54,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:39:54,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:39:54,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776769502] [2022-04-08 09:39:54,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:39:54,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 09:39:54,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:39:54,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:54,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:39:54,910 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 09:39:54,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:39:54,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 09:39:54,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 09:39:54,926 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:55,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:55,012 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-08 09:39:55,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 09:39:55,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 09:39:55,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:39:55,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:55,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-04-08 09:39:55,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:55,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-04-08 09:39:55,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 39 transitions. [2022-04-08 09:39:55,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:39:55,080 INFO L225 Difference]: With dead ends: 34 [2022-04-08 09:39:55,081 INFO L226 Difference]: Without dead ends: 15 [2022-04-08 09:39:55,083 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 09:39:55,087 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 13 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:39:55,088 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 26 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:39:55,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-08 09:39:55,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-04-08 09:39:55,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:39:55,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:55,109 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:55,109 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:55,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:55,111 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 09:39:55,111 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 09:39:55,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:39:55,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:39:55,112 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-08 09:39:55,112 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-08 09:39:55,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:55,114 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 09:39:55,114 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 09:39:55,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:39:55,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:39:55,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:39:55,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:39:55,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:55,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-08 09:39:55,118 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2022-04-08 09:39:55,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:39:55,118 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-08 09:39:55,119 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:55,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-08 09:39:55,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:39:55,141 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-08 09:39:55,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-08 09:39:55,145 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:39:55,145 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:39:55,145 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 09:39:55,146 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:39:55,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:39:55,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1786070446, now seen corresponding path program 1 times [2022-04-08 09:39:55,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:39:55,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1310045024] [2022-04-08 09:39:55,160 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:39:55,161 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:39:55,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1786070446, now seen corresponding path program 2 times [2022-04-08 09:39:55,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:39:55,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492466132] [2022-04-08 09:39:55,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:39:55,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:39:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:55,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:39:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:55,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {160#true} is VALID [2022-04-08 09:39:55,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {160#true} assume true; {160#true} is VALID [2022-04-08 09:39:55,218 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {160#true} {160#true} #51#return; {160#true} is VALID [2022-04-08 09:39:55,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {160#true} call ULTIMATE.init(); {167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:39:55,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {160#true} is VALID [2022-04-08 09:39:55,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {160#true} assume true; {160#true} is VALID [2022-04-08 09:39:55,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {160#true} {160#true} #51#return; {160#true} is VALID [2022-04-08 09:39:55,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {160#true} call #t~ret2 := main(); {160#true} is VALID [2022-04-08 09:39:55,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {160#true} havoc ~i~0;~i~0 := 0; {165#(= main_~i~0 0)} is VALID [2022-04-08 09:39:55,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {165#(= main_~i~0 0)} assume !!(~i~0 < 1000000); {165#(= main_~i~0 0)} is VALID [2022-04-08 09:39:55,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {165#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {166#(<= main_~i~0 1)} is VALID [2022-04-08 09:39:55,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {166#(<= main_~i~0 1)} assume !(~i~0 < 1000000); {161#false} is VALID [2022-04-08 09:39:55,222 INFO L272 TraceCheckUtils]: 9: Hoare triple {161#false} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {161#false} is VALID [2022-04-08 09:39:55,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {161#false} ~cond := #in~cond; {161#false} is VALID [2022-04-08 09:39:55,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {161#false} assume 0 == ~cond; {161#false} is VALID [2022-04-08 09:39:55,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {161#false} assume !false; {161#false} is VALID [2022-04-08 09:39:55,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:39:55,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:39:55,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492466132] [2022-04-08 09:39:55,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492466132] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:39:55,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638358769] [2022-04-08 09:39:55,223 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:39:55,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:39:55,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:39:55,225 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) [2022-04-08 09:39:55,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 [2022-04-08 09:39:55,263 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:39:55,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:39:55,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 09:39:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:55,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:39:55,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {160#true} call ULTIMATE.init(); {160#true} is VALID [2022-04-08 09:39:55,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {160#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {160#true} is VALID [2022-04-08 09:39:55,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {160#true} assume true; {160#true} is VALID [2022-04-08 09:39:55,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {160#true} {160#true} #51#return; {160#true} is VALID [2022-04-08 09:39:55,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {160#true} call #t~ret2 := main(); {160#true} is VALID [2022-04-08 09:39:55,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {160#true} havoc ~i~0;~i~0 := 0; {186#(<= main_~i~0 0)} is VALID [2022-04-08 09:39:55,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {186#(<= main_~i~0 0)} assume !!(~i~0 < 1000000); {186#(<= main_~i~0 0)} is VALID [2022-04-08 09:39:55,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {186#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {166#(<= main_~i~0 1)} is VALID [2022-04-08 09:39:55,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {166#(<= main_~i~0 1)} assume !(~i~0 < 1000000); {161#false} is VALID [2022-04-08 09:39:55,357 INFO L272 TraceCheckUtils]: 9: Hoare triple {161#false} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {161#false} is VALID [2022-04-08 09:39:55,357 INFO L290 TraceCheckUtils]: 10: Hoare triple {161#false} ~cond := #in~cond; {161#false} is VALID [2022-04-08 09:39:55,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {161#false} assume 0 == ~cond; {161#false} is VALID [2022-04-08 09:39:55,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {161#false} assume !false; {161#false} is VALID [2022-04-08 09:39:55,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:39:55,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:39:55,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {161#false} assume !false; {161#false} is VALID [2022-04-08 09:39:55,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {161#false} assume 0 == ~cond; {161#false} is VALID [2022-04-08 09:39:55,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {161#false} ~cond := #in~cond; {161#false} is VALID [2022-04-08 09:39:55,436 INFO L272 TraceCheckUtils]: 9: Hoare triple {161#false} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {161#false} is VALID [2022-04-08 09:39:55,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {220#(< main_~i~0 1000000)} assume !(~i~0 < 1000000); {161#false} is VALID [2022-04-08 09:39:55,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {224#(< main_~i~0 999999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {220#(< main_~i~0 1000000)} is VALID [2022-04-08 09:39:55,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {224#(< main_~i~0 999999)} assume !!(~i~0 < 1000000); {224#(< main_~i~0 999999)} is VALID [2022-04-08 09:39:55,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {160#true} havoc ~i~0;~i~0 := 0; {224#(< main_~i~0 999999)} is VALID [2022-04-08 09:39:55,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {160#true} call #t~ret2 := main(); {160#true} is VALID [2022-04-08 09:39:55,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {160#true} {160#true} #51#return; {160#true} is VALID [2022-04-08 09:39:55,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {160#true} assume true; {160#true} is VALID [2022-04-08 09:39:55,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {160#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {160#true} is VALID [2022-04-08 09:39:55,442 INFO L272 TraceCheckUtils]: 0: Hoare triple {160#true} call ULTIMATE.init(); {160#true} is VALID [2022-04-08 09:39:55,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:39:55,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638358769] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:39:55,443 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:39:55,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-08 09:39:55,444 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:39:55,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1310045024] [2022-04-08 09:39:55,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1310045024] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:39:55,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:39:55,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:39:55,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154913027] [2022-04-08 09:39:55,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:39:55,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-08 09:39:55,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:39:55,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:55,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:39:55,457 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 09:39:55,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:39:55,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 09:39:55,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-08 09:39:55,458 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:55,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:55,526 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-08 09:39:55,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 09:39:55,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-08 09:39:55,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:39:55,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:55,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-04-08 09:39:55,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:55,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-04-08 09:39:55,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 22 transitions. [2022-04-08 09:39:55,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:39:55,547 INFO L225 Difference]: With dead ends: 22 [2022-04-08 09:39:55,548 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 09:39:55,549 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-08 09:39:55,550 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:39:55,553 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 23 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:39:55,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 09:39:55,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-08 09:39:55,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:39:55,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:55,560 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:55,560 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:55,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:55,561 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-08 09:39:55,561 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 09:39:55,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:39:55,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:39:55,562 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-08 09:39:55,564 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-08 09:39:55,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:55,566 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-08 09:39:55,568 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 09:39:55,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:39:55,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:39:55,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:39:55,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:39:55,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:55,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-08 09:39:55,570 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2022-04-08 09:39:55,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:39:55,570 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-08 09:39:55,571 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:55,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-08 09:39:55,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:39:55,583 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-08 09:39:55,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 09:39:55,583 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:39:55,583 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:39:55,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 09:39:55,795 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:39:55,795 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:39:55,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:39:55,796 INFO L85 PathProgramCache]: Analyzing trace with hash -471224436, now seen corresponding path program 3 times [2022-04-08 09:39:55,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:39:55,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [620355076] [2022-04-08 09:39:55,803 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:39:55,803 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:39:55,803 INFO L85 PathProgramCache]: Analyzing trace with hash -471224436, now seen corresponding path program 4 times [2022-04-08 09:39:55,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:39:55,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145978096] [2022-04-08 09:39:55,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:39:55,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:39:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:55,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:39:55,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:39:55,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {362#true} is VALID [2022-04-08 09:39:55,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {362#true} assume true; {362#true} is VALID [2022-04-08 09:39:55,884 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {362#true} {362#true} #51#return; {362#true} is VALID [2022-04-08 09:39:55,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {362#true} call ULTIMATE.init(); {372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:39:55,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {362#true} is VALID [2022-04-08 09:39:55,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {362#true} assume true; {362#true} is VALID [2022-04-08 09:39:55,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {362#true} {362#true} #51#return; {362#true} is VALID [2022-04-08 09:39:55,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {362#true} call #t~ret2 := main(); {362#true} is VALID [2022-04-08 09:39:55,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {362#true} havoc ~i~0;~i~0 := 0; {362#true} is VALID [2022-04-08 09:39:55,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {362#true} assume !!(~i~0 < 1000000); {362#true} is VALID [2022-04-08 09:39:55,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {362#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {362#true} is VALID [2022-04-08 09:39:55,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {362#true} assume !!(~i~0 < 1000000); {367#(<= main_~i~0 999999)} is VALID [2022-04-08 09:39:55,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {367#(<= main_~i~0 999999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {368#(<= main_~i~0 1000000)} is VALID [2022-04-08 09:39:55,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {368#(<= main_~i~0 1000000)} assume !(~i~0 < 1000000); {369#(and (<= main_~i~0 1000000) (< 999999 main_~i~0))} is VALID [2022-04-08 09:39:55,889 INFO L272 TraceCheckUtils]: 11: Hoare triple {369#(and (<= main_~i~0 1000000) (< 999999 main_~i~0))} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {370#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:39:55,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {370#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {371#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:39:55,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {371#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {363#false} is VALID [2022-04-08 09:39:55,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {363#false} assume !false; {363#false} is VALID [2022-04-08 09:39:55,890 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 09:39:55,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:39:55,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145978096] [2022-04-08 09:39:55,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145978096] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:39:55,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:39:55,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:39:55,891 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:39:55,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [620355076] [2022-04-08 09:39:55,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [620355076] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:39:55,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:39:55,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:39:55,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090254718] [2022-04-08 09:39:55,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:39:55,892 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 09:39:55,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:39:55,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:55,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:39:55,902 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 09:39:55,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:39:55,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 09:39:55,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-04-08 09:39:55,902 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:56,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:56,003 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-08 09:39:56,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:39:56,004 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 09:39:56,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:39:56,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:56,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2022-04-08 09:39:56,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:56,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2022-04-08 09:39:56,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 14 transitions. [2022-04-08 09:39:56,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:39:56,016 INFO L225 Difference]: With dead ends: 16 [2022-04-08 09:39:56,016 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 09:39:56,016 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-08 09:39:56,017 INFO L913 BasicCegarLoop]: 7 mSDtfsCounter, 9 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:39:56,017 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 29 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:39:56,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 09:39:56,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 09:39:56,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:39:56,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:39:56,018 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:39:56,018 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:39:56,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:56,018 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:39:56,018 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:39:56,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:39:56,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:39:56,019 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 09:39:56,019 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 09:39:56,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:39:56,019 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:39:56,019 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:39:56,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:39:56,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:39:56,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:39:56,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:39:56,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:39:56,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 09:39:56,020 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2022-04-08 09:39:56,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:39:56,020 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 09:39:56,020 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:39:56,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 09:39:56,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:39:56,020 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:39:56,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:39:56,022 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 09:39:56,022 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 09:39:56,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 09:39:56,100 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-08 09:39:56,100 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-08 09:39:56,100 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-08 09:39:56,100 INFO L882 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-08 09:39:56,100 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-08 09:39:56,100 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-08 09:39:56,100 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-08 09:39:56,101 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 24 29) the Hoare annotation is: true [2022-04-08 09:39:56,101 INFO L885 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-04-08 09:39:56,101 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 24 29) the Hoare annotation is: true [2022-04-08 09:39:56,101 INFO L878 garLoopResultBuilder]: At program point L26-2(line 26) the Hoare annotation is: (<= main_~i~0 999999) [2022-04-08 09:39:56,101 INFO L878 garLoopResultBuilder]: At program point L26-3(line 26) the Hoare annotation is: (<= main_~i~0 1000000) [2022-04-08 09:39:56,101 INFO L878 garLoopResultBuilder]: At program point L26-4(line 26) the Hoare annotation is: (and (<= main_~i~0 1000000) (< 999999 main_~i~0)) [2022-04-08 09:39:56,101 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 24 29) the Hoare annotation is: true [2022-04-08 09:39:56,101 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:39:56,101 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 09:39:56,102 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:39:56,102 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:39:56,102 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 09:39:56,102 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 09:39:56,102 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:39:56,102 INFO L885 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: true [2022-04-08 09:39:56,102 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-08 09:39:56,102 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: true [2022-04-08 09:39:56,102 INFO L878 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 09:39:56,102 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 09:39:56,102 INFO L878 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 09:39:56,105 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2] [2022-04-08 09:39:56,105 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 09:39:56,108 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:39:56,108 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:39:56,109 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 09:39:56,112 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-08 09:39:56,112 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 09:39:56,112 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 09:39:56,116 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-08 09:39:56,117 INFO L163 areAnnotationChecker]: CFG has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 09:39:56,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 09:39:56 BoogieIcfgContainer [2022-04-08 09:39:56,122 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 09:39:56,123 INFO L158 Benchmark]: Toolchain (without parser) took 1986.52ms. Allocated memory was 203.4MB in the beginning and 259.0MB in the end (delta: 55.6MB). Free memory was 146.5MB in the beginning and 227.6MB in the end (delta: -81.1MB). Peak memory consumption was 86.5MB. Max. memory is 8.0GB. [2022-04-08 09:39:56,123 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 203.4MB. Free memory is still 162.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 09:39:56,123 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.90ms. Allocated memory was 203.4MB in the beginning and 259.0MB in the end (delta: 55.6MB). Free memory was 146.4MB in the beginning and 229.6MB in the end (delta: -83.2MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. [2022-04-08 09:39:56,124 INFO L158 Benchmark]: Boogie Preprocessor took 22.24ms. Allocated memory is still 259.0MB. Free memory was 229.6MB in the beginning and 228.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 09:39:56,124 INFO L158 Benchmark]: RCFGBuilder took 251.72ms. Allocated memory is still 259.0MB. Free memory was 228.0MB in the beginning and 217.0MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 09:39:56,124 INFO L158 Benchmark]: TraceAbstraction took 1517.07ms. Allocated memory is still 259.0MB. Free memory was 216.5MB in the beginning and 227.6MB in the end (delta: -11.1MB). Peak memory consumption was 101.1MB. Max. memory is 8.0GB. [2022-04-08 09:39:56,125 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 203.4MB. Free memory is still 162.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 191.90ms. Allocated memory was 203.4MB in the beginning and 259.0MB in the end (delta: 55.6MB). Free memory was 146.4MB in the beginning and 229.6MB in the end (delta: -83.2MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.24ms. Allocated memory is still 259.0MB. Free memory was 229.6MB in the beginning and 228.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 251.72ms. Allocated memory is still 259.0MB. Free memory was 228.0MB in the beginning and 217.0MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1517.07ms. Allocated memory is still 259.0MB. Free memory was 216.5MB in the beginning and 227.6MB in the end (delta: -11.1MB). Peak memory consumption was 101.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 58 IncrementalHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 35 mSDtfsCounter, 58 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 32 PreInvPairs, 45 NumberOfFragments, 47 HoareAnnotationTreeSize, 32 FomulaSimplifications, 9 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 16 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: i <= 1000000 - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-08 09:39:56,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...