/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-lit/bhmr2007.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 06:12:29,501 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:12:29,503 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:12:29,561 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:12:29,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:12:29,564 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:12:29,567 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:12:29,572 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:12:29,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:12:29,577 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:12:29,578 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:12:29,579 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:12:29,579 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:12:29,581 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:12:29,581 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:12:29,582 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:12:29,583 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:12:29,583 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:12:29,586 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:12:29,590 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:12:29,592 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:12:29,593 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:12:29,593 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:12:29,594 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:12:29,595 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:12:29,599 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:12:29,600 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:12:29,600 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:12:29,600 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:12:29,601 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:12:29,602 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:12:29,602 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:12:29,603 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:12:29,604 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:12:29,604 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:12:29,605 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:12:29,605 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:12:29,605 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:12:29,605 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:12:29,605 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:12:29,606 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:12:29,607 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:12:29,608 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 06:12:29,614 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:12:29,615 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:12:29,616 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:12:29,616 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:12:29,616 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:12:29,616 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:12:29,616 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:12:29,616 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:12:29,616 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:12:29,616 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:12:29,617 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:12:29,617 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:12:29,617 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:12:29,617 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:12:29,617 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:12:29,617 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:12:29,617 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:12:29,617 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:12:29,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:12:29,618 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:12:29,618 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:12:29,618 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:12:29,618 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:12:29,618 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:12:29,618 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:12:29,618 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 06:12:29,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:12:29,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:12:29,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:12:29,826 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:12:29,828 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:12:29,829 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/bhmr2007.i [2022-04-15 06:12:29,886 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0136b93c/6b1c8384cae94caa9b2e78b42fa751fd/FLAG259248e4d [2022-04-15 06:12:30,165 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:12:30,166 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bhmr2007.i [2022-04-15 06:12:30,172 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0136b93c/6b1c8384cae94caa9b2e78b42fa751fd/FLAG259248e4d [2022-04-15 06:12:30,602 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0136b93c/6b1c8384cae94caa9b2e78b42fa751fd [2022-04-15 06:12:30,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:12:30,606 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:12:30,607 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:12:30,607 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:12:30,618 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:12:30,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:12:30" (1/1) ... [2022-04-15 06:12:30,621 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ed67f1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:30, skipping insertion in model container [2022-04-15 06:12:30,621 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:12:30" (1/1) ... [2022-04-15 06:12:30,625 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:12:30,638 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:12:30,776 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bhmr2007.i[895,908] [2022-04-15 06:12:30,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:12:30,789 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:12:30,806 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bhmr2007.i[895,908] [2022-04-15 06:12:30,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:12:30,819 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:12:30,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:30 WrapperNode [2022-04-15 06:12:30,820 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:12:30,821 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:12:30,821 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:12:30,821 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:12:30,830 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:30" (1/1) ... [2022-04-15 06:12:30,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:30" (1/1) ... [2022-04-15 06:12:30,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:30" (1/1) ... [2022-04-15 06:12:30,834 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:30" (1/1) ... [2022-04-15 06:12:30,838 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:30" (1/1) ... [2022-04-15 06:12:30,841 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:30" (1/1) ... [2022-04-15 06:12:30,842 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:30" (1/1) ... [2022-04-15 06:12:30,843 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:12:30,844 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:12:30,844 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:12:30,844 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:12:30,845 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:30" (1/1) ... [2022-04-15 06:12:30,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:12:30,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:12:30,885 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 06:12:30,894 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 06:12:30,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:12:30,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:12:30,931 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:12:30,931 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 06:12:30,931 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 06:12:30,932 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:12:30,932 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:12:30,932 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:12:30,932 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 06:12:30,933 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 06:12:30,933 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:12:30,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:12:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 06:12:30,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:12:30,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 06:12:30,935 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:12:30,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:12:30,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:12:30,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:12:30,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:12:30,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:12:30,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:12:31,000 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:12:31,001 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:12:31,135 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:12:31,140 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:12:31,140 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 06:12:31,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:12:31 BoogieIcfgContainer [2022-04-15 06:12:31,142 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:12:31,143 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:12:31,143 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:12:31,145 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:12:31,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:12:30" (1/3) ... [2022-04-15 06:12:31,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d6f4ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:12:31, skipping insertion in model container [2022-04-15 06:12:31,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:12:30" (2/3) ... [2022-04-15 06:12:31,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d6f4ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:12:31, skipping insertion in model container [2022-04-15 06:12:31,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:12:31" (3/3) ... [2022-04-15 06:12:31,147 INFO L111 eAbstractionObserver]: Analyzing ICFG bhmr2007.i [2022-04-15 06:12:31,151 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:12:31,151 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:12:31,195 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:12:31,200 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 06:12:31,200 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:12:31,216 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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 06:12:31,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 06:12:31,221 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:12:31,221 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:12:31,222 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:12:31,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:12:31,226 INFO L85 PathProgramCache]: Analyzing trace with hash -353995685, now seen corresponding path program 1 times [2022-04-15 06:12:31,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:31,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1282527168] [2022-04-15 06:12:31,243 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:12:31,243 INFO L85 PathProgramCache]: Analyzing trace with hash -353995685, now seen corresponding path program 2 times [2022-04-15 06:12:31,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:12:31,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035963158] [2022-04-15 06:12:31,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:12:31,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:12:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:31,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:12:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:31,413 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(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); {25#true} is VALID [2022-04-15 06:12:31,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 06:12:31,413 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #61#return; {25#true} is VALID [2022-04-15 06:12:31,416 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:12:31,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(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); {25#true} is VALID [2022-04-15 06:12:31,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 06:12:31,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #61#return; {25#true} is VALID [2022-04-15 06:12:31,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret3 := main(); {25#true} is VALID [2022-04-15 06:12:31,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {25#true} is VALID [2022-04-15 06:12:31,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {25#true} is VALID [2022-04-15 06:12:31,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-15 06:12:31,419 INFO L272 TraceCheckUtils]: 8: Hoare triple {26#false} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {26#false} is VALID [2022-04-15 06:12:31,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-15 06:12:31,419 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-15 06:12:31,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-15 06:12:31,420 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 06:12:31,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:12:31,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035963158] [2022-04-15 06:12:31,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035963158] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:31,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:31,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:12:31,425 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:12:31,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1282527168] [2022-04-15 06:12:31,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1282527168] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:31,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:31,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:12:31,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518063722] [2022-04-15 06:12:31,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:12:31,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 06:12:31,433 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:12:31,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:31,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:31,467 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 06:12:31,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:31,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 06:12:31,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:12:31,501 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:31,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:31,599 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-15 06:12:31,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 06:12:31,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 06:12:31,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:12:31,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:31,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-15 06:12:31,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:31,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-15 06:12:31,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2022-04-15 06:12:31,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:31,680 INFO L225 Difference]: With dead ends: 34 [2022-04-15 06:12:31,680 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 06:12:31,682 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 06:12:31,687 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 26 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 06:12:31,688 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 26 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:12:31,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 06:12:31,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 06:12:31,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:12:31,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:31,710 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:31,710 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:31,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:31,712 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 06:12:31,712 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 06:12:31,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:31,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:31,713 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 06:12:31,713 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 06:12:31,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:31,715 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 06:12:31,715 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 06:12:31,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:31,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:31,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:12:31,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:12:31,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:31,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-15 06:12:31,718 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-15 06:12:31,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:12:31,718 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-15 06:12:31,719 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:31,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-15 06:12:31,734 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-15 06:12:31,735 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 06:12:31,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 06:12:31,735 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:12:31,735 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:12:31,736 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:12:31,736 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:12:31,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:12:31,737 INFO L85 PathProgramCache]: Analyzing trace with hash -364154416, now seen corresponding path program 1 times [2022-04-15 06:12:31,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:31,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [992541878] [2022-04-15 06:12:31,738 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:12:31,738 INFO L85 PathProgramCache]: Analyzing trace with hash -364154416, now seen corresponding path program 2 times [2022-04-15 06:12:31,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:12:31,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910048242] [2022-04-15 06:12:31,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:12:31,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:12:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:31,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:12:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:12:31,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {171#(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); {161#true} is VALID [2022-04-15 06:12:31,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-15 06:12:31,940 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161#true} {161#true} #61#return; {161#true} is VALID [2022-04-15 06:12:31,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {161#true} call ULTIMATE.init(); {171#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:12:31,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#(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); {161#true} is VALID [2022-04-15 06:12:31,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-15 06:12:31,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161#true} {161#true} #61#return; {161#true} is VALID [2022-04-15 06:12:31,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {161#true} call #t~ret3 := main(); {161#true} is VALID [2022-04-15 06:12:31,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {161#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {166#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-15 06:12:31,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {166#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {167#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0) (not (<= (+ (* main_~n~0 3) 1) (+ main_~b~0 main_~a~0))))} is VALID [2022-04-15 06:12:31,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {167#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0) (not (<= (+ (* main_~n~0 3) 1) (+ main_~b~0 main_~a~0))))} assume !(~i~0 < ~n~0); {168#(and (= main_~a~0 0) (= main_~b~0 0) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)) (not (<= (+ (* main_~n~0 3) 1) (+ main_~b~0 main_~a~0))))} is VALID [2022-04-15 06:12:31,948 INFO L272 TraceCheckUtils]: 8: Hoare triple {168#(and (= main_~a~0 0) (= main_~b~0 0) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)) (not (<= (+ (* main_~n~0 3) 1) (+ main_~b~0 main_~a~0))))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {169#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:12:31,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {169#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {170#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:12:31,948 INFO L290 TraceCheckUtils]: 10: Hoare triple {170#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {162#false} is VALID [2022-04-15 06:12:31,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {162#false} assume !false; {162#false} is VALID [2022-04-15 06:12:31,949 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 06:12:31,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:12:31,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910048242] [2022-04-15 06:12:31,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910048242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:31,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:31,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:12:31,950 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:12:31,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [992541878] [2022-04-15 06:12:31,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [992541878] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:12:31,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:12:31,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:12:31,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005787945] [2022-04-15 06:12:31,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:12:31,951 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 06:12:31,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:12:31,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:31,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:31,965 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:12:31,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:31,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:12:31,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-15 06:12:31,971 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:32,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:32,189 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-15 06:12:32,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:12:32,190 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 06:12:32,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:12:32,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:32,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2022-04-15 06:12:32,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:32,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2022-04-15 06:12:32,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 24 transitions. [2022-04-15 06:12:32,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:12:32,219 INFO L225 Difference]: With dead ends: 22 [2022-04-15 06:12:32,219 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 06:12:32,219 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-04-15 06:12:32,220 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:12:32,221 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 33 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:12:32,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 06:12:32,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-15 06:12:32,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:12:32,228 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:32,228 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:32,229 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:32,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:32,230 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 06:12:32,230 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 06:12:32,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:32,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:32,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 06:12:32,231 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 06:12:32,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:12:32,233 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 06:12:32,233 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 06:12:32,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:12:32,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:12:32,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:12:32,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:12:32,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:32,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-15 06:12:32,235 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2022-04-15 06:12:32,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:12:32,235 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-15 06:12:32,235 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:12:32,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 17 transitions. [2022-04-15 06:12:32,252 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 06:12:32,253 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-15 06:12:32,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 06:12:32,253 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:12:32,253 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:12:32,253 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 06:12:32,254 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:12:32,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:12:32,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1324408332, now seen corresponding path program 1 times [2022-04-15 06:12:32,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:12:32,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [163186307] [2022-04-15 06:12:32,624 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=2, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:12:32,625 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:401) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.PredicateHelper.makeReflexive(PredicateHelper.java:222) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:253) 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:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) 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 06:12:32,628 INFO L158 Benchmark]: Toolchain (without parser) took 2022.12ms. Allocated memory was 203.4MB in the beginning and 244.3MB in the end (delta: 40.9MB). Free memory was 152.5MB in the beginning and 177.3MB in the end (delta: -24.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-04-15 06:12:32,628 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 203.4MB. Free memory is still 168.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 06:12:32,629 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.98ms. Allocated memory is still 203.4MB. Free memory was 152.4MB in the beginning and 178.3MB in the end (delta: -25.9MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. [2022-04-15 06:12:32,629 INFO L158 Benchmark]: Boogie Preprocessor took 22.84ms. Allocated memory is still 203.4MB. Free memory was 178.3MB in the beginning and 176.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 06:12:32,629 INFO L158 Benchmark]: RCFGBuilder took 297.74ms. Allocated memory is still 203.4MB. Free memory was 176.8MB in the beginning and 165.7MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 06:12:32,630 INFO L158 Benchmark]: TraceAbstraction took 1484.49ms. Allocated memory was 203.4MB in the beginning and 244.3MB in the end (delta: 40.9MB). Free memory was 165.2MB in the beginning and 177.3MB in the end (delta: -12.1MB). Peak memory consumption was 29.2MB. Max. memory is 8.0GB. [2022-04-15 06:12:32,631 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.12ms. Allocated memory is still 203.4MB. Free memory is still 168.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 212.98ms. Allocated memory is still 203.4MB. Free memory was 152.4MB in the beginning and 178.3MB in the end (delta: -25.9MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.84ms. Allocated memory is still 203.4MB. Free memory was 178.3MB in the beginning and 176.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 297.74ms. Allocated memory is still 203.4MB. Free memory was 176.8MB in the beginning and 165.7MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1484.49ms. Allocated memory was 203.4MB in the beginning and 244.3MB in the end (delta: 40.9MB). Free memory was 165.2MB in the beginning and 177.3MB in the end (delta: -12.1MB). Peak memory consumption was 29.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 06:12:32,656 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...