/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-lit/cggmp2005.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:12:00,317 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:12:00,319 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:12:00,355 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:12:00,359 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:12:00,360 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:12:00,366 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:12:00,368 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:12:00,370 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:12:00,374 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:12:00,375 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:12:00,376 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:12:00,377 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:12:00,379 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:12:00,379 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:12:00,380 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:12:00,381 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:12:00,382 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:12:00,385 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:12:00,390 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:12:00,392 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:12:00,392 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:12:00,393 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:12:00,394 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:12:00,395 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:12:00,398 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:12:00,398 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:12:00,398 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:12:00,399 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:12:00,399 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:12:00,400 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:12:00,400 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:12:00,402 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:12:00,402 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:12:00,403 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:12:00,403 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:12:00,404 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:12:00,404 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:12:00,404 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:12:00,404 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:12:00,405 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:12:00,406 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:12:00,407 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:12:00,420 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:12:00,420 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:12:00,421 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:12:00,422 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:12:00,422 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:12:00,422 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:12:00,422 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:12:00,422 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:12:00,422 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:12:00,423 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:12:00,423 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:12:00,423 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:12:00,423 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:12:00,424 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:12:00,424 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:12:00,424 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:12:00,424 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:12:00,424 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:12:00,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:12:00,424 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:12:00,425 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:12:00,425 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:12:00,425 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:12:00,425 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:12:00,425 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:12:00,425 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-28 03:12:00,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:12:00,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:12:00,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:12:00,665 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:12:00,665 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:12:00,666 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/cggmp2005.i [2022-04-28 03:12:00,731 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cbdebe0f/b6150e967c9e4f909b33759f52f7955f/FLAG382e65a8a [2022-04-28 03:12:01,110 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:12:01,110 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005.i [2022-04-28 03:12:01,119 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cbdebe0f/b6150e967c9e4f909b33759f52f7955f/FLAG382e65a8a [2022-04-28 03:12:01,509 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cbdebe0f/b6150e967c9e4f909b33759f52f7955f [2022-04-28 03:12:01,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:12:01,513 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:12:01,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:12:01,515 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:12:01,519 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:12:01,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:12:01" (1/1) ... [2022-04-28 03:12:01,520 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c730297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:01, skipping insertion in model container [2022-04-28 03:12:01,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:12:01" (1/1) ... [2022-04-28 03:12:01,526 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:12:01,539 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:12:01,678 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-lit/cggmp2005.i[895,908] [2022-04-28 03:12:01,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:12:01,698 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:12:01,708 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-lit/cggmp2005.i[895,908] [2022-04-28 03:12:01,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:12:01,724 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:12:01,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:01 WrapperNode [2022-04-28 03:12:01,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:12:01,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:12:01,725 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:12:01,725 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:12:01,733 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:01" (1/1) ... [2022-04-28 03:12:01,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:01" (1/1) ... [2022-04-28 03:12:01,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:01" (1/1) ... [2022-04-28 03:12:01,740 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:01" (1/1) ... [2022-04-28 03:12:01,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:01" (1/1) ... [2022-04-28 03:12:01,749 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:01" (1/1) ... [2022-04-28 03:12:01,750 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:01" (1/1) ... [2022-04-28 03:12:01,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:12:01,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:12:01,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:12:01,752 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:12:01,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:01" (1/1) ... [2022-04-28 03:12:01,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:12:01,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:12:01,788 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-28 03:12:01,815 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-28 03:12:01,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:12:01,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:12:01,836 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:12:01,836 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 03:12:01,837 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:12:01,837 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:12:01,837 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:12:01,842 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:12:01,843 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 03:12:01,843 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 03:12:01,843 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:12:01,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:12:01,846 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 03:12:01,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:12:01,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 03:12:01,847 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:12:01,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:12:01,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:12:01,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:12:01,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:12:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:12:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:12:01,905 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:12:01,906 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:12:02,059 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:12:02,064 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:12:02,064 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 03:12:02,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:12:02 BoogieIcfgContainer [2022-04-28 03:12:02,065 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:12:02,067 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:12:02,067 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:12:02,082 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:12:02,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:12:01" (1/3) ... [2022-04-28 03:12:02,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a5d6b3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:12:02, skipping insertion in model container [2022-04-28 03:12:02,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:12:01" (2/3) ... [2022-04-28 03:12:02,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a5d6b3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:12:02, skipping insertion in model container [2022-04-28 03:12:02,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:12:02" (3/3) ... [2022-04-28 03:12:02,084 INFO L111 eAbstractionObserver]: Analyzing ICFG cggmp2005.i [2022-04-28 03:12:02,095 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:12:02,095 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:12:02,130 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:12:02,136 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@498d931d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1c6e0a3c [2022-04-28 03:12:02,136 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:12:02,143 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 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-28 03:12:02,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 03:12:02,148 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:12:02,149 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:12:02,149 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:12:02,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:12:02,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1817730928, now seen corresponding path program 1 times [2022-04-28 03:12:02,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:02,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [8375783] [2022-04-28 03:12:02,171 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:12:02,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1817730928, now seen corresponding path program 2 times [2022-04-28 03:12:02,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:02,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386694554] [2022-04-28 03:12:02,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:02,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:02,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:12:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:02,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(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); {22#true} is VALID [2022-04-28 03:12:02,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-28 03:12:02,434 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #50#return; {22#true} is VALID [2022-04-28 03:12:02,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:12:02,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(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); {22#true} is VALID [2022-04-28 03:12:02,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-28 03:12:02,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #50#return; {22#true} is VALID [2022-04-28 03:12:02,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret1 := main(); {22#true} is VALID [2022-04-28 03:12:02,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {27#(and (<= 10 main_~j~0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 03:12:02,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#(and (<= 10 main_~j~0) (= (+ (- 1) main_~i~0) 0))} assume !(~j~0 >= ~i~0); {23#false} is VALID [2022-04-28 03:12:02,440 INFO L272 TraceCheckUtils]: 7: Hoare triple {23#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {23#false} is VALID [2022-04-28 03:12:02,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2022-04-28 03:12:02,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2022-04-28 03:12:02,441 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-04-28 03:12:02,441 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-28 03:12:02,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:12:02,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386694554] [2022-04-28 03:12:02,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386694554] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:02,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:02,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:12:02,446 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:12:02,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [8375783] [2022-04-28 03:12:02,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [8375783] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:02,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:02,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:12:02,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609793415] [2022-04-28 03:12:02,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:12:02,453 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-28 03:12:02,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:12:02,457 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-28 03:12:02,474 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-28 03:12:02,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 03:12:02,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:02,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 03:12:02,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 03:12:02,500 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 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-28 03:12:02,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:02,651 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-28 03:12:02,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 03:12:02,651 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-28 03:12:02,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:12:02,653 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-28 03:12:02,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-28 03:12:02,665 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-28 03:12:02,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-28 03:12:02,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-04-28 03:12:02,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:12:02,734 INFO L225 Difference]: With dead ends: 32 [2022-04-28 03:12:02,734 INFO L226 Difference]: Without dead ends: 13 [2022-04-28 03:12:02,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-28 03:12:02,740 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:12:02,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 26 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:12:02,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-28 03:12:02,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-28 03:12:02,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:12:02,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-28 03:12:02,772 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-28 03:12:02,773 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-28 03:12:02,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:02,779 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-28 03:12:02,779 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 03:12:02,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:02,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:02,780 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 13 states. [2022-04-28 03:12:02,781 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 13 states. [2022-04-28 03:12:02,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:02,784 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-28 03:12:02,784 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 03:12:02,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:02,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:02,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:12:02,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:12:02,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-28 03:12:02,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-28 03:12:02,788 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-28 03:12:02,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:12:02,789 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-28 03:12:02,792 INFO L496 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-28 03:12:02,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-28 03:12:02,813 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-28 03:12:02,814 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 03:12:02,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 03:12:02,814 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:12:02,815 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:12:02,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:12:02,815 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:12:02,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:12:02,817 INFO L85 PathProgramCache]: Analyzing trace with hash -480588846, now seen corresponding path program 1 times [2022-04-28 03:12:02,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:02,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1540715298] [2022-04-28 03:12:03,181 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:12:03,183 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:12:03,187 INFO L85 PathProgramCache]: Analyzing trace with hash 406914835, now seen corresponding path program 1 times [2022-04-28 03:12:03,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:03,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899989672] [2022-04-28 03:12:03,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:03,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:03,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:12:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:03,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {159#(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); {149#true} is VALID [2022-04-28 03:12:03,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {149#true} assume true; {149#true} is VALID [2022-04-28 03:12:03,391 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {149#true} {149#true} #50#return; {149#true} is VALID [2022-04-28 03:12:03,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {149#true} call ULTIMATE.init(); {159#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:12:03,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#(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); {149#true} is VALID [2022-04-28 03:12:03,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {149#true} assume true; {149#true} is VALID [2022-04-28 03:12:03,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149#true} {149#true} #50#return; {149#true} is VALID [2022-04-28 03:12:03,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {149#true} call #t~ret1 := main(); {149#true} is VALID [2022-04-28 03:12:03,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {149#true} havoc ~i~0;havoc ~j~0;~i~0 := 1;~j~0 := 10; {154#(and (<= main_~j~0 10) (<= 10 main_~j~0) (= main_~i~0 1))} is VALID [2022-04-28 03:12:03,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {154#(and (<= main_~j~0 10) (<= 10 main_~j~0) (= main_~i~0 1))} [54] L28-2-->L28-3_primed: Formula: (let ((.cse0 (= v_main_~i~0_8 v_main_~i~0_7)) (.cse1 (= v_main_~j~0_10 v_main_~j~0_9))) (or (and .cse0 .cse1) (and (< v_main_~j~0_9 v_main_~j~0_10) (<= v_main_~j~0_10 (+ v_main_~j~0_9 (div (+ v_main_~j~0_10 (* (- 1) v_main_~i~0_8)) 3) 1)) (= (+ v_main_~i~0_8 (* v_main_~j~0_10 2)) (+ v_main_~i~0_7 (* v_main_~j~0_9 2)))) (and .cse0 (< v_main_~j~0_10 v_main_~i~0_8) .cse1))) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_10} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_9} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {155#(or (and (< 5 main_~j~0) (or (<= main_~j~0 6) (<= (+ (* main_~j~0 2) main_~i~0) 21))) (and (<= 10 main_~j~0) (= main_~i~0 1)))} is VALID [2022-04-28 03:12:03,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {155#(or (and (< 5 main_~j~0) (or (<= main_~j~0 6) (<= (+ (* main_~j~0 2) main_~i~0) 21))) (and (<= 10 main_~j~0) (= main_~i~0 1)))} [53] L28-3_primed-->L28-3: Formula: (not (<= v_main_~i~0_1 v_main_~j~0_1)) InVars {main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_1} OutVars{main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {156#(and (<= main_~j~0 6) (< 5 main_~j~0))} is VALID [2022-04-28 03:12:03,403 INFO L272 TraceCheckUtils]: 8: Hoare triple {156#(and (<= main_~j~0 6) (< 5 main_~j~0))} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {157#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:12:03,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {157#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {158#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:12:03,407 INFO L290 TraceCheckUtils]: 10: Hoare triple {158#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {150#false} is VALID [2022-04-28 03:12:03,407 INFO L290 TraceCheckUtils]: 11: Hoare triple {150#false} assume !false; {150#false} is VALID [2022-04-28 03:12:03,407 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-28 03:12:03,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:12:03,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899989672] [2022-04-28 03:12:03,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899989672] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:03,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:03,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:12:03,593 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:12:03,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1540715298] [2022-04-28 03:12:03,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1540715298] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:03,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:03,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:12:03,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939283653] [2022-04-28 03:12:03,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:12:03,597 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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 12 [2022-04-28 03:12:03,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:12:03,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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-28 03:12:03,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:12:03,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:12:03,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:03,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:12:03,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:12:03,614 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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-28 03:12:03,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:03,707 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-28 03:12:03,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:12:03,708 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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 12 [2022-04-28 03:12:03,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:12:03,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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-28 03:12:03,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2022-04-28 03:12:03,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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-28 03:12:03,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2022-04-28 03:12:03,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 13 transitions. [2022-04-28 03:12:03,736 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-28 03:12:03,737 INFO L225 Difference]: With dead ends: 13 [2022-04-28 03:12:03,737 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 03:12:03,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-28 03:12:03,739 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:12:03,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 34 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 8 Unchecked, 0.0s Time] [2022-04-28 03:12:03,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 03:12:03,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 03:12:03,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:12:03,741 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-28 03:12:03,741 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-28 03:12:03,742 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-28 03:12:03,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:03,742 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 03:12:03,742 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:12:03,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:03,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:03,742 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-28 03:12:03,742 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-28 03:12:03,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:03,743 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 03:12:03,743 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:12:03,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:03,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:03,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:12:03,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:12:03,743 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-28 03:12:03,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 03:12:03,744 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2022-04-28 03:12:03,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:12:03,744 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 03:12:03,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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-28 03:12:03,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 03:12:03,744 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-28 03:12:03,745 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:12:03,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:03,747 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 03:12:03,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:12:03,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 03:12:03,833 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-28 03:12:03,833 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-28 03:12:03,834 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-28 03:12:03,834 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-28 03:12:03,834 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-28 03:12:03,834 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-28 03:12:03,835 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-28 03:12:03,835 INFO L902 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: true [2022-04-28 03:12:03,835 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 34) the Hoare annotation is: true [2022-04-28 03:12:03,835 INFO L895 garLoopResultBuilder]: At program point L28-2(lines 28 31) the Hoare annotation is: (exists ((v_main_~j~0_14 Int)) (and (or (and (= main_~i~0 1) (= v_main_~j~0_14 main_~j~0)) (and (< main_~j~0 v_main_~j~0_14) (<= v_main_~j~0_14 (+ main_~j~0 (div (+ v_main_~j~0_14 (- 1)) 3) 1)) (= (+ (* v_main_~j~0_14 2) 1) (+ (* main_~j~0 2) main_~i~0)))) (<= v_main_~j~0_14 10) (<= 10 v_main_~j~0_14))) [2022-04-28 03:12:03,836 INFO L895 garLoopResultBuilder]: At program point L28-3(lines 28 31) the Hoare annotation is: (and (<= main_~j~0 6) (< 5 main_~j~0)) [2022-04-28 03:12:03,836 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 24 34) the Hoare annotation is: true [2022-04-28 03:12:03,836 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 24 34) the Hoare annotation is: true [2022-04-28 03:12:03,836 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 03:12:03,836 INFO L895 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-28 03:12:03,836 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 03:12:03,836 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 03:12:03,837 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 03:12:03,840 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 03:12:03,840 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 03:12:03,841 INFO L902 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: true [2022-04-28 03:12:03,841 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-28 03:12:03,842 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: true [2022-04-28 03:12:03,842 INFO L895 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 03:12:03,842 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 03:12:03,842 INFO L895 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-28 03:12:03,845 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-28 03:12:03,846 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 03:12:03,849 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 03:12:03,849 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 03:12:03,850 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 03:12:03,852 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-28 03:12:03,852 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 03:12:03,852 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 03:12:03,860 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-28 03:12:03,860 INFO L163 areAnnotationChecker]: CFG has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 03:12:03,866 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-28 03:12:03,867 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-28 03:12:03,867 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-28 03:12:03,867 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-28 03:12:03,867 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-28 03:12:03,868 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-28 03:12:03,868 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-28 03:12:03,870 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-28 03:12:03,871 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-28 03:12:03,871 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-28 03:12:03,871 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-28 03:12:03,871 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-28 03:12:03,871 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-28 03:12:03,871 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-28 03:12:03,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 03:12:03 BoogieIcfgContainer [2022-04-28 03:12:03,875 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 03:12:03,877 INFO L158 Benchmark]: Toolchain (without parser) took 2362.99ms. Allocated memory was 194.0MB in the beginning and 232.8MB in the end (delta: 38.8MB). Free memory was 145.4MB in the beginning and 149.5MB in the end (delta: -4.1MB). Peak memory consumption was 34.3MB. Max. memory is 8.0GB. [2022-04-28 03:12:03,878 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 194.0MB. Free memory was 161.3MB in the beginning and 161.2MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 03:12:03,878 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.26ms. Allocated memory is still 194.0MB. Free memory was 145.1MB in the beginning and 169.8MB in the end (delta: -24.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 03:12:03,878 INFO L158 Benchmark]: Boogie Preprocessor took 26.63ms. Allocated memory is still 194.0MB. Free memory was 169.8MB in the beginning and 168.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 03:12:03,879 INFO L158 Benchmark]: RCFGBuilder took 313.16ms. Allocated memory is still 194.0MB. Free memory was 168.0MB in the beginning and 158.2MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-28 03:12:03,879 INFO L158 Benchmark]: TraceAbstraction took 1808.12ms. Allocated memory was 194.0MB in the beginning and 232.8MB in the end (delta: 38.8MB). Free memory was 157.6MB in the beginning and 149.5MB in the end (delta: 8.1MB). Peak memory consumption was 47.2MB. Max. memory is 8.0GB. [2022-04-28 03:12:03,880 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 194.0MB. Free memory was 161.3MB in the beginning and 161.2MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 209.26ms. Allocated memory is still 194.0MB. Free memory was 145.1MB in the beginning and 169.8MB in the end (delta: -24.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.63ms. Allocated memory is still 194.0MB. Free memory was 169.8MB in the beginning and 168.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 313.16ms. Allocated memory is still 194.0MB. Free memory was 168.0MB in the beginning and 158.2MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 1808.12ms. Allocated memory was 194.0MB in the beginning and 232.8MB in the end (delta: 38.8MB). Free memory was 157.6MB in the beginning and 149.5MB in the end (delta: 8.1MB). Peak memory consumption was 47.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] * 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, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 8 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24 IncrementalHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 24 mSDtfsCounter, 24 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, InterpolantAutomatonStates: 12, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 25 PreInvPairs, 34 NumberOfFragments, 82 HoareAnnotationTreeSize, 25 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 19 FomulaSimplificationsInter, 68 FormulaSimplificationTreeSizeReductionInter, 0.1s 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: 28]: Loop Invariant [2022-04-28 03:12:03,888 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-28 03:12:03,888 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-28 03:12:03,888 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-28 03:12:03,888 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-28 03:12:03,888 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-28 03:12:03,889 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-28 03:12:03,889 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-28 03:12:03,889 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-28 03:12:03,889 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-28 03:12:03,889 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-28 03:12:03,889 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-28 03:12:03,889 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-28 03:12:03,889 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] [2022-04-28 03:12:03,889 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_14,QUANTIFIED] Derived loop invariant: (\exists v_main_~j~0_14 : int :: (((i == 1 && v_main_~j~0_14 == j) || ((j < v_main_~j~0_14 && v_main_~j~0_14 <= j + (v_main_~j~0_14 + -1) / 3 + 1) && v_main_~j~0_14 * 2 + 1 == j * 2 + i)) && v_main_~j~0_14 <= 10) && 10 <= v_main_~j~0_14) - 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-28 03:12:03,922 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...