/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-invgen/nested6.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:11:34,412 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:11:34,414 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:11:34,448 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:11:34,449 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:11:34,450 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:11:34,452 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:11:34,456 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:11:34,457 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:11:34,460 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:11:34,460 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:11:34,461 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:11:34,461 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:11:34,462 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:11:34,462 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:11:34,463 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:11:34,463 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:11:34,464 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:11:34,464 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:11:34,465 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:11:34,466 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:11:34,467 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:11:34,468 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:11:34,470 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:11:34,471 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:11:34,474 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:11:34,474 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:11:34,474 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:11:34,474 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:11:34,475 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:11:34,475 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:11:34,475 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:11:34,476 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:11:34,476 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:11:34,477 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:11:34,477 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:11:34,477 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:11:34,478 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:11:34,478 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:11:34,478 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:11:34,478 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:11:34,479 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:11:34,479 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:11:34,485 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:11:34,485 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:11:34,485 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:11:34,486 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:11:34,486 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:11:34,486 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:11:34,486 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:11:34,486 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:11:34,486 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:11:34,486 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:11:34,486 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:11:34,486 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:11:34,486 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:11:34,486 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:11:34,486 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:11:34,487 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:11:34,487 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:11:34,487 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:11:34,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:11:34,489 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:11:34,490 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:11:34,490 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:11:34,490 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:11:34,490 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:11:34,490 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:11:34,490 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:11:34,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:11:34,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:11:34,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:11:34,691 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:11:34,692 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:11:34,693 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/nested6.i [2022-04-28 03:11:34,740 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f009c7ac/b73130f311a8400a8cd1c69c24ec8d2b/FLAG44b7b260e [2022-04-28 03:11:35,094 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:11:35,095 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested6.i [2022-04-28 03:11:35,099 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f009c7ac/b73130f311a8400a8cd1c69c24ec8d2b/FLAG44b7b260e [2022-04-28 03:11:35,108 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f009c7ac/b73130f311a8400a8cd1c69c24ec8d2b [2022-04-28 03:11:35,110 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:11:35,111 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:11:35,113 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:11:35,114 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:11:35,116 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:11:35,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:11:35" (1/1) ... [2022-04-28 03:11:35,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60f4b12c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:35, skipping insertion in model container [2022-04-28 03:11:35,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:11:35" (1/1) ... [2022-04-28 03:11:35,122 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:11:35,131 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:11:35,282 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/nested6.i[893,906] [2022-04-28 03:11:35,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:11:35,300 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:11:35,325 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/nested6.i[893,906] [2022-04-28 03:11:35,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:11:35,336 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:11:35,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:35 WrapperNode [2022-04-28 03:11:35,337 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:11:35,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:11:35,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:11:35,337 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:11:35,344 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:35" (1/1) ... [2022-04-28 03:11:35,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:35" (1/1) ... [2022-04-28 03:11:35,348 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:35" (1/1) ... [2022-04-28 03:11:35,348 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:35" (1/1) ... [2022-04-28 03:11:35,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:35" (1/1) ... [2022-04-28 03:11:35,355 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:35" (1/1) ... [2022-04-28 03:11:35,356 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:35" (1/1) ... [2022-04-28 03:11:35,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:11:35,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:11:35,358 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:11:35,358 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:11:35,360 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:35" (1/1) ... [2022-04-28 03:11:35,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:11:35,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:11:35,386 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:11:35,415 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:11:35,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:11:35,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:11:35,427 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:11:35,427 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 03:11:35,427 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:11:35,428 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:11:35,428 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:11:35,428 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:11:35,428 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 03:11:35,428 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 03:11:35,428 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:11:35,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:11:35,430 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 03:11:35,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:11:35,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 03:11:35,431 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:11:35,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:11:35,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:11:35,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:11:35,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:11:35,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:11:35,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:11:35,488 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:11:35,489 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:11:35,647 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:11:35,659 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:11:35,659 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-28 03:11:35,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:11:35 BoogieIcfgContainer [2022-04-28 03:11:35,661 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:11:35,662 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:11:35,662 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:11:35,668 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:11:35,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:11:35" (1/3) ... [2022-04-28 03:11:35,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1461b9e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:11:35, skipping insertion in model container [2022-04-28 03:11:35,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:35" (2/3) ... [2022-04-28 03:11:35,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1461b9e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:11:35, skipping insertion in model container [2022-04-28 03:11:35,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:11:35" (3/3) ... [2022-04-28 03:11:35,670 INFO L111 eAbstractionObserver]: Analyzing ICFG nested6.i [2022-04-28 03:11:35,681 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:11:35,681 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:11:35,710 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:11:35,714 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@7c820c94, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4a14cdb1 [2022-04-28 03:11:35,715 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:11:35,720 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 20 states have (on average 1.55) internal successors, (31), 22 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 03:11:35,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 03:11:35,725 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:11:35,725 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:11:35,725 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:11:35,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:11:35,729 INFO L85 PathProgramCache]: Analyzing trace with hash -380972064, now seen corresponding path program 1 times [2022-04-28 03:11:35,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:35,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1530005440] [2022-04-28 03:11:35,745 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:11:35,745 INFO L85 PathProgramCache]: Analyzing trace with hash -380972064, now seen corresponding path program 2 times [2022-04-28 03:11:35,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:11:35,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276862239] [2022-04-28 03:11:35,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:11:35,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:11:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:35,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:11:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:35,971 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#(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); {33#true} is VALID [2022-04-28 03:11:35,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-28 03:11:35,972 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #98#return; {33#true} is VALID [2022-04-28 03:11:35,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {41#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:11:35,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#(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); {33#true} is VALID [2022-04-28 03:11:35,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-28 03:11:35,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #98#return; {33#true} is VALID [2022-04-28 03:11:35,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID [2022-04-28 03:11:35,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2; {33#true} is VALID [2022-04-28 03:11:35,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {33#true} assume !!(~n~0 < 1000000); {33#true} is VALID [2022-04-28 03:11:35,979 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} assume ~k~0 == ~n~0; {38#(<= main_~n~0 main_~k~0)} is VALID [2022-04-28 03:11:35,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {38#(<= main_~n~0 main_~k~0)} ~i~0 := 0; {38#(<= main_~n~0 main_~k~0)} is VALID [2022-04-28 03:11:35,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#(<= main_~n~0 main_~k~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {38#(<= main_~n~0 main_~k~0)} is VALID [2022-04-28 03:11:35,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {38#(<= main_~n~0 main_~k~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {38#(<= main_~n~0 main_~k~0)} is VALID [2022-04-28 03:11:35,982 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#(<= main_~n~0 main_~k~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {38#(<= main_~n~0 main_~k~0)} is VALID [2022-04-28 03:11:35,983 INFO L272 TraceCheckUtils]: 12: Hoare triple {38#(<= main_~n~0 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {39#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:11:35,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {39#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {40#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:11:35,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {34#false} is VALID [2022-04-28 03:11:35,987 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-28 03:11:35,988 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:11:35,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:11:35,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276862239] [2022-04-28 03:11:35,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276862239] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:35,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:35,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:11:35,991 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:11:35,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1530005440] [2022-04-28 03:11:35,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1530005440] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:35,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:35,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:11:35,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796570218] [2022-04-28 03:11:35,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:11:35,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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 16 [2022-04-28 03:11:35,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:11:35,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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:11:36,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:11:36,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:11:36,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:36,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:11:36,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:11:36,040 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.55) internal successors, (31), 22 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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:11:36,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:36,401 INFO L93 Difference]: Finished difference Result 58 states and 81 transitions. [2022-04-28 03:11:36,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:11:36,402 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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 16 [2022-04-28 03:11:36,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:11:36,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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:11:36,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2022-04-28 03:11:36,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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:11:36,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2022-04-28 03:11:36,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 81 transitions. [2022-04-28 03:11:36,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:11:36,490 INFO L225 Difference]: With dead ends: 58 [2022-04-28 03:11:36,490 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 03:11:36,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:11:36,495 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 39 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:11:36,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 52 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:11:36,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 03:11:36,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 03:11:36,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:11:36,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 03:11:36,540 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 03:11:36,540 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 03:11:36,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:36,543 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-28 03:11:36,543 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-28 03:11:36,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:36,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:36,544 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-28 03:11:36,544 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-28 03:11:36,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:36,547 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-28 03:11:36,547 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-28 03:11:36,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:36,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:36,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:11:36,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:11:36,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 03:11:36,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-04-28 03:11:36,551 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 16 [2022-04-28 03:11:36,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:11:36,551 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-04-28 03:11:36,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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:11:36,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 33 transitions. [2022-04-28 03:11:36,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:11:36,580 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-28 03:11:36,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 03:11:36,580 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:11:36,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:11:36,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:11:36,581 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:11:36,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:11:36,581 INFO L85 PathProgramCache]: Analyzing trace with hash 580085489, now seen corresponding path program 1 times [2022-04-28 03:11:36,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:36,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [416526258] [2022-04-28 03:11:36,582 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:11:36,582 INFO L85 PathProgramCache]: Analyzing trace with hash 580085489, now seen corresponding path program 2 times [2022-04-28 03:11:36,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:11:36,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267560207] [2022-04-28 03:11:36,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:11:36,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:11:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:36,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:11:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:36,699 INFO L290 TraceCheckUtils]: 0: Hoare triple {293#(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); {284#true} is VALID [2022-04-28 03:11:36,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {284#true} assume true; {284#true} is VALID [2022-04-28 03:11:36,700 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {284#true} {284#true} #98#return; {284#true} is VALID [2022-04-28 03:11:36,700 INFO L272 TraceCheckUtils]: 0: Hoare triple {284#true} call ULTIMATE.init(); {293#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:11:36,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {293#(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); {284#true} is VALID [2022-04-28 03:11:36,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {284#true} assume true; {284#true} is VALID [2022-04-28 03:11:36,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {284#true} {284#true} #98#return; {284#true} is VALID [2022-04-28 03:11:36,701 INFO L272 TraceCheckUtils]: 4: Hoare triple {284#true} call #t~ret7 := main(); {284#true} is VALID [2022-04-28 03:11:36,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {284#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2; {284#true} is VALID [2022-04-28 03:11:36,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {284#true} assume !!(~n~0 < 1000000); {284#true} is VALID [2022-04-28 03:11:36,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {284#true} assume ~k~0 == ~n~0; {284#true} is VALID [2022-04-28 03:11:36,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {284#true} ~i~0 := 0; {284#true} is VALID [2022-04-28 03:11:36,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {284#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {289#(<= (* main_~i~0 2) main_~j~0)} is VALID [2022-04-28 03:11:36,703 INFO L290 TraceCheckUtils]: 10: Hoare triple {289#(<= (* main_~i~0 2) main_~j~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {289#(<= (* main_~i~0 2) main_~j~0)} is VALID [2022-04-28 03:11:36,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {289#(<= (* main_~i~0 2) main_~j~0)} assume 0 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {290#(<= (* main_~i~0 2) main_~k~0)} is VALID [2022-04-28 03:11:36,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {290#(<= (* main_~i~0 2) main_~k~0)} assume !!(~k~0 < ~n~0); {290#(<= (* main_~i~0 2) main_~k~0)} is VALID [2022-04-28 03:11:36,704 INFO L272 TraceCheckUtils]: 13: Hoare triple {290#(<= (* main_~i~0 2) main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 2 * ~i~0 then 1 else 0)); {291#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:11:36,705 INFO L290 TraceCheckUtils]: 14: Hoare triple {291#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {292#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:11:36,705 INFO L290 TraceCheckUtils]: 15: Hoare triple {292#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {285#false} is VALID [2022-04-28 03:11:36,705 INFO L290 TraceCheckUtils]: 16: Hoare triple {285#false} assume !false; {285#false} is VALID [2022-04-28 03:11:36,705 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:11:36,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:11:36,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267560207] [2022-04-28 03:11:36,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267560207] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:36,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:36,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:11:36,706 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:11:36,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [416526258] [2022-04-28 03:11:36,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [416526258] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:36,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:36,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:11:36,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831313909] [2022-04-28 03:11:36,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:11:36,708 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 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-28 03:11:36,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:11:36,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 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-28 03:11:36,721 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-28 03:11:36,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:11:36,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:36,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:11:36,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:11:36,723 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 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-28 03:11:37,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:37,083 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-28 03:11:37,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:11:37,084 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 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-28 03:11:37,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:11:37,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 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-28 03:11:37,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-04-28 03:11:37,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 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-28 03:11:37,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-04-28 03:11:37,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 45 transitions. [2022-04-28 03:11:37,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:11:37,134 INFO L225 Difference]: With dead ends: 41 [2022-04-28 03:11:37,134 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 03:11:37,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:11:37,135 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 29 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:11:37,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 45 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:11:37,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 03:11:37,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2022-04-28 03:11:37,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:11:37,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 03:11:37,174 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 03:11:37,174 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 03:11:37,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:37,176 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-28 03:11:37,176 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-28 03:11:37,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:37,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:37,177 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 39 states. [2022-04-28 03:11:37,177 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 39 states. [2022-04-28 03:11:37,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:37,182 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-28 03:11:37,182 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-28 03:11:37,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:37,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:37,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:11:37,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:11:37,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 03:11:37,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-04-28 03:11:37,188 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 17 [2022-04-28 03:11:37,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:11:37,188 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-04-28 03:11:37,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 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-28 03:11:37,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 36 transitions. [2022-04-28 03:11:37,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:11:37,216 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-28 03:11:37,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 03:11:37,220 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:11:37,220 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:11:37,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:11:37,223 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:11:37,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:11:37,224 INFO L85 PathProgramCache]: Analyzing trace with hash -132185391, now seen corresponding path program 1 times [2022-04-28 03:11:37,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:37,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [146717045] [2022-04-28 03:11:37,228 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:11:37,228 INFO L85 PathProgramCache]: Analyzing trace with hash -132185391, now seen corresponding path program 2 times [2022-04-28 03:11:37,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:11:37,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285870615] [2022-04-28 03:11:37,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:11:37,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:11:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:37,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:11:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:37,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {544#(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); {532#true} is VALID [2022-04-28 03:11:37,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {532#true} assume true; {532#true} is VALID [2022-04-28 03:11:37,335 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {532#true} {532#true} #98#return; {532#true} is VALID [2022-04-28 03:11:37,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 03:11:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:37,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {532#true} ~cond := #in~cond; {532#true} is VALID [2022-04-28 03:11:37,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {532#true} assume !(0 == ~cond); {532#true} is VALID [2022-04-28 03:11:37,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {532#true} assume true; {532#true} is VALID [2022-04-28 03:11:37,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {532#true} {537#(<= main_~k~0 main_~n~0)} #94#return; {537#(<= main_~k~0 main_~n~0)} is VALID [2022-04-28 03:11:37,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {532#true} call ULTIMATE.init(); {544#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:11:37,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {544#(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); {532#true} is VALID [2022-04-28 03:11:37,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {532#true} assume true; {532#true} is VALID [2022-04-28 03:11:37,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {532#true} {532#true} #98#return; {532#true} is VALID [2022-04-28 03:11:37,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {532#true} call #t~ret7 := main(); {532#true} is VALID [2022-04-28 03:11:37,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {532#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2; {532#true} is VALID [2022-04-28 03:11:37,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {532#true} assume !!(~n~0 < 1000000); {532#true} is VALID [2022-04-28 03:11:37,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {532#true} assume ~k~0 == ~n~0; {537#(<= main_~k~0 main_~n~0)} is VALID [2022-04-28 03:11:37,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {537#(<= main_~k~0 main_~n~0)} ~i~0 := 0; {537#(<= main_~k~0 main_~n~0)} is VALID [2022-04-28 03:11:37,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {537#(<= main_~k~0 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {537#(<= main_~k~0 main_~n~0)} is VALID [2022-04-28 03:11:37,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {537#(<= main_~k~0 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {537#(<= main_~k~0 main_~n~0)} is VALID [2022-04-28 03:11:37,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {537#(<= main_~k~0 main_~n~0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {537#(<= main_~k~0 main_~n~0)} is VALID [2022-04-28 03:11:37,360 INFO L272 TraceCheckUtils]: 12: Hoare triple {537#(<= main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 >= ~n~0 then 1 else 0)); {532#true} is VALID [2022-04-28 03:11:37,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {532#true} ~cond := #in~cond; {532#true} is VALID [2022-04-28 03:11:37,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {532#true} assume !(0 == ~cond); {532#true} is VALID [2022-04-28 03:11:37,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {532#true} assume true; {532#true} is VALID [2022-04-28 03:11:37,362 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {532#true} {537#(<= main_~k~0 main_~n~0)} #94#return; {537#(<= main_~k~0 main_~n~0)} is VALID [2022-04-28 03:11:37,369 INFO L272 TraceCheckUtils]: 17: Hoare triple {537#(<= main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~k~0 <= ~n~0 then 1 else 0)); {542#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:11:37,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {542#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {543#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:11:37,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {543#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {533#false} is VALID [2022-04-28 03:11:37,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {533#false} assume !false; {533#false} is VALID [2022-04-28 03:11:37,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:11:37,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:11:37,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285870615] [2022-04-28 03:11:37,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285870615] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:37,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:37,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:11:37,371 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:11:37,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [146717045] [2022-04-28 03:11:37,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [146717045] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:37,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:37,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:11:37,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349997406] [2022-04-28 03:11:37,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:11:37,375 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-28 03:11:37,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:11:37,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:11:37,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:11:37,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:11:37,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:37,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:11:37,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:11:37,388 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:11:37,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:37,654 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2022-04-28 03:11:37,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:11:37,655 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-28 03:11:37,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:11:37,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:11:37,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-28 03:11:37,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:11:37,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-28 03:11:37,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2022-04-28 03:11:37,707 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-28 03:11:37,710 INFO L225 Difference]: With dead ends: 46 [2022-04-28 03:11:37,710 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 03:11:37,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:11:37,713 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 31 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:11:37,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 42 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:11:37,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 03:11:37,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-28 03:11:37,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:11:37,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 03:11:37,761 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 03:11:37,761 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 03:11:37,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:37,763 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-04-28 03:11:37,763 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-04-28 03:11:37,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:37,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:37,764 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-28 03:11:37,764 INFO L87 Difference]: Start difference. First operand has 44 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-28 03:11:37,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:37,765 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-04-28 03:11:37,765 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-04-28 03:11:37,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:37,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:37,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:11:37,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:11:37,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 03:11:37,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-04-28 03:11:37,767 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 21 [2022-04-28 03:11:37,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:11:37,767 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-04-28 03:11:37,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:11:37,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 50 transitions. [2022-04-28 03:11:37,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:11:37,810 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-04-28 03:11:37,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 03:11:37,811 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:11:37,811 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:11:37,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 03:11:37,811 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:11:37,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:11:37,812 INFO L85 PathProgramCache]: Analyzing trace with hash -512108736, now seen corresponding path program 1 times [2022-04-28 03:11:37,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:37,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [240123103] [2022-04-28 03:11:37,905 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula(JordanLoopAcceleration.java:1059) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.createLoopAccelerationTermSequential(JordanLoopAcceleration.java:693) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.createLoopAccelerationFormula(JordanLoopAcceleration.java:528) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.accelerateLoop(JordanLoopAcceleration.java:156) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.loopaccelerator.AcceleratorJordan.accelerateLoop(AcceleratorJordan.java:88) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:246) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) 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-28 03:11:37,908 INFO L158 Benchmark]: Toolchain (without parser) took 2797.37ms. Allocated memory was 183.5MB in the beginning and 230.7MB in the end (delta: 47.2MB). Free memory was 133.8MB in the beginning and 77.9MB in the end (delta: 55.9MB). Peak memory consumption was 104.1MB. Max. memory is 8.0GB. [2022-04-28 03:11:37,909 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 183.5MB. Free memory is still 150.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 03:11:37,909 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.44ms. Allocated memory is still 183.5MB. Free memory was 133.6MB in the beginning and 158.9MB in the end (delta: -25.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 03:11:37,909 INFO L158 Benchmark]: Boogie Preprocessor took 20.07ms. Allocated memory is still 183.5MB. Free memory was 158.9MB in the beginning and 157.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 03:11:37,909 INFO L158 Benchmark]: RCFGBuilder took 302.81ms. Allocated memory is still 183.5MB. Free memory was 157.5MB in the beginning and 144.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 03:11:37,910 INFO L158 Benchmark]: TraceAbstraction took 2245.72ms. Allocated memory was 183.5MB in the beginning and 230.7MB in the end (delta: 47.2MB). Free memory was 144.6MB in the beginning and 77.9MB in the end (delta: 66.7MB). Peak memory consumption was 115.0MB. Max. memory is 8.0GB. [2022-04-28 03:11:37,912 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.09ms. Allocated memory is still 183.5MB. Free memory is still 150.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 223.44ms. Allocated memory is still 183.5MB. Free memory was 133.6MB in the beginning and 158.9MB in the end (delta: -25.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.07ms. Allocated memory is still 183.5MB. Free memory was 158.9MB in the beginning and 157.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 302.81ms. Allocated memory is still 183.5MB. Free memory was 157.5MB in the beginning and 144.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 2245.72ms. Allocated memory was 183.5MB in the beginning and 230.7MB in the end (delta: 47.2MB). Free memory was 144.6MB in the beginning and 77.9MB in the end (delta: 66.7MB). Peak memory consumption was 115.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-28 03:11:37,936 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...