/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-invgen/large_const.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:30:49,427 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:30:49,428 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:30:49,460 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:30:49,460 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:30:49,461 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:30:49,462 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:30:49,463 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:30:49,465 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:30:49,466 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:30:49,466 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:30:49,467 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:30:49,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:30:49,468 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:30:49,469 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:30:49,470 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:30:49,471 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:30:49,471 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:30:49,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:30:49,474 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:30:49,475 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:30:49,480 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:30:49,481 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:30:49,481 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:30:49,482 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:30:49,484 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:30:49,485 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:30:49,485 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:30:49,485 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:30:49,486 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:30:49,486 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:30:49,487 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:30:49,487 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:30:49,488 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:30:49,488 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:30:49,489 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:30:49,489 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:30:49,490 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:30:49,490 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:30:49,490 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:30:49,491 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:30:49,492 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:30:49,492 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:30:49,506 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:30:49,508 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:30:49,509 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:30:49,509 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:30:49,509 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:30:49,509 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:30:49,510 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:30:49,510 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:30:49,510 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:30:49,511 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:30:49,511 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:30:49,511 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:30:49,511 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:30:49,511 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:30:49,511 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:30:49,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:30:49,511 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:30:49,512 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:30:49,512 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:30:49,512 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:30:49,512 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:30:49,512 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:30:49,512 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:30:49,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:30:49,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:30:49,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:30:49,753 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:30:49,754 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:30:49,755 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/large_const.i [2022-04-28 09:30:49,809 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dcf62e11/0c4ff2587b494e1995472ea4120c6640/FLAG036d18da4 [2022-04-28 09:30:50,238 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:30:50,238 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/large_const.i [2022-04-28 09:30:50,243 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dcf62e11/0c4ff2587b494e1995472ea4120c6640/FLAG036d18da4 [2022-04-28 09:30:50,649 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dcf62e11/0c4ff2587b494e1995472ea4120c6640 [2022-04-28 09:30:50,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:30:50,653 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:30:50,656 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:30:50,656 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:30:50,659 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:30:50,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:30:50" (1/1) ... [2022-04-28 09:30:50,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27a1d8a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:30:50, skipping insertion in model container [2022-04-28 09:30:50,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:30:50" (1/1) ... [2022-04-28 09:30:50,668 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:30:50,682 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:30:50,816 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/large_const.i[893,906] [2022-04-28 09:30:50,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:30:50,836 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:30:50,848 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/large_const.i[893,906] [2022-04-28 09:30:50,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:30:50,865 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:30:50,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:30:50 WrapperNode [2022-04-28 09:30:50,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:30:50,867 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:30:50,867 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:30:50,867 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:30:50,875 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:30:50" (1/1) ... [2022-04-28 09:30:50,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:30:50" (1/1) ... [2022-04-28 09:30:50,881 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:30:50" (1/1) ... [2022-04-28 09:30:50,882 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:30:50" (1/1) ... [2022-04-28 09:30:50,894 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:30:50" (1/1) ... [2022-04-28 09:30:50,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:30:50" (1/1) ... [2022-04-28 09:30:50,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:30:50" (1/1) ... [2022-04-28 09:30:50,908 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:30:50,908 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:30:50,909 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:30:50,909 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:30:50,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:30:50" (1/1) ... [2022-04-28 09:30:50,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:30:50,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:30:50,942 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:30:50,947 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:30:50,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:30:50,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:30:50,978 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:30:50,978 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 09:30:50,978 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:30:50,978 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:30:50,979 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:30:50,979 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:30:50,979 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 09:30:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 09:30:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:30:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:30:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 09:30:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:30:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 09:30:50,983 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:30:50,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:30:50,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:30:50,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:30:50,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:30:50,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:30:50,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:30:51,083 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:30:51,085 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:30:51,370 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:30:51,377 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:30:51,377 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 09:30:51,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:30:51 BoogieIcfgContainer [2022-04-28 09:30:51,385 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:30:51,387 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:30:51,387 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:30:51,390 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:30:51,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:30:50" (1/3) ... [2022-04-28 09:30:51,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b1de13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:30:51, skipping insertion in model container [2022-04-28 09:30:51,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:30:50" (2/3) ... [2022-04-28 09:30:51,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b1de13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:30:51, skipping insertion in model container [2022-04-28 09:30:51,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:30:51" (3/3) ... [2022-04-28 09:30:51,393 INFO L111 eAbstractionObserver]: Analyzing ICFG large_const.i [2022-04-28 09:30:51,406 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:30:51,406 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:30:51,461 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:30:51,479 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@51ca28c6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@570faf11 [2022-04-28 09:30:51,479 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:30:51,487 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:30:51,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 09:30:51,493 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:30:51,494 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:30:51,494 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:30:51,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:30:51,500 INFO L85 PathProgramCache]: Analyzing trace with hash -829760349, now seen corresponding path program 1 times [2022-04-28 09:30:51,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:51,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [556577675] [2022-04-28 09:30:51,521 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:30:51,521 INFO L85 PathProgramCache]: Analyzing trace with hash -829760349, now seen corresponding path program 2 times [2022-04-28 09:30:51,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:30:51,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089977515] [2022-04-28 09:30:51,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:30:51,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:30:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:51,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:30:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:51,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#(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); {29#true} is VALID [2022-04-28 09:30:51,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-28 09:30:51,779 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #83#return; {29#true} is VALID [2022-04-28 09:30:51,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {37#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:30:51,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#(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); {29#true} is VALID [2022-04-28 09:30:51,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-28 09:30:51,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #83#return; {29#true} is VALID [2022-04-28 09:30:51,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {29#true} is VALID [2022-04-28 09:30:51,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {29#true} is VALID [2022-04-28 09:30:51,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {34#(= main_~i~0 0)} is VALID [2022-04-28 09:30:51,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#(= main_~i~0 0)} assume !(~i~0 < ~n~0); {35#(<= main_~n~0 0)} is VALID [2022-04-28 09:30:51,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#(<= main_~n~0 0)} ~j~0 := 0; {36#(and (= main_~j~0 0) (<= main_~n~0 0))} is VALID [2022-04-28 09:30:51,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#(and (= main_~j~0 0) (<= main_~n~0 0))} assume !!(~j~0 < ~n~0); {30#false} is VALID [2022-04-28 09:30:51,785 INFO L272 TraceCheckUtils]: 10: Hoare triple {30#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {30#false} is VALID [2022-04-28 09:30:51,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-28 09:30:51,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-28 09:30:51,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-28 09:30:51,786 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:30:51,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:30:51,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089977515] [2022-04-28 09:30:51,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089977515] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:51,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:30:51,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:30:51,790 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:30:51,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [556577675] [2022-04-28 09:30:51,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [556577675] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:51,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:30:51,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:30:51,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531314775] [2022-04-28 09:30:51,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:30:51,798 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) 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:30:51,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:30:51,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) 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:30:51,835 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:30:51,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:30:51,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:51,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:30:51,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-28 09:30:51,859 INFO L87 Difference]: Start difference. First operand has 26 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 6 states have (on average 1.6666666666666667) 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:30:52,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:52,191 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-28 09:30:52,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 09:30:52,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) 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:30:52,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:30:52,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) 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:30:52,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2022-04-28 09:30:52,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) 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:30:52,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2022-04-28 09:30:52,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 62 transitions. [2022-04-28 09:30:52,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:52,287 INFO L225 Difference]: With dead ends: 47 [2022-04-28 09:30:52,288 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 09:30:52,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-28 09:30:52,296 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 38 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:30:52,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 44 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:30:52,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 09:30:52,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-28 09:30:52,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:30:52,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 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), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:30:52,328 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 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), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:30:52,329 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 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), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:30:52,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:52,332 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-28 09:30:52,333 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-28 09:30:52,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:52,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:52,334 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 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), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-28 09:30:52,334 INFO L87 Difference]: Start difference. First operand has 22 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), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-28 09:30:52,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:52,337 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-28 09:30:52,337 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-28 09:30:52,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:52,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:52,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:30:52,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:30:52,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 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), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:30:52,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-04-28 09:30:52,342 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2022-04-28 09:30:52,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:30:52,344 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-04-28 09:30:52,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) 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:30:52,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 25 transitions. [2022-04-28 09:30:52,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:52,382 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-28 09:30:52,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 09:30:52,383 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:30:52,384 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:30:52,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:30:52,384 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:30:52,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:30:52,385 INFO L85 PathProgramCache]: Analyzing trace with hash -174022606, now seen corresponding path program 1 times [2022-04-28 09:30:52,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:52,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [709821510] [2022-04-28 09:30:52,419 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:30:52,419 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:30:52,419 INFO L85 PathProgramCache]: Analyzing trace with hash -174022606, now seen corresponding path program 2 times [2022-04-28 09:30:52,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:30:52,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212598009] [2022-04-28 09:30:52,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:30:52,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:30:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:52,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:30:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:52,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {238#(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); {228#true} is VALID [2022-04-28 09:30:52,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#true} assume true; {228#true} is VALID [2022-04-28 09:30:52,582 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {228#true} {228#true} #83#return; {228#true} is VALID [2022-04-28 09:30:52,582 INFO L272 TraceCheckUtils]: 0: Hoare triple {228#true} call ULTIMATE.init(); {238#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:30:52,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {238#(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); {228#true} is VALID [2022-04-28 09:30:52,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {228#true} assume true; {228#true} is VALID [2022-04-28 09:30:52,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {228#true} {228#true} #83#return; {228#true} is VALID [2022-04-28 09:30:52,583 INFO L272 TraceCheckUtils]: 4: Hoare triple {228#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {228#true} is VALID [2022-04-28 09:30:52,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {228#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {233#(<= 4000 main_~c1~0)} is VALID [2022-04-28 09:30:52,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {233#(<= 4000 main_~c1~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {234#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} is VALID [2022-04-28 09:30:52,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {234#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {234#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} is VALID [2022-04-28 09:30:52,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {234#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {234#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} is VALID [2022-04-28 09:30:52,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {234#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} assume 0 == ~v~0;~k~0 := ~k~0 + ~c1~0; {235#(<= 4000 main_~k~0)} is VALID [2022-04-28 09:30:52,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#(<= 4000 main_~k~0)} assume !(~i~0 < ~n~0); {235#(<= 4000 main_~k~0)} is VALID [2022-04-28 09:30:52,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#(<= 4000 main_~k~0)} ~j~0 := 0; {235#(<= 4000 main_~k~0)} is VALID [2022-04-28 09:30:52,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {235#(<= 4000 main_~k~0)} assume !!(~j~0 < ~n~0); {235#(<= 4000 main_~k~0)} is VALID [2022-04-28 09:30:52,589 INFO L272 TraceCheckUtils]: 13: Hoare triple {235#(<= 4000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {236#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:30:52,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {236#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {237#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:30:52,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {237#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {229#false} is VALID [2022-04-28 09:30:52,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {229#false} assume !false; {229#false} is VALID [2022-04-28 09:30:52,591 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:30:52,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:30:52,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212598009] [2022-04-28 09:30:52,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212598009] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:30:52,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539985981] [2022-04-28 09:30:52,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:30:52,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:30:52,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:30:52,594 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:30:52,596 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:30:52,652 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:30:52,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:30:52,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 09:30:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:52,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:30:52,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {228#true} call ULTIMATE.init(); {228#true} is VALID [2022-04-28 09:30:52,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#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); {228#true} is VALID [2022-04-28 09:30:52,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {228#true} assume true; {228#true} is VALID [2022-04-28 09:30:52,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {228#true} {228#true} #83#return; {228#true} is VALID [2022-04-28 09:30:52,919 INFO L272 TraceCheckUtils]: 4: Hoare triple {228#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {228#true} is VALID [2022-04-28 09:30:52,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {228#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {233#(<= 4000 main_~c1~0)} is VALID [2022-04-28 09:30:52,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {233#(<= 4000 main_~c1~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {260#(and (<= 0 main_~k~0) (<= 4000 main_~c1~0))} is VALID [2022-04-28 09:30:52,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {260#(and (<= 0 main_~k~0) (<= 4000 main_~c1~0))} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {260#(and (<= 0 main_~k~0) (<= 4000 main_~c1~0))} is VALID [2022-04-28 09:30:52,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {260#(and (<= 0 main_~k~0) (<= 4000 main_~c1~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {260#(and (<= 0 main_~k~0) (<= 4000 main_~c1~0))} is VALID [2022-04-28 09:30:52,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {260#(and (<= 0 main_~k~0) (<= 4000 main_~c1~0))} assume 0 == ~v~0;~k~0 := ~k~0 + ~c1~0; {235#(<= 4000 main_~k~0)} is VALID [2022-04-28 09:30:52,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#(<= 4000 main_~k~0)} assume !(~i~0 < ~n~0); {235#(<= 4000 main_~k~0)} is VALID [2022-04-28 09:30:52,927 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#(<= 4000 main_~k~0)} ~j~0 := 0; {235#(<= 4000 main_~k~0)} is VALID [2022-04-28 09:30:52,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {235#(<= 4000 main_~k~0)} assume !!(~j~0 < ~n~0); {235#(<= 4000 main_~k~0)} is VALID [2022-04-28 09:30:52,929 INFO L272 TraceCheckUtils]: 13: Hoare triple {235#(<= 4000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {282#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:30:52,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {282#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {286#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:30:52,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {286#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {229#false} is VALID [2022-04-28 09:30:52,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {229#false} assume !false; {229#false} is VALID [2022-04-28 09:30:52,933 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:30:52,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:30:53,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {229#false} assume !false; {229#false} is VALID [2022-04-28 09:30:53,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {286#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {229#false} is VALID [2022-04-28 09:30:53,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {282#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {286#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:30:53,093 INFO L272 TraceCheckUtils]: 13: Hoare triple {302#(< 0 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {282#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:30:53,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {302#(< 0 main_~k~0)} assume !!(~j~0 < ~n~0); {302#(< 0 main_~k~0)} is VALID [2022-04-28 09:30:53,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {302#(< 0 main_~k~0)} ~j~0 := 0; {302#(< 0 main_~k~0)} is VALID [2022-04-28 09:30:53,094 INFO L290 TraceCheckUtils]: 10: Hoare triple {302#(< 0 main_~k~0)} assume !(~i~0 < ~n~0); {302#(< 0 main_~k~0)} is VALID [2022-04-28 09:30:53,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {315#(< 0 (+ main_~k~0 main_~c1~0))} assume 0 == ~v~0;~k~0 := ~k~0 + ~c1~0; {302#(< 0 main_~k~0)} is VALID [2022-04-28 09:30:53,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {315#(< 0 (+ main_~k~0 main_~c1~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {315#(< 0 (+ main_~k~0 main_~c1~0))} is VALID [2022-04-28 09:30:53,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {315#(< 0 (+ main_~k~0 main_~c1~0))} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {315#(< 0 (+ main_~k~0 main_~c1~0))} is VALID [2022-04-28 09:30:53,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {325#(< 0 main_~c1~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {315#(< 0 (+ main_~k~0 main_~c1~0))} is VALID [2022-04-28 09:30:53,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {228#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {325#(< 0 main_~c1~0)} is VALID [2022-04-28 09:30:53,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {228#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {228#true} is VALID [2022-04-28 09:30:53,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {228#true} {228#true} #83#return; {228#true} is VALID [2022-04-28 09:30:53,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {228#true} assume true; {228#true} is VALID [2022-04-28 09:30:53,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#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); {228#true} is VALID [2022-04-28 09:30:53,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {228#true} call ULTIMATE.init(); {228#true} is VALID [2022-04-28 09:30:53,099 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:30:53,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539985981] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:30:53,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:30:53,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-28 09:30:53,100 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:30:53,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [709821510] [2022-04-28 09:30:53,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [709821510] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:53,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:30:53,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:30:53,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610302977] [2022-04-28 09:30:53,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:30:53,101 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 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 17 [2022-04-28 09:30:53,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:30:53,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 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:30:53,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:53,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:30:53,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:53,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:30:53,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:30:53,118 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 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:30:53,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:53,512 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-04-28 09:30:53,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:30:53,512 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 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 17 [2022-04-28 09:30:53,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:30:53,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 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:30:53,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 47 transitions. [2022-04-28 09:30:53,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 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:30:53,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 47 transitions. [2022-04-28 09:30:53,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 47 transitions. [2022-04-28 09:30:53,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:53,568 INFO L225 Difference]: With dead ends: 39 [2022-04-28 09:30:53,569 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 09:30:53,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-04-28 09:30:53,574 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 59 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:30:53,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 42 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:30:53,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 09:30:53,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2022-04-28 09:30:53,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:30:53,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 32 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:30:53,601 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 32 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:30:53,602 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 32 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:30:53,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:53,606 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-04-28 09:30:53,606 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2022-04-28 09:30:53,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:53,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:53,607 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 37 states. [2022-04-28 09:30:53,607 INFO L87 Difference]: Start difference. First operand has 32 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 37 states. [2022-04-28 09:30:53,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:53,617 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-04-28 09:30:53,617 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2022-04-28 09:30:53,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:53,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:53,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:30:53,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:30:53,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:30:53,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-04-28 09:30:53,620 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 17 [2022-04-28 09:30:53,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:30:53,620 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-04-28 09:30:53,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 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:30:53,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 37 transitions. [2022-04-28 09:30:53,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:53,665 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-28 09:30:53,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 09:30:53,666 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:30:53,666 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:30:53,694 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:30:53,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:30:53,883 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:30:53,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:30:53,883 INFO L85 PathProgramCache]: Analyzing trace with hash 767622940, now seen corresponding path program 1 times [2022-04-28 09:30:53,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:53,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1093152628] [2022-04-28 09:30:53,898 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:30:53,898 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:30:53,898 INFO L85 PathProgramCache]: Analyzing trace with hash 767622940, now seen corresponding path program 2 times [2022-04-28 09:30:53,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:30:53,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571800478] [2022-04-28 09:30:53,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:30:53,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:30:53,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:53,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:30:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:53,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {584#(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); {574#true} is VALID [2022-04-28 09:30:53,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {574#true} assume true; {574#true} is VALID [2022-04-28 09:30:53,983 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {574#true} {574#true} #83#return; {574#true} is VALID [2022-04-28 09:30:53,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {574#true} call ULTIMATE.init(); {584#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:30:53,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {584#(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); {574#true} is VALID [2022-04-28 09:30:53,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {574#true} assume true; {574#true} is VALID [2022-04-28 09:30:53,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {574#true} {574#true} #83#return; {574#true} is VALID [2022-04-28 09:30:53,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {574#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {574#true} is VALID [2022-04-28 09:30:53,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {574#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {579#(<= 2000 main_~c2~0)} is VALID [2022-04-28 09:30:53,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {579#(<= 2000 main_~c2~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {580#(and (= main_~k~0 0) (<= 2000 main_~c2~0))} is VALID [2022-04-28 09:30:53,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {580#(and (= main_~k~0 0) (<= 2000 main_~c2~0))} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {580#(and (= main_~k~0 0) (<= 2000 main_~c2~0))} is VALID [2022-04-28 09:30:53,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {580#(and (= main_~k~0 0) (<= 2000 main_~c2~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {580#(and (= main_~k~0 0) (<= 2000 main_~c2~0))} is VALID [2022-04-28 09:30:53,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {580#(and (= main_~k~0 0) (<= 2000 main_~c2~0))} assume !(0 == ~v~0); {580#(and (= main_~k~0 0) (<= 2000 main_~c2~0))} is VALID [2022-04-28 09:30:53,988 INFO L290 TraceCheckUtils]: 10: Hoare triple {580#(and (= main_~k~0 0) (<= 2000 main_~c2~0))} assume 1 == ~v~0;~k~0 := ~k~0 + ~c2~0; {581#(<= 2000 main_~k~0)} is VALID [2022-04-28 09:30:53,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {581#(<= 2000 main_~k~0)} assume !(~i~0 < ~n~0); {581#(<= 2000 main_~k~0)} is VALID [2022-04-28 09:30:53,988 INFO L290 TraceCheckUtils]: 12: Hoare triple {581#(<= 2000 main_~k~0)} ~j~0 := 0; {581#(<= 2000 main_~k~0)} is VALID [2022-04-28 09:30:53,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {581#(<= 2000 main_~k~0)} assume !!(~j~0 < ~n~0); {581#(<= 2000 main_~k~0)} is VALID [2022-04-28 09:30:53,989 INFO L272 TraceCheckUtils]: 14: Hoare triple {581#(<= 2000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {582#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:30:53,990 INFO L290 TraceCheckUtils]: 15: Hoare triple {582#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {583#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:30:53,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {583#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {575#false} is VALID [2022-04-28 09:30:53,991 INFO L290 TraceCheckUtils]: 17: Hoare triple {575#false} assume !false; {575#false} is VALID [2022-04-28 09:30:53,991 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:30:53,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:30:53,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571800478] [2022-04-28 09:30:53,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571800478] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:30:53,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665213489] [2022-04-28 09:30:53,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:30:53,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:30:53,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:30:53,993 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:30:54,000 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:30:54,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:30:54,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:30:54,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 09:30:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:54,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:30:54,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {574#true} call ULTIMATE.init(); {574#true} is VALID [2022-04-28 09:30:54,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {574#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); {574#true} is VALID [2022-04-28 09:30:54,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {574#true} assume true; {574#true} is VALID [2022-04-28 09:30:54,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {574#true} {574#true} #83#return; {574#true} is VALID [2022-04-28 09:30:54,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {574#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {574#true} is VALID [2022-04-28 09:30:54,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {574#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {579#(<= 2000 main_~c2~0)} is VALID [2022-04-28 09:30:54,216 INFO L290 TraceCheckUtils]: 6: Hoare triple {579#(<= 2000 main_~c2~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {606#(and (<= 0 main_~k~0) (<= 2000 main_~c2~0))} is VALID [2022-04-28 09:30:54,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {606#(and (<= 0 main_~k~0) (<= 2000 main_~c2~0))} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {606#(and (<= 0 main_~k~0) (<= 2000 main_~c2~0))} is VALID [2022-04-28 09:30:54,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {606#(and (<= 0 main_~k~0) (<= 2000 main_~c2~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {606#(and (<= 0 main_~k~0) (<= 2000 main_~c2~0))} is VALID [2022-04-28 09:30:54,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {606#(and (<= 0 main_~k~0) (<= 2000 main_~c2~0))} assume !(0 == ~v~0); {606#(and (<= 0 main_~k~0) (<= 2000 main_~c2~0))} is VALID [2022-04-28 09:30:54,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {606#(and (<= 0 main_~k~0) (<= 2000 main_~c2~0))} assume 1 == ~v~0;~k~0 := ~k~0 + ~c2~0; {581#(<= 2000 main_~k~0)} is VALID [2022-04-28 09:30:54,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {581#(<= 2000 main_~k~0)} assume !(~i~0 < ~n~0); {581#(<= 2000 main_~k~0)} is VALID [2022-04-28 09:30:54,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {581#(<= 2000 main_~k~0)} ~j~0 := 0; {581#(<= 2000 main_~k~0)} is VALID [2022-04-28 09:30:54,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {581#(<= 2000 main_~k~0)} assume !!(~j~0 < ~n~0); {581#(<= 2000 main_~k~0)} is VALID [2022-04-28 09:30:54,225 INFO L272 TraceCheckUtils]: 14: Hoare triple {581#(<= 2000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {631#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:30:54,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {631#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {635#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:30:54,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {635#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {575#false} is VALID [2022-04-28 09:30:54,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {575#false} assume !false; {575#false} is VALID [2022-04-28 09:30:54,226 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:30:54,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:30:54,406 INFO L290 TraceCheckUtils]: 17: Hoare triple {575#false} assume !false; {575#false} is VALID [2022-04-28 09:30:54,407 INFO L290 TraceCheckUtils]: 16: Hoare triple {635#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {575#false} is VALID [2022-04-28 09:30:54,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {631#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {635#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:30:54,409 INFO L272 TraceCheckUtils]: 14: Hoare triple {651#(< 0 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {631#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:30:54,409 INFO L290 TraceCheckUtils]: 13: Hoare triple {651#(< 0 main_~k~0)} assume !!(~j~0 < ~n~0); {651#(< 0 main_~k~0)} is VALID [2022-04-28 09:30:54,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {651#(< 0 main_~k~0)} ~j~0 := 0; {651#(< 0 main_~k~0)} is VALID [2022-04-28 09:30:54,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {651#(< 0 main_~k~0)} assume !(~i~0 < ~n~0); {651#(< 0 main_~k~0)} is VALID [2022-04-28 09:30:54,420 INFO L290 TraceCheckUtils]: 10: Hoare triple {664#(< 0 (+ main_~k~0 main_~c2~0))} assume 1 == ~v~0;~k~0 := ~k~0 + ~c2~0; {651#(< 0 main_~k~0)} is VALID [2022-04-28 09:30:54,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {664#(< 0 (+ main_~k~0 main_~c2~0))} assume !(0 == ~v~0); {664#(< 0 (+ main_~k~0 main_~c2~0))} is VALID [2022-04-28 09:30:54,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {664#(< 0 (+ main_~k~0 main_~c2~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {664#(< 0 (+ main_~k~0 main_~c2~0))} is VALID [2022-04-28 09:30:54,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {664#(< 0 (+ main_~k~0 main_~c2~0))} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {664#(< 0 (+ main_~k~0 main_~c2~0))} is VALID [2022-04-28 09:30:54,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {677#(< 0 main_~c2~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {664#(< 0 (+ main_~k~0 main_~c2~0))} is VALID [2022-04-28 09:30:54,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {574#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {677#(< 0 main_~c2~0)} is VALID [2022-04-28 09:30:54,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {574#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {574#true} is VALID [2022-04-28 09:30:54,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {574#true} {574#true} #83#return; {574#true} is VALID [2022-04-28 09:30:54,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {574#true} assume true; {574#true} is VALID [2022-04-28 09:30:54,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {574#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); {574#true} is VALID [2022-04-28 09:30:54,423 INFO L272 TraceCheckUtils]: 0: Hoare triple {574#true} call ULTIMATE.init(); {574#true} is VALID [2022-04-28 09:30:54,423 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:30:54,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665213489] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:30:54,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:30:54,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-28 09:30:54,424 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:30:54,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1093152628] [2022-04-28 09:30:54,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1093152628] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:54,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:30:54,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:30:54,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391263808] [2022-04-28 09:30:54,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:30:54,425 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 09:30:54,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:30:54,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:30:54,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:54,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:30:54,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:54,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:30:54,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:30:54,443 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:30:54,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:54,841 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-04-28 09:30:54,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:30:54,842 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 09:30:54,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:30:54,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:30:54,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 47 transitions. [2022-04-28 09:30:54,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:30:54,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 47 transitions. [2022-04-28 09:30:54,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 47 transitions. [2022-04-28 09:30:54,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:54,898 INFO L225 Difference]: With dead ends: 49 [2022-04-28 09:30:54,898 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 09:30:54,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-04-28 09:30:54,899 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 41 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:30:54,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 50 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:30:54,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 09:30:54,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2022-04-28 09:30:54,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:30:54,942 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 38 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:30:54,943 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 38 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:30:54,943 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 38 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:30:54,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:54,945 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-04-28 09:30:54,945 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-04-28 09:30:54,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:54,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:54,946 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 47 states. [2022-04-28 09:30:54,946 INFO L87 Difference]: Start difference. First operand has 38 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 47 states. [2022-04-28 09:30:54,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:54,948 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-04-28 09:30:54,948 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-04-28 09:30:54,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:54,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:54,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:30:54,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:30:54,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:30:54,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2022-04-28 09:30:54,950 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 18 [2022-04-28 09:30:54,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:30:54,951 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2022-04-28 09:30:54,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:30:54,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 47 transitions. [2022-04-28 09:30:54,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:54,998 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-28 09:30:54,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 09:30:54,998 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:30:54,998 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:30:55,026 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:30:55,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 09:30:55,215 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:30:55,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:30:55,215 INFO L85 PathProgramCache]: Analyzing trace with hash -41723686, now seen corresponding path program 1 times [2022-04-28 09:30:55,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:55,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1903893984] [2022-04-28 09:30:55,224 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:30:55,225 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:30:55,225 INFO L85 PathProgramCache]: Analyzing trace with hash -41723686, now seen corresponding path program 2 times [2022-04-28 09:30:55,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:30:55,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859298431] [2022-04-28 09:30:55,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:30:55,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:30:55,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:55,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:30:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:55,318 INFO L290 TraceCheckUtils]: 0: Hoare triple {988#(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); {978#true} is VALID [2022-04-28 09:30:55,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {978#true} assume true; {978#true} is VALID [2022-04-28 09:30:55,319 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {978#true} {978#true} #83#return; {978#true} is VALID [2022-04-28 09:30:55,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {978#true} call ULTIMATE.init(); {988#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:30:55,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {988#(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); {978#true} is VALID [2022-04-28 09:30:55,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {978#true} assume true; {978#true} is VALID [2022-04-28 09:30:55,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {978#true} {978#true} #83#return; {978#true} is VALID [2022-04-28 09:30:55,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {978#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {978#true} is VALID [2022-04-28 09:30:55,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {978#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {983#(<= 10000 main_~c3~0)} is VALID [2022-04-28 09:30:55,321 INFO L290 TraceCheckUtils]: 6: Hoare triple {983#(<= 10000 main_~c3~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {984#(and (<= 10000 main_~c3~0) (= main_~k~0 0))} is VALID [2022-04-28 09:30:55,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {984#(and (<= 10000 main_~c3~0) (= main_~k~0 0))} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {984#(and (<= 10000 main_~c3~0) (= main_~k~0 0))} is VALID [2022-04-28 09:30:55,322 INFO L290 TraceCheckUtils]: 8: Hoare triple {984#(and (<= 10000 main_~c3~0) (= main_~k~0 0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {984#(and (<= 10000 main_~c3~0) (= main_~k~0 0))} is VALID [2022-04-28 09:30:55,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {984#(and (<= 10000 main_~c3~0) (= main_~k~0 0))} assume !(0 == ~v~0); {984#(and (<= 10000 main_~c3~0) (= main_~k~0 0))} is VALID [2022-04-28 09:30:55,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {984#(and (<= 10000 main_~c3~0) (= main_~k~0 0))} assume !(1 == ~v~0);~k~0 := ~k~0 + ~c3~0; {985#(<= 10000 main_~k~0)} is VALID [2022-04-28 09:30:55,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {985#(<= 10000 main_~k~0)} assume !(~i~0 < ~n~0); {985#(<= 10000 main_~k~0)} is VALID [2022-04-28 09:30:55,324 INFO L290 TraceCheckUtils]: 12: Hoare triple {985#(<= 10000 main_~k~0)} ~j~0 := 0; {985#(<= 10000 main_~k~0)} is VALID [2022-04-28 09:30:55,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {985#(<= 10000 main_~k~0)} assume !!(~j~0 < ~n~0); {985#(<= 10000 main_~k~0)} is VALID [2022-04-28 09:30:55,325 INFO L272 TraceCheckUtils]: 14: Hoare triple {985#(<= 10000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {986#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:30:55,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {986#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {987#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:30:55,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {987#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {979#false} is VALID [2022-04-28 09:30:55,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {979#false} assume !false; {979#false} is VALID [2022-04-28 09:30:55,326 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:30:55,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:30:55,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859298431] [2022-04-28 09:30:55,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859298431] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:30:55,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034623615] [2022-04-28 09:30:55,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:30:55,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:30:55,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:30:55,328 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:30:55,363 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:30:55,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:30:55,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:30:55,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 09:30:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:55,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:30:55,528 INFO L272 TraceCheckUtils]: 0: Hoare triple {978#true} call ULTIMATE.init(); {978#true} is VALID [2022-04-28 09:30:55,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {978#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); {978#true} is VALID [2022-04-28 09:30:55,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {978#true} assume true; {978#true} is VALID [2022-04-28 09:30:55,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {978#true} {978#true} #83#return; {978#true} is VALID [2022-04-28 09:30:55,529 INFO L272 TraceCheckUtils]: 4: Hoare triple {978#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {978#true} is VALID [2022-04-28 09:30:55,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {978#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {983#(<= 10000 main_~c3~0)} is VALID [2022-04-28 09:30:55,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {983#(<= 10000 main_~c3~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {1010#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} is VALID [2022-04-28 09:30:55,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {1010#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {1010#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} is VALID [2022-04-28 09:30:55,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {1010#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {1010#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} is VALID [2022-04-28 09:30:55,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {1010#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} assume !(0 == ~v~0); {1010#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} is VALID [2022-04-28 09:30:55,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {1010#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} assume !(1 == ~v~0);~k~0 := ~k~0 + ~c3~0; {985#(<= 10000 main_~k~0)} is VALID [2022-04-28 09:30:55,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {985#(<= 10000 main_~k~0)} assume !(~i~0 < ~n~0); {985#(<= 10000 main_~k~0)} is VALID [2022-04-28 09:30:55,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {985#(<= 10000 main_~k~0)} ~j~0 := 0; {985#(<= 10000 main_~k~0)} is VALID [2022-04-28 09:30:55,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {985#(<= 10000 main_~k~0)} assume !!(~j~0 < ~n~0); {985#(<= 10000 main_~k~0)} is VALID [2022-04-28 09:30:55,534 INFO L272 TraceCheckUtils]: 14: Hoare triple {985#(<= 10000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1035#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:30:55,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {1035#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1039#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:30:55,535 INFO L290 TraceCheckUtils]: 16: Hoare triple {1039#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {979#false} is VALID [2022-04-28 09:30:55,535 INFO L290 TraceCheckUtils]: 17: Hoare triple {979#false} assume !false; {979#false} is VALID [2022-04-28 09:30:55,535 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:30:55,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:30:55,689 INFO L290 TraceCheckUtils]: 17: Hoare triple {979#false} assume !false; {979#false} is VALID [2022-04-28 09:30:55,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {1039#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {979#false} is VALID [2022-04-28 09:30:55,691 INFO L290 TraceCheckUtils]: 15: Hoare triple {1035#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1039#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:30:55,691 INFO L272 TraceCheckUtils]: 14: Hoare triple {1055#(< 0 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1035#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:30:55,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {1055#(< 0 main_~k~0)} assume !!(~j~0 < ~n~0); {1055#(< 0 main_~k~0)} is VALID [2022-04-28 09:30:55,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {1055#(< 0 main_~k~0)} ~j~0 := 0; {1055#(< 0 main_~k~0)} is VALID [2022-04-28 09:30:55,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {1055#(< 0 main_~k~0)} assume !(~i~0 < ~n~0); {1055#(< 0 main_~k~0)} is VALID [2022-04-28 09:30:55,693 INFO L290 TraceCheckUtils]: 10: Hoare triple {1068#(< 0 (+ main_~k~0 main_~c3~0))} assume !(1 == ~v~0);~k~0 := ~k~0 + ~c3~0; {1055#(< 0 main_~k~0)} is VALID [2022-04-28 09:30:55,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {1068#(< 0 (+ main_~k~0 main_~c3~0))} assume !(0 == ~v~0); {1068#(< 0 (+ main_~k~0 main_~c3~0))} is VALID [2022-04-28 09:30:55,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {1068#(< 0 (+ main_~k~0 main_~c3~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {1068#(< 0 (+ main_~k~0 main_~c3~0))} is VALID [2022-04-28 09:30:55,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {1068#(< 0 (+ main_~k~0 main_~c3~0))} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {1068#(< 0 (+ main_~k~0 main_~c3~0))} is VALID [2022-04-28 09:30:55,695 INFO L290 TraceCheckUtils]: 6: Hoare triple {1081#(< 0 main_~c3~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {1068#(< 0 (+ main_~k~0 main_~c3~0))} is VALID [2022-04-28 09:30:55,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {978#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1081#(< 0 main_~c3~0)} is VALID [2022-04-28 09:30:55,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {978#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {978#true} is VALID [2022-04-28 09:30:55,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {978#true} {978#true} #83#return; {978#true} is VALID [2022-04-28 09:30:55,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {978#true} assume true; {978#true} is VALID [2022-04-28 09:30:55,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {978#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); {978#true} is VALID [2022-04-28 09:30:55,697 INFO L272 TraceCheckUtils]: 0: Hoare triple {978#true} call ULTIMATE.init(); {978#true} is VALID [2022-04-28 09:30:55,697 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:30:55,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034623615] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:30:55,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:30:55,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-28 09:30:55,697 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:30:55,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1903893984] [2022-04-28 09:30:55,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1903893984] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:55,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:30:55,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:30:55,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296467520] [2022-04-28 09:30:55,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:30:55,698 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 09:30:55,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:30:55,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:30:55,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:55,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:30:55,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:55,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:30:55,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:30:55,735 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:30:56,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:56,165 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2022-04-28 09:30:56,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:30:56,166 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 09:30:56,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:30:56,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:30:56,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 47 transitions. [2022-04-28 09:30:56,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:30:56,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 47 transitions. [2022-04-28 09:30:56,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 47 transitions. [2022-04-28 09:30:56,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:56,218 INFO L225 Difference]: With dead ends: 53 [2022-04-28 09:30:56,218 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 09:30:56,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-04-28 09:30:56,220 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 41 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:30:56,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 55 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:30:56,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 09:30:56,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2022-04-28 09:30:56,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:30:56,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 43 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:30:56,285 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 43 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:30:56,286 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 43 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:30:56,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:56,288 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2022-04-28 09:30:56,288 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2022-04-28 09:30:56,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:56,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:56,289 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 51 states. [2022-04-28 09:30:56,289 INFO L87 Difference]: Start difference. First operand has 43 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 51 states. [2022-04-28 09:30:56,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:56,291 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2022-04-28 09:30:56,291 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2022-04-28 09:30:56,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:56,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:56,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:30:56,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:30:56,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:30:56,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 56 transitions. [2022-04-28 09:30:56,294 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 56 transitions. Word has length 18 [2022-04-28 09:30:56,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:30:56,294 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 56 transitions. [2022-04-28 09:30:56,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:30:56,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 56 transitions. [2022-04-28 09:30:56,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:56,352 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 56 transitions. [2022-04-28 09:30:56,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 09:30:56,352 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:30:56,353 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:30:56,371 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:30:56,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:30:56,564 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:30:56,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:30:56,564 INFO L85 PathProgramCache]: Analyzing trace with hash -2044959957, now seen corresponding path program 1 times [2022-04-28 09:30:56,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:56,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [321991472] [2022-04-28 09:30:56,579 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:30:56,579 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:30:56,579 INFO L85 PathProgramCache]: Analyzing trace with hash -2044959957, now seen corresponding path program 2 times [2022-04-28 09:30:56,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:30:56,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081844832] [2022-04-28 09:30:56,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:30:56,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:30:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:56,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:30:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:56,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {1416#(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); {1408#true} is VALID [2022-04-28 09:30:56,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {1408#true} assume true; {1408#true} is VALID [2022-04-28 09:30:56,635 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1408#true} {1408#true} #83#return; {1408#true} is VALID [2022-04-28 09:30:56,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {1408#true} call ULTIMATE.init(); {1416#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:30:56,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {1416#(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); {1408#true} is VALID [2022-04-28 09:30:56,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {1408#true} assume true; {1408#true} is VALID [2022-04-28 09:30:56,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1408#true} {1408#true} #83#return; {1408#true} is VALID [2022-04-28 09:30:56,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {1408#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {1408#true} is VALID [2022-04-28 09:30:56,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {1408#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1408#true} is VALID [2022-04-28 09:30:56,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {1408#true} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {1413#(= main_~i~0 0)} is VALID [2022-04-28 09:30:56,637 INFO L290 TraceCheckUtils]: 7: Hoare triple {1413#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {1414#(<= 1 main_~i~0)} is VALID [2022-04-28 09:30:56,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {1414#(<= 1 main_~i~0)} assume !!(0 <= ~v~0 && ~n~0 < 2); {1415#(<= main_~n~0 main_~i~0)} is VALID [2022-04-28 09:30:56,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {1415#(<= main_~n~0 main_~i~0)} assume 0 == ~v~0;~k~0 := ~k~0 + ~c1~0; {1415#(<= main_~n~0 main_~i~0)} is VALID [2022-04-28 09:30:56,639 INFO L290 TraceCheckUtils]: 10: Hoare triple {1415#(<= main_~n~0 main_~i~0)} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {1409#false} is VALID [2022-04-28 09:30:56,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {1409#false} assume !!(0 <= ~v~0 && ~n~0 < 2); {1409#false} is VALID [2022-04-28 09:30:56,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {1409#false} assume !(0 == ~v~0); {1409#false} is VALID [2022-04-28 09:30:56,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {1409#false} assume 1 == ~v~0;~k~0 := ~k~0 + ~c2~0; {1409#false} is VALID [2022-04-28 09:30:56,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {1409#false} assume !(~i~0 < ~n~0); {1409#false} is VALID [2022-04-28 09:30:56,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {1409#false} ~j~0 := 0; {1409#false} is VALID [2022-04-28 09:30:56,644 INFO L290 TraceCheckUtils]: 16: Hoare triple {1409#false} assume !!(~j~0 < ~n~0); {1409#false} is VALID [2022-04-28 09:30:56,644 INFO L272 TraceCheckUtils]: 17: Hoare triple {1409#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1409#false} is VALID [2022-04-28 09:30:56,644 INFO L290 TraceCheckUtils]: 18: Hoare triple {1409#false} ~cond := #in~cond; {1409#false} is VALID [2022-04-28 09:30:56,644 INFO L290 TraceCheckUtils]: 19: Hoare triple {1409#false} assume 0 == ~cond; {1409#false} is VALID [2022-04-28 09:30:56,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {1409#false} assume !false; {1409#false} is VALID [2022-04-28 09:30:56,645 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:30:56,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:30:56,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081844832] [2022-04-28 09:30:56,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081844832] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:30:56,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064762938] [2022-04-28 09:30:56,646 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:30:56,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:30:56,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:30:56,648 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:30:56,676 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:30:56,699 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:30:56,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:30:56,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 09:30:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:56,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:30:56,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {1408#true} call ULTIMATE.init(); {1408#true} is VALID [2022-04-28 09:30:56,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {1408#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); {1408#true} is VALID [2022-04-28 09:30:56,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {1408#true} assume true; {1408#true} is VALID [2022-04-28 09:30:56,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1408#true} {1408#true} #83#return; {1408#true} is VALID [2022-04-28 09:30:56,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {1408#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {1408#true} is VALID [2022-04-28 09:30:56,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {1408#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1408#true} is VALID [2022-04-28 09:30:56,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {1408#true} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {1438#(<= 0 main_~i~0)} is VALID [2022-04-28 09:30:56,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {1438#(<= 0 main_~i~0)} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {1414#(<= 1 main_~i~0)} is VALID [2022-04-28 09:30:56,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {1414#(<= 1 main_~i~0)} assume !!(0 <= ~v~0 && ~n~0 < 2); {1445#(and (< main_~n~0 2) (<= 1 main_~i~0))} is VALID [2022-04-28 09:30:56,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {1445#(and (< main_~n~0 2) (<= 1 main_~i~0))} assume 0 == ~v~0;~k~0 := ~k~0 + ~c1~0; {1445#(and (< main_~n~0 2) (<= 1 main_~i~0))} is VALID [2022-04-28 09:30:56,835 INFO L290 TraceCheckUtils]: 10: Hoare triple {1445#(and (< main_~n~0 2) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {1409#false} is VALID [2022-04-28 09:30:56,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {1409#false} assume !!(0 <= ~v~0 && ~n~0 < 2); {1409#false} is VALID [2022-04-28 09:30:56,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {1409#false} assume !(0 == ~v~0); {1409#false} is VALID [2022-04-28 09:30:56,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {1409#false} assume 1 == ~v~0;~k~0 := ~k~0 + ~c2~0; {1409#false} is VALID [2022-04-28 09:30:56,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {1409#false} assume !(~i~0 < ~n~0); {1409#false} is VALID [2022-04-28 09:30:56,836 INFO L290 TraceCheckUtils]: 15: Hoare triple {1409#false} ~j~0 := 0; {1409#false} is VALID [2022-04-28 09:30:56,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {1409#false} assume !!(~j~0 < ~n~0); {1409#false} is VALID [2022-04-28 09:30:56,836 INFO L272 TraceCheckUtils]: 17: Hoare triple {1409#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1409#false} is VALID [2022-04-28 09:30:56,836 INFO L290 TraceCheckUtils]: 18: Hoare triple {1409#false} ~cond := #in~cond; {1409#false} is VALID [2022-04-28 09:30:56,836 INFO L290 TraceCheckUtils]: 19: Hoare triple {1409#false} assume 0 == ~cond; {1409#false} is VALID [2022-04-28 09:30:56,837 INFO L290 TraceCheckUtils]: 20: Hoare triple {1409#false} assume !false; {1409#false} is VALID [2022-04-28 09:30:56,837 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:30:56,837 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 09:30:56,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064762938] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:56,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 09:30:56,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2022-04-28 09:30:56,838 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:30:56,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [321991472] [2022-04-28 09:30:56,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [321991472] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:56,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:30:56,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:30:56,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340190040] [2022-04-28 09:30:56,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:30:56,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 21 [2022-04-28 09:30:56,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:30:56,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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:30:56,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:56,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:30:56,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:56,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:30:56,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-28 09:30:56,857 INFO L87 Difference]: Start difference. First operand 43 states and 56 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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:30:56,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:56,966 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2022-04-28 09:30:56,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:30:56,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 21 [2022-04-28 09:30:56,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:30:56,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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:30:56,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-04-28 09:30:56,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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:30:56,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-04-28 09:30:56,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2022-04-28 09:30:57,021 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:30:57,022 INFO L225 Difference]: With dead ends: 62 [2022-04-28 09:30:57,022 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 09:30:57,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-28 09:30:57,023 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 16 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:30:57,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 43 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:30:57,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 09:30:57,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-04-28 09:30:57,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:30:57,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:30:57,097 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:30:57,097 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:30:57,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:57,099 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-28 09:30:57,099 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-28 09:30:57,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:57,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:57,099 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-04-28 09:30:57,099 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-04-28 09:30:57,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:57,100 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-28 09:30:57,101 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-28 09:30:57,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:57,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:57,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:30:57,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:30:57,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:30:57,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-04-28 09:30:57,104 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 21 [2022-04-28 09:30:57,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:30:57,104 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-04-28 09:30:57,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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:30:57,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 30 transitions. [2022-04-28 09:30:57,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:30:57,142 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-28 09:30:57,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 09:30:57,143 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:30:57,143 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:30:57,175 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:30:57,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:30:57,359 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:30:57,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:30:57,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1943105420, now seen corresponding path program 1 times [2022-04-28 09:30:57,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:57,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1579462259] [2022-04-28 09:30:57,381 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:30:57,381 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:30:57,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1943105420, now seen corresponding path program 2 times [2022-04-28 09:30:57,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:30:57,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827022604] [2022-04-28 09:30:57,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:30:57,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:30:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:57,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:30:57,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:57,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {1736#(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); {1721#true} is VALID [2022-04-28 09:30:57,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {1721#true} assume true; {1721#true} is VALID [2022-04-28 09:30:57,454 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1721#true} {1721#true} #83#return; {1721#true} is VALID [2022-04-28 09:30:57,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-28 09:30:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:57,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {1721#true} ~cond := #in~cond; {1721#true} is VALID [2022-04-28 09:30:57,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {1721#true} assume !(0 == ~cond); {1721#true} is VALID [2022-04-28 09:30:57,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {1721#true} assume true; {1721#true} is VALID [2022-04-28 09:30:57,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1721#true} {1728#(<= 4000 main_~k~0)} #81#return; {1728#(<= 4000 main_~k~0)} is VALID [2022-04-28 09:30:57,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {1721#true} call ULTIMATE.init(); {1736#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:30:57,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {1736#(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); {1721#true} is VALID [2022-04-28 09:30:57,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {1721#true} assume true; {1721#true} is VALID [2022-04-28 09:30:57,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1721#true} {1721#true} #83#return; {1721#true} is VALID [2022-04-28 09:30:57,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {1721#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {1721#true} is VALID [2022-04-28 09:30:57,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {1721#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1726#(<= 4000 main_~c1~0)} is VALID [2022-04-28 09:30:57,469 INFO L290 TraceCheckUtils]: 6: Hoare triple {1726#(<= 4000 main_~c1~0)} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {1727#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} is VALID [2022-04-28 09:30:57,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {1727#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {1727#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} is VALID [2022-04-28 09:30:57,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {1727#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} assume !!(0 <= ~v~0 && ~n~0 < 2); {1727#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} is VALID [2022-04-28 09:30:57,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {1727#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} assume 0 == ~v~0;~k~0 := ~k~0 + ~c1~0; {1728#(<= 4000 main_~k~0)} is VALID [2022-04-28 09:30:57,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {1728#(<= 4000 main_~k~0)} assume !(~i~0 < ~n~0); {1728#(<= 4000 main_~k~0)} is VALID [2022-04-28 09:30:57,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {1728#(<= 4000 main_~k~0)} ~j~0 := 0; {1728#(<= 4000 main_~k~0)} is VALID [2022-04-28 09:30:57,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {1728#(<= 4000 main_~k~0)} assume !!(~j~0 < ~n~0); {1728#(<= 4000 main_~k~0)} is VALID [2022-04-28 09:30:57,473 INFO L272 TraceCheckUtils]: 13: Hoare triple {1728#(<= 4000 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1721#true} is VALID [2022-04-28 09:30:57,473 INFO L290 TraceCheckUtils]: 14: Hoare triple {1721#true} ~cond := #in~cond; {1721#true} is VALID [2022-04-28 09:30:57,474 INFO L290 TraceCheckUtils]: 15: Hoare triple {1721#true} assume !(0 == ~cond); {1721#true} is VALID [2022-04-28 09:30:57,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {1721#true} assume true; {1721#true} is VALID [2022-04-28 09:30:57,475 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1721#true} {1728#(<= 4000 main_~k~0)} #81#return; {1728#(<= 4000 main_~k~0)} is VALID [2022-04-28 09:30:57,478 INFO L290 TraceCheckUtils]: 18: Hoare triple {1728#(<= 4000 main_~k~0)} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {1733#(<= 3999 main_~k~0)} is VALID [2022-04-28 09:30:57,479 INFO L290 TraceCheckUtils]: 19: Hoare triple {1733#(<= 3999 main_~k~0)} assume !!(~j~0 < ~n~0); {1733#(<= 3999 main_~k~0)} is VALID [2022-04-28 09:30:57,479 INFO L272 TraceCheckUtils]: 20: Hoare triple {1733#(<= 3999 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1734#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:30:57,480 INFO L290 TraceCheckUtils]: 21: Hoare triple {1734#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1735#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:30:57,480 INFO L290 TraceCheckUtils]: 22: Hoare triple {1735#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1722#false} is VALID [2022-04-28 09:30:57,480 INFO L290 TraceCheckUtils]: 23: Hoare triple {1722#false} assume !false; {1722#false} is VALID [2022-04-28 09:30:57,480 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:30:57,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:30:57,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827022604] [2022-04-28 09:30:57,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827022604] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:30:57,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6339548] [2022-04-28 09:30:57,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:30:57,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:30:57,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:30:57,482 INFO L229 MonitoredProcess]: Starting monitored process 6 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:30:57,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 09:30:57,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:30:57,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:30:57,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 09:30:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:30:57,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:30:57,727 INFO L272 TraceCheckUtils]: 0: Hoare triple {1721#true} call ULTIMATE.init(); {1721#true} is VALID [2022-04-28 09:30:57,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {1721#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); {1721#true} is VALID [2022-04-28 09:30:57,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {1721#true} assume true; {1721#true} is VALID [2022-04-28 09:30:57,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1721#true} {1721#true} #83#return; {1721#true} is VALID [2022-04-28 09:30:57,728 INFO L272 TraceCheckUtils]: 4: Hoare triple {1721#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {1721#true} is VALID [2022-04-28 09:30:57,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {1721#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~c1~0 := 4000;~c2~0 := 2000;~c3~0 := 10000;havoc ~n~0;havoc ~v~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1721#true} is VALID [2022-04-28 09:30:57,728 INFO L290 TraceCheckUtils]: 6: Hoare triple {1721#true} assume !!(0 <= ~n~0 && ~n~0 < 10);~k~0 := 0;~i~0 := 0; {1721#true} is VALID [2022-04-28 09:30:57,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {1721#true} assume !!(~i~0 < ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~v~0 := #t~nondet3;havoc #t~nondet3; {1721#true} is VALID [2022-04-28 09:30:57,729 INFO L290 TraceCheckUtils]: 8: Hoare triple {1721#true} assume !!(0 <= ~v~0 && ~n~0 < 2); {1764#(< main_~n~0 2)} is VALID [2022-04-28 09:30:57,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {1764#(< main_~n~0 2)} assume 0 == ~v~0;~k~0 := ~k~0 + ~c1~0; {1764#(< main_~n~0 2)} is VALID [2022-04-28 09:30:57,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {1764#(< main_~n~0 2)} assume !(~i~0 < ~n~0); {1764#(< main_~n~0 2)} is VALID [2022-04-28 09:30:57,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {1764#(< main_~n~0 2)} ~j~0 := 0; {1774#(and (<= 0 main_~j~0) (< main_~n~0 2))} is VALID [2022-04-28 09:30:57,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {1774#(and (<= 0 main_~j~0) (< main_~n~0 2))} assume !!(~j~0 < ~n~0); {1774#(and (<= 0 main_~j~0) (< main_~n~0 2))} is VALID [2022-04-28 09:30:57,730 INFO L272 TraceCheckUtils]: 13: Hoare triple {1774#(and (<= 0 main_~j~0) (< main_~n~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1721#true} is VALID [2022-04-28 09:30:57,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {1721#true} ~cond := #in~cond; {1721#true} is VALID [2022-04-28 09:30:57,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {1721#true} assume !(0 == ~cond); {1721#true} is VALID [2022-04-28 09:30:57,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {1721#true} assume true; {1721#true} is VALID [2022-04-28 09:30:57,731 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1721#true} {1774#(and (<= 0 main_~j~0) (< main_~n~0 2))} #81#return; {1774#(and (<= 0 main_~j~0) (< main_~n~0 2))} is VALID [2022-04-28 09:30:57,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {1774#(and (<= 0 main_~j~0) (< main_~n~0 2))} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {1796#(and (<= 1 main_~j~0) (< main_~n~0 2))} is VALID [2022-04-28 09:30:57,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {1796#(and (<= 1 main_~j~0) (< main_~n~0 2))} assume !!(~j~0 < ~n~0); {1722#false} is VALID [2022-04-28 09:30:57,733 INFO L272 TraceCheckUtils]: 20: Hoare triple {1722#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1722#false} is VALID [2022-04-28 09:30:57,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {1722#false} ~cond := #in~cond; {1722#false} is VALID [2022-04-28 09:30:57,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {1722#false} assume 0 == ~cond; {1722#false} is VALID [2022-04-28 09:30:57,733 INFO L290 TraceCheckUtils]: 23: Hoare triple {1722#false} assume !false; {1722#false} is VALID [2022-04-28 09:30:57,735 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:30:57,735 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 09:30:57,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6339548] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:57,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 09:30:57,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2022-04-28 09:30:57,736 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:30:57,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1579462259] [2022-04-28 09:30:57,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1579462259] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:30:57,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:30:57,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:30:57,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256807862] [2022-04-28 09:30:57,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:30:57,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 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 24 [2022-04-28 09:30:57,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:30:57,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 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:30:57,758 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:30:57,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:30:57,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:30:57,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:30:57,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-04-28 09:30:57,762 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 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:30:57,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:57,871 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-28 09:30:57,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:30:57,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 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 24 [2022-04-28 09:30:57,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:30:57,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 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:30:57,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 09:30:57,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 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:30:57,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 09:30:57,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-28 09:30:57,895 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:30:57,895 INFO L225 Difference]: With dead ends: 30 [2022-04-28 09:30:57,895 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 09:30:57,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-04-28 09:30:57,896 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 5 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:30:57,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 45 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:30:57,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 09:30:57,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 09:30:57,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:30:57,897 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:30:57,897 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:30:57,897 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:30:57,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:57,898 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:30:57,898 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:30:57,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:57,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:57,898 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:30:57,898 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:30:57,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:30:57,898 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:30:57,898 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:30:57,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:57,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:30:57,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:30:57,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:30:57,898 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:30:57,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 09:30:57,899 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-04-28 09:30:57,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:30:57,899 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 09:30:57,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 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:30:57,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 09:30:57,899 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:30:57,899 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:30:57,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:30:57,902 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 09:30:57,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 09:30:58,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:30:58,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 09:30:58,481 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-28 09:30:58,481 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-28 09:30:58,481 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-28 09:30:58,481 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-28 09:30:58,481 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:30:58,481 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:30:58,481 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:30:58,481 INFO L895 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= 4000 main_~c1~0) (<= 2000 main_~c2~0)) [2022-04-28 09:30:58,481 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 24 52) the Hoare annotation is: true [2022-04-28 09:30:58,481 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 24 52) the Hoare annotation is: true [2022-04-28 09:30:58,481 INFO L895 garLoopResultBuilder]: At program point L46-2(lines 46 50) the Hoare annotation is: (let ((.cse0 (<= 10000 main_~c3~0)) (.cse1 (<= 4000 main_~c1~0)) (.cse2 (< main_~n~0 2)) (.cse3 (<= 2000 main_~c2~0)) (.cse4 (<= 1 main_~i~0))) (or (and .cse0 (<= 0 main_~j~0) (<= 2000 main_~k~0) .cse1 .cse2 .cse3 .cse4) (and (= main_~j~0 0) (= main_~i~0 0) (<= main_~n~0 0)) (and .cse0 (<= 1 main_~j~0) .cse1 .cse2 .cse3 .cse4))) [2022-04-28 09:30:58,481 INFO L902 garLoopResultBuilder]: At program point L46-3(lines 46 50) the Hoare annotation is: true [2022-04-28 09:30:58,482 INFO L895 garLoopResultBuilder]: At program point L40(lines 40 43) the Hoare annotation is: (and (<= 10000 main_~c3~0) (= main_~k~0 0) (<= 4000 main_~c1~0) (< main_~n~0 2) (<= 2000 main_~c2~0) (<= 1 main_~i~0)) [2022-04-28 09:30:58,482 INFO L895 garLoopResultBuilder]: At program point L38(lines 38 43) the Hoare annotation is: (and (<= 10000 main_~c3~0) (= main_~k~0 0) (<= 4000 main_~c1~0) (< main_~n~0 2) (<= 2000 main_~c2~0) (<= 1 main_~i~0)) [2022-04-28 09:30:58,483 INFO L895 garLoopResultBuilder]: At program point L40-2(lines 34 44) the Hoare annotation is: (let ((.cse0 (<= 10000 main_~c3~0)) (.cse1 (<= 4000 main_~c1~0)) (.cse2 (<= 2000 main_~c2~0))) (or (and .cse0 (<= 2000 main_~k~0) .cse1 (< main_~n~0 2) .cse2 (<= 1 main_~i~0)) (and .cse0 (= main_~k~0 0) .cse1 (= main_~i~0 0) .cse2))) [2022-04-28 09:30:58,483 INFO L895 garLoopResultBuilder]: At program point L34-2(lines 34 44) the Hoare annotation is: (or (and (= main_~i~0 0) (<= main_~n~0 0)) (and (<= 10000 main_~c3~0) (<= 2000 main_~k~0) (<= 4000 main_~c1~0) (< main_~n~0 2) (<= 2000 main_~c2~0) (<= 1 main_~i~0))) [2022-04-28 09:30:58,483 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 52) the Hoare annotation is: true [2022-04-28 09:30:58,483 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= 0 main_~j~0) (<= 2000 main_~k~0) (<= 4000 main_~c1~0) (< main_~n~0 2) (<= 2000 main_~c2~0) (<= 1 main_~i~0)) [2022-04-28 09:30:58,483 INFO L895 garLoopResultBuilder]: At program point L47-1(line 47) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= 0 main_~j~0) (<= 4000 main_~c1~0) (< main_~n~0 2) (<= 2000 main_~c2~0) (<= 1 main_~i~0)) [2022-04-28 09:30:58,484 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (and (<= 10000 main_~c3~0) (= main_~k~0 0) (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 1 main_~i~0)) [2022-04-28 09:30:58,484 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:30:58,484 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:30:58,484 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:30:58,484 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:30:58,484 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 09:30:58,484 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 09:30:58,484 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:30:58,484 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:30:58,484 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-28 09:30:58,484 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:30:58,485 INFO L895 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 09:30:58,485 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:30:58,485 INFO L895 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 09:30:58,488 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2] [2022-04-28 09:30:58,490 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 09:30:58,493 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:30:58,493 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:30:58,493 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 09:30:58,494 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-28 09:30:58,494 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 09:30:58,494 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 09:30:58,496 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-28 09:30:58,520 INFO L163 areAnnotationChecker]: CFG has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 09:30:58,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:30:58 BoogieIcfgContainer [2022-04-28 09:30:58,540 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 09:30:58,541 INFO L158 Benchmark]: Toolchain (without parser) took 7888.54ms. Allocated memory was 185.6MB in the beginning and 223.3MB in the end (delta: 37.7MB). Free memory was 135.0MB in the beginning and 110.2MB in the end (delta: 24.8MB). Peak memory consumption was 62.6MB. Max. memory is 8.0GB. [2022-04-28 09:30:58,541 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 185.6MB. Free memory was 151.4MB in the beginning and 151.4MB in the end (delta: 69.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 09:30:58,542 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.00ms. Allocated memory was 185.6MB in the beginning and 223.3MB in the end (delta: 37.7MB). Free memory was 134.8MB in the beginning and 199.0MB in the end (delta: -64.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 09:30:58,542 INFO L158 Benchmark]: Boogie Preprocessor took 41.03ms. Allocated memory is still 223.3MB. Free memory was 199.0MB in the beginning and 197.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 09:30:58,542 INFO L158 Benchmark]: RCFGBuilder took 476.45ms. Allocated memory is still 223.3MB. Free memory was 197.4MB in the beginning and 184.3MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 09:30:58,542 INFO L158 Benchmark]: TraceAbstraction took 7153.30ms. Allocated memory is still 223.3MB. Free memory was 183.7MB in the beginning and 110.2MB in the end (delta: 73.5MB). Peak memory consumption was 74.1MB. Max. memory is 8.0GB. [2022-04-28 09:30:58,543 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.14ms. Allocated memory is still 185.6MB. Free memory was 151.4MB in the beginning and 151.4MB in the end (delta: 69.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 210.00ms. Allocated memory was 185.6MB in the beginning and 223.3MB in the end (delta: 37.7MB). Free memory was 134.8MB in the beginning and 199.0MB in the end (delta: -64.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.03ms. Allocated memory is still 223.3MB. Free memory was 199.0MB in the beginning and 197.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 476.45ms. Allocated memory is still 223.3MB. Free memory was 197.4MB in the beginning and 184.3MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 7153.30ms. Allocated memory is still 223.3MB. Free memory was 183.7MB in the beginning and 110.2MB in the end (delta: 73.5MB). Peak memory consumption was 74.1MB. 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, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 202 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 200 mSDsluCounter, 279 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 134 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 457 IncrementalHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 145 mSDtfsCounter, 457 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 220 GetRequests, 140 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=4, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 24 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 50 PreInvPairs, 72 NumberOfFragments, 268 HoareAnnotationTreeSize, 50 FomulaSimplifications, 3 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 26 FomulaSimplificationsInter, 279 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: 34]: Loop Invariant Derived loop invariant: (((((10000 <= c3 && 2000 <= k) && 4000 <= c1) && n < 2) && 2000 <= c2) && 1 <= i) || ((((10000 <= c3 && k == 0) && 4000 <= c1) && i == 0) && 2000 <= c2) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (((((((10000 <= c3 && 0 <= j) && 2000 <= k) && 4000 <= c1) && n < 2) && 2000 <= c2) && 1 <= i) || ((j == 0 && i == 0) && n <= 0)) || (((((10000 <= c3 && 1 <= j) && 4000 <= c1) && n < 2) && 2000 <= c2) && 1 <= i) - 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:30:58,595 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...