/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-invgen/seq-3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:31:17,962 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:31:17,965 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:31:18,006 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:31:18,007 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:31:18,008 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:31:18,013 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:31:18,016 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:31:18,018 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:31:18,022 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:31:18,023 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:31:18,024 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:31:18,025 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:31:18,027 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:31:18,028 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:31:18,031 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:31:18,032 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:31:18,033 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:31:18,035 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:31:18,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:31:18,043 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:31:18,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:31:18,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:31:18,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:31:18,047 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:31:18,053 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:31:18,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:31:18,053 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:31:18,054 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:31:18,055 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:31:18,056 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:31:18,057 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:31:18,058 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:31:18,059 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:31:18,059 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:31:18,060 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:31:18,060 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:31:18,061 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:31:18,061 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:31:18,061 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:31:18,061 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:31:18,063 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:31:18,064 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:31:18,074 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:31:18,075 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:31:18,077 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:31:18,078 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:31:18,078 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:31:18,078 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:31:18,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:31:18,078 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:31:18,078 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:31:18,079 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:31:18,079 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:31:18,080 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:31:18,080 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:31:18,080 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:31:18,080 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:31:18,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:31:18,080 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:31:18,080 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:31:18,080 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:31:18,080 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:31:18,080 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:31:18,081 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:31:18,081 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-15 12:31:18,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:31:18,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:31:18,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:31:18,425 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:31:18,426 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:31:18,428 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/seq-3.i [2022-04-15 12:31:18,485 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f1d0e600/e39b1f1c5a9b425ab27517eb39debe9c/FLAGcc1d3a769 [2022-04-15 12:31:18,786 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:31:18,787 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/seq-3.i [2022-04-15 12:31:18,790 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f1d0e600/e39b1f1c5a9b425ab27517eb39debe9c/FLAGcc1d3a769 [2022-04-15 12:31:19,229 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f1d0e600/e39b1f1c5a9b425ab27517eb39debe9c [2022-04-15 12:31:19,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:31:19,233 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:31:19,244 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:31:19,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:31:19,248 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:31:19,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:31:19" (1/1) ... [2022-04-15 12:31:19,250 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f294324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:19, skipping insertion in model container [2022-04-15 12:31:19,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:31:19" (1/1) ... [2022-04-15 12:31:19,255 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:31:19,266 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:31:19,404 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-invgen/seq-3.i[893,906] [2022-04-15 12:31:19,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:31:19,426 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:31:19,436 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-invgen/seq-3.i[893,906] [2022-04-15 12:31:19,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:31:19,449 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:31:19,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:19 WrapperNode [2022-04-15 12:31:19,450 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:31:19,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:31:19,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:31:19,451 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:31:19,459 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:19" (1/1) ... [2022-04-15 12:31:19,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:19" (1/1) ... [2022-04-15 12:31:19,464 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:19" (1/1) ... [2022-04-15 12:31:19,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:19" (1/1) ... [2022-04-15 12:31:19,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:19" (1/1) ... [2022-04-15 12:31:19,473 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:19" (1/1) ... [2022-04-15 12:31:19,474 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:19" (1/1) ... [2022-04-15 12:31:19,476 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:31:19,477 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:31:19,477 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:31:19,477 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:31:19,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:19" (1/1) ... [2022-04-15 12:31:19,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:31:19,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:31:19,505 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-15 12:31:19,511 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-15 12:31:19,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:31:19,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:31:19,546 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:31:19,547 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 12:31:19,547 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:31:19,547 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:31:19,548 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:31:19,548 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:31:19,548 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 12:31:19,548 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 12:31:19,548 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:31:19,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:31:19,549 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 12:31:19,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:31:19,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 12:31:19,551 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:31:19,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:31:19,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:31:19,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:31:19,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:31:19,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:31:19,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:31:19,602 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:31:19,603 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:31:19,760 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:31:19,765 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:31:19,765 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-15 12:31:19,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:31:19 BoogieIcfgContainer [2022-04-15 12:31:19,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:31:19,768 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:31:19,768 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:31:19,770 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:31:19,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:31:19" (1/3) ... [2022-04-15 12:31:19,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cde6c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:31:19, skipping insertion in model container [2022-04-15 12:31:19,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:31:19" (2/3) ... [2022-04-15 12:31:19,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cde6c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:31:19, skipping insertion in model container [2022-04-15 12:31:19,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:31:19" (3/3) ... [2022-04-15 12:31:19,772 INFO L111 eAbstractionObserver]: Analyzing ICFG seq-3.i [2022-04-15 12:31:19,776 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:31:19,776 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:31:19,846 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:31:19,851 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-15 12:31:19,851 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:31:19,881 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 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-15 12:31:19,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:31:19,886 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:31:19,886 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:31:19,887 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:31:19,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:31:19,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1545358454, now seen corresponding path program 1 times [2022-04-15 12:31:19,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:31:19,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1754388259] [2022-04-15 12:31:19,925 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:31:19,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1545358454, now seen corresponding path program 2 times [2022-04-15 12:31:19,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:31:19,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200562442] [2022-04-15 12:31:19,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:31:19,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:31:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:20,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:31:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:20,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(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); {28#true} is VALID [2022-04-15 12:31:20,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-15 12:31:20,118 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #84#return; {28#true} is VALID [2022-04-15 12:31:20,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:31:20,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(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); {28#true} is VALID [2022-04-15 12:31:20,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-15 12:31:20,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #84#return; {28#true} is VALID [2022-04-15 12:31:20,122 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret9 := main(); {28#true} is VALID [2022-04-15 12:31:20,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {28#true} is VALID [2022-04-15 12:31:20,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {28#true} is VALID [2022-04-15 12:31:20,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#true} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {28#true} is VALID [2022-04-15 12:31:20,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#true} assume !true; {29#false} is VALID [2022-04-15 12:31:20,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#false} ~i1~0 := 0; {29#false} is VALID [2022-04-15 12:31:20,124 INFO L290 TraceCheckUtils]: 10: Hoare triple {29#false} assume !(~i1~0 < ~n1~0); {29#false} is VALID [2022-04-15 12:31:20,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} ~j1~0 := 0; {29#false} is VALID [2022-04-15 12:31:20,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#false} assume !!(~j1~0 < ~n0~0 + ~n1~0); {29#false} is VALID [2022-04-15 12:31:20,125 INFO L272 TraceCheckUtils]: 13: Hoare triple {29#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {29#false} is VALID [2022-04-15 12:31:20,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-04-15 12:31:20,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-04-15 12:31:20,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-15 12:31:20,126 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-15 12:31:20,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:31:20,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200562442] [2022-04-15 12:31:20,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200562442] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:31:20,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:31:20,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:31:20,132 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:31:20,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1754388259] [2022-04-15 12:31:20,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1754388259] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:31:20,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:31:20,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:31:20,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321246225] [2022-04-15 12:31:20,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:31:20,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 17 [2022-04-15 12:31:20,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:31:20,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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-15 12:31:20,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:20,168 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:31:20,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:31:20,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:31:20,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:31:20,209 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 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 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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-15 12:31:20,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:20,305 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2022-04-15 12:31:20,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:31:20,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 17 [2022-04-15 12:31:20,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:31:20,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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-15 12:31:20,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-04-15 12:31:20,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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-15 12:31:20,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-04-15 12:31:20,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2022-04-15 12:31:20,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:20,378 INFO L225 Difference]: With dead ends: 41 [2022-04-15 12:31:20,379 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 12:31:20,381 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:31:20,384 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:31:20,385 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 31 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:31:20,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 12:31:20,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-15 12:31:20,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:31:20,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:31:20,420 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:31:20,420 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:31:20,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:20,422 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 12:31:20,422 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 12:31:20,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:31:20,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:31:20,423 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 21 states. [2022-04-15 12:31:20,423 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 21 states. [2022-04-15 12:31:20,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:20,441 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 12:31:20,442 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 12:31:20,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:31:20,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:31:20,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:31:20,442 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:31:20,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:31:20,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-15 12:31:20,445 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 17 [2022-04-15 12:31:20,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:31:20,445 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-15 12:31:20,446 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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-15 12:31:20,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 23 transitions. [2022-04-15 12:31:20,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:20,465 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 12:31:20,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:31:20,466 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:31:20,466 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:31:20,466 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:31:20,466 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:31:20,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:31:20,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1389492102, now seen corresponding path program 1 times [2022-04-15 12:31:20,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:31:20,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [531386661] [2022-04-15 12:31:20,467 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:31:20,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1389492102, now seen corresponding path program 2 times [2022-04-15 12:31:20,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:31:20,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684524949] [2022-04-15 12:31:20,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:31:20,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:31:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:20,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:31:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:20,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {212#(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); {202#true} is VALID [2022-04-15 12:31:20,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {202#true} assume true; {202#true} is VALID [2022-04-15 12:31:20,645 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {202#true} {202#true} #84#return; {202#true} is VALID [2022-04-15 12:31:20,646 INFO L272 TraceCheckUtils]: 0: Hoare triple {202#true} call ULTIMATE.init(); {212#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:31:20,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#(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); {202#true} is VALID [2022-04-15 12:31:20,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {202#true} assume true; {202#true} is VALID [2022-04-15 12:31:20,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {202#true} {202#true} #84#return; {202#true} is VALID [2022-04-15 12:31:20,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {202#true} call #t~ret9 := main(); {202#true} is VALID [2022-04-15 12:31:20,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {202#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {207#(= main_~i0~0 0)} is VALID [2022-04-15 12:31:20,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {207#(= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {207#(= main_~i0~0 0)} is VALID [2022-04-15 12:31:20,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {207#(= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {207#(= main_~i0~0 0)} is VALID [2022-04-15 12:31:20,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {207#(= main_~i0~0 0)} assume !(~i0~0 < ~n0~0); {208#(<= main_~n0~0 0)} is VALID [2022-04-15 12:31:20,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {208#(<= main_~n0~0 0)} ~i1~0 := 0; {209#(and (<= main_~n0~0 0) (= main_~i1~0 0))} is VALID [2022-04-15 12:31:20,651 INFO L290 TraceCheckUtils]: 10: Hoare triple {209#(and (<= main_~n0~0 0) (= main_~i1~0 0))} assume !(~i1~0 < ~n1~0); {210#(<= (+ main_~n1~0 main_~n0~0) 0)} is VALID [2022-04-15 12:31:20,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {210#(<= (+ main_~n1~0 main_~n0~0) 0)} ~j1~0 := 0; {211#(and (= main_~j1~0 0) (<= (+ main_~n1~0 main_~n0~0) 0))} is VALID [2022-04-15 12:31:20,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {211#(and (= main_~j1~0 0) (<= (+ main_~n1~0 main_~n0~0) 0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {203#false} is VALID [2022-04-15 12:31:20,652 INFO L272 TraceCheckUtils]: 13: Hoare triple {203#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {203#false} is VALID [2022-04-15 12:31:20,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {203#false} ~cond := #in~cond; {203#false} is VALID [2022-04-15 12:31:20,652 INFO L290 TraceCheckUtils]: 15: Hoare triple {203#false} assume 0 == ~cond; {203#false} is VALID [2022-04-15 12:31:20,652 INFO L290 TraceCheckUtils]: 16: Hoare triple {203#false} assume !false; {203#false} is VALID [2022-04-15 12:31:20,653 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-15 12:31:20,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:31:20,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684524949] [2022-04-15 12:31:20,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684524949] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:31:20,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:31:20,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:31:20,654 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:31:20,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [531386661] [2022-04-15 12:31:20,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [531386661] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:31:20,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:31:20,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:31:20,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40999453] [2022-04-15 12:31:20,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:31:20,656 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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 17 [2022-04-15 12:31:20,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:31:20,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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-15 12:31:20,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:20,674 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:31:20,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:31:20,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:31:20,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:31:20,676 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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-15 12:31:20,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:20,945 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-04-15 12:31:20,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:31:20,946 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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 17 [2022-04-15 12:31:20,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:31:20,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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-15 12:31:20,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-15 12:31:20,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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-15 12:31:20,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-15 12:31:20,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-04-15 12:31:20,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:20,987 INFO L225 Difference]: With dead ends: 40 [2022-04-15 12:31:20,987 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 12:31:20,987 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:31:20,988 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 40 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:31:20,989 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 42 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:31:20,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 12:31:20,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2022-04-15 12:31:20,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:31:20,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:31:20,998 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:31:20,998 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:31:21,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:21,000 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-04-15 12:31:21,001 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-04-15 12:31:21,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:31:21,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:31:21,001 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 29 states. [2022-04-15 12:31:21,002 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 29 states. [2022-04-15 12:31:21,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:31:21,003 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-04-15 12:31:21,004 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-04-15 12:31:21,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:31:21,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:31:21,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:31:21,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:31:21,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:31:21,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-15 12:31:21,006 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2022-04-15 12:31:21,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:31:21,006 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-15 12:31:21,006 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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-15 12:31:21,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-15 12:31:21,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:31:21,029 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-15 12:31:21,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 12:31:21,029 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:31:21,029 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:31:21,029 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:31:21,030 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:31:21,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:31:21,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1362943620, now seen corresponding path program 1 times [2022-04-15 12:31:21,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:31:21,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [211538103] [2022-04-15 12:31:21,202 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:31:21,204 INFO L85 PathProgramCache]: Analyzing trace with hash -997567355, now seen corresponding path program 1 times [2022-04-15 12:31:21,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:31:21,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357136667] [2022-04-15 12:31:21,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:31:21,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:31:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:21,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:31:21,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:31:21,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {422#(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); {411#true} is VALID [2022-04-15 12:31:21,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {411#true} assume true; {411#true} is VALID [2022-04-15 12:31:21,302 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {411#true} {411#true} #84#return; {411#true} is VALID [2022-04-15 12:31:21,303 INFO L272 TraceCheckUtils]: 0: Hoare triple {411#true} call ULTIMATE.init(); {422#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:31:21,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {422#(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); {411#true} is VALID [2022-04-15 12:31:21,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {411#true} assume true; {411#true} is VALID [2022-04-15 12:31:21,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {411#true} {411#true} #84#return; {411#true} is VALID [2022-04-15 12:31:21,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {411#true} call #t~ret9 := main(); {411#true} is VALID [2022-04-15 12:31:21,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {411#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {416#(= main_~i0~0 0)} is VALID [2022-04-15 12:31:21,304 INFO L290 TraceCheckUtils]: 6: Hoare triple {416#(= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {416#(= main_~i0~0 0)} is VALID [2022-04-15 12:31:21,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {416#(= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {416#(= main_~i0~0 0)} is VALID [2022-04-15 12:31:21,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {416#(= main_~i0~0 0)} [88] L32-2-->L32-3_primed: Formula: (or (and (= v_main_~k~0_Out_2 v_main_~k~0_In_1) (< v_main_~i0~0_Out_2 (+ v_main_~n0~0_In_1 1)) (= v_main_~n0~0_In_1 0) (= v_main_~i0~0_Out_2 v_main_~i0~0_In_1) (= |v_main_#t~post3_Out_2| 0) (= v_main_~i0~0_Out_2 0)) (and (= v_main_~n0~0_In_1 v_main_~n0~0_In_1) (= v_main_~k~0_In_1 v_main_~k~0_Out_2) (= v_main_~i0~0_In_1 v_main_~i0~0_Out_2))) InVars {main_~i0~0=v_main_~i0~0_In_1, main_~n0~0=v_main_~n0~0_In_1, main_~k~0=v_main_~k~0_In_1} OutVars{main_#t~post4=|v_main_#t~post4_Out_2|, main_~i0~0=v_main_~i0~0_Out_2, main_#t~post3=|v_main_#t~post3_Out_2|, main_~n0~0=v_main_~n0~0_In_1, main_~k~0=v_main_~k~0_Out_2} AuxVars[] AssignedVars[main_~k~0, main_#t~post4, main_~i0~0, main_#t~post3] {417#(or (= main_~i0~0 0) (<= main_~n0~0 0))} is VALID [2022-04-15 12:31:21,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {417#(or (= main_~i0~0 0) (<= main_~n0~0 0))} [87] L32-3_primed-->L32-3: Formula: (not (< v_main_~i0~0_4 v_main_~n0~0_9)) InVars {main_~i0~0=v_main_~i0~0_4, main_~n0~0=v_main_~n0~0_9} OutVars{main_~i0~0=v_main_~i0~0_4, main_~n0~0=v_main_~n0~0_9} AuxVars[] AssignedVars[] {418#(<= main_~n0~0 0)} is VALID [2022-04-15 12:31:21,307 INFO L290 TraceCheckUtils]: 10: Hoare triple {418#(<= main_~n0~0 0)} ~i1~0 := 0; {419#(and (<= main_~n0~0 0) (= main_~i1~0 0))} is VALID [2022-04-15 12:31:21,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {419#(and (<= main_~n0~0 0) (= main_~i1~0 0))} assume !(~i1~0 < ~n1~0); {420#(<= (+ main_~n1~0 main_~n0~0) 0)} is VALID [2022-04-15 12:31:21,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {420#(<= (+ main_~n1~0 main_~n0~0) 0)} ~j1~0 := 0; {421#(and (= main_~j1~0 0) (<= (+ main_~n1~0 main_~n0~0) 0))} is VALID [2022-04-15 12:31:21,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {421#(and (= main_~j1~0 0) (<= (+ main_~n1~0 main_~n0~0) 0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {412#false} is VALID [2022-04-15 12:31:21,308 INFO L272 TraceCheckUtils]: 14: Hoare triple {412#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {412#false} is VALID [2022-04-15 12:31:21,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {412#false} ~cond := #in~cond; {412#false} is VALID [2022-04-15 12:31:21,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {412#false} assume 0 == ~cond; {412#false} is VALID [2022-04-15 12:31:21,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {412#false} assume !false; {412#false} is VALID [2022-04-15 12:31:21,309 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-15 12:31:21,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:31:21,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357136667] [2022-04-15 12:31:21,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357136667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:31:21,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:31:21,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:31:21,337 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:31:21,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [211538103] [2022-04-15 12:31:21,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [211538103] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:31:21,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:31:21,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:31:21,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139792177] [2022-04-15 12:31:21,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:31:21,338 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 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 18 [2022-04-15 12:31:21,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:31:21,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 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-15 12:31:21,349 WARN L143 InductivityCheck]: Transition 423#(and (< main_~i0~0 (+ main_~n0~0 1)) (= (+ (- 1) main_~i0~0) 0)) ( _ , assume !(~i0~0 < ~n0~0); , 418#(<= main_~n0~0 0) ) not inductive [2022-04-15 12:31:21,350 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 12:31:21,350 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:682) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:547) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 12:31:21,354 INFO L158 Benchmark]: Toolchain (without parser) took 2120.56ms. Allocated memory is still 197.1MB. Free memory was 149.5MB in the beginning and 106.5MB in the end (delta: 42.9MB). Peak memory consumption was 44.1MB. Max. memory is 8.0GB. [2022-04-15 12:31:21,354 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 197.1MB. Free memory was 165.4MB in the beginning and 165.3MB in the end (delta: 81.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:31:21,354 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.62ms. Allocated memory is still 197.1MB. Free memory was 149.3MB in the beginning and 175.8MB in the end (delta: -26.5MB). Peak memory consumption was 14.2MB. Max. memory is 8.0GB. [2022-04-15 12:31:21,355 INFO L158 Benchmark]: Boogie Preprocessor took 25.22ms. Allocated memory is still 197.1MB. Free memory was 175.8MB in the beginning and 174.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 12:31:21,355 INFO L158 Benchmark]: RCFGBuilder took 289.90ms. Allocated memory is still 197.1MB. Free memory was 174.2MB in the beginning and 161.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 12:31:21,355 INFO L158 Benchmark]: TraceAbstraction took 1585.20ms. Allocated memory is still 197.1MB. Free memory was 161.2MB in the beginning and 106.5MB in the end (delta: 54.6MB). Peak memory consumption was 56.1MB. Max. memory is 8.0GB. [2022-04-15 12:31:21,356 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.24ms. Allocated memory is still 197.1MB. Free memory was 165.4MB in the beginning and 165.3MB in the end (delta: 81.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 206.62ms. Allocated memory is still 197.1MB. Free memory was 149.3MB in the beginning and 175.8MB in the end (delta: -26.5MB). Peak memory consumption was 14.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.22ms. Allocated memory is still 197.1MB. Free memory was 175.8MB in the beginning and 174.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 289.90ms. Allocated memory is still 197.1MB. Free memory was 174.2MB in the beginning and 161.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 1585.20ms. Allocated memory is still 197.1MB. Free memory was 161.2MB in the beginning and 106.5MB in the end (delta: 54.6MB). Peak memory consumption was 56.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 12:31:21,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...