/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-new/count_by_k.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:15:26,513 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:15:26,538 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:15:26,576 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:15:26,576 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:15:26,577 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:15:26,581 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:15:26,587 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:15:26,588 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:15:26,593 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:15:26,594 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:15:26,596 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:15:26,596 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:15:26,599 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:15:26,600 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:15:26,601 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:15:26,601 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:15:26,602 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:15:26,606 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:15:26,613 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:15:26,614 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:15:26,616 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:15:26,616 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:15:26,617 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:15:26,620 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:15:26,624 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:15:26,624 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:15:26,624 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:15:26,625 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:15:26,625 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:15:26,626 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:15:26,626 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:15:26,628 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:15:26,628 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:15:26,629 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:15:26,629 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:15:26,630 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:15:26,630 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:15:26,630 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:15:26,630 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:15:26,631 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:15:26,632 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:15:26,633 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:15:26,642 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:15:26,643 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:15:26,644 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:15:26,644 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:15:26,644 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:15:26,644 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:15:26,644 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:15:26,644 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:15:26,644 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:15:26,645 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:15:26,645 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:15:26,645 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:15:26,646 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:15:26,646 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:15:26,646 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:15:26,646 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:15:26,646 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:15:26,646 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:15:26,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:15:26,646 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:15:26,647 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:15:26,647 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:15:26,647 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:15:26,647 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:15:26,647 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:15:26,647 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:15:26,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:15:26,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:15:26,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:15:26,898 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:15:26,898 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:15:26,899 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/count_by_k.i [2022-04-28 03:15:26,952 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97ea748d3/6390d969e0ae4fa6afe702a3affc8f74/FLAG6649f7c62 [2022-04-28 03:15:27,267 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:15:27,268 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_k.i [2022-04-28 03:15:27,273 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97ea748d3/6390d969e0ae4fa6afe702a3affc8f74/FLAG6649f7c62 [2022-04-28 03:15:27,689 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97ea748d3/6390d969e0ae4fa6afe702a3affc8f74 [2022-04-28 03:15:27,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:15:27,692 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:15:27,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:15:27,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:15:27,697 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:15:27,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:15:27" (1/1) ... [2022-04-28 03:15:27,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@198b1a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:15:27, skipping insertion in model container [2022-04-28 03:15:27,699 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:15:27" (1/1) ... [2022-04-28 03:15:27,704 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:15:27,715 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:15:27,855 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-new/count_by_k.i[891,904] [2022-04-28 03:15:27,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:15:27,888 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:15:27,907 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-new/count_by_k.i[891,904] [2022-04-28 03:15:27,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:15:27,924 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:15:27,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:15:27 WrapperNode [2022-04-28 03:15:27,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:15:27,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:15:27,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:15:27,927 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:15:27,936 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:15:27" (1/1) ... [2022-04-28 03:15:27,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:15:27" (1/1) ... [2022-04-28 03:15:27,944 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:15:27" (1/1) ... [2022-04-28 03:15:27,944 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:15:27" (1/1) ... [2022-04-28 03:15:27,950 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:15:27" (1/1) ... [2022-04-28 03:15:27,957 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:15:27" (1/1) ... [2022-04-28 03:15:27,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:15:27" (1/1) ... [2022-04-28 03:15:27,970 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:15:27,971 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:15:27,971 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:15:27,971 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:15:27,972 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:15:27" (1/1) ... [2022-04-28 03:15:27,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:15:27,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:15:28,000 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:15:28,027 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:15:28,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:15:28,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:15:28,042 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:15:28,042 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 03:15:28,042 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:15:28,042 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:15:28,042 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:15:28,043 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:15:28,043 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 03:15:28,043 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 03:15:28,043 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:15:28,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:15:28,044 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 03:15:28,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:15:28,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 03:15:28,045 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:15:28,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:15:28,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:15:28,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:15:28,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:15:28,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:15:28,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:15:28,103 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:15:28,105 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:15:28,197 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:15:28,202 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:15:28,202 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 03:15:28,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:15:28 BoogieIcfgContainer [2022-04-28 03:15:28,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:15:28,206 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:15:28,206 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:15:28,221 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:15:28,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:15:27" (1/3) ... [2022-04-28 03:15:28,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a98d47e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:15:28, skipping insertion in model container [2022-04-28 03:15:28,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:15:27" (2/3) ... [2022-04-28 03:15:28,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a98d47e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:15:28, skipping insertion in model container [2022-04-28 03:15:28,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:15:28" (3/3) ... [2022-04-28 03:15:28,224 INFO L111 eAbstractionObserver]: Analyzing ICFG count_by_k.i [2022-04-28 03:15:28,235 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:15:28,235 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:15:28,274 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:15:28,294 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@ba32286, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2f6040fb [2022-04-28 03:15:28,294 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:15:28,310 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 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:15:28,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 03:15:28,317 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:15:28,318 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:15:28,318 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:15:28,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:15:28,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1676006891, now seen corresponding path program 1 times [2022-04-28 03:15:28,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:15:28,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1963867158] [2022-04-28 03:15:28,353 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:15:28,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1676006891, now seen corresponding path program 2 times [2022-04-28 03:15:28,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:15:28,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921593035] [2022-04-28 03:15:28,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:15:28,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:15:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:28,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:15:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:28,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {24#true} is VALID [2022-04-28 03:15:28,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 03:15:28,625 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #55#return; {24#true} is VALID [2022-04-28 03:15:28,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:15:28,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {24#true} is VALID [2022-04-28 03:15:28,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 03:15:28,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #55#return; {24#true} is VALID [2022-04-28 03:15:28,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret2 := main(); {24#true} is VALID [2022-04-28 03:15:28,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {24#true} is VALID [2022-04-28 03:15:28,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {29#(or (and (<= 0 main_~k~0) (= main_~i~0 0)) (= (* main_~k~0 1000000) main_~i~0))} is VALID [2022-04-28 03:15:28,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#(or (and (<= 0 main_~k~0) (= main_~i~0 0)) (= (* main_~k~0 1000000) main_~i~0))} assume !(~i~0 < 1000000 * ~k~0); {30#(= (* main_~k~0 1000000) main_~i~0)} is VALID [2022-04-28 03:15:28,630 INFO L272 TraceCheckUtils]: 8: Hoare triple {30#(= (* main_~k~0 1000000) main_~i~0)} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {31#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:15:28,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {32#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:15:28,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {25#false} is VALID [2022-04-28 03:15:28,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-28 03:15:28,632 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:15:28,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:15:28,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921593035] [2022-04-28 03:15:28,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921593035] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:15:28,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:15:28,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:15:28,635 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:15:28,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1963867158] [2022-04-28 03:15:28,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1963867158] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:15:28,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:15:28,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:15:28,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104273628] [2022-04-28 03:15:28,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:15:28,642 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 03:15:28,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:15:28,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:15:28,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:15:28,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:15:28,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:15:28,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:15:28,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:15:28,705 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 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 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:15:29,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:29,107 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-04-28 03:15:29,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:15:29,108 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 03:15:29,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:15:29,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:15:29,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2022-04-28 03:15:29,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:15:29,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2022-04-28 03:15:29,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 51 transitions. [2022-04-28 03:15:29,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:15:29,184 INFO L225 Difference]: With dead ends: 43 [2022-04-28 03:15:29,185 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 03:15:29,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:15:29,193 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 29 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:15:29,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 45 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:15:29,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 03:15:29,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-04-28 03:15:29,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:15:29,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 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-28 03:15:29,226 INFO L74 IsIncluded]: Start isIncluded. First operand 16 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-28 03:15:29,227 INFO L87 Difference]: Start difference. First operand 16 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-28 03:15:29,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:29,233 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 03:15:29,233 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 03:15:29,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:15:29,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:15:29,234 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 16 states. [2022-04-28 03:15:29,235 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 16 states. [2022-04-28 03:15:29,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:29,243 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 03:15:29,244 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 03:15:29,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:15:29,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:15:29,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:15:29,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:15:29,245 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-28 03:15:29,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-28 03:15:29,248 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2022-04-28 03:15:29,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:15:29,251 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-28 03:15:29,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:15:29,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-28 03:15:29,266 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-28 03:15:29,266 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 03:15:29,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 03:15:29,267 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:15:29,267 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:15:29,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:15:29,268 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:15:29,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:15:29,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1072109235, now seen corresponding path program 1 times [2022-04-28 03:15:29,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:15:29,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [469635157] [2022-04-28 03:15:33,707 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 03:15:38,032 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:15:42,206 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 03:15:42,495 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:15:42,499 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:15:42,504 INFO L85 PathProgramCache]: Analyzing trace with hash 562650993, now seen corresponding path program 1 times [2022-04-28 03:15:42,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:15:42,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686167190] [2022-04-28 03:15:42,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:15:42,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:15:42,534 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:15:42,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [60920819] [2022-04-28 03:15:42,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:15:42,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:15:42,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:15:42,543 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:15:42,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 03:15:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:42,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:15:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:42,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:15:44,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {194#true} call ULTIMATE.init(); {194#true} is VALID [2022-04-28 03:15:44,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {194#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {202#(= (select |#valid| 2) 1)} is VALID [2022-04-28 03:15:44,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {202#(= (select |#valid| 2) 1)} assume true; {202#(= (select |#valid| 2) 1)} is VALID [2022-04-28 03:15:44,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {202#(= (select |#valid| 2) 1)} {194#true} #55#return; {194#true} is VALID [2022-04-28 03:15:44,490 INFO L272 TraceCheckUtils]: 4: Hoare triple {194#true} call #t~ret2 := main(); {194#true} is VALID [2022-04-28 03:15:44,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {194#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {194#true} is VALID [2022-04-28 03:15:44,491 INFO L290 TraceCheckUtils]: 6: Hoare triple {194#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {218#(and (<= 0 main_~k~0) (= main_~i~0 0))} is VALID [2022-04-28 03:15:44,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {218#(and (<= 0 main_~k~0) (= main_~i~0 0))} [59] L29-3-->L29-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_10 v_main_~i~0_9)) (.cse1 (* v_main_~k~0_11 1000000))) (or (and .cse0 (<= .cse1 v_main_~i~0_10)) (and .cse0 (= v_main_~k~0_11 v_main_~k~0_11)) (and (let ((.cse2 (= v_main_~k~0_11 0))) (or (and .cse0 .cse2) (let ((.cse3 (+ (* v_main_~i~0_10 (- 1)) v_main_~i~0_9))) (and (= (mod .cse3 v_main_~k~0_11) 0) (forall ((v_it_1 Int)) (or (< (+ (* v_main_~k~0_11 v_it_1) v_main_~i~0_10) (* v_main_~k~0_11 1000000)) (not (<= (+ v_it_1 1) (div (+ (* v_main_~i~0_10 (- 1)) v_main_~i~0_9) v_main_~k~0_11))) (not (<= 1 v_it_1)))) (< 0 (div .cse3 v_main_~k~0_11)) (not .cse2))))) (< v_main_~i~0_10 .cse1)))) InVars {main_~i~0=v_main_~i~0_10, main_~k~0=v_main_~k~0_11} OutVars{main_~i~0=v_main_~i~0_9, main_~k~0=v_main_~k~0_11} AuxVars[] AssignedVars[main_~i~0] {222#(and (or (and (forall ((v_it_1 Int)) (or (< (* v_it_1 main_~k~0) (* main_~k~0 1000000)) (not (<= (+ v_it_1 1) (div main_~i~0 main_~k~0))))) (= (mod main_~i~0 main_~k~0) 0) (< 0 (div main_~i~0 main_~k~0))) (= main_~i~0 0)) (<= 0 main_~k~0))} is VALID [2022-04-28 03:15:44,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {222#(and (or (and (forall ((v_it_1 Int)) (or (< (* v_it_1 main_~k~0) (* main_~k~0 1000000)) (not (<= (+ v_it_1 1) (div main_~i~0 main_~k~0))))) (= (mod main_~i~0 main_~k~0) 0) (< 0 (div main_~i~0 main_~k~0))) (= main_~i~0 0)) (<= 0 main_~k~0))} [58] L29-4_primed-->L29-4: Formula: (not (< v_main_~i~0_3 (* v_main_~k~0_4 1000000))) InVars {main_~k~0=v_main_~k~0_4, main_~i~0=v_main_~i~0_3} OutVars{main_~k~0=v_main_~k~0_4, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[] {226#(and (<= 0 main_~k~0) (or (and (forall ((v_it_1 Int)) (or (< (* v_it_1 main_~k~0) (* main_~k~0 1000000)) (not (<= (+ v_it_1 1) (div main_~i~0 main_~k~0))))) (= (mod main_~i~0 main_~k~0) 0)) (= main_~i~0 0)) (not (< main_~i~0 (* main_~k~0 1000000))))} is VALID [2022-04-28 03:15:44,499 INFO L272 TraceCheckUtils]: 9: Hoare triple {226#(and (<= 0 main_~k~0) (or (and (forall ((v_it_1 Int)) (or (< (* v_it_1 main_~k~0) (* main_~k~0 1000000)) (not (<= (+ v_it_1 1) (div main_~i~0 main_~k~0))))) (= (mod main_~i~0 main_~k~0) 0)) (= main_~i~0 0)) (not (< main_~i~0 (* main_~k~0 1000000))))} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {230#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:15:44,500 INFO L290 TraceCheckUtils]: 10: Hoare triple {230#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {234#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:15:44,500 INFO L290 TraceCheckUtils]: 11: Hoare triple {234#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {195#false} is VALID [2022-04-28 03:15:44,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {195#false} assume !false; {195#false} is VALID [2022-04-28 03:15:44,501 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:15:44,502 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 03:15:44,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:15:44,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686167190] [2022-04-28 03:15:44,502 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:15:44,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60920819] [2022-04-28 03:15:44,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60920819] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:15:44,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:15:44,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:15:48,743 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:15:48,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [469635157] [2022-04-28 03:15:48,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [469635157] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:15:48,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:15:48,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:15:48,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632449534] [2022-04-28 03:15:48,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:15:48,745 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 2 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-28 03:15:48,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:15:48,746 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), 8 states have internal predecessors, (10), 2 states have call successors, (3), 2 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:15:48,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:15:48,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:15:48,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:15:48,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:15:48,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=68, Unknown=1, NotChecked=0, Total=90 [2022-04-28 03:15:48,777 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 2 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:15:49,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:49,132 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 03:15:49,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:15:49,132 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 2 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-28 03:15:49,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:15:49,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 2 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:15:49,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2022-04-28 03:15:49,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 2 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:15:49,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2022-04-28 03:15:49,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 15 transitions. [2022-04-28 03:15:51,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 14 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:15:51,163 INFO L225 Difference]: With dead ends: 15 [2022-04-28 03:15:51,163 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 03:15:51,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=29, Invalid=102, Unknown=1, NotChecked=0, Total=132 [2022-04-28 03:15:51,165 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 5 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:15:51,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 43 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 18 Unchecked, 0.0s Time] [2022-04-28 03:15:51,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 03:15:51,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 03:15:51,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:15:51,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 03:15:51,166 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 03:15:51,167 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 03:15:51,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:51,167 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 03:15:51,167 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:15:51,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:15:51,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:15:51,167 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 03:15:51,167 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 03:15:51,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:51,168 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 03:15:51,168 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:15:51,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:15:51,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:15:51,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:15:51,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:15:51,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 03:15:51,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 03:15:51,168 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-28 03:15:51,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:15:51,168 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 03:15:51,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 2 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:15:51,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 03:15:51,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:15:51,169 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:15:51,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:15:51,174 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 03:15:51,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 03:15:51,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:15:51,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 03:15:51,891 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-28 03:15:51,891 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-28 03:15:51,891 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-28 03:15:51,891 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-28 03:15:51,891 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-28 03:15:51,891 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-28 03:15:51,892 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-28 03:15:51,892 INFO L902 garLoopResultBuilder]: At program point L30(line 30) the Hoare annotation is: true [2022-04-28 03:15:51,892 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 32) the Hoare annotation is: true [2022-04-28 03:15:51,892 INFO L902 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: true [2022-04-28 03:15:51,892 INFO L895 garLoopResultBuilder]: At program point L29-2(line 29) the Hoare annotation is: (or (and (or (and (forall ((v_it_1 Int)) (or (< (* v_it_1 main_~k~0) (* main_~k~0 1000000)) (not (<= (+ v_it_1 1) (div main_~i~0 main_~k~0))))) (= (mod main_~i~0 main_~k~0) 0) (< 0 (div main_~i~0 main_~k~0))) (= main_~i~0 0)) (< main_~i~0 (* main_~k~0 1000000))) (not (= (select |#valid| 2) 1))) [2022-04-28 03:15:51,892 INFO L895 garLoopResultBuilder]: At program point L29-3(line 29) the Hoare annotation is: (or (and (<= 0 main_~k~0) (= main_~i~0 0)) (not (= (select |#valid| 2) 1)) (and (< main_~i~0 (* 1000001 main_~k~0)) (or (= main_~i~0 main_~k~0) (let ((.cse0 (+ (* (- 1) main_~k~0) main_~i~0))) (and (= (mod .cse0 main_~k~0) 0) (forall ((v_it_1 Int)) (or (< (* v_it_1 main_~k~0) (* main_~k~0 1000000)) (not (<= (+ v_it_1 1) (div (+ (* (- 1) main_~k~0) main_~i~0) main_~k~0))))) (< 0 (div .cse0 main_~k~0))))))) [2022-04-28 03:15:51,892 INFO L895 garLoopResultBuilder]: At program point L29-4(line 29) the Hoare annotation is: (or (not (= (select |#valid| 2) 1)) (= (* main_~k~0 1000000) main_~i~0)) [2022-04-28 03:15:51,893 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 24 32) the Hoare annotation is: true [2022-04-28 03:15:51,893 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 24 32) the Hoare annotation is: true [2022-04-28 03:15:51,893 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (= (select |#valid| 2) 1) [2022-04-28 03:15:51,893 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 03:15:51,893 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (= (select |#valid| 2) 1) [2022-04-28 03:15:51,893 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 03:15:51,893 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (= (select |#valid| 2) 1) [2022-04-28 03:15:51,893 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 03:15:51,893 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 03:15:51,893 INFO L895 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 03:15:51,893 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-28 03:15:51,894 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 03:15:51,894 INFO L895 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 03:15:51,894 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 03:15:51,894 INFO L895 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (and (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 03:15:51,897 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-28 03:15:51,898 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 03:15:51,901 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 03:15:51,902 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 03:15:51,903 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 03:15:51,903 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-28 03:15:51,903 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 03:15:51,903 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 03:15:51,907 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-28 03:15:54,049 INFO L163 areAnnotationChecker]: CFG has 24 edges. 23 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 03:15:54,053 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] [2022-04-28 03:15:54,054 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] [2022-04-28 03:15:54,056 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] [2022-04-28 03:15:54,056 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] [2022-04-28 03:15:54,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 03:15:54 BoogieIcfgContainer [2022-04-28 03:15:54,058 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 03:15:54,059 INFO L158 Benchmark]: Toolchain (without parser) took 26366.00ms. Allocated memory was 175.1MB in the beginning and 218.1MB in the end (delta: 43.0MB). Free memory was 126.0MB in the beginning and 146.2MB in the end (delta: -20.3MB). Peak memory consumption was 22.9MB. Max. memory is 8.0GB. [2022-04-28 03:15:54,060 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 175.1MB. Free memory was 142.0MB in the beginning and 141.9MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 03:15:54,061 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.32ms. Allocated memory is still 175.1MB. Free memory was 125.8MB in the beginning and 150.4MB in the end (delta: -24.6MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. [2022-04-28 03:15:54,061 INFO L158 Benchmark]: Boogie Preprocessor took 43.42ms. Allocated memory is still 175.1MB. Free memory was 150.4MB in the beginning and 149.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 03:15:54,062 INFO L158 Benchmark]: RCFGBuilder took 233.35ms. Allocated memory is still 175.1MB. Free memory was 148.7MB in the beginning and 138.4MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 03:15:54,062 INFO L158 Benchmark]: TraceAbstraction took 25852.40ms. Allocated memory was 175.1MB in the beginning and 218.1MB in the end (delta: 43.0MB). Free memory was 137.8MB in the beginning and 146.2MB in the end (delta: -8.4MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-04-28 03:15:54,065 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.11ms. Allocated memory is still 175.1MB. Free memory was 142.0MB in the beginning and 141.9MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 232.32ms. Allocated memory is still 175.1MB. Free memory was 125.8MB in the beginning and 150.4MB in the end (delta: -24.6MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.42ms. Allocated memory is still 175.1MB. Free memory was 150.4MB in the beginning and 149.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 233.35ms. Allocated memory is still 175.1MB. Free memory was 148.7MB in the beginning and 138.4MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 25852.40ms. Allocated memory was 175.1MB in the beginning and 218.1MB in the end (delta: 43.0MB). Free memory was 137.8MB in the beginning and 146.2MB in the end (delta: -8.4MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 88 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 18 IncrementalHoareTripleChecker+Unchecked, 62 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 81 IncrementalHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 26 mSDtfsCounter, 81 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 33 PreInvPairs, 48 NumberOfFragments, 191 HoareAnnotationTreeSize, 33 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 137 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 29]: Loop Invariant [2022-04-28 03:15:54,075 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] [2022-04-28 03:15:54,075 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] [2022-04-28 03:15:54,081 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] [2022-04-28 03:15:54,084 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] Derived loop invariant: ((0 <= k && i == 0) || !(\valid[2] == 1)) || (i < 1000001 * k && (i == k || (((-1 * k + i) % k == 0 && (forall v_it_1 : int :: v_it_1 * k < k * 1000000 || !(v_it_1 + 1 <= (-1 * k + i) / k))) && 0 < (-1 * k + i) / k))) - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-04-28 03:15:54,099 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...