/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-lit/gj2007b.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:40:33,874 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:40:33,876 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:40:33,924 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:40:33,924 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:40:33,925 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:40:33,925 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:40:33,927 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:40:33,936 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:40:33,937 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:40:33,937 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:40:33,938 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:40:33,938 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:40:33,939 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:40:33,939 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:40:33,940 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:40:33,940 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:40:33,941 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:40:33,942 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:40:33,943 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:40:33,944 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:40:33,944 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:40:33,945 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:40:33,945 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:40:33,946 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:40:33,947 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:40:33,947 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:40:33,948 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:40:33,948 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:40:33,948 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:40:33,949 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:40:33,949 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:40:33,949 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:40:33,950 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:40:33,950 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:40:33,951 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:40:33,951 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:40:33,951 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:40:33,951 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:40:33,952 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:40:33,952 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:40:33,953 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:40:33,953 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 09:40:33,958 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:40:33,959 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:40:33,959 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:40:33,959 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:40:33,960 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:40:33,960 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:40:33,960 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:40:33,960 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:40:33,960 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:40:33,960 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:40:33,960 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:40:33,960 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:40:33,961 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:40:33,961 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:40:33,961 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:40:33,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:40:33,961 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:40:33,961 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:40:33,961 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:40:33,961 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:40:33,962 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:40:33,962 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:40:33,962 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 09:40:34,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:40:34,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:40:34,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:40:34,136 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:40:34,136 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:40:34,137 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007b.i [2022-04-28 09:40:34,184 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b0e33b48/6f6507acf1b3433a89bf3ed733f1f5e7/FLAGfa0f9cb2f [2022-04-28 09:40:34,526 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:40:34,527 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007b.i [2022-04-28 09:40:34,533 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b0e33b48/6f6507acf1b3433a89bf3ed733f1f5e7/FLAGfa0f9cb2f [2022-04-28 09:40:34,546 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b0e33b48/6f6507acf1b3433a89bf3ed733f1f5e7 [2022-04-28 09:40:34,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:40:34,550 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:40:34,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:40:34,551 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:40:34,553 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:40:34,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:40:34" (1/1) ... [2022-04-28 09:40:34,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@375b9bbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:40:34, skipping insertion in model container [2022-04-28 09:40:34,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:40:34" (1/1) ... [2022-04-28 09:40:34,562 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:40:34,572 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:40:34,718 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007b.i[895,908] [2022-04-28 09:40:34,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:40:34,746 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:40:34,757 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007b.i[895,908] [2022-04-28 09:40:34,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:40:34,772 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:40:34,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:40:34 WrapperNode [2022-04-28 09:40:34,772 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:40:34,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:40:34,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:40:34,773 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:40:34,779 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:40:34" (1/1) ... [2022-04-28 09:40:34,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:40:34" (1/1) ... [2022-04-28 09:40:34,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:40:34" (1/1) ... [2022-04-28 09:40:34,784 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:40:34" (1/1) ... [2022-04-28 09:40:34,792 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:40:34" (1/1) ... [2022-04-28 09:40:34,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:40:34" (1/1) ... [2022-04-28 09:40:34,799 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:40:34" (1/1) ... [2022-04-28 09:40:34,803 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:40:34,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:40:34,805 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:40:34,805 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:40:34,806 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:40:34" (1/1) ... [2022-04-28 09:40:34,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:40:34,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:40:34,824 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 09:40:34,832 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 09:40:34,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:40:34,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:40:34,853 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:40:34,853 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 09:40:34,853 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:40:34,853 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:40:34,853 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:40:34,854 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:40:34,854 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 09:40:34,854 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 09:40:34,854 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:40:34,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:40:34,854 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 09:40:34,854 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:40:34,855 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 09:40:34,855 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:40:34,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:40:34,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:40:34,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:40:34,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:40:34,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:40:34,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:40:34,897 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:40:34,898 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:40:35,069 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:40:35,073 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:40:35,073 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 09:40:35,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:40:35 BoogieIcfgContainer [2022-04-28 09:40:35,075 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:40:35,076 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:40:35,076 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:40:35,078 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:40:35,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:40:34" (1/3) ... [2022-04-28 09:40:35,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23bf4603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:40:35, skipping insertion in model container [2022-04-28 09:40:35,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:40:34" (2/3) ... [2022-04-28 09:40:35,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23bf4603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:40:35, skipping insertion in model container [2022-04-28 09:40:35,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:40:35" (3/3) ... [2022-04-28 09:40:35,080 INFO L111 eAbstractionObserver]: Analyzing ICFG gj2007b.i [2022-04-28 09:40:35,088 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:40:35,088 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:40:35,142 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:40:35,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@4c3a768a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6dcda5b0 [2022-04-28 09:40:35,149 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:40:35,157 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 09:40:35,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 09:40:35,162 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:40:35,162 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:40:35,163 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:40:35,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:40:35,168 INFO L85 PathProgramCache]: Analyzing trace with hash -915508507, now seen corresponding path program 1 times [2022-04-28 09:40:35,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:40:35,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1999543325] [2022-04-28 09:40:35,187 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:40:35,187 INFO L85 PathProgramCache]: Analyzing trace with hash -915508507, now seen corresponding path program 2 times [2022-04-28 09:40:35,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:40:35,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394811420] [2022-04-28 09:40:35,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:40:35,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:40:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:40:35,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:40:35,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:40:35,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {25#true} is VALID [2022-04-28 09:40:35,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 09:40:35,316 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #60#return; {25#true} is VALID [2022-04-28 09:40:35,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:40:35,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {25#true} is VALID [2022-04-28 09:40:35,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 09:40:35,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #60#return; {25#true} is VALID [2022-04-28 09:40:35,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret3 := main(); {25#true} is VALID [2022-04-28 09:40:35,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {25#true} is VALID [2022-04-28 09:40:35,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-28 09:40:35,318 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {26#false} is VALID [2022-04-28 09:40:35,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-28 09:40:35,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-28 09:40:35,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-28 09:40:35,319 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 09:40:35,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:40:35,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394811420] [2022-04-28 09:40:35,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394811420] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:40:35,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:40:35,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:40:35,322 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:40:35,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1999543325] [2022-04-28 09:40:35,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1999543325] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:40:35,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:40:35,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:40:35,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531706399] [2022-04-28 09:40:35,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:40:35,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-28 09:40:35,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:40:35,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 09:40:35,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:40:35,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 09:40:35,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:40:35,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 09:40:35,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 09:40:35,362 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 09:40:35,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:40:35,417 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-28 09:40:35,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 09:40:35,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-28 09:40:35,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:40:35,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 09:40:35,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-28 09:40:35,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 09:40:35,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-28 09:40:35,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2022-04-28 09:40:35,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:40:35,469 INFO L225 Difference]: With dead ends: 35 [2022-04-28 09:40:35,469 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 09:40:35,471 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 09:40:35,473 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:40:35,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:40:35,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 09:40:35,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 09:40:35,491 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:40:35,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 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 09:40:35,492 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 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 09:40:35,492 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 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 09:40:35,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:40:35,494 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 09:40:35,494 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 09:40:35,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:40:35,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:40:35,495 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-04-28 09:40:35,495 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-04-28 09:40:35,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:40:35,497 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 09:40:35,497 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 09:40:35,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:40:35,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:40:35,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:40:35,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:40:35,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 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 09:40:35,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-28 09:40:35,499 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-28 09:40:35,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:40:35,500 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-28 09:40:35,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 09:40:35,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-28 09:40:35,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:40:35,518 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 09:40:35,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 09:40:35,518 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:40:35,518 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:40:35,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:40:35,518 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:40:35,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:40:35,519 INFO L85 PathProgramCache]: Analyzing trace with hash -925667238, now seen corresponding path program 1 times [2022-04-28 09:40:35,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:40:35,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1816881732] [2022-04-28 09:40:35,519 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:40:35,519 INFO L85 PathProgramCache]: Analyzing trace with hash -925667238, now seen corresponding path program 2 times [2022-04-28 09:40:35,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:40:35,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984220558] [2022-04-28 09:40:35,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:40:35,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:40:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:40:35,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:40:35,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:40:35,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {179#(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); {171#true} is VALID [2022-04-28 09:40:35,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#true} assume true; {171#true} is VALID [2022-04-28 09:40:35,651 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {171#true} {171#true} #60#return; {171#true} is VALID [2022-04-28 09:40:35,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {171#true} call ULTIMATE.init(); {179#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:40:35,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {179#(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); {171#true} is VALID [2022-04-28 09:40:35,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {171#true} assume true; {171#true} is VALID [2022-04-28 09:40:35,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171#true} {171#true} #60#return; {171#true} is VALID [2022-04-28 09:40:35,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {171#true} call #t~ret3 := main(); {171#true} is VALID [2022-04-28 09:40:35,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {171#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {176#(or (<= 0 main_~m~0) (<= main_~n~0 0))} is VALID [2022-04-28 09:40:35,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {176#(or (<= 0 main_~m~0) (<= main_~n~0 0))} assume !(~x~0 < ~n~0); {176#(or (<= 0 main_~m~0) (<= main_~n~0 0))} is VALID [2022-04-28 09:40:35,656 INFO L272 TraceCheckUtils]: 7: Hoare triple {176#(or (<= 0 main_~m~0) (<= main_~n~0 0))} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {177#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:40:35,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {177#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {178#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:40:35,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {178#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {172#false} is VALID [2022-04-28 09:40:35,659 INFO L290 TraceCheckUtils]: 10: Hoare triple {172#false} assume !false; {172#false} is VALID [2022-04-28 09:40:35,660 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 09:40:35,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:40:35,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984220558] [2022-04-28 09:40:35,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984220558] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:40:35,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:40:35,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:40:35,662 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:40:35,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1816881732] [2022-04-28 09:40:35,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1816881732] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:40:35,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:40:35,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:40:35,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666975437] [2022-04-28 09:40:35,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:40:35,664 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 11 [2022-04-28 09:40:35,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:40:35,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 09:40:35,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:40:35,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:40:35,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:40:35,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:40:35,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 09:40:35,675 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 09:40:35,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:40:35,847 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-28 09:40:35,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:40:35,847 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 11 [2022-04-28 09:40:35,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:40:35,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 09:40:35,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-28 09:40:35,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 09:40:35,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-28 09:40:35,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 32 transitions. [2022-04-28 09:40:35,881 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 09:40:35,883 INFO L225 Difference]: With dead ends: 28 [2022-04-28 09:40:35,883 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 09:40:35,884 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 09:40:35,886 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 27 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:40:35,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 32 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:40:35,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 09:40:35,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-28 09:40:35,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:40:35,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:40:35,904 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:40:35,905 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:40:35,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:40:35,907 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-28 09:40:35,908 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-28 09:40:35,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:40:35,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:40:35,908 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-28 09:40:35,908 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-28 09:40:35,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:40:35,912 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-28 09:40:35,912 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-28 09:40:35,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:40:35,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:40:35,913 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:40:35,913 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:40:35,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:40:35,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-28 09:40:35,915 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 11 [2022-04-28 09:40:35,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:40:35,915 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-28 09:40:35,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 09:40:35,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 29 transitions. [2022-04-28 09:40:35,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:40:35,939 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-28 09:40:35,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 09:40:35,939 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:40:35,940 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:40:35,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 09:40:35,942 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:40:35,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:40:35,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1147629988, now seen corresponding path program 1 times [2022-04-28 09:40:35,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:40:35,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1663395355] [2022-04-28 09:40:35,962 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:40:35,962 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:40:35,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1147629988, now seen corresponding path program 2 times [2022-04-28 09:40:35,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:40:35,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639625569] [2022-04-28 09:40:35,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:40:35,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:40:35,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:40:36,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:40:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:40:36,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {357#(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); {348#true} is VALID [2022-04-28 09:40:36,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {348#true} assume true; {348#true} is VALID [2022-04-28 09:40:36,061 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {348#true} {348#true} #60#return; {348#true} is VALID [2022-04-28 09:40:36,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {357#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:40:36,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {357#(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); {348#true} is VALID [2022-04-28 09:40:36,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {348#true} assume true; {348#true} is VALID [2022-04-28 09:40:36,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {348#true} {348#true} #60#return; {348#true} is VALID [2022-04-28 09:40:36,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {348#true} call #t~ret3 := main(); {348#true} is VALID [2022-04-28 09:40:36,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {348#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {353#(= main_~x~0 0)} is VALID [2022-04-28 09:40:36,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {353#(= main_~x~0 0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {353#(= main_~x~0 0)} is VALID [2022-04-28 09:40:36,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {353#(= main_~x~0 0)} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {354#(or (<= 0 main_~m~0) (<= main_~n~0 0))} is VALID [2022-04-28 09:40:36,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {354#(or (<= 0 main_~m~0) (<= main_~n~0 0))} ~x~0 := 1 + ~x~0; {354#(or (<= 0 main_~m~0) (<= main_~n~0 0))} is VALID [2022-04-28 09:40:36,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {354#(or (<= 0 main_~m~0) (<= main_~n~0 0))} assume !(~x~0 < ~n~0); {354#(or (<= 0 main_~m~0) (<= main_~n~0 0))} is VALID [2022-04-28 09:40:36,080 INFO L272 TraceCheckUtils]: 10: Hoare triple {354#(or (<= 0 main_~m~0) (<= main_~n~0 0))} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {355#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:40:36,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {355#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {356#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:40:36,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {356#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {349#false} is VALID [2022-04-28 09:40:36,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {349#false} assume !false; {349#false} is VALID [2022-04-28 09:40:36,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:40:36,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:40:36,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639625569] [2022-04-28 09:40:36,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639625569] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:40:36,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237859459] [2022-04-28 09:40:36,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:40:36,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:40:36,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:40:36,084 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 09:40:36,085 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 09:40:36,121 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:40:36,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:40:36,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 09:40:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:40:36,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:40:36,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {348#true} is VALID [2022-04-28 09:40:36,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {348#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); {348#true} is VALID [2022-04-28 09:40:36,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {348#true} assume true; {348#true} is VALID [2022-04-28 09:40:36,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {348#true} {348#true} #60#return; {348#true} is VALID [2022-04-28 09:40:36,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {348#true} call #t~ret3 := main(); {348#true} is VALID [2022-04-28 09:40:36,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {348#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {376#(<= 0 main_~x~0)} is VALID [2022-04-28 09:40:36,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {376#(<= 0 main_~x~0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {376#(<= 0 main_~x~0)} is VALID [2022-04-28 09:40:36,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {376#(<= 0 main_~x~0)} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {383#(<= 0 main_~m~0)} is VALID [2022-04-28 09:40:36,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {383#(<= 0 main_~m~0)} ~x~0 := 1 + ~x~0; {383#(<= 0 main_~m~0)} is VALID [2022-04-28 09:40:36,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {383#(<= 0 main_~m~0)} assume !(~x~0 < ~n~0); {383#(<= 0 main_~m~0)} is VALID [2022-04-28 09:40:36,345 INFO L272 TraceCheckUtils]: 10: Hoare triple {383#(<= 0 main_~m~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {393#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:40:36,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {393#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {397#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:40:36,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {397#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {349#false} is VALID [2022-04-28 09:40:36,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {349#false} assume !false; {349#false} is VALID [2022-04-28 09:40:36,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:40:36,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:40:36,480 INFO L290 TraceCheckUtils]: 13: Hoare triple {349#false} assume !false; {349#false} is VALID [2022-04-28 09:40:36,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {397#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {349#false} is VALID [2022-04-28 09:40:36,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {393#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {397#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:40:36,482 INFO L272 TraceCheckUtils]: 10: Hoare triple {383#(<= 0 main_~m~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {393#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:40:36,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {383#(<= 0 main_~m~0)} assume !(~x~0 < ~n~0); {383#(<= 0 main_~m~0)} is VALID [2022-04-28 09:40:36,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {383#(<= 0 main_~m~0)} ~x~0 := 1 + ~x~0; {383#(<= 0 main_~m~0)} is VALID [2022-04-28 09:40:36,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {376#(<= 0 main_~x~0)} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {383#(<= 0 main_~m~0)} is VALID [2022-04-28 09:40:36,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {376#(<= 0 main_~x~0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {376#(<= 0 main_~x~0)} is VALID [2022-04-28 09:40:36,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {348#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {376#(<= 0 main_~x~0)} is VALID [2022-04-28 09:40:36,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {348#true} call #t~ret3 := main(); {348#true} is VALID [2022-04-28 09:40:36,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {348#true} {348#true} #60#return; {348#true} is VALID [2022-04-28 09:40:36,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {348#true} assume true; {348#true} is VALID [2022-04-28 09:40:36,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {348#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); {348#true} is VALID [2022-04-28 09:40:36,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {348#true} is VALID [2022-04-28 09:40:36,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:40:36,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237859459] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:40:36,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:40:36,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2022-04-28 09:40:36,486 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:40:36,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1663395355] [2022-04-28 09:40:36,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1663395355] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:40:36,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:40:36,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:40:36,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863586682] [2022-04-28 09:40:36,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:40:36,487 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 09:40:36,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:40:36,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:40:36,498 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 09:40:36,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:40:36,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:40:36,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:40:36,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-28 09:40:36,499 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:40:36,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:40:36,717 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-28 09:40:36,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:40:36,718 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 09:40:36,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:40:36,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:40:36,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-28 09:40:36,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:40:36,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-28 09:40:36,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2022-04-28 09:40:36,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:40:36,759 INFO L225 Difference]: With dead ends: 42 [2022-04-28 09:40:36,759 INFO L226 Difference]: Without dead ends: 40 [2022-04-28 09:40:36,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-04-28 09:40:36,763 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 33 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:40:36,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 34 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:40:36,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-28 09:40:36,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. [2022-04-28 09:40:36,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:40:36,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 20 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:40:36,780 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 20 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:40:36,780 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 20 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:40:36,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:40:36,785 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-04-28 09:40:36,785 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-28 09:40:36,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:40:36,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:40:36,786 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 20 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 40 states. [2022-04-28 09:40:36,787 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 20 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 40 states. [2022-04-28 09:40:36,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:40:36,792 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-04-28 09:40:36,792 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-28 09:40:36,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:40:36,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:40:36,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:40:36,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:40:36,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 20 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:40:36,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-04-28 09:40:36,799 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 14 [2022-04-28 09:40:36,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:40:36,799 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-04-28 09:40:36,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:40:36,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 33 transitions. [2022-04-28 09:40:36,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:40:36,822 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-28 09:40:36,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 09:40:36,822 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:40:36,823 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:40:36,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 09:40:37,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:40:37,036 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:40:37,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:40:37,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1885482061, now seen corresponding path program 1 times [2022-04-28 09:40:37,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:40:37,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1154701103] [2022-04-28 09:40:37,037 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:40:37,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1885482061, now seen corresponding path program 2 times [2022-04-28 09:40:37,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:40:37,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133659869] [2022-04-28 09:40:37,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:40:37,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:40:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:40:37,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:40:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:40:37,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {686#(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); {673#true} is VALID [2022-04-28 09:40:37,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {673#true} assume true; {673#true} is VALID [2022-04-28 09:40:37,101 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {673#true} {673#true} #60#return; {673#true} is VALID [2022-04-28 09:40:37,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-28 09:40:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:40:37,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {673#true} ~cond := #in~cond; {673#true} is VALID [2022-04-28 09:40:37,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {673#true} assume !(0 == ~cond); {673#true} is VALID [2022-04-28 09:40:37,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {673#true} assume true; {673#true} is VALID [2022-04-28 09:40:37,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {673#true} {679#(<= main_~n~0 0)} #56#return; {679#(<= main_~n~0 0)} is VALID [2022-04-28 09:40:37,106 INFO L272 TraceCheckUtils]: 0: Hoare triple {673#true} call ULTIMATE.init(); {686#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:40:37,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {686#(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); {673#true} is VALID [2022-04-28 09:40:37,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {673#true} assume true; {673#true} is VALID [2022-04-28 09:40:37,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {673#true} {673#true} #60#return; {673#true} is VALID [2022-04-28 09:40:37,106 INFO L272 TraceCheckUtils]: 4: Hoare triple {673#true} call #t~ret3 := main(); {673#true} is VALID [2022-04-28 09:40:37,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {673#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {678#(= main_~x~0 0)} is VALID [2022-04-28 09:40:37,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {678#(= main_~x~0 0)} assume !(~x~0 < ~n~0); {679#(<= main_~n~0 0)} is VALID [2022-04-28 09:40:37,107 INFO L272 TraceCheckUtils]: 7: Hoare triple {679#(<= main_~n~0 0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {673#true} is VALID [2022-04-28 09:40:37,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {673#true} ~cond := #in~cond; {673#true} is VALID [2022-04-28 09:40:37,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {673#true} assume !(0 == ~cond); {673#true} is VALID [2022-04-28 09:40:37,107 INFO L290 TraceCheckUtils]: 10: Hoare triple {673#true} assume true; {673#true} is VALID [2022-04-28 09:40:37,108 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {673#true} {679#(<= main_~n~0 0)} #56#return; {679#(<= main_~n~0 0)} is VALID [2022-04-28 09:40:37,109 INFO L272 TraceCheckUtils]: 12: Hoare triple {679#(<= main_~n~0 0)} call __VERIFIER_assert((if ~m~0 < ~n~0 || ~n~0 <= 0 then 1 else 0)); {684#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:40:37,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {684#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {685#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:40:37,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {685#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {674#false} is VALID [2022-04-28 09:40:37,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {674#false} assume !false; {674#false} is VALID [2022-04-28 09:40:37,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:40:37,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:40:37,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133659869] [2022-04-28 09:40:37,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133659869] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:40:37,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:40:37,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:40:37,110 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:40:37,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1154701103] [2022-04-28 09:40:37,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1154701103] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:40:37,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:40:37,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:40:37,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472928165] [2022-04-28 09:40:37,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:40:37,111 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-04-28 09:40:37,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:40:37,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:40:37,125 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 09:40:37,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:40:37,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:40:37,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:40:37,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 09:40:37,126 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:40:37,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:40:37,264 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-04-28 09:40:37,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:40:37,264 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-04-28 09:40:37,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:40:37,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:40:37,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-28 09:40:37,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:40:37,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-28 09:40:37,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 32 transitions. [2022-04-28 09:40:37,290 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 09:40:37,292 INFO L225 Difference]: With dead ends: 40 [2022-04-28 09:40:37,292 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 09:40:37,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-28 09:40:37,294 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:40:37,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 34 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:40:37,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 09:40:37,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-04-28 09:40:37,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:40:37,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 27 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:40:37,306 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 27 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:40:37,307 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 27 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:40:37,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:40:37,308 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-04-28 09:40:37,308 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-04-28 09:40:37,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:40:37,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:40:37,308 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 28 states. [2022-04-28 09:40:37,308 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 28 states. [2022-04-28 09:40:37,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:40:37,309 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-04-28 09:40:37,309 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-04-28 09:40:37,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:40:37,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:40:37,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:40:37,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:40:37,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:40:37,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2022-04-28 09:40:37,310 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 16 [2022-04-28 09:40:37,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:40:37,311 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-04-28 09:40:37,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:40:37,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 32 transitions. [2022-04-28 09:40:37,334 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 09:40:37,334 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-04-28 09:40:37,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 09:40:37,335 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:40:37,335 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:40:37,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 09:40:37,335 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:40:37,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:40:37,335 INFO L85 PathProgramCache]: Analyzing trace with hash 820605978, now seen corresponding path program 3 times [2022-04-28 09:40:37,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:40:37,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [151042264] [2022-04-28 09:40:37,340 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:40:37,340 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:40:37,340 INFO L85 PathProgramCache]: Analyzing trace with hash 820605978, now seen corresponding path program 4 times [2022-04-28 09:40:37,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:40:37,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448735092] [2022-04-28 09:40:37,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:40:37,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:40:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:40:37,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:40:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:40:37,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {900#(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); {890#true} is VALID [2022-04-28 09:40:37,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {890#true} assume true; {890#true} is VALID [2022-04-28 09:40:37,389 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {890#true} {890#true} #60#return; {890#true} is VALID [2022-04-28 09:40:37,390 INFO L272 TraceCheckUtils]: 0: Hoare triple {890#true} call ULTIMATE.init(); {900#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:40:37,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {900#(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); {890#true} is VALID [2022-04-28 09:40:37,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {890#true} assume true; {890#true} is VALID [2022-04-28 09:40:37,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {890#true} {890#true} #60#return; {890#true} is VALID [2022-04-28 09:40:37,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {890#true} call #t~ret3 := main(); {890#true} is VALID [2022-04-28 09:40:37,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {890#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {895#(= main_~x~0 0)} is VALID [2022-04-28 09:40:37,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {895#(= main_~x~0 0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {895#(= main_~x~0 0)} is VALID [2022-04-28 09:40:37,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {895#(= main_~x~0 0)} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {895#(= main_~x~0 0)} is VALID [2022-04-28 09:40:37,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {895#(= main_~x~0 0)} ~x~0 := 1 + ~x~0; {896#(<= 1 main_~x~0)} is VALID [2022-04-28 09:40:37,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {896#(<= 1 main_~x~0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {896#(<= 1 main_~x~0)} is VALID [2022-04-28 09:40:37,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {896#(<= 1 main_~x~0)} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {897#(<= 1 main_~m~0)} is VALID [2022-04-28 09:40:37,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {897#(<= 1 main_~m~0)} ~x~0 := 1 + ~x~0; {897#(<= 1 main_~m~0)} is VALID [2022-04-28 09:40:37,392 INFO L290 TraceCheckUtils]: 12: Hoare triple {897#(<= 1 main_~m~0)} assume !(~x~0 < ~n~0); {897#(<= 1 main_~m~0)} is VALID [2022-04-28 09:40:37,393 INFO L272 TraceCheckUtils]: 13: Hoare triple {897#(<= 1 main_~m~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {898#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:40:37,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {898#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {899#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:40:37,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {899#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {891#false} is VALID [2022-04-28 09:40:37,394 INFO L290 TraceCheckUtils]: 16: Hoare triple {891#false} assume !false; {891#false} is VALID [2022-04-28 09:40:37,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:40:37,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:40:37,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448735092] [2022-04-28 09:40:37,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448735092] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:40:37,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882066773] [2022-04-28 09:40:37,394 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:40:37,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:40:37,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:40:37,414 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:40:37,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 09:40:37,439 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:40:37,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:40:37,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 09:40:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:40:37,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:40:37,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {890#true} call ULTIMATE.init(); {890#true} is VALID [2022-04-28 09:40:37,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {890#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); {890#true} is VALID [2022-04-28 09:40:37,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {890#true} assume true; {890#true} is VALID [2022-04-28 09:40:37,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {890#true} {890#true} #60#return; {890#true} is VALID [2022-04-28 09:40:37,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {890#true} call #t~ret3 := main(); {890#true} is VALID [2022-04-28 09:40:37,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {890#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {890#true} is VALID [2022-04-28 09:40:37,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {890#true} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {890#true} is VALID [2022-04-28 09:40:37,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {890#true} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {890#true} is VALID [2022-04-28 09:40:37,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {890#true} ~x~0 := 1 + ~x~0; {890#true} is VALID [2022-04-28 09:40:37,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {890#true} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {890#true} is VALID [2022-04-28 09:40:37,640 INFO L290 TraceCheckUtils]: 10: Hoare triple {890#true} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {934#(<= main_~x~0 main_~m~0)} is VALID [2022-04-28 09:40:37,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {934#(<= main_~x~0 main_~m~0)} ~x~0 := 1 + ~x~0; {938#(<= main_~x~0 (+ main_~m~0 1))} is VALID [2022-04-28 09:40:37,641 INFO L290 TraceCheckUtils]: 12: Hoare triple {938#(<= main_~x~0 (+ main_~m~0 1))} assume !(~x~0 < ~n~0); {942#(<= main_~n~0 (+ main_~m~0 1))} is VALID [2022-04-28 09:40:37,641 INFO L272 TraceCheckUtils]: 13: Hoare triple {942#(<= main_~n~0 (+ main_~m~0 1))} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {946#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:40:37,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {946#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {950#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:40:37,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {950#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {891#false} is VALID [2022-04-28 09:40:37,642 INFO L290 TraceCheckUtils]: 16: Hoare triple {891#false} assume !false; {891#false} is VALID [2022-04-28 09:40:37,642 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 09:40:37,642 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 09:40:37,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882066773] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:40:37,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 09:40:37,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-04-28 09:40:37,643 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:40:37,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [151042264] [2022-04-28 09:40:37,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [151042264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:40:37,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:40:37,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:40:37,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722515889] [2022-04-28 09:40:37,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:40:37,644 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 17 [2022-04-28 09:40:37,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:40:37,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 09:40:37,653 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 09:40:37,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:40:37,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:40:37,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:40:37,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-04-28 09:40:37,654 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 09:40:37,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:40:37,800 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2022-04-28 09:40:37,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:40:37,800 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 17 [2022-04-28 09:40:37,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:40:37,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 09:40:37,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-28 09:40:37,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 09:40:37,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-28 09:40:37,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2022-04-28 09:40:37,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:40:37,826 INFO L225 Difference]: With dead ends: 48 [2022-04-28 09:40:37,826 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 09:40:37,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-04-28 09:40:37,827 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 10 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:40:37,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 65 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:40:37,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 09:40:37,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 29. [2022-04-28 09:40:37,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:40:37,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 29 states, 20 states have (on average 1.35) internal successors, (27), 22 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:40:37,847 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 29 states, 20 states have (on average 1.35) internal successors, (27), 22 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:40:37,847 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 29 states, 20 states have (on average 1.35) internal successors, (27), 22 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:40:37,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:40:37,848 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-04-28 09:40:37,848 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-04-28 09:40:37,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:40:37,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:40:37,849 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 20 states have (on average 1.35) internal successors, (27), 22 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 46 states. [2022-04-28 09:40:37,849 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.35) internal successors, (27), 22 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 46 states. [2022-04-28 09:40:37,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:40:37,850 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-04-28 09:40:37,850 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-04-28 09:40:37,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:40:37,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:40:37,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:40:37,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:40:37,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.35) internal successors, (27), 22 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:40:37,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-04-28 09:40:37,851 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 17 [2022-04-28 09:40:37,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:40:37,851 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-04-28 09:40:37,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 09:40:37,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 35 transitions. [2022-04-28 09:40:37,879 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 09:40:37,879 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-28 09:40:37,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 09:40:37,880 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:40:37,880 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:40:37,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 09:40:38,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:40:38,098 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:40:38,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:40:38,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1672024233, now seen corresponding path program 1 times [2022-04-28 09:40:38,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:40:38,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2032319468] [2022-04-28 09:40:38,107 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:40:38,107 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:40:38,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1672024233, now seen corresponding path program 2 times [2022-04-28 09:40:38,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:40:38,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324819161] [2022-04-28 09:40:38,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:40:38,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:40:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:40:38,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:40:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:40:38,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {1219#(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); {1206#true} is VALID [2022-04-28 09:40:38,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {1206#true} assume true; {1206#true} is VALID [2022-04-28 09:40:38,157 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1206#true} {1206#true} #60#return; {1206#true} is VALID [2022-04-28 09:40:38,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-28 09:40:38,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:40:38,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {1206#true} ~cond := #in~cond; {1206#true} is VALID [2022-04-28 09:40:38,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {1206#true} assume !(0 == ~cond); {1206#true} is VALID [2022-04-28 09:40:38,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {1206#true} assume true; {1206#true} is VALID [2022-04-28 09:40:38,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1206#true} {1212#(= main_~m~0 0)} #56#return; {1212#(= main_~m~0 0)} is VALID [2022-04-28 09:40:38,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {1206#true} call ULTIMATE.init(); {1219#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:40:38,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {1219#(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); {1206#true} is VALID [2022-04-28 09:40:38,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {1206#true} assume true; {1206#true} is VALID [2022-04-28 09:40:38,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1206#true} {1206#true} #60#return; {1206#true} is VALID [2022-04-28 09:40:38,190 INFO L272 TraceCheckUtils]: 4: Hoare triple {1206#true} call #t~ret3 := main(); {1206#true} is VALID [2022-04-28 09:40:38,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {1206#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1211#(= main_~x~0 0)} is VALID [2022-04-28 09:40:38,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {1211#(= main_~x~0 0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1211#(= main_~x~0 0)} is VALID [2022-04-28 09:40:38,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {1211#(= main_~x~0 0)} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {1212#(= main_~m~0 0)} is VALID [2022-04-28 09:40:38,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {1212#(= main_~m~0 0)} ~x~0 := 1 + ~x~0; {1212#(= main_~m~0 0)} is VALID [2022-04-28 09:40:38,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {1212#(= main_~m~0 0)} assume !(~x~0 < ~n~0); {1212#(= main_~m~0 0)} is VALID [2022-04-28 09:40:38,191 INFO L272 TraceCheckUtils]: 10: Hoare triple {1212#(= main_~m~0 0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {1206#true} is VALID [2022-04-28 09:40:38,191 INFO L290 TraceCheckUtils]: 11: Hoare triple {1206#true} ~cond := #in~cond; {1206#true} is VALID [2022-04-28 09:40:38,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {1206#true} assume !(0 == ~cond); {1206#true} is VALID [2022-04-28 09:40:38,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {1206#true} assume true; {1206#true} is VALID [2022-04-28 09:40:38,192 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1206#true} {1212#(= main_~m~0 0)} #56#return; {1212#(= main_~m~0 0)} is VALID [2022-04-28 09:40:38,192 INFO L272 TraceCheckUtils]: 15: Hoare triple {1212#(= main_~m~0 0)} call __VERIFIER_assert((if ~m~0 < ~n~0 || ~n~0 <= 0 then 1 else 0)); {1217#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:40:38,192 INFO L290 TraceCheckUtils]: 16: Hoare triple {1217#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1218#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:40:38,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {1218#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1207#false} is VALID [2022-04-28 09:40:38,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {1207#false} assume !false; {1207#false} is VALID [2022-04-28 09:40:38,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:40:38,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:40:38,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324819161] [2022-04-28 09:40:38,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324819161] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:40:38,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440023534] [2022-04-28 09:40:38,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:40:38,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:40:38,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:40:38,200 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:40:38,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 09:40:38,242 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:40:38,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:40:38,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 09:40:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:40:38,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:40:38,366 INFO L272 TraceCheckUtils]: 0: Hoare triple {1206#true} call ULTIMATE.init(); {1206#true} is VALID [2022-04-28 09:40:38,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {1206#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); {1206#true} is VALID [2022-04-28 09:40:38,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {1206#true} assume true; {1206#true} is VALID [2022-04-28 09:40:38,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1206#true} {1206#true} #60#return; {1206#true} is VALID [2022-04-28 09:40:38,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {1206#true} call #t~ret3 := main(); {1206#true} is VALID [2022-04-28 09:40:38,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {1206#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1206#true} is VALID [2022-04-28 09:40:38,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {1206#true} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1241#(< main_~x~0 main_~n~0)} is VALID [2022-04-28 09:40:38,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {1241#(< main_~x~0 main_~n~0)} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {1245#(< main_~m~0 main_~n~0)} is VALID [2022-04-28 09:40:38,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {1245#(< main_~m~0 main_~n~0)} ~x~0 := 1 + ~x~0; {1245#(< main_~m~0 main_~n~0)} is VALID [2022-04-28 09:40:38,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {1245#(< main_~m~0 main_~n~0)} assume !(~x~0 < ~n~0); {1245#(< main_~m~0 main_~n~0)} is VALID [2022-04-28 09:40:38,368 INFO L272 TraceCheckUtils]: 10: Hoare triple {1245#(< main_~m~0 main_~n~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {1206#true} is VALID [2022-04-28 09:40:38,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {1206#true} ~cond := #in~cond; {1206#true} is VALID [2022-04-28 09:40:38,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {1206#true} assume !(0 == ~cond); {1206#true} is VALID [2022-04-28 09:40:38,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {1206#true} assume true; {1206#true} is VALID [2022-04-28 09:40:38,369 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1206#true} {1245#(< main_~m~0 main_~n~0)} #56#return; {1245#(< main_~m~0 main_~n~0)} is VALID [2022-04-28 09:40:38,369 INFO L272 TraceCheckUtils]: 15: Hoare triple {1245#(< main_~m~0 main_~n~0)} call __VERIFIER_assert((if ~m~0 < ~n~0 || ~n~0 <= 0 then 1 else 0)); {1270#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:40:38,370 INFO L290 TraceCheckUtils]: 16: Hoare triple {1270#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1274#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:40:38,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {1274#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1207#false} is VALID [2022-04-28 09:40:38,370 INFO L290 TraceCheckUtils]: 18: Hoare triple {1207#false} assume !false; {1207#false} is VALID [2022-04-28 09:40:38,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:40:38,370 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 09:40:38,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440023534] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:40:38,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 09:40:38,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2022-04-28 09:40:38,371 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:40:38,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2032319468] [2022-04-28 09:40:38,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2032319468] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:40:38,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:40:38,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:40:38,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656991969] [2022-04-28 09:40:38,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:40:38,371 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-04-28 09:40:38,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:40:38,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:40:38,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:40:38,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:40:38,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:40:38,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:40:38,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-04-28 09:40:38,384 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:40:38,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:40:38,502 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2022-04-28 09:40:38,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:40:38,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-04-28 09:40:38,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:40:38,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:40:38,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-28 09:40:38,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:40:38,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-28 09:40:38,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 32 transitions. [2022-04-28 09:40:38,524 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 09:40:38,525 INFO L225 Difference]: With dead ends: 40 [2022-04-28 09:40:38,525 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 09:40:38,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-28 09:40:38,525 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 9 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:40:38,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 72 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:40:38,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 09:40:38,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-28 09:40:38,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:40:38,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:40:38,555 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:40:38,556 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:40:38,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:40:38,556 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-28 09:40:38,556 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-28 09:40:38,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:40:38,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:40:38,557 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 30 states. [2022-04-28 09:40:38,557 INFO L87 Difference]: Start difference. First operand has 30 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 30 states. [2022-04-28 09:40:38,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:40:38,557 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-28 09:40:38,558 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-28 09:40:38,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:40:38,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:40:38,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:40:38,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:40:38,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:40:38,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-04-28 09:40:38,559 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 19 [2022-04-28 09:40:38,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:40:38,559 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-04-28 09:40:38,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:40:38,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 35 transitions. [2022-04-28 09:40:38,588 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 09:40:38,588 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-28 09:40:38,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 09:40:38,588 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:40:38,588 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:40:38,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 09:40:38,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:40:38,795 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:40:38,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:40:38,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1930189671, now seen corresponding path program 1 times [2022-04-28 09:40:38,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:40:38,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1940265875] [2022-04-28 09:40:38,801 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:40:38,801 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:40:38,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1930189671, now seen corresponding path program 2 times [2022-04-28 09:40:38,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:40:38,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722728576] [2022-04-28 09:40:38,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:40:38,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:40:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:40:38,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:40:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:40:38,833 INFO L290 TraceCheckUtils]: 0: Hoare triple {1496#(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); {1484#true} is VALID [2022-04-28 09:40:38,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {1484#true} assume true; {1484#true} is VALID [2022-04-28 09:40:38,834 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1484#true} {1484#true} #60#return; {1484#true} is VALID [2022-04-28 09:40:38,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-28 09:40:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:40:38,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {1484#true} ~cond := #in~cond; {1484#true} is VALID [2022-04-28 09:40:38,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {1484#true} assume !(0 == ~cond); {1484#true} is VALID [2022-04-28 09:40:38,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {1484#true} assume true; {1484#true} is VALID [2022-04-28 09:40:38,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1484#true} {1489#(= main_~m~0 0)} #56#return; {1489#(= main_~m~0 0)} is VALID [2022-04-28 09:40:38,838 INFO L272 TraceCheckUtils]: 0: Hoare triple {1484#true} call ULTIMATE.init(); {1496#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:40:38,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {1496#(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); {1484#true} is VALID [2022-04-28 09:40:38,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {1484#true} assume true; {1484#true} is VALID [2022-04-28 09:40:38,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1484#true} {1484#true} #60#return; {1484#true} is VALID [2022-04-28 09:40:38,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {1484#true} call #t~ret3 := main(); {1484#true} is VALID [2022-04-28 09:40:38,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {1484#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1489#(= main_~m~0 0)} is VALID [2022-04-28 09:40:38,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {1489#(= main_~m~0 0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1489#(= main_~m~0 0)} is VALID [2022-04-28 09:40:38,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {1489#(= main_~m~0 0)} assume !(0 != #t~nondet2);havoc #t~nondet2; {1489#(= main_~m~0 0)} is VALID [2022-04-28 09:40:38,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {1489#(= main_~m~0 0)} ~x~0 := 1 + ~x~0; {1489#(= main_~m~0 0)} is VALID [2022-04-28 09:40:38,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {1489#(= main_~m~0 0)} assume !(~x~0 < ~n~0); {1489#(= main_~m~0 0)} is VALID [2022-04-28 09:40:38,840 INFO L272 TraceCheckUtils]: 10: Hoare triple {1489#(= main_~m~0 0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {1484#true} is VALID [2022-04-28 09:40:38,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {1484#true} ~cond := #in~cond; {1484#true} is VALID [2022-04-28 09:40:38,840 INFO L290 TraceCheckUtils]: 12: Hoare triple {1484#true} assume !(0 == ~cond); {1484#true} is VALID [2022-04-28 09:40:38,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {1484#true} assume true; {1484#true} is VALID [2022-04-28 09:40:38,840 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1484#true} {1489#(= main_~m~0 0)} #56#return; {1489#(= main_~m~0 0)} is VALID [2022-04-28 09:40:38,841 INFO L272 TraceCheckUtils]: 15: Hoare triple {1489#(= main_~m~0 0)} call __VERIFIER_assert((if ~m~0 < ~n~0 || ~n~0 <= 0 then 1 else 0)); {1494#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:40:38,841 INFO L290 TraceCheckUtils]: 16: Hoare triple {1494#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1495#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:40:38,841 INFO L290 TraceCheckUtils]: 17: Hoare triple {1495#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1485#false} is VALID [2022-04-28 09:40:38,841 INFO L290 TraceCheckUtils]: 18: Hoare triple {1485#false} assume !false; {1485#false} is VALID [2022-04-28 09:40:38,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 09:40:38,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:40:38,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722728576] [2022-04-28 09:40:38,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722728576] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:40:38,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:40:38,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:40:38,842 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:40:38,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1940265875] [2022-04-28 09:40:38,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1940265875] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:40:38,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:40:38,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:40:38,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800754649] [2022-04-28 09:40:38,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:40:38,843 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-04-28 09:40:38,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:40:38,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:40:38,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:40:38,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:40:38,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:40:38,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:40:38,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 09:40:38,853 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:40:38,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:40:38,997 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-28 09:40:38,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 09:40:38,998 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-04-28 09:40:38,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:40:38,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:40:38,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-28 09:40:38,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:40:39,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-28 09:40:39,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 28 transitions. [2022-04-28 09:40:39,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:40:39,019 INFO L225 Difference]: With dead ends: 34 [2022-04-28 09:40:39,019 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 09:40:39,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 09:40:39,020 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 21 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:40:39,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 34 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:40:39,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 09:40:39,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2022-04-28 09:40:39,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:40:39,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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 09:40:39,035 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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 09:40:39,036 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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 09:40:39,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:40:39,036 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-28 09:40:39,036 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-28 09:40:39,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:40:39,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:40:39,036 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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 24 states. [2022-04-28 09:40:39,037 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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 24 states. [2022-04-28 09:40:39,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:40:39,037 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-28 09:40:39,037 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-28 09:40:39,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:40:39,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:40:39,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:40:39,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:40:39,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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 09:40:39,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-04-28 09:40:39,038 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 19 [2022-04-28 09:40:39,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:40:39,038 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-04-28 09:40:39,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:40:39,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 24 transitions. [2022-04-28 09:40:39,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:40:39,056 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-28 09:40:39,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 09:40:39,056 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:40:39,056 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:40:39,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 09:40:39,056 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:40:39,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:40:39,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1209158758, now seen corresponding path program 1 times [2022-04-28 09:40:39,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:40:39,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [664045586] [2022-04-28 09:40:39,064 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:40:39,065 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:40:39,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1209158758, now seen corresponding path program 2 times [2022-04-28 09:40:39,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:40:39,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203399025] [2022-04-28 09:40:39,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:40:39,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:40:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:40:39,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:40:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:40:39,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {1674#(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); {1664#true} is VALID [2022-04-28 09:40:39,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {1664#true} assume true; {1664#true} is VALID [2022-04-28 09:40:39,109 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1664#true} {1664#true} #60#return; {1664#true} is VALID [2022-04-28 09:40:39,110 INFO L272 TraceCheckUtils]: 0: Hoare triple {1664#true} call ULTIMATE.init(); {1674#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:40:39,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {1674#(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); {1664#true} is VALID [2022-04-28 09:40:39,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {1664#true} assume true; {1664#true} is VALID [2022-04-28 09:40:39,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1664#true} {1664#true} #60#return; {1664#true} is VALID [2022-04-28 09:40:39,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {1664#true} call #t~ret3 := main(); {1664#true} is VALID [2022-04-28 09:40:39,110 INFO L290 TraceCheckUtils]: 5: Hoare triple {1664#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1669#(= main_~x~0 0)} is VALID [2022-04-28 09:40:39,111 INFO L290 TraceCheckUtils]: 6: Hoare triple {1669#(= main_~x~0 0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1669#(= main_~x~0 0)} is VALID [2022-04-28 09:40:39,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {1669#(= main_~x~0 0)} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {1669#(= main_~x~0 0)} is VALID [2022-04-28 09:40:39,111 INFO L290 TraceCheckUtils]: 8: Hoare triple {1669#(= main_~x~0 0)} ~x~0 := 1 + ~x~0; {1670#(<= 1 main_~x~0)} is VALID [2022-04-28 09:40:39,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {1670#(<= 1 main_~x~0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1670#(<= 1 main_~x~0)} is VALID [2022-04-28 09:40:39,112 INFO L290 TraceCheckUtils]: 10: Hoare triple {1670#(<= 1 main_~x~0)} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {1671#(<= 1 main_~m~0)} is VALID [2022-04-28 09:40:39,112 INFO L290 TraceCheckUtils]: 11: Hoare triple {1671#(<= 1 main_~m~0)} ~x~0 := 1 + ~x~0; {1671#(<= 1 main_~m~0)} is VALID [2022-04-28 09:40:39,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {1671#(<= 1 main_~m~0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1671#(<= 1 main_~m~0)} is VALID [2022-04-28 09:40:39,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {1671#(<= 1 main_~m~0)} assume !(0 != #t~nondet2);havoc #t~nondet2; {1671#(<= 1 main_~m~0)} is VALID [2022-04-28 09:40:39,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {1671#(<= 1 main_~m~0)} ~x~0 := 1 + ~x~0; {1671#(<= 1 main_~m~0)} is VALID [2022-04-28 09:40:39,113 INFO L290 TraceCheckUtils]: 15: Hoare triple {1671#(<= 1 main_~m~0)} assume !(~x~0 < ~n~0); {1671#(<= 1 main_~m~0)} is VALID [2022-04-28 09:40:39,114 INFO L272 TraceCheckUtils]: 16: Hoare triple {1671#(<= 1 main_~m~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {1672#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:40:39,114 INFO L290 TraceCheckUtils]: 17: Hoare triple {1672#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1673#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:40:39,114 INFO L290 TraceCheckUtils]: 18: Hoare triple {1673#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1665#false} is VALID [2022-04-28 09:40:39,114 INFO L290 TraceCheckUtils]: 19: Hoare triple {1665#false} assume !false; {1665#false} is VALID [2022-04-28 09:40:39,114 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 09:40:39,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:40:39,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203399025] [2022-04-28 09:40:39,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203399025] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:40:39,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304132904] [2022-04-28 09:40:39,115 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:40:39,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:40:39,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:40:39,116 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:40:39,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 09:40:39,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:40:39,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:40:39,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 09:40:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:40:39,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:40:39,253 INFO L272 TraceCheckUtils]: 0: Hoare triple {1664#true} call ULTIMATE.init(); {1664#true} is VALID [2022-04-28 09:40:39,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {1664#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); {1664#true} is VALID [2022-04-28 09:40:39,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {1664#true} assume true; {1664#true} is VALID [2022-04-28 09:40:39,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1664#true} {1664#true} #60#return; {1664#true} is VALID [2022-04-28 09:40:39,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {1664#true} call #t~ret3 := main(); {1664#true} is VALID [2022-04-28 09:40:39,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {1664#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1693#(<= 0 main_~x~0)} is VALID [2022-04-28 09:40:39,254 INFO L290 TraceCheckUtils]: 6: Hoare triple {1693#(<= 0 main_~x~0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1693#(<= 0 main_~x~0)} is VALID [2022-04-28 09:40:39,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {1693#(<= 0 main_~x~0)} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {1693#(<= 0 main_~x~0)} is VALID [2022-04-28 09:40:39,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {1693#(<= 0 main_~x~0)} ~x~0 := 1 + ~x~0; {1670#(<= 1 main_~x~0)} is VALID [2022-04-28 09:40:39,255 INFO L290 TraceCheckUtils]: 9: Hoare triple {1670#(<= 1 main_~x~0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1670#(<= 1 main_~x~0)} is VALID [2022-04-28 09:40:39,256 INFO L290 TraceCheckUtils]: 10: Hoare triple {1670#(<= 1 main_~x~0)} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {1671#(<= 1 main_~m~0)} is VALID [2022-04-28 09:40:39,256 INFO L290 TraceCheckUtils]: 11: Hoare triple {1671#(<= 1 main_~m~0)} ~x~0 := 1 + ~x~0; {1671#(<= 1 main_~m~0)} is VALID [2022-04-28 09:40:39,256 INFO L290 TraceCheckUtils]: 12: Hoare triple {1671#(<= 1 main_~m~0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1671#(<= 1 main_~m~0)} is VALID [2022-04-28 09:40:39,256 INFO L290 TraceCheckUtils]: 13: Hoare triple {1671#(<= 1 main_~m~0)} assume !(0 != #t~nondet2);havoc #t~nondet2; {1671#(<= 1 main_~m~0)} is VALID [2022-04-28 09:40:39,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {1671#(<= 1 main_~m~0)} ~x~0 := 1 + ~x~0; {1671#(<= 1 main_~m~0)} is VALID [2022-04-28 09:40:39,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {1671#(<= 1 main_~m~0)} assume !(~x~0 < ~n~0); {1671#(<= 1 main_~m~0)} is VALID [2022-04-28 09:40:39,264 INFO L272 TraceCheckUtils]: 16: Hoare triple {1671#(<= 1 main_~m~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {1727#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:40:39,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {1727#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1731#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:40:39,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {1731#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1665#false} is VALID [2022-04-28 09:40:39,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {1665#false} assume !false; {1665#false} is VALID [2022-04-28 09:40:39,266 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 09:40:39,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:40:39,371 INFO L290 TraceCheckUtils]: 19: Hoare triple {1665#false} assume !false; {1665#false} is VALID [2022-04-28 09:40:39,372 INFO L290 TraceCheckUtils]: 18: Hoare triple {1731#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1665#false} is VALID [2022-04-28 09:40:39,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {1727#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1731#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:40:39,373 INFO L272 TraceCheckUtils]: 16: Hoare triple {1747#(<= 0 main_~m~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {1727#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:40:39,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {1747#(<= 0 main_~m~0)} assume !(~x~0 < ~n~0); {1747#(<= 0 main_~m~0)} is VALID [2022-04-28 09:40:39,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {1747#(<= 0 main_~m~0)} ~x~0 := 1 + ~x~0; {1747#(<= 0 main_~m~0)} is VALID [2022-04-28 09:40:39,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {1747#(<= 0 main_~m~0)} assume !(0 != #t~nondet2);havoc #t~nondet2; {1747#(<= 0 main_~m~0)} is VALID [2022-04-28 09:40:39,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {1747#(<= 0 main_~m~0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1747#(<= 0 main_~m~0)} is VALID [2022-04-28 09:40:39,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {1747#(<= 0 main_~m~0)} ~x~0 := 1 + ~x~0; {1747#(<= 0 main_~m~0)} is VALID [2022-04-28 09:40:39,381 INFO L290 TraceCheckUtils]: 10: Hoare triple {1693#(<= 0 main_~x~0)} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {1747#(<= 0 main_~m~0)} is VALID [2022-04-28 09:40:39,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {1693#(<= 0 main_~x~0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1693#(<= 0 main_~x~0)} is VALID [2022-04-28 09:40:39,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {1772#(<= 0 (+ main_~x~0 1))} ~x~0 := 1 + ~x~0; {1693#(<= 0 main_~x~0)} is VALID [2022-04-28 09:40:39,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {1772#(<= 0 (+ main_~x~0 1))} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {1772#(<= 0 (+ main_~x~0 1))} is VALID [2022-04-28 09:40:39,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {1772#(<= 0 (+ main_~x~0 1))} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1772#(<= 0 (+ main_~x~0 1))} is VALID [2022-04-28 09:40:39,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {1664#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1772#(<= 0 (+ main_~x~0 1))} is VALID [2022-04-28 09:40:39,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {1664#true} call #t~ret3 := main(); {1664#true} is VALID [2022-04-28 09:40:39,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1664#true} {1664#true} #60#return; {1664#true} is VALID [2022-04-28 09:40:39,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {1664#true} assume true; {1664#true} is VALID [2022-04-28 09:40:39,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {1664#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); {1664#true} is VALID [2022-04-28 09:40:39,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {1664#true} call ULTIMATE.init(); {1664#true} is VALID [2022-04-28 09:40:39,383 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 09:40:39,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304132904] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:40:39,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:40:39,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-04-28 09:40:39,384 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:40:39,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [664045586] [2022-04-28 09:40:39,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [664045586] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:40:39,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:40:39,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:40:39,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319771407] [2022-04-28 09:40:39,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:40:39,384 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 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 20 [2022-04-28 09:40:39,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:40:39,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 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 09:40:39,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:40:39,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:40:39,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:40:39,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:40:39,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-28 09:40:39,395 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 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 09:40:39,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:40:39,546 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-28 09:40:39,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:40:39,546 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 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 20 [2022-04-28 09:40:39,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:40:39,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 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 09:40:39,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2022-04-28 09:40:39,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 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 09:40:39,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2022-04-28 09:40:39,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 23 transitions. [2022-04-28 09:40:39,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:40:39,564 INFO L225 Difference]: With dead ends: 22 [2022-04-28 09:40:39,564 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 09:40:39,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-04-28 09:40:39,565 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:40:39,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 37 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:40:39,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 09:40:39,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 09:40:39,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:40:39,566 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 09:40:39,566 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 09:40:39,567 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 09:40:39,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:40:39,567 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:40:39,567 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:40:39,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:40:39,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:40:39,567 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 09:40:39,567 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 09:40:39,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:40:39,567 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:40:39,567 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:40:39,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:40:39,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:40:39,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:40:39,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:40:39,567 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 09:40:39,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 09:40:39,567 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-04-28 09:40:39,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:40:39,568 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 09:40:39,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 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 09:40:39,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 09:40:39,568 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 09:40:39,568 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:40:39,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:40:39,570 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 09:40:39,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 09:40:39,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:40:39,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 09:40:40,172 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-28 09:40:40,172 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-28 09:40:40,172 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-28 09:40:40,172 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-28 09:40:40,172 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:40:40,172 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:40:40,172 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:40:40,173 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 37) the Hoare annotation is: true [2022-04-28 09:40:40,173 INFO L895 garLoopResultBuilder]: At program point L29(lines 29 31) the Hoare annotation is: (let ((.cse0 (< main_~x~0 main_~n~0))) (or (and (= main_~x~0 0) .cse0 (= main_~m~0 0)) (and (<= 0 main_~m~0) (<= 1 main_~x~0) .cse0 (< main_~m~0 main_~n~0)))) [2022-04-28 09:40:40,173 INFO L895 garLoopResultBuilder]: At program point L29-2(lines 29 31) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (< main_~x~0 main_~n~0))) (or (and .cse1 (< main_~m~0 main_~n~0) (or (<= 0 main_~m~0) (<= main_~n~0 0))) (and .cse1 (= main_~m~0 0)))))) (or (and (= main_~x~0 0) .cse0) (and (<= 1 main_~x~0) .cse0))) [2022-04-28 09:40:40,173 INFO L895 garLoopResultBuilder]: At program point L28-2(lines 28 33) the Hoare annotation is: (let ((.cse0 (= main_~m~0 0))) (or (and (<= 1 main_~x~0) (or (and (< main_~m~0 main_~n~0) (or (<= 0 main_~m~0) (<= main_~n~0 0))) .cse0)) (and (= main_~x~0 0) .cse0))) [2022-04-28 09:40:40,173 INFO L895 garLoopResultBuilder]: At program point L28-3(lines 28 33) the Hoare annotation is: (let ((.cse0 (<= main_~n~0 0))) (or (and (< main_~m~0 main_~n~0) (or (<= 0 main_~m~0) .cse0)) (and (= main_~x~0 0) .cse0) (= main_~m~0 0))) [2022-04-28 09:40:40,173 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 24 37) the Hoare annotation is: true [2022-04-28 09:40:40,173 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 24 37) the Hoare annotation is: true [2022-04-28 09:40:40,173 INFO L902 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: true [2022-04-28 09:40:40,173 INFO L895 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (or (< main_~m~0 main_~n~0) (and (= main_~x~0 0) (<= main_~n~0 0)) (= main_~m~0 0)) [2022-04-28 09:40:40,173 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:40:40,173 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 09:40:40,173 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:40:40,173 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:40:40,173 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 09:40:40,173 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 09:40:40,173 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:40:40,173 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 09:40:40,174 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-28 09:40:40,174 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 09:40:40,174 INFO L895 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 09:40:40,174 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 09:40:40,174 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 09:40:40,176 INFO L356 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 2, 2] [2022-04-28 09:40:40,177 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 09:40:40,179 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:40:40,179 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:40:40,184 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 09:40:40,185 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-28 09:40:40,185 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 09:40:40,185 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 09:40:40,191 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-28 09:40:40,198 INFO L163 areAnnotationChecker]: CFG has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 09:40:40,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:40:40 BoogieIcfgContainer [2022-04-28 09:40:40,205 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 09:40:40,206 INFO L158 Benchmark]: Toolchain (without parser) took 5656.20ms. Allocated memory was 172.0MB in the beginning and 231.7MB in the end (delta: 59.8MB). Free memory was 123.2MB in the beginning and 83.0MB in the end (delta: 40.2MB). Peak memory consumption was 101.3MB. Max. memory is 8.0GB. [2022-04-28 09:40:40,206 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 172.0MB. Free memory was 139.9MB in the beginning and 139.8MB in the end (delta: 89.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 09:40:40,206 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.87ms. Allocated memory is still 172.0MB. Free memory was 123.1MB in the beginning and 149.2MB in the end (delta: -26.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 09:40:40,206 INFO L158 Benchmark]: Boogie Preprocessor took 30.95ms. Allocated memory is still 172.0MB. Free memory was 149.2MB in the beginning and 147.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 09:40:40,207 INFO L158 Benchmark]: RCFGBuilder took 270.04ms. Allocated memory is still 172.0MB. Free memory was 147.6MB in the beginning and 136.6MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 09:40:40,207 INFO L158 Benchmark]: TraceAbstraction took 5129.47ms. Allocated memory was 172.0MB in the beginning and 231.7MB in the end (delta: 59.8MB). Free memory was 136.1MB in the beginning and 83.0MB in the end (delta: 53.0MB). Peak memory consumption was 113.9MB. Max. memory is 8.0GB. [2022-04-28 09:40:40,208 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 172.0MB. Free memory was 139.9MB in the beginning and 139.8MB in the end (delta: 89.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 221.87ms. Allocated memory is still 172.0MB. Free memory was 123.1MB in the beginning and 149.2MB in the end (delta: -26.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.95ms. Allocated memory is still 172.0MB. Free memory was 149.2MB in the beginning and 147.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 270.04ms. Allocated memory is still 172.0MB. Free memory was 147.6MB in the beginning and 136.6MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5129.47ms. Allocated memory was 172.0MB in the beginning and 231.7MB in the end (delta: 59.8MB). Free memory was 136.1MB in the beginning and 83.0MB in the end (delta: 53.0MB). Peak memory consumption was 113.9MB. Max. memory is 8.0GB. * 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, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 160 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 155 mSDsluCounter, 333 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 213 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 381 IncrementalHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 120 mSDtfsCounter, 381 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 194 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=6, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 35 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 70 PreInvPairs, 114 NumberOfFragments, 197 HoareAnnotationTreeSize, 70 FomulaSimplifications, 192 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 22 FomulaSimplificationsInter, 1194 FormulaSimplificationTreeSizeReductionInter, 0.3s 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: 28]: Loop Invariant Derived loop invariant: (1 <= x && ((m < n && (0 <= m || n <= 0)) || m == 0)) || (x == 0 && m == 0) - 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 09:40:40,231 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...