/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/fragtest_simple.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:10:49,855 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:10:49,863 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:10:49,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:10:49,904 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:10:49,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:10:49,907 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:10:49,908 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:10:49,910 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:10:49,913 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:10:49,914 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:10:49,915 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:10:49,915 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:10:49,917 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:10:49,917 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:10:49,919 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:10:49,920 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:10:49,920 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:10:49,922 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:10:49,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:10:49,926 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:10:49,927 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:10:49,928 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:10:49,929 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:10:49,929 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:10:49,935 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:10:49,935 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:10:49,935 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:10:49,935 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:10:49,936 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:10:49,936 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:10:49,937 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:10:49,938 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:10:49,938 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:10:49,939 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:10:49,939 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:10:49,939 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:10:49,940 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:10:49,940 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:10:49,940 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:10:49,940 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:10:49,941 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:10:49,942 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:10:49,950 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:10:49,951 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:10:49,951 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:10:49,951 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:10:49,952 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:10:49,952 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:10:49,952 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:10:49,952 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:10:49,952 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:10:49,953 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:10:49,953 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:10:49,953 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:10:49,953 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:10:49,953 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:10:49,953 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:10:49,953 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:10:49,953 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:10:49,953 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:10:49,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:10:49,954 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:10:49,954 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:10:49,954 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:10:49,954 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:10:49,954 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:10:49,954 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:10:49,954 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 03:10:50,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:10:50,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:10:50,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:10:50,141 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:10:50,143 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:10:50,144 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/fragtest_simple.i [2022-04-28 03:10:50,184 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cd10130b/af5f836504e040da92c84c6e6994b277/FLAG56112ea60 [2022-04-28 03:10:50,557 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:10:50,557 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/fragtest_simple.i [2022-04-28 03:10:50,561 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cd10130b/af5f836504e040da92c84c6e6994b277/FLAG56112ea60 [2022-04-28 03:10:50,569 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cd10130b/af5f836504e040da92c84c6e6994b277 [2022-04-28 03:10:50,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:10:50,572 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:10:50,574 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:10:50,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:10:50,588 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:10:50,589 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:10:50" (1/1) ... [2022-04-28 03:10:50,590 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6435b315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:50, skipping insertion in model container [2022-04-28 03:10:50,590 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:10:50" (1/1) ... [2022-04-28 03:10:50,594 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:10:50,602 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:10:50,750 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/fragtest_simple.i[893,906] [2022-04-28 03:10:50,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:10:50,792 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:10:50,800 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/fragtest_simple.i[893,906] [2022-04-28 03:10:50,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:10:50,815 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:10:50,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:50 WrapperNode [2022-04-28 03:10:50,816 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:10:50,816 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:10:50,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:10:50,817 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:10:50,824 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:50" (1/1) ... [2022-04-28 03:10:50,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:50" (1/1) ... [2022-04-28 03:10:50,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:50" (1/1) ... [2022-04-28 03:10:50,831 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:50" (1/1) ... [2022-04-28 03:10:50,841 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:50" (1/1) ... [2022-04-28 03:10:50,844 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:50" (1/1) ... [2022-04-28 03:10:50,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:50" (1/1) ... [2022-04-28 03:10:50,846 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:10:50,846 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:10:50,846 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:10:50,846 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:10:50,852 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:50" (1/1) ... [2022-04-28 03:10:50,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:10:50,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:10:50,881 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 03:10:50,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 03:10:50,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:10:50,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:10:50,912 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:10:50,912 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 03:10:50,912 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:10:50,913 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:10:50,913 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:10:50,913 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:10:50,913 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 03:10:50,913 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 03:10:50,913 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:10:50,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:10:50,913 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 03:10:50,913 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:10:50,913 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 03:10:50,913 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:10:50,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:10:50,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:10:50,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:10:50,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:10:50,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:10:50,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:10:50,954 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:10:50,955 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:10:51,089 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:10:51,094 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:10:51,094 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-28 03:10:51,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:10:51 BoogieIcfgContainer [2022-04-28 03:10:51,095 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:10:51,096 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:10:51,096 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:10:51,098 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:10:51,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:10:50" (1/3) ... [2022-04-28 03:10:51,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@412aa7e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:10:51, skipping insertion in model container [2022-04-28 03:10:51,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:50" (2/3) ... [2022-04-28 03:10:51,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@412aa7e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:10:51, skipping insertion in model container [2022-04-28 03:10:51,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:10:51" (3/3) ... [2022-04-28 03:10:51,100 INFO L111 eAbstractionObserver]: Analyzing ICFG fragtest_simple.i [2022-04-28 03:10:51,109 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:10:51,109 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:10:51,145 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:10:51,149 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3d3a5fff, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@16ecb478 [2022-04-28 03:10:51,149 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:10:51,158 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:10:51,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 03:10:51,164 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:10:51,164 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:10:51,164 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:10:51,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:10:51,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1613859161, now seen corresponding path program 1 times [2022-04-28 03:10:51,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:51,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [369400216] [2022-04-28 03:10:51,189 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:10:51,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1613859161, now seen corresponding path program 2 times [2022-04-28 03:10:51,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:10:51,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448847690] [2022-04-28 03:10:51,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:51,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:10:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:51,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:10:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:51,338 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#(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); {31#true} is VALID [2022-04-28 03:10:51,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-28 03:10:51,340 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #90#return; {31#true} is VALID [2022-04-28 03:10:51,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:10:51,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#(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); {31#true} is VALID [2022-04-28 03:10:51,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-28 03:10:51,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #90#return; {31#true} is VALID [2022-04-28 03:10:51,342 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret4 := main(); {31#true} is VALID [2022-04-28 03:10:51,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} havoc ~i~0;havoc ~pvlen~0;havoc ~tmp___1~0;~k~0 := 0;havoc ~n~0;~i~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~pvlen~0 := #t~nondet1;havoc #t~nondet1; {31#true} is VALID [2022-04-28 03:10:51,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {31#true} assume !true; {32#false} is VALID [2022-04-28 03:10:51,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#false} assume !(~i~0 > ~pvlen~0); {32#false} is VALID [2022-04-28 03:10:51,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#false} ~i~0 := 0; {32#false} is VALID [2022-04-28 03:10:51,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} assume !true; {32#false} is VALID [2022-04-28 03:10:51,343 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#false} ~j~0 := 0;~n~0 := ~i~0; {32#false} is VALID [2022-04-28 03:10:51,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-28 03:10:51,343 INFO L272 TraceCheckUtils]: 12: Hoare triple {32#false} call __VERIFIER_assert((if ~k~0 >= 0 then 1 else 0)); {32#false} is VALID [2022-04-28 03:10:51,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-04-28 03:10:51,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-04-28 03:10:51,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-28 03:10:51,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:10:51,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:10:51,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448847690] [2022-04-28 03:10:51,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448847690] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:51,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:51,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:10:51,347 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:10:51,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [369400216] [2022-04-28 03:10:51,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [369400216] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:51,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:51,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:10:51,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043757344] [2022-04-28 03:10:51,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:10:51,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 03:10:51,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:10:51,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:51,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:51,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 03:10:51,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:51,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 03:10:51,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:10:51,415 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:51,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:51,474 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2022-04-28 03:10:51,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 03:10:51,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 03:10:51,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:10:51,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:51,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-04-28 03:10:51,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:51,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-04-28 03:10:51,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2022-04-28 03:10:51,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:51,553 INFO L225 Difference]: With dead ends: 48 [2022-04-28 03:10:51,553 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 03:10:51,555 INFO L412 NwaCegarLoop]: 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-28 03:10:51,560 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 33 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-28 03:10:51,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 33 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:10:51,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 03:10:51,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 03:10:51,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:10:51,583 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:10:51,583 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:10:51,583 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:10:51,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:51,585 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-28 03:10:51,585 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-28 03:10:51,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:51,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:51,586 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-28 03:10:51,586 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-28 03:10:51,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:51,588 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-28 03:10:51,588 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-28 03:10:51,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:51,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:51,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:10:51,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:10:51,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:10:51,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-04-28 03:10:51,592 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 16 [2022-04-28 03:10:51,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:10:51,592 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-04-28 03:10:51,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:51,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 26 transitions. [2022-04-28 03:10:51,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:51,616 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-28 03:10:51,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 03:10:51,616 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:10:51,616 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:10:51,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:10:51,617 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:10:51,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:10:51,618 INFO L85 PathProgramCache]: Analyzing trace with hash 20877373, now seen corresponding path program 1 times [2022-04-28 03:10:51,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:51,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [783889434] [2022-04-28 03:10:51,619 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:10:51,619 INFO L85 PathProgramCache]: Analyzing trace with hash 20877373, now seen corresponding path program 2 times [2022-04-28 03:10:51,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:10:51,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442928065] [2022-04-28 03:10:51,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:51,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:10:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:51,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:10:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:51,728 INFO L290 TraceCheckUtils]: 0: Hoare triple {235#(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); {227#true} is VALID [2022-04-28 03:10:51,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {227#true} assume true; {227#true} is VALID [2022-04-28 03:10:51,729 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {227#true} {227#true} #90#return; {227#true} is VALID [2022-04-28 03:10:51,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {227#true} call ULTIMATE.init(); {235#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:10:51,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {235#(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); {227#true} is VALID [2022-04-28 03:10:51,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {227#true} assume true; {227#true} is VALID [2022-04-28 03:10:51,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {227#true} {227#true} #90#return; {227#true} is VALID [2022-04-28 03:10:51,730 INFO L272 TraceCheckUtils]: 4: Hoare triple {227#true} call #t~ret4 := main(); {227#true} is VALID [2022-04-28 03:10:51,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {227#true} havoc ~i~0;havoc ~pvlen~0;havoc ~tmp___1~0;~k~0 := 0;havoc ~n~0;~i~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~pvlen~0 := #t~nondet1;havoc #t~nondet1; {232#(<= 0 main_~k~0)} is VALID [2022-04-28 03:10:51,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {232#(<= 0 main_~k~0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {232#(<= 0 main_~k~0)} is VALID [2022-04-28 03:10:51,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {232#(<= 0 main_~k~0)} assume !(0 != #t~nondet2 && ~i~0 <= 1000000);havoc #t~nondet2; {232#(<= 0 main_~k~0)} is VALID [2022-04-28 03:10:51,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {232#(<= 0 main_~k~0)} assume !(~i~0 > ~pvlen~0); {232#(<= 0 main_~k~0)} is VALID [2022-04-28 03:10:51,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {232#(<= 0 main_~k~0)} ~i~0 := 0; {232#(<= 0 main_~k~0)} is VALID [2022-04-28 03:10:51,733 INFO L290 TraceCheckUtils]: 10: Hoare triple {232#(<= 0 main_~k~0)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {232#(<= 0 main_~k~0)} is VALID [2022-04-28 03:10:51,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {232#(<= 0 main_~k~0)} assume !(0 != #t~nondet3 && ~i~0 <= 1000000);havoc #t~nondet3; {232#(<= 0 main_~k~0)} is VALID [2022-04-28 03:10:51,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {232#(<= 0 main_~k~0)} ~j~0 := 0;~n~0 := ~i~0; {232#(<= 0 main_~k~0)} is VALID [2022-04-28 03:10:51,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {232#(<= 0 main_~k~0)} assume !false; {232#(<= 0 main_~k~0)} is VALID [2022-04-28 03:10:51,735 INFO L272 TraceCheckUtils]: 14: Hoare triple {232#(<= 0 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 0 then 1 else 0)); {233#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:10:51,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {233#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {234#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:10:51,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {234#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {228#false} is VALID [2022-04-28 03:10:51,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {228#false} assume !false; {228#false} is VALID [2022-04-28 03:10:51,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:10:51,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:10:51,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442928065] [2022-04-28 03:10:51,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442928065] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:51,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:51,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:10:51,738 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:10:51,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [783889434] [2022-04-28 03:10:51,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [783889434] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:51,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:51,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:10:51,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952476936] [2022-04-28 03:10:51,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:10:51,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 03:10:51,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:10:51,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:51,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:51,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:10:51,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:51,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:10:51,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:10:51,761 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:51,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:51,969 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-28 03:10:51,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:10:51,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 03:10:51,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:10:51,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:51,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2022-04-28 03:10:52,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:52,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2022-04-28 03:10:52,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 35 transitions. [2022-04-28 03:10:52,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:52,041 INFO L225 Difference]: With dead ends: 32 [2022-04-28 03:10:52,041 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 03:10:52,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:10:52,042 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 30 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:10:52,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 38 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:10:52,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 03:10:52,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-04-28 03:10:52,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:10:52,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:10:52,053 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:10:52,054 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:10:52,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:52,055 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-28 03:10:52,055 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-28 03:10:52,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:52,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:52,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-04-28 03:10:52,056 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-04-28 03:10:52,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:52,057 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-28 03:10:52,057 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-28 03:10:52,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:52,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:52,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:10:52,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:10:52,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:10:52,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-04-28 03:10:52,060 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 18 [2022-04-28 03:10:52,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:10:52,060 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-04-28 03:10:52,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:52,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 32 transitions. [2022-04-28 03:10:52,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:52,088 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-28 03:10:52,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 03:10:52,088 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:10:52,088 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:10:52,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:10:52,089 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:10:52,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:10:52,089 INFO L85 PathProgramCache]: Analyzing trace with hash -295388463, now seen corresponding path program 1 times [2022-04-28 03:10:52,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:52,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [128873013] [2022-04-28 03:10:52,725 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=2, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:10:52,729 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:10:52,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1683713962, now seen corresponding path program 1 times [2022-04-28 03:10:52,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:10:52,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681396239] [2022-04-28 03:10:52,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:52,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:10:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:52,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:10:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:52,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {439#(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); {428#true} is VALID [2022-04-28 03:10:52,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {428#true} assume true; {428#true} is VALID [2022-04-28 03:10:52,852 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {428#true} {428#true} #90#return; {428#true} is VALID [2022-04-28 03:10:52,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {428#true} call ULTIMATE.init(); {439#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:10:52,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {439#(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); {428#true} is VALID [2022-04-28 03:10:52,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {428#true} assume true; {428#true} is VALID [2022-04-28 03:10:52,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {428#true} {428#true} #90#return; {428#true} is VALID [2022-04-28 03:10:52,853 INFO L272 TraceCheckUtils]: 4: Hoare triple {428#true} call #t~ret4 := main(); {428#true} is VALID [2022-04-28 03:10:52,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {428#true} havoc ~i~0;havoc ~pvlen~0;havoc ~tmp___1~0;~k~0 := 0;havoc ~n~0;~i~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~pvlen~0 := #t~nondet1;havoc #t~nondet1; {433#(= main_~k~0 0)} is VALID [2022-04-28 03:10:52,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {433#(= main_~k~0 0)} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {433#(= main_~k~0 0)} is VALID [2022-04-28 03:10:52,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {433#(= main_~k~0 0)} assume !(0 != #t~nondet2 && ~i~0 <= 1000000);havoc #t~nondet2; {433#(= main_~k~0 0)} is VALID [2022-04-28 03:10:52,857 INFO L290 TraceCheckUtils]: 8: Hoare triple {433#(= main_~k~0 0)} assume !(~i~0 > ~pvlen~0); {433#(= main_~k~0 0)} is VALID [2022-04-28 03:10:52,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {433#(= main_~k~0 0)} ~i~0 := 0; {434#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:10:52,858 INFO L290 TraceCheckUtils]: 10: Hoare triple {434#(and (= main_~k~0 0) (= main_~i~0 0))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {434#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:10:52,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {434#(and (= main_~k~0 0) (= main_~i~0 0))} assume !(0 != #t~nondet3 && ~i~0 <= 1000000);havoc #t~nondet3; {434#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:10:52,859 INFO L290 TraceCheckUtils]: 12: Hoare triple {434#(and (= main_~k~0 0) (= main_~i~0 0))} ~j~0 := 0;~n~0 := ~i~0; {435#(and (= main_~n~0 0) (= main_~k~0 0) (= main_~j~0 0))} is VALID [2022-04-28 03:10:52,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {435#(and (= main_~n~0 0) (= main_~k~0 0) (= main_~j~0 0))} [94] L45-2-->L46_primed: Formula: (let ((.cse0 (= v_main_~i~0_17 v_main_~i~0_16)) (.cse1 (= v_main_~k~0_11 v_main_~k~0_10)) (.cse2 (= v_main_~j~0_7 v_main_~j~0_6))) (or (and (= v_main_~n~0_5 v_main_~n~0_5) .cse0 .cse1 .cse2) (and (or (not (< (+ v_main_~j~0_7 1) v_main_~n~0_5)) (not (<= 0 v_main_~k~0_11))) .cse0 .cse1 .cse2) (let ((.cse3 (+ v_main_~k~0_11 v_main_~j~0_7))) (and (< v_main_~k~0_10 v_main_~k~0_11) (< .cse3 (+ v_main_~k~0_10 v_main_~n~0_5)) (= (+ v_main_~k~0_10 v_main_~j~0_6) .cse3) (= (+ v_main_~i~0_17 v_main_~k~0_10) (+ v_main_~i~0_16 v_main_~k~0_11)) (<= 0 (+ v_main_~k~0_10 1)))))) InVars {main_~i~0=v_main_~i~0_17, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_11, main_~j~0=v_main_~j~0_7} OutVars{main_~i~0=v_main_~i~0_16, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_10, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {436#(or (<= 1 main_~k~0) (= main_~k~0 0))} is VALID [2022-04-28 03:10:52,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {436#(or (<= 1 main_~k~0) (= main_~k~0 0))} [93] L46_primed-->L46: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {436#(or (<= 1 main_~k~0) (= main_~k~0 0))} is VALID [2022-04-28 03:10:52,862 INFO L272 TraceCheckUtils]: 15: Hoare triple {436#(or (<= 1 main_~k~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~k~0 >= 0 then 1 else 0)); {437#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:10:52,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {437#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {438#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:10:52,863 INFO L290 TraceCheckUtils]: 17: Hoare triple {438#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {429#false} is VALID [2022-04-28 03:10:52,863 INFO L290 TraceCheckUtils]: 18: Hoare triple {429#false} assume !false; {429#false} is VALID [2022-04-28 03:10:52,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:10:52,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:10:52,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681396239] [2022-04-28 03:10:52,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681396239] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:52,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:52,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:10:52,990 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:10:52,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [128873013] [2022-04-28 03:10:52,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [128873013] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:52,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:52,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 03:10:52,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769860941] [2022-04-28 03:10:52,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:10:52,992 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-04-28 03:10:52,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:10:52,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:10:53,010 WARN L143 InductivityCheck]: Transition 435#(and (= main_~n~0 0) (= main_~k~0 0) (= main_~j~0 0)) ( _ , call __VERIFIER_assert((if ~k~0 >= 0 then 1 else 0)); , 441#(and (= main_~n~0 0) (= main_~j~0 0) (= |__VERIFIER_assert_#in~cond| 1)) ) not inductive [2022-04-28 03:10:53,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 03:10:53,011 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:109) 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:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:564) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:437) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-28 03:10:53,019 INFO L158 Benchmark]: Toolchain (without parser) took 2446.96ms. Allocated memory was 221.2MB in the beginning and 282.1MB in the end (delta: 60.8MB). Free memory was 168.9MB in the beginning and 182.6MB in the end (delta: -13.7MB). Peak memory consumption was 48.0MB. Max. memory is 8.0GB. [2022-04-28 03:10:53,019 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 221.2MB. Free memory is still 185.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 03:10:53,020 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.29ms. Allocated memory is still 221.2MB. Free memory was 168.7MB in the beginning and 194.0MB in the end (delta: -25.2MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. [2022-04-28 03:10:53,020 INFO L158 Benchmark]: Boogie Preprocessor took 29.39ms. Allocated memory is still 221.2MB. Free memory was 194.0MB in the beginning and 192.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 03:10:53,020 INFO L158 Benchmark]: RCFGBuilder took 248.84ms. Allocated memory is still 221.2MB. Free memory was 192.4MB in the beginning and 180.3MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 03:10:53,020 INFO L158 Benchmark]: TraceAbstraction took 1921.93ms. Allocated memory was 221.2MB in the beginning and 282.1MB in the end (delta: 60.8MB). Free memory was 179.8MB in the beginning and 182.6MB in the end (delta: -2.8MB). Peak memory consumption was 59.1MB. Max. memory is 8.0GB. [2022-04-28 03:10:53,022 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.08ms. Allocated memory is still 221.2MB. Free memory is still 185.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 242.29ms. Allocated memory is still 221.2MB. Free memory was 168.7MB in the beginning and 194.0MB in the end (delta: -25.2MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.39ms. Allocated memory is still 221.2MB. Free memory was 194.0MB in the beginning and 192.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 248.84ms. Allocated memory is still 221.2MB. Free memory was 192.4MB in the beginning and 180.3MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1921.93ms. Allocated memory was 221.2MB in the beginning and 282.1MB in the end (delta: 60.8MB). Free memory was 179.8MB in the beginning and 182.6MB in the end (delta: -2.8MB). Peak memory consumption was 59.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-28 03:10:53,053 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...