/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-lit/jm2006.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:32:08,608 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:32:08,610 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:32:08,668 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:32:08,669 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:32:08,670 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:32:08,672 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:32:08,675 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:32:08,676 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:32:08,680 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:32:08,681 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:32:08,682 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:32:08,682 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:32:08,684 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:32:08,685 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:32:08,687 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:32:08,688 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:32:08,689 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:32:08,690 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:32:08,695 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:32:08,697 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:32:08,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:32:08,699 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:32:08,699 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:32:08,701 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:32:08,706 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:32:08,707 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:32:08,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:32:08,708 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:32:08,708 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:32:08,709 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:32:08,709 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:32:08,711 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:32:08,711 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:32:08,712 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:32:08,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:32:08,713 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:32:08,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:32:08,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:32:08,714 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:32:08,714 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:32:08,716 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:32:08,716 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:32:08,726 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:32:08,727 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:32:08,728 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:32:08,728 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:32:08,728 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:32:08,728 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:32:08,729 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:32:08,729 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:32:08,729 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:32:08,730 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:32:08,730 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:32:08,730 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:32:08,730 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:32:08,730 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:32:08,731 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:32:08,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:32:08,731 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:32:08,731 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:32:08,731 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:32:08,731 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:32:08,731 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:32:08,732 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:32:08,732 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 12:32:08,950 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:32:08,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:32:08,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:32:08,969 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:32:08,971 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:32:08,973 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/jm2006.i [2022-04-15 12:32:09,023 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75445f5cd/a01de0b627a04b86abc7d41be96a4e15/FLAGd314fdf05 [2022-04-15 12:32:09,387 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:32:09,388 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006.i [2022-04-15 12:32:09,393 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75445f5cd/a01de0b627a04b86abc7d41be96a4e15/FLAGd314fdf05 [2022-04-15 12:32:09,402 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75445f5cd/a01de0b627a04b86abc7d41be96a4e15 [2022-04-15 12:32:09,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:32:09,405 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:32:09,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:32:09,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:32:09,415 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:32:09,416 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:32:09" (1/1) ... [2022-04-15 12:32:09,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c79ad91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:09, skipping insertion in model container [2022-04-15 12:32:09,417 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:32:09" (1/1) ... [2022-04-15 12:32:09,422 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:32:09,432 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:32:09,554 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/jm2006.i[895,908] [2022-04-15 12:32:09,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:32:09,582 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:32:09,593 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/jm2006.i[895,908] [2022-04-15 12:32:09,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:32:09,607 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:32:09,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:09 WrapperNode [2022-04-15 12:32:09,607 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:32:09,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:32:09,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:32:09,609 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:32:09,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:09" (1/1) ... [2022-04-15 12:32:09,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:09" (1/1) ... [2022-04-15 12:32:09,622 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:09" (1/1) ... [2022-04-15 12:32:09,622 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:09" (1/1) ... [2022-04-15 12:32:09,637 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:09" (1/1) ... [2022-04-15 12:32:09,643 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:09" (1/1) ... [2022-04-15 12:32:09,645 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:09" (1/1) ... [2022-04-15 12:32:09,652 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:32:09,653 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:32:09,653 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:32:09,653 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:32:09,654 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:09" (1/1) ... [2022-04-15 12:32:09,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:32:09,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:09,678 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 12:32:09,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 12:32:09,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:32:09,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:32:09,720 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:32:09,720 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 12:32:09,721 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:32:09,721 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:32:09,721 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:32:09,721 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:32:09,721 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 12:32:09,721 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 12:32:09,721 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:32:09,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:32:09,725 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 12:32:09,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:32:09,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 12:32:09,726 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:32:09,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:32:09,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:32:09,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:32:09,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:32:09,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:32:09,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:32:09,776 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:32:09,777 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:32:09,903 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:32:09,908 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:32:09,909 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 12:32:09,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:32:09 BoogieIcfgContainer [2022-04-15 12:32:09,910 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:32:09,911 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:32:09,911 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:32:09,927 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:32:09,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:32:09" (1/3) ... [2022-04-15 12:32:09,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@146ad0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:32:09, skipping insertion in model container [2022-04-15 12:32:09,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:09" (2/3) ... [2022-04-15 12:32:09,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@146ad0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:32:09, skipping insertion in model container [2022-04-15 12:32:09,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:32:09" (3/3) ... [2022-04-15 12:32:09,930 INFO L111 eAbstractionObserver]: Analyzing ICFG jm2006.i [2022-04-15 12:32:09,940 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:32:09,941 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:32:09,997 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:32:10,003 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 12:32:10,004 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:32:10,026 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:32:10,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 12:32:10,032 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:10,032 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:10,033 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:10,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:10,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1244516831, now seen corresponding path program 1 times [2022-04-15 12:32:10,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:10,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [989742588] [2022-04-15 12:32:10,058 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:32:10,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1244516831, now seen corresponding path program 2 times [2022-04-15 12:32:10,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:10,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421120816] [2022-04-15 12:32:10,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:10,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:10,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:10,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:32:10,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:10,476 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(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); {24#true} is VALID [2022-04-15 12:32:10,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-15 12:32:10,476 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #60#return; {24#true} is VALID [2022-04-15 12:32:10,479 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {34#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:32:10,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(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); {24#true} is VALID [2022-04-15 12:32:10,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-15 12:32:10,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #60#return; {24#true} is VALID [2022-04-15 12:32:10,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret5 := main(); {24#true} is VALID [2022-04-15 12:32:10,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {24#true} is VALID [2022-04-15 12:32:10,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !!(~i~0 >= 0 && ~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0; {29#(and (or (and (or (= main_~i~0 0) (= main_~i~0 main_~x~0)) (or (<= main_~y~0 main_~j~0) (not (= main_~i~0 0)))) (<= main_~y~0 0)) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-15 12:32:10,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#(and (or (and (or (= main_~i~0 0) (= main_~i~0 main_~x~0)) (or (<= main_~y~0 main_~j~0) (not (= main_~i~0 0)))) (<= main_~y~0 0)) (< 0 (+ main_~y~0 1)))} assume !(0 != ~x~0); {30#(and (or (and (<= main_~y~0 main_~j~0) (= main_~i~0 0)) (<= main_~y~0 0)) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-15 12:32:10,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#(and (or (and (<= main_~y~0 main_~j~0) (= main_~i~0 0)) (<= main_~y~0 0)) (< 0 (+ main_~y~0 1)))} assume ~i~0 == ~j~0; {31#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-15 12:32:10,487 INFO L272 TraceCheckUtils]: 9: Hoare triple {31#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {32#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:32:10,487 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {33#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:32:10,488 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {25#false} is VALID [2022-04-15 12:32:10,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-15 12:32:10,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:10,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:10,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421120816] [2022-04-15 12:32:10,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421120816] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:10,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:10,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:32:10,496 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:10,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [989742588] [2022-04-15 12:32:10,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [989742588] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:10,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:10,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:32:10,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889841385] [2022-04-15 12:32:10,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:10,504 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 12:32:10,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:10,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:10,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:10,531 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:32:10,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:10,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:32:10,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:32:10,561 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 15 states have internal predecessors, (19), 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 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:11,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:11,058 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-15 12:32:11,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:32:11,059 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 12:32:11,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:32:11,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:11,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-04-15 12:32:11,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:11,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-04-15 12:32:11,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 58 transitions. [2022-04-15 12:32:11,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:11,154 INFO L225 Difference]: With dead ends: 47 [2022-04-15 12:32:11,155 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 12:32:11,158 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:32:11,162 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 34 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:32:11,163 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 48 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:32:11,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 12:32:11,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 12:32:11,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:32:11,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 12:32:11,189 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 12:32:11,190 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 12:32:11,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:11,192 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 12:32:11,193 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 12:32:11,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:11,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:11,194 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 12:32:11,194 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 12:32:11,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:11,196 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 12:32:11,196 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 12:32:11,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:11,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:11,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:32:11,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:32:11,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 12:32:11,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-15 12:32:11,199 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-15 12:32:11,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:32:11,200 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-15 12:32:11,200 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:11,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-15 12:32:11,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:11,215 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 12:32:11,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 12:32:11,216 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:11,216 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:11,216 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:32:11,217 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:11,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:11,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1450374075, now seen corresponding path program 1 times [2022-04-15 12:32:11,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:11,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2014072131] [2022-04-15 12:32:11,712 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:32:11,713 INFO L85 PathProgramCache]: Analyzing trace with hash 100046810, now seen corresponding path program 1 times [2022-04-15 12:32:11,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:11,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101347469] [2022-04-15 12:32:11,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:11,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:11,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:32:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:11,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {214#(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); {203#true} is VALID [2022-04-15 12:32:11,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {203#true} assume true; {203#true} is VALID [2022-04-15 12:32:11,890 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {203#true} {203#true} #60#return; {203#true} is VALID [2022-04-15 12:32:11,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {203#true} call ULTIMATE.init(); {214#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:32:11,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {214#(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); {203#true} is VALID [2022-04-15 12:32:11,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {203#true} assume true; {203#true} is VALID [2022-04-15 12:32:11,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {203#true} {203#true} #60#return; {203#true} is VALID [2022-04-15 12:32:11,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {203#true} call #t~ret5 := main(); {203#true} is VALID [2022-04-15 12:32:11,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {203#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {203#true} is VALID [2022-04-15 12:32:11,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {203#true} assume !!(~i~0 >= 0 && ~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0; {208#(and (<= 0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-15 12:32:11,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {208#(and (<= 0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} [64] L31-2-->L31-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_In_1 v_main_~y~0_Out_2))) (or (and .cse0 (= v_main_~x~0_In_1 v_main_~x~0_Out_2)) (and .cse0 (= |v_main_#t~post3_Out_2| 0) (= v_main_~x~0_Out_2 v_main_~x~0_In_1) (= v_main_~y~0_Out_2 0) (not (= (+ v_main_~x~0_Out_2 1) 0))))) InVars {main_~x~0=v_main_~x~0_In_1, main_~y~0=v_main_~y~0_In_1} OutVars{main_#t~post4=|v_main_#t~post4_Out_2|, main_~y~0=v_main_~y~0_Out_2, main_#t~post3=|v_main_#t~post3_Out_2|, main_~x~0=v_main_~x~0_Out_2} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post3] {209#(or (and (<= main_~y~0 main_~j~0) (= (+ main_~i~0 (* (- 1) main_~x~0)) 0) (< 0 (+ main_~y~0 1))) (= main_~y~0 0))} is VALID [2022-04-15 12:32:11,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {209#(or (and (<= main_~y~0 main_~j~0) (= (+ main_~i~0 (* (- 1) main_~x~0)) 0) (< 0 (+ main_~y~0 1))) (= main_~y~0 0))} [63] L31-3_primed-->L31-3: Formula: (= v_main_~x~0_2 0) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {210#(or (and (< 0 (+ main_~y~0 1)) (<= (+ main_~i~0 main_~y~0) main_~j~0)) (= main_~y~0 0))} is VALID [2022-04-15 12:32:11,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {210#(or (and (< 0 (+ main_~y~0 1)) (<= (+ main_~i~0 main_~y~0) main_~j~0)) (= main_~y~0 0))} assume ~i~0 == ~j~0; {211#(= main_~y~0 0)} is VALID [2022-04-15 12:32:11,895 INFO L272 TraceCheckUtils]: 10: Hoare triple {211#(= main_~y~0 0)} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {212#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:32:11,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {212#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {213#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:32:11,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {213#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {204#false} is VALID [2022-04-15 12:32:11,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {204#false} assume !false; {204#false} is VALID [2022-04-15 12:32:11,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:11,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:11,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101347469] [2022-04-15 12:32:11,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101347469] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:11,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:11,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:32:11,997 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:11,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2014072131] [2022-04-15 12:32:11,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2014072131] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:11,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:11,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:32:11,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060807127] [2022-04-15 12:32:11,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:12,000 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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 14 [2022-04-15 12:32:12,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:12,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:12,007 WARN L143 InductivityCheck]: Transition 215#(and (= (+ main_~x~0 1) main_~i~0) (<= (+ main_~y~0 1) main_~j~0) (not (= main_~i~0 0)) (<= 0 (+ main_~y~0 1))) ( _ , assume !(0 != ~x~0); , 210#(or (and (< 0 (+ main_~y~0 1)) (<= (+ main_~i~0 main_~y~0) main_~j~0)) (= main_~y~0 0)) ) not inductive [2022-04-15 12:32:12,008 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:32:12,008 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:682) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:547) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 12:32:12,015 INFO L158 Benchmark]: Toolchain (without parser) took 2609.94ms. Allocated memory was 177.2MB in the beginning and 212.9MB in the end (delta: 35.7MB). Free memory was 127.7MB in the beginning and 127.4MB in the end (delta: 222.4kB). Peak memory consumption was 36.9MB. Max. memory is 8.0GB. [2022-04-15 12:32:12,016 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 177.2MB. Free memory was 144.0MB in the beginning and 143.9MB in the end (delta: 136.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:32:12,017 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.90ms. Allocated memory is still 177.2MB. Free memory was 127.4MB in the beginning and 153.5MB in the end (delta: -26.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 12:32:12,018 INFO L158 Benchmark]: Boogie Preprocessor took 43.80ms. Allocated memory is still 177.2MB. Free memory was 153.5MB in the beginning and 152.1MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 12:32:12,022 INFO L158 Benchmark]: RCFGBuilder took 257.06ms. Allocated memory is still 177.2MB. Free memory was 152.1MB in the beginning and 140.9MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 12:32:12,023 INFO L158 Benchmark]: TraceAbstraction took 2102.76ms. Allocated memory was 177.2MB in the beginning and 212.9MB in the end (delta: 35.7MB). Free memory was 140.6MB in the beginning and 127.4MB in the end (delta: 13.1MB). Peak memory consumption was 49.5MB. Max. memory is 8.0GB. [2022-04-15 12:32:12,029 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.17ms. Allocated memory is still 177.2MB. Free memory was 144.0MB in the beginning and 143.9MB in the end (delta: 136.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 195.90ms. Allocated memory is still 177.2MB. Free memory was 127.4MB in the beginning and 153.5MB in the end (delta: -26.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.80ms. Allocated memory is still 177.2MB. Free memory was 153.5MB in the beginning and 152.1MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 257.06ms. Allocated memory is still 177.2MB. Free memory was 152.1MB in the beginning and 140.9MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2102.76ms. Allocated memory was 177.2MB in the beginning and 212.9MB in the end (delta: 35.7MB). Free memory was 140.6MB in the beginning and 127.4MB in the end (delta: 13.1MB). Peak memory consumption was 49.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 12:32:12,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...