/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-new/nested-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:21:49,660 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:21:49,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:21:49,723 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:21:49,723 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:21:49,724 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:21:49,727 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:21:49,729 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:21:49,730 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:21:49,734 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:21:49,734 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:21:49,736 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:21:49,736 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:21:49,737 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:21:49,738 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:21:49,740 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:21:49,741 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:21:49,741 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:21:49,743 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:21:49,746 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:21:49,747 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:21:49,748 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:21:49,749 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:21:49,749 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:21:49,750 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:21:49,752 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:21:49,752 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:21:49,752 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:21:49,753 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:21:49,753 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:21:49,754 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:21:49,754 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:21:49,755 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:21:49,755 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:21:49,755 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:21:49,756 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:21:49,756 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:21:49,757 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:21:49,757 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:21:49,757 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:21:49,757 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:21:49,758 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:21:49,759 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:21:49,768 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:21:49,768 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:21:49,769 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:21:49,769 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:21:49,769 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:21:49,769 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:21:49,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:21:49,769 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:21:49,769 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:21:49,770 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:21:49,770 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:21:49,770 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:21:49,770 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:21:49,770 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:21:49,770 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:21:49,770 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:21:49,771 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:21:49,771 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:21:49,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:21:49,771 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:21:49,771 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:21:49,771 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:21:49,771 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:21:49,771 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:21:49,771 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:21:49,771 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 03:21:49,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:21:49,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:21:49,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:21:49,963 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:21:49,963 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:21:49,964 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/nested-1.i [2022-04-28 03:21:50,009 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d07a23d19/879733b6e83943e0aa9fec0707b5d469/FLAGd90f8055d [2022-04-28 03:21:50,337 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:21:50,338 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/nested-1.i [2022-04-28 03:21:50,341 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d07a23d19/879733b6e83943e0aa9fec0707b5d469/FLAGd90f8055d [2022-04-28 03:21:50,351 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d07a23d19/879733b6e83943e0aa9fec0707b5d469 [2022-04-28 03:21:50,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:21:50,354 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:21:50,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:21:50,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:21:50,361 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:21:50,362 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:21:50" (1/1) ... [2022-04-28 03:21:50,363 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d37f7bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:21:50, skipping insertion in model container [2022-04-28 03:21:50,363 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:21:50" (1/1) ... [2022-04-28 03:21:50,368 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:21:50,376 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:21:50,535 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-new/nested-1.i[891,904] [2022-04-28 03:21:50,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:21:50,556 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:21:50,567 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-new/nested-1.i[891,904] [2022-04-28 03:21:50,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:21:50,585 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:21:50,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:21:50 WrapperNode [2022-04-28 03:21:50,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:21:50,586 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:21:50,586 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:21:50,586 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:21:50,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:21:50" (1/1) ... [2022-04-28 03:21:50,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:21:50" (1/1) ... [2022-04-28 03:21:50,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:21:50" (1/1) ... [2022-04-28 03:21:50,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:21:50" (1/1) ... [2022-04-28 03:21:50,607 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:21:50" (1/1) ... [2022-04-28 03:21:50,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:21:50" (1/1) ... [2022-04-28 03:21:50,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:21:50" (1/1) ... [2022-04-28 03:21:50,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:21:50,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:21:50,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:21:50,612 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:21:50,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:21:50" (1/1) ... [2022-04-28 03:21:50,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:21:50,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:21:50,640 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 03:21:50,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 03:21:50,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:21:50,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:21:50,662 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:21:50,662 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 03:21:50,662 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:21:50,662 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:21:50,663 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:21:50,663 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:21:50,663 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 03:21:50,663 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 03:21:50,663 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:21:50,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:21:50,663 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 03:21:50,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:21:50,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 03:21:50,663 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:21:50,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:21:50,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:21:50,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:21:50,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:21:50,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:21:50,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:21:50,705 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:21:50,706 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:21:50,814 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:21:50,820 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:21:50,820 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 03:21:50,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:21:50 BoogieIcfgContainer [2022-04-28 03:21:50,822 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:21:50,823 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:21:50,823 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:21:50,826 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:21:50,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:21:50" (1/3) ... [2022-04-28 03:21:50,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b1ec237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:21:50, skipping insertion in model container [2022-04-28 03:21:50,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:21:50" (2/3) ... [2022-04-28 03:21:50,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b1ec237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:21:50, skipping insertion in model container [2022-04-28 03:21:50,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:21:50" (3/3) ... [2022-04-28 03:21:50,828 INFO L111 eAbstractionObserver]: Analyzing ICFG nested-1.i [2022-04-28 03:21:50,839 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:21:50,839 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:21:50,869 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:21:50,874 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@f003478, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2749a264 [2022-04-28 03:21:50,875 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:21:50,881 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:21:50,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 03:21:50,886 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:21:50,887 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:21:50,887 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:21:50,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:21:50,891 INFO L85 PathProgramCache]: Analyzing trace with hash 486387592, now seen corresponding path program 1 times [2022-04-28 03:21:50,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:21:50,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [265264641] [2022-04-28 03:21:50,906 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:21:50,906 INFO L85 PathProgramCache]: Analyzing trace with hash 486387592, now seen corresponding path program 2 times [2022-04-28 03:21:50,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:21:50,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800730252] [2022-04-28 03:21:50,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:21:50,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:21:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:51,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:21:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:51,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {27#true} is VALID [2022-04-28 03:21:51,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-28 03:21:51,116 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #71#return; {27#true} is VALID [2022-04-28 03:21:51,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {34#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:21:51,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {27#true} is VALID [2022-04-28 03:21:51,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-28 03:21:51,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #71#return; {27#true} is VALID [2022-04-28 03:21:51,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret6 := main(); {27#true} is VALID [2022-04-28 03:21:51,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {27#true} is VALID [2022-04-28 03:21:51,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {32#(<= 10 main_~n~0)} is VALID [2022-04-28 03:21:51,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#(<= 10 main_~n~0)} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {33#(and (<= 10 main_~n~0) (= main_~i~0 0))} is VALID [2022-04-28 03:21:51,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#(and (<= 10 main_~n~0) (= main_~i~0 0))} assume !(~i~0 < ~n~0); {28#false} is VALID [2022-04-28 03:21:51,120 INFO L272 TraceCheckUtils]: 9: Hoare triple {28#false} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {28#false} is VALID [2022-04-28 03:21:51,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-28 03:21:51,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-28 03:21:51,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-28 03:21:51,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:21:51,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:21:51,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800730252] [2022-04-28 03:21:51,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800730252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:21:51,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:21:51,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:21:51,124 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:21:51,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [265264641] [2022-04-28 03:21:51,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [265264641] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:21:51,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:21:51,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:21:51,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172776576] [2022-04-28 03:21:51,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:21:51,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 03:21:51,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:21:51,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:21:51,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:21:51,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 03:21:51,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:21:51,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 03:21:51,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 03:21:51,178 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 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 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:21:51,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:21:51,413 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2022-04-28 03:21:51,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 03:21:51,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 03:21:51,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:21:51,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:21:51,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-04-28 03:21:51,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:21:51,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-04-28 03:21:51,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 61 transitions. [2022-04-28 03:21:51,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:21:51,492 INFO L225 Difference]: With dead ends: 46 [2022-04-28 03:21:51,492 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 03:21:51,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:21:51,498 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 36 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:21:51,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 40 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:21:51,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 03:21:51,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2022-04-28 03:21:51,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:21:51,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:21:51,533 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:21:51,533 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:21:51,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:21:51,535 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-28 03:21:51,535 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-28 03:21:51,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:21:51,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:21:51,536 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 03:21:51,536 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 03:21:51,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:21:51,539 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-28 03:21:51,539 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-28 03:21:51,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:21:51,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:21:51,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:21:51,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:21:51,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:21:51,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-04-28 03:21:51,545 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2022-04-28 03:21:51,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:21:51,549 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-04-28 03:21:51,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:21:51,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 19 transitions. [2022-04-28 03:21:51,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:21:51,568 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-28 03:21:51,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 03:21:51,569 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:21:51,569 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:21:51,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:21:51,569 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:21:51,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:21:51,571 INFO L85 PathProgramCache]: Analyzing trace with hash 123963385, now seen corresponding path program 1 times [2022-04-28 03:21:51,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:21:51,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [29304514] [2022-04-28 03:21:54,287 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:21:54,466 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:21:54,467 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:21:54,470 INFO L85 PathProgramCache]: Analyzing trace with hash -779046942, now seen corresponding path program 1 times [2022-04-28 03:21:54,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:21:54,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850862102] [2022-04-28 03:21:54,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:21:54,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:21:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:54,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:21:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:54,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {219#(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); {211#true} is VALID [2022-04-28 03:21:54,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {211#true} assume true; {211#true} is VALID [2022-04-28 03:21:54,549 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {211#true} {211#true} #71#return; {211#true} is VALID [2022-04-28 03:21:54,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {211#true} call ULTIMATE.init(); {219#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:21:54,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {219#(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); {211#true} is VALID [2022-04-28 03:21:54,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {211#true} assume true; {211#true} is VALID [2022-04-28 03:21:54,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {211#true} {211#true} #71#return; {211#true} is VALID [2022-04-28 03:21:54,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {211#true} call #t~ret6 := main(); {211#true} is VALID [2022-04-28 03:21:54,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {211#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {211#true} is VALID [2022-04-28 03:21:54,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {211#true} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {216#(<= 10 main_~n~0)} is VALID [2022-04-28 03:21:54,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {216#(<= 10 main_~n~0)} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {217#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~i~0 0))} is VALID [2022-04-28 03:21:54,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {217#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~i~0 0))} [75] L31-3-->L31-4_primed: Formula: (let ((.cse1 (= v_main_~i~0_8 v_main_~i~0_7)) (.cse2 (= |v_main_#t~post3_4| |v_main_#t~post3_3|)) (.cse3 (= v_main_~j~0_8 v_main_~j~0_7)) (.cse0 (<= v_main_~m~0_6 0))) (or (and .cse0 (< v_main_~i~0_8 v_main_~i~0_7) (= v_main_~j~0_7 0) (< v_main_~i~0_7 (+ v_main_~n~0_6 1))) (and (= v_main_~n~0_6 v_main_~n~0_6) .cse1 .cse2 .cse3 (= v_main_~m~0_6 v_main_~m~0_6)) (and .cse1 .cse2 .cse3 (or (not (< v_main_~i~0_8 v_main_~n~0_6)) (not .cse0))))) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_6, main_#t~post3=|v_main_#t~post3_4|, main_~m~0=v_main_~m~0_6, main_~j~0=v_main_~j~0_8} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_3|, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post3] {218#(<= (+ main_~i~0 10) main_~n~0)} is VALID [2022-04-28 03:21:54,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {218#(<= (+ main_~i~0 10) main_~n~0)} [74] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {212#false} is VALID [2022-04-28 03:21:54,553 INFO L272 TraceCheckUtils]: 10: Hoare triple {212#false} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {212#false} is VALID [2022-04-28 03:21:54,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {212#false} ~cond := #in~cond; {212#false} is VALID [2022-04-28 03:21:54,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {212#false} assume 0 == ~cond; {212#false} is VALID [2022-04-28 03:21:54,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {212#false} assume !false; {212#false} is VALID [2022-04-28 03:21:54,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:21:54,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:21:54,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850862102] [2022-04-28 03:21:54,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850862102] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:21:54,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:21:54,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:21:54,614 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:21:54,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [29304514] [2022-04-28 03:21:54,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [29304514] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:21:54,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:21:54,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:21:54,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193033165] [2022-04-28 03:21:54,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:21:54,616 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 03:21:54,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:21:54,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:21:54,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:21:54,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:21:54,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:21:54,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:21:54,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:21:54,629 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:21:54,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:21:54,751 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-28 03:21:54,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:21:54,751 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 03:21:54,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:21:54,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:21:54,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-28 03:21:54,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:21:54,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-28 03:21:54,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2022-04-28 03:21:54,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:21:54,779 INFO L225 Difference]: With dead ends: 32 [2022-04-28 03:21:54,779 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 03:21:54,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:21:54,780 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 33 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:21:54,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 24 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:21:54,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 03:21:54,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2022-04-28 03:21:54,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:21:54,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:21:54,791 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:21:54,792 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:21:54,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:21:54,793 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 03:21:54,793 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 03:21:54,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:21:54,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:21:54,793 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 03:21:54,794 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 03:21:54,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:21:54,794 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 03:21:54,795 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 03:21:54,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:21:54,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:21:54,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:21:54,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:21:54,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:21:54,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-04-28 03:21:54,796 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2022-04-28 03:21:54,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:21:54,796 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-04-28 03:21:54,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:21:54,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 20 transitions. [2022-04-28 03:21:54,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:21:54,813 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-28 03:21:54,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 03:21:54,813 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:21:54,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:21:54,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:21:54,813 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:21:54,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:21:54,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1005518441, now seen corresponding path program 1 times [2022-04-28 03:21:54,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:21:54,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2109848877] [2022-04-28 03:21:55,037 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:21:55,349 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:21:55,351 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:21:55,353 INFO L85 PathProgramCache]: Analyzing trace with hash -719941598, now seen corresponding path program 1 times [2022-04-28 03:21:55,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:21:55,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688912812] [2022-04-28 03:21:55,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:21:55,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:21:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:55,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:21:55,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:55,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {385#(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); {377#true} is VALID [2022-04-28 03:21:55,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#true} assume true; {377#true} is VALID [2022-04-28 03:21:55,420 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {377#true} {377#true} #71#return; {377#true} is VALID [2022-04-28 03:21:55,420 INFO L272 TraceCheckUtils]: 0: Hoare triple {377#true} call ULTIMATE.init(); {385#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:21:55,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#(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); {377#true} is VALID [2022-04-28 03:21:55,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#true} assume true; {377#true} is VALID [2022-04-28 03:21:55,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {377#true} {377#true} #71#return; {377#true} is VALID [2022-04-28 03:21:55,420 INFO L272 TraceCheckUtils]: 4: Hoare triple {377#true} call #t~ret6 := main(); {377#true} is VALID [2022-04-28 03:21:55,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {377#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {377#true} is VALID [2022-04-28 03:21:55,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {377#true} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {382#(<= 10 main_~n~0)} is VALID [2022-04-28 03:21:55,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {382#(<= 10 main_~n~0)} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {383#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~i~0 0))} is VALID [2022-04-28 03:21:55,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {383#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~i~0 0))} [77] L31-3-->L31-4_primed: Formula: (let ((.cse2 (= v_main_~i~0_14 v_main_~i~0_13)) (.cse3 (= v_main_~k~0_14 v_main_~k~0_13)) (.cse4 (= |v_main_#t~post3_9| |v_main_#t~post3_8|)) (.cse0 (< 0 v_main_~m~0_12)) (.cse1 (< 1 v_main_~m~0_12))) (or (and (= v_main_~j~0_19 v_main_~j~0_21) (or (not (< v_main_~i~0_14 v_main_~n~0_8)) (not .cse0) .cse1) (= |v_main_#t~post5_9| |v_main_#t~post5_10|) .cse2 .cse3 (= |v_main_#t~post4_9| |v_main_#t~post4_10|) .cse4) (and .cse2 .cse3 (= v_main_~j~0_21 v_main_~j~0_19) (= |v_main_#t~post5_10| |v_main_#t~post5_9|) (= v_main_~m~0_12 v_main_~m~0_12) .cse4 (= |v_main_#t~post4_10| |v_main_#t~post4_9|) (= v_main_~n~0_8 v_main_~n~0_8)) (and .cse0 (= v_main_~j~0_19 1) (< v_main_~i~0_14 v_main_~i~0_13) (< v_main_~i~0_13 (+ v_main_~n~0_8 1)) (not .cse1) (= (+ v_main_~i~0_13 v_main_~k~0_14) (+ v_main_~i~0_14 v_main_~k~0_13))))) InVars {main_~m~0=v_main_~m~0_12, main_~k~0=v_main_~k~0_14, main_~j~0=v_main_~j~0_21, main_~i~0=v_main_~i~0_14, main_#t~post4=|v_main_#t~post4_10|, main_#t~post5=|v_main_#t~post5_10|, main_~n~0=v_main_~n~0_8, main_#t~post3=|v_main_#t~post3_9|} OutVars{main_~m~0=v_main_~m~0_12, main_~k~0=v_main_~k~0_13, main_~j~0=v_main_~j~0_19, main_~i~0=v_main_~i~0_13, main_#t~post4=|v_main_#t~post4_9|, main_#t~post5=|v_main_#t~post5_9|, main_#t~post3=|v_main_#t~post3_8|, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {384#(and (<= 10 main_~n~0) (= main_~i~0 0))} is VALID [2022-04-28 03:21:55,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {384#(and (<= 10 main_~n~0) (= main_~i~0 0))} [76] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {378#false} is VALID [2022-04-28 03:21:55,422 INFO L272 TraceCheckUtils]: 10: Hoare triple {378#false} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {378#false} is VALID [2022-04-28 03:21:55,423 INFO L290 TraceCheckUtils]: 11: Hoare triple {378#false} ~cond := #in~cond; {378#false} is VALID [2022-04-28 03:21:55,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {378#false} assume 0 == ~cond; {378#false} is VALID [2022-04-28 03:21:55,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {378#false} assume !false; {378#false} is VALID [2022-04-28 03:21:55,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:21:55,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:21:55,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688912812] [2022-04-28 03:21:55,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688912812] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:21:55,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:21:55,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:21:55,479 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:21:55,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2109848877] [2022-04-28 03:21:55,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2109848877] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:21:55,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:21:55,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:21:55,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754504310] [2022-04-28 03:21:55,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:21:55,480 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) 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 03:21:55,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:21:55,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) 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 03:21:55,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:21:55,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:21:55,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:21:55,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:21:55,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-28 03:21:55,515 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 7 states, 7 states have (on average 2.0) 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 03:21:55,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:21:55,659 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-28 03:21:55,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:21:55,659 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) 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 03:21:55,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:21:55,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) 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 03:21:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-04-28 03:21:55,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) 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 03:21:55,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-04-28 03:21:55,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 38 transitions. [2022-04-28 03:21:55,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:21:55,689 INFO L225 Difference]: With dead ends: 34 [2022-04-28 03:21:55,689 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 03:21:55,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:21:55,690 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 37 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:21:55,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 19 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:21:55,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 03:21:55,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-04-28 03:21:55,703 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:21:55,703 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:21:55,703 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:21:55,703 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:21:55,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:21:55,704 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-28 03:21:55,704 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 03:21:55,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:21:55,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:21:55,705 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 03:21:55,705 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 03:21:55,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:21:55,706 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-28 03:21:55,706 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 03:21:55,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:21:55,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:21:55,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:21:55,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:21:55,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:21:55,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-04-28 03:21:55,707 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2022-04-28 03:21:55,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:21:55,707 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-04-28 03:21:55,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) 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 03:21:55,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 22 transitions. [2022-04-28 03:21:55,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:21:55,728 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-28 03:21:55,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 03:21:55,728 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:21:55,728 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:21:55,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 03:21:55,729 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:21:55,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:21:55,729 INFO L85 PathProgramCache]: Analyzing trace with hash 189172661, now seen corresponding path program 2 times [2022-04-28 03:21:55,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:21:55,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [764665775] [2022-04-28 03:21:59,857 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:21:59,945 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:22:02,779 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:22:02,899 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:22:02,900 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:22:02,902 INFO L85 PathProgramCache]: Analyzing trace with hash -660836254, now seen corresponding path program 1 times [2022-04-28 03:22:02,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:22:02,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143566437] [2022-04-28 03:22:02,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:22:02,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:22:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:02,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:22:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:02,987 INFO L290 TraceCheckUtils]: 0: Hoare triple {566#(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); {558#true} is VALID [2022-04-28 03:22:02,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {558#true} assume true; {558#true} is VALID [2022-04-28 03:22:02,987 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {558#true} {558#true} #71#return; {558#true} is VALID [2022-04-28 03:22:02,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {558#true} call ULTIMATE.init(); {566#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:22:02,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {566#(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); {558#true} is VALID [2022-04-28 03:22:02,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {558#true} assume true; {558#true} is VALID [2022-04-28 03:22:02,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {558#true} {558#true} #71#return; {558#true} is VALID [2022-04-28 03:22:02,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {558#true} call #t~ret6 := main(); {558#true} is VALID [2022-04-28 03:22:02,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {558#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {558#true} is VALID [2022-04-28 03:22:02,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {558#true} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {563#(<= 10 main_~n~0)} is VALID [2022-04-28 03:22:02,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {563#(<= 10 main_~n~0)} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {564#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~i~0 0))} is VALID [2022-04-28 03:22:02,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {564#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~i~0 0))} [79] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post3_14| |v_main_#t~post3_13|)) (.cse1 (= |v_main_#t~post5_23| |v_main_#t~post5_21|)) (.cse2 (= v_main_~i~0_20 v_main_~i~0_19)) (.cse3 (= v_main_~j~0_38 v_main_~j~0_35)) (.cse4 (= |v_main_#t~post4_23| |v_main_#t~post4_21|)) (.cse6 (<= v_main_~m~0_19 2)) (.cse5 (< 1 v_main_~m~0_19))) (or (and .cse0 (= v_main_~k~0_31 v_main_~k~0_29) .cse1 .cse2 .cse3 (= v_main_~n~0_10 v_main_~n~0_10) (= v_main_~m~0_19 v_main_~m~0_19) .cse4) (and (= v_main_~k~0_29 v_main_~k~0_31) .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~i~0_20 v_main_~n~0_10)) (not .cse5) (not .cse6)) .cse4) (and (< v_main_~i~0_20 v_main_~i~0_19) .cse6 .cse5 (< v_main_~i~0_19 (+ v_main_~n~0_10 1)) (= v_main_~j~0_35 2) (= (+ v_main_~k~0_29 (* v_main_~i~0_20 2)) (+ v_main_~k~0_31 (* v_main_~i~0_19 2)))))) InVars {main_~m~0=v_main_~m~0_19, main_~k~0=v_main_~k~0_31, main_~j~0=v_main_~j~0_38, main_~i~0=v_main_~i~0_20, main_#t~post4=|v_main_#t~post4_23|, main_#t~post5=|v_main_#t~post5_23|, main_~n~0=v_main_~n~0_10, main_#t~post3=|v_main_#t~post3_14|} OutVars{main_~m~0=v_main_~m~0_19, main_~k~0=v_main_~k~0_29, main_~j~0=v_main_~j~0_35, main_~i~0=v_main_~i~0_19, main_#t~post4=|v_main_#t~post4_21|, main_#t~post5=|v_main_#t~post5_21|, main_#t~post3=|v_main_#t~post3_13|, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {565#(and (<= 10 main_~n~0) (= main_~i~0 0))} is VALID [2022-04-28 03:22:02,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {565#(and (<= 10 main_~n~0) (= main_~i~0 0))} [78] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {559#false} is VALID [2022-04-28 03:22:02,990 INFO L272 TraceCheckUtils]: 10: Hoare triple {559#false} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {559#false} is VALID [2022-04-28 03:22:02,991 INFO L290 TraceCheckUtils]: 11: Hoare triple {559#false} ~cond := #in~cond; {559#false} is VALID [2022-04-28 03:22:02,991 INFO L290 TraceCheckUtils]: 12: Hoare triple {559#false} assume 0 == ~cond; {559#false} is VALID [2022-04-28 03:22:02,991 INFO L290 TraceCheckUtils]: 13: Hoare triple {559#false} assume !false; {559#false} is VALID [2022-04-28 03:22:02,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:22:02,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:22:02,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143566437] [2022-04-28 03:22:02,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143566437] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:22:02,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:22:02,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:22:03,090 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:22:03,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [764665775] [2022-04-28 03:22:03,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [764665775] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:22:03,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:22:03,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:22:03,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251296623] [2022-04-28 03:22:03,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:22:03,092 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 03:22:03,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:22:03,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:03,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:22:03,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:22:03,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:22:03,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:22:03,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 03:22:03,112 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:03,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:03,318 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-28 03:22:03,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:22:03,318 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 03:22:03,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:22:03,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:03,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-28 03:22:03,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:03,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-28 03:22:03,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2022-04-28 03:22:03,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:22:03,349 INFO L225 Difference]: With dead ends: 36 [2022-04-28 03:22:03,349 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 03:22:03,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2022-04-28 03:22:03,350 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 39 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:22:03,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 34 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:22:03,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 03:22:03,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-04-28 03:22:03,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:22:03,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:03,364 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:03,364 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:03,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:03,365 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-28 03:22:03,365 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 03:22:03,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:22:03,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:22:03,365 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-28 03:22:03,365 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-28 03:22:03,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:03,366 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-28 03:22:03,366 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 03:22:03,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:22:03,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:22:03,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:22:03,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:22:03,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:03,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-04-28 03:22:03,367 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2022-04-28 03:22:03,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:22:03,367 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-04-28 03:22:03,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:03,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 24 transitions. [2022-04-28 03:22:03,387 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 03:22:03,387 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-28 03:22:03,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 03:22:03,388 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:22:03,388 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:22:03,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 03:22:03,388 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:22:03,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:22:03,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1531053651, now seen corresponding path program 3 times [2022-04-28 03:22:03,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:22:03,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1255041486] [2022-04-28 03:22:07,509 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:22:07,581 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:22:07,845 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:22:07,846 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:22:07,848 INFO L85 PathProgramCache]: Analyzing trace with hash -601730910, now seen corresponding path program 1 times [2022-04-28 03:22:07,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:22:07,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766705667] [2022-04-28 03:22:07,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:22:07,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:22:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:07,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:22:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:07,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {762#(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); {754#true} is VALID [2022-04-28 03:22:07,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {754#true} assume true; {754#true} is VALID [2022-04-28 03:22:07,916 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {754#true} {754#true} #71#return; {754#true} is VALID [2022-04-28 03:22:07,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {754#true} call ULTIMATE.init(); {762#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:22:07,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {762#(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); {754#true} is VALID [2022-04-28 03:22:07,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {754#true} assume true; {754#true} is VALID [2022-04-28 03:22:07,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {754#true} {754#true} #71#return; {754#true} is VALID [2022-04-28 03:22:07,919 INFO L272 TraceCheckUtils]: 4: Hoare triple {754#true} call #t~ret6 := main(); {754#true} is VALID [2022-04-28 03:22:07,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {754#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {754#true} is VALID [2022-04-28 03:22:07,920 INFO L290 TraceCheckUtils]: 6: Hoare triple {754#true} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {759#(<= 10 main_~n~0)} is VALID [2022-04-28 03:22:07,920 INFO L290 TraceCheckUtils]: 7: Hoare triple {759#(<= 10 main_~n~0)} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {760#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~i~0 0))} is VALID [2022-04-28 03:22:07,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {760#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~i~0 0))} [81] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_26 v_main_~i~0_25)) (.cse1 (= |v_main_#t~post5_37| |v_main_#t~post5_34|)) (.cse2 (= |v_main_#t~post3_19| |v_main_#t~post3_18|)) (.cse3 (= |v_main_#t~post4_37| |v_main_#t~post4_34|)) (.cse4 (= v_main_~j~0_57 v_main_~j~0_53)) (.cse6 (<= v_main_~m~0_26 3)) (.cse5 (< 2 v_main_~m~0_26))) (or (and (= v_main_~m~0_26 v_main_~m~0_26) .cse0 .cse1 .cse2 (= v_main_~n~0_12 v_main_~n~0_12) .cse3 (= v_main_~k~0_50 v_main_~k~0_47) .cse4) (and .cse0 .cse1 (= v_main_~k~0_47 v_main_~k~0_50) .cse2 (or (not .cse5) (not (< v_main_~i~0_26 v_main_~n~0_12)) (not .cse6)) .cse3 .cse4) (and (= v_main_~j~0_53 3) (< v_main_~i~0_26 v_main_~i~0_25) .cse6 (= (+ v_main_~k~0_50 (* v_main_~i~0_25 3)) (+ v_main_~k~0_47 (* v_main_~i~0_26 3))) (< v_main_~i~0_25 (+ v_main_~n~0_12 1)) .cse5))) InVars {main_~m~0=v_main_~m~0_26, main_~k~0=v_main_~k~0_50, main_~j~0=v_main_~j~0_57, main_~i~0=v_main_~i~0_26, main_#t~post4=|v_main_#t~post4_37|, main_#t~post5=|v_main_#t~post5_37|, main_~n~0=v_main_~n~0_12, main_#t~post3=|v_main_#t~post3_19|} OutVars{main_~m~0=v_main_~m~0_26, main_~k~0=v_main_~k~0_47, main_~j~0=v_main_~j~0_53, main_~i~0=v_main_~i~0_25, main_#t~post4=|v_main_#t~post4_34|, main_#t~post5=|v_main_#t~post5_34|, main_#t~post3=|v_main_#t~post3_18|, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {761#(and (<= 10 main_~n~0) (= main_~i~0 0))} is VALID [2022-04-28 03:22:07,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {761#(and (<= 10 main_~n~0) (= main_~i~0 0))} [80] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {755#false} is VALID [2022-04-28 03:22:07,922 INFO L272 TraceCheckUtils]: 10: Hoare triple {755#false} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {755#false} is VALID [2022-04-28 03:22:07,922 INFO L290 TraceCheckUtils]: 11: Hoare triple {755#false} ~cond := #in~cond; {755#false} is VALID [2022-04-28 03:22:07,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {755#false} assume 0 == ~cond; {755#false} is VALID [2022-04-28 03:22:07,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {755#false} assume !false; {755#false} is VALID [2022-04-28 03:22:07,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:22:07,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:22:07,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766705667] [2022-04-28 03:22:07,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766705667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:22:07,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:22:07,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:22:08,052 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:22:08,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1255041486] [2022-04-28 03:22:08,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1255041486] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:22:08,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:22:08,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:22:08,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739881879] [2022-04-28 03:22:08,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:22:08,053 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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 22 [2022-04-28 03:22:08,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:22:08,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:08,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:22:08,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:22:08,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:22:08,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:22:08,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:22:08,069 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:08,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:08,297 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-04-28 03:22:08,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:22:08,297 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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 22 [2022-04-28 03:22:08,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:22:08,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:08,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2022-04-28 03:22:08,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:08,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2022-04-28 03:22:08,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 42 transitions. [2022-04-28 03:22:08,328 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 03:22:08,329 INFO L225 Difference]: With dead ends: 38 [2022-04-28 03:22:08,329 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 03:22:08,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2022-04-28 03:22:08,329 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 43 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:22:08,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 19 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:22:08,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 03:22:08,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-04-28 03:22:08,347 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:22:08,347 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:08,347 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:08,347 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:08,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:08,348 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-28 03:22:08,348 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-28 03:22:08,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:22:08,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:22:08,348 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-28 03:22:08,349 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-28 03:22:08,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:08,349 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-28 03:22:08,349 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-28 03:22:08,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:22:08,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:22:08,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:22:08,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:22:08,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:08,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-04-28 03:22:08,350 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2022-04-28 03:22:08,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:22:08,351 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-04-28 03:22:08,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:08,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 26 transitions. [2022-04-28 03:22:08,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:22:08,390 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-04-28 03:22:08,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 03:22:08,391 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:22:08,391 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:22:08,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 03:22:08,392 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:22:08,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:22:08,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1706471055, now seen corresponding path program 4 times [2022-04-28 03:22:08,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:22:08,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1581114420] [2022-04-28 03:22:08,550 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:22:08,991 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:22:08,993 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:22:08,995 INFO L85 PathProgramCache]: Analyzing trace with hash -542625566, now seen corresponding path program 1 times [2022-04-28 03:22:08,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:22:08,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639975991] [2022-04-28 03:22:08,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:22:08,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:22:09,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:09,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:22:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:09,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {973#(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); {965#true} is VALID [2022-04-28 03:22:09,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {965#true} assume true; {965#true} is VALID [2022-04-28 03:22:09,052 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {965#true} {965#true} #71#return; {965#true} is VALID [2022-04-28 03:22:09,052 INFO L272 TraceCheckUtils]: 0: Hoare triple {965#true} call ULTIMATE.init(); {973#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:22:09,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {973#(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); {965#true} is VALID [2022-04-28 03:22:09,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {965#true} assume true; {965#true} is VALID [2022-04-28 03:22:09,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {965#true} {965#true} #71#return; {965#true} is VALID [2022-04-28 03:22:09,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {965#true} call #t~ret6 := main(); {965#true} is VALID [2022-04-28 03:22:09,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {965#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {965#true} is VALID [2022-04-28 03:22:09,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {965#true} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {970#(<= 10 main_~n~0)} is VALID [2022-04-28 03:22:09,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {970#(<= 10 main_~n~0)} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {971#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~i~0 0))} is VALID [2022-04-28 03:22:09,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {971#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~i~0 0))} [83] L31-3-->L31-4_primed: Formula: (let ((.cse1 (< 3 v_main_~m~0_33)) (.cse0 (<= v_main_~m~0_33 4)) (.cse2 (= v_main_~i~0_32 v_main_~i~0_31)) (.cse3 (= |v_main_#t~post3_24| |v_main_#t~post3_23|)) (.cse4 (= |v_main_#t~post5_52| |v_main_#t~post5_48|)) (.cse5 (= v_main_~j~0_78 v_main_~j~0_73))) (or (and (= |v_main_#t~post4_48| |v_main_#t~post4_52|) (or (not .cse0) (not (< v_main_~i~0_32 v_main_~n~0_14)) (not .cse1)) .cse2 .cse3 .cse4 (= v_main_~k~0_67 v_main_~k~0_71) .cse5) (and (= v_main_~j~0_73 4) .cse1 (< v_main_~i~0_32 v_main_~i~0_31) (= (+ v_main_~k~0_71 (* v_main_~i~0_31 4)) (+ v_main_~k~0_67 (* v_main_~i~0_32 4))) .cse0 (< v_main_~i~0_31 (+ v_main_~n~0_14 1))) (and (= |v_main_#t~post4_52| |v_main_#t~post4_48|) (= v_main_~m~0_33 v_main_~m~0_33) (= v_main_~k~0_71 v_main_~k~0_67) (= v_main_~n~0_14 v_main_~n~0_14) .cse2 .cse3 .cse4 .cse5))) InVars {main_~m~0=v_main_~m~0_33, main_~k~0=v_main_~k~0_71, main_~j~0=v_main_~j~0_78, main_~i~0=v_main_~i~0_32, main_#t~post4=|v_main_#t~post4_52|, main_#t~post5=|v_main_#t~post5_52|, main_~n~0=v_main_~n~0_14, main_#t~post3=|v_main_#t~post3_24|} OutVars{main_~m~0=v_main_~m~0_33, main_~k~0=v_main_~k~0_67, main_~j~0=v_main_~j~0_73, main_~i~0=v_main_~i~0_31, main_#t~post4=|v_main_#t~post4_48|, main_#t~post5=|v_main_#t~post5_48|, main_#t~post3=|v_main_#t~post3_23|, main_~n~0=v_main_~n~0_14} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {972#(and (<= 10 main_~n~0) (= main_~i~0 0))} is VALID [2022-04-28 03:22:09,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {972#(and (<= 10 main_~n~0) (= main_~i~0 0))} [82] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {966#false} is VALID [2022-04-28 03:22:09,055 INFO L272 TraceCheckUtils]: 10: Hoare triple {966#false} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {966#false} is VALID [2022-04-28 03:22:09,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {966#false} ~cond := #in~cond; {966#false} is VALID [2022-04-28 03:22:09,055 INFO L290 TraceCheckUtils]: 12: Hoare triple {966#false} assume 0 == ~cond; {966#false} is VALID [2022-04-28 03:22:09,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {966#false} assume !false; {966#false} is VALID [2022-04-28 03:22:09,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:22:09,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:22:09,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639975991] [2022-04-28 03:22:09,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639975991] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:22:09,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:22:09,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:22:09,199 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:22:09,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1581114420] [2022-04-28 03:22:09,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1581114420] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:22:09,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:22:09,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:22:09,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468845075] [2022-04-28 03:22:09,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:22:09,200 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 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 24 [2022-04-28 03:22:09,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:22:09,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:09,217 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 03:22:09,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:22:09,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:22:09,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:22:09,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-04-28 03:22:09,217 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:09,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:09,456 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-04-28 03:22:09,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 03:22:09,457 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 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 24 [2022-04-28 03:22:09,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:22:09,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:09,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2022-04-28 03:22:09,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:09,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2022-04-28 03:22:09,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 44 transitions. [2022-04-28 03:22:09,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:22:09,495 INFO L225 Difference]: With dead ends: 40 [2022-04-28 03:22:09,495 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 03:22:09,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2022-04-28 03:22:09,495 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 38 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:22:09,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 29 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:22:09,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 03:22:09,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2022-04-28 03:22:09,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:22:09,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:09,514 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:09,514 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:09,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:09,515 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-28 03:22:09,515 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-28 03:22:09,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:22:09,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:22:09,515 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-28 03:22:09,515 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-28 03:22:09,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:09,516 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-28 03:22:09,516 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-28 03:22:09,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:22:09,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:22:09,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:22:09,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:22:09,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:09,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-04-28 03:22:09,517 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2022-04-28 03:22:09,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:22:09,517 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-04-28 03:22:09,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:09,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 28 transitions. [2022-04-28 03:22:09,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:22:09,544 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-04-28 03:22:09,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 03:22:09,545 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:22:09,545 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:22:09,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 03:22:09,545 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:22:09,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:22:09,545 INFO L85 PathProgramCache]: Analyzing trace with hash 883576079, now seen corresponding path program 5 times [2022-04-28 03:22:09,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:22:09,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1121328422] [2022-04-28 03:22:13,658 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:22:13,746 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:22:16,079 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:22:16,096 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:22:16,098 INFO L85 PathProgramCache]: Analyzing trace with hash -483520222, now seen corresponding path program 1 times [2022-04-28 03:22:16,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:22:16,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238871533] [2022-04-28 03:22:16,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:22:16,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:22:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:16,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:22:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:16,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {1199#(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); {1191#true} is VALID [2022-04-28 03:22:16,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {1191#true} assume true; {1191#true} is VALID [2022-04-28 03:22:16,164 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1191#true} {1191#true} #71#return; {1191#true} is VALID [2022-04-28 03:22:16,165 INFO L272 TraceCheckUtils]: 0: Hoare triple {1191#true} call ULTIMATE.init(); {1199#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:22:16,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {1199#(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); {1191#true} is VALID [2022-04-28 03:22:16,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {1191#true} assume true; {1191#true} is VALID [2022-04-28 03:22:16,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1191#true} {1191#true} #71#return; {1191#true} is VALID [2022-04-28 03:22:16,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {1191#true} call #t~ret6 := main(); {1191#true} is VALID [2022-04-28 03:22:16,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {1191#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {1191#true} is VALID [2022-04-28 03:22:16,165 INFO L290 TraceCheckUtils]: 6: Hoare triple {1191#true} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {1196#(<= 10 main_~n~0)} is VALID [2022-04-28 03:22:16,166 INFO L290 TraceCheckUtils]: 7: Hoare triple {1196#(<= 10 main_~n~0)} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {1197#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~i~0 0))} is VALID [2022-04-28 03:22:16,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {1197#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~i~0 0))} [85] L31-3-->L31-4_primed: Formula: (let ((.cse1 (<= v_main_~m~0_40 5)) (.cse0 (< 4 v_main_~m~0_40)) (.cse2 (= v_main_~i~0_38 v_main_~i~0_37)) (.cse3 (= |v_main_#t~post4_68| |v_main_#t~post4_63|)) (.cse4 (= |v_main_#t~post3_29| |v_main_#t~post3_28|)) (.cse5 (= |v_main_#t~post5_68| |v_main_#t~post5_63|))) (or (and (< v_main_~i~0_38 v_main_~i~0_37) .cse0 .cse1 (= (+ v_main_~k~0_94 (* v_main_~i~0_37 5)) (+ v_main_~k~0_89 (* v_main_~i~0_38 5))) (= v_main_~j~0_95 5) (< v_main_~i~0_37 (+ v_main_~n~0_16 1))) (and .cse2 (or (not (< v_main_~i~0_38 v_main_~n~0_16)) (not .cse1) (not .cse0)) .cse3 (= v_main_~j~0_95 v_main_~j~0_101) .cse4 (= v_main_~k~0_89 v_main_~k~0_94) .cse5) (and (= v_main_~n~0_16 v_main_~n~0_16) .cse2 (= v_main_~k~0_94 v_main_~k~0_89) .cse3 (= v_main_~j~0_101 v_main_~j~0_95) .cse4 (= v_main_~m~0_40 v_main_~m~0_40) .cse5))) InVars {main_~m~0=v_main_~m~0_40, main_~k~0=v_main_~k~0_94, main_~j~0=v_main_~j~0_101, main_~i~0=v_main_~i~0_38, main_#t~post4=|v_main_#t~post4_68|, main_#t~post5=|v_main_#t~post5_68|, main_~n~0=v_main_~n~0_16, main_#t~post3=|v_main_#t~post3_29|} OutVars{main_~m~0=v_main_~m~0_40, main_~k~0=v_main_~k~0_89, main_~j~0=v_main_~j~0_95, main_~i~0=v_main_~i~0_37, main_#t~post4=|v_main_#t~post4_63|, main_#t~post5=|v_main_#t~post5_63|, main_#t~post3=|v_main_#t~post3_28|, main_~n~0=v_main_~n~0_16} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {1198#(<= (+ main_~i~0 10) main_~n~0)} is VALID [2022-04-28 03:22:16,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {1198#(<= (+ main_~i~0 10) main_~n~0)} [84] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1192#false} is VALID [2022-04-28 03:22:16,167 INFO L272 TraceCheckUtils]: 10: Hoare triple {1192#false} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {1192#false} is VALID [2022-04-28 03:22:16,167 INFO L290 TraceCheckUtils]: 11: Hoare triple {1192#false} ~cond := #in~cond; {1192#false} is VALID [2022-04-28 03:22:16,168 INFO L290 TraceCheckUtils]: 12: Hoare triple {1192#false} assume 0 == ~cond; {1192#false} is VALID [2022-04-28 03:22:16,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {1192#false} assume !false; {1192#false} is VALID [2022-04-28 03:22:16,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:22:16,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:22:16,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238871533] [2022-04-28 03:22:16,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238871533] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:22:16,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:22:16,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:22:16,345 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:22:16,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1121328422] [2022-04-28 03:22:16,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1121328422] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:22:16,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:22:16,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:22:16,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131712729] [2022-04-28 03:22:16,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:22:16,346 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 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 26 [2022-04-28 03:22:16,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:22:16,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:16,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:22:16,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 03:22:16,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:22:16,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 03:22:16,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:22:16,363 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:16,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:16,648 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-28 03:22:16,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 03:22:16,648 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 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 26 [2022-04-28 03:22:16,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:22:16,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:16,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 46 transitions. [2022-04-28 03:22:16,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:16,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 46 transitions. [2022-04-28 03:22:16,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 46 transitions. [2022-04-28 03:22:16,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:22:16,684 INFO L225 Difference]: With dead ends: 42 [2022-04-28 03:22:16,684 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 03:22:16,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2022-04-28 03:22:16,685 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 40 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:22:16,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 24 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:22:16,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 03:22:16,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2022-04-28 03:22:16,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:22:16,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 29 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:16,712 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 29 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:16,712 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 29 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:16,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:16,713 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-28 03:22:16,713 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 03:22:16,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:22:16,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:22:16,713 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-28 03:22:16,713 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-28 03:22:16,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:16,714 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-28 03:22:16,714 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 03:22:16,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:22:16,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:22:16,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:22:16,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:22:16,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:16,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-04-28 03:22:16,717 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2022-04-28 03:22:16,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:22:16,717 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-04-28 03:22:16,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:16,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 30 transitions. [2022-04-28 03:22:16,747 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 03:22:16,747 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-28 03:22:16,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 03:22:16,748 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:22:16,748 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:22:16,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 03:22:16,748 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:22:16,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:22:16,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1162159827, now seen corresponding path program 6 times [2022-04-28 03:22:16,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:22:16,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2020096256] [2022-04-28 03:22:16,911 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:22:17,198 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:22:17,199 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:22:17,201 INFO L85 PathProgramCache]: Analyzing trace with hash -424414878, now seen corresponding path program 1 times [2022-04-28 03:22:17,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:22:17,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747083893] [2022-04-28 03:22:17,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:22:17,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:22:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:17,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:22:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:17,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {1440#(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); {1432#true} is VALID [2022-04-28 03:22:17,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {1432#true} assume true; {1432#true} is VALID [2022-04-28 03:22:17,281 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1432#true} {1432#true} #71#return; {1432#true} is VALID [2022-04-28 03:22:17,282 INFO L272 TraceCheckUtils]: 0: Hoare triple {1432#true} call ULTIMATE.init(); {1440#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:22:17,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {1440#(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); {1432#true} is VALID [2022-04-28 03:22:17,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {1432#true} assume true; {1432#true} is VALID [2022-04-28 03:22:17,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1432#true} {1432#true} #71#return; {1432#true} is VALID [2022-04-28 03:22:17,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {1432#true} call #t~ret6 := main(); {1432#true} is VALID [2022-04-28 03:22:17,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {1432#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {1432#true} is VALID [2022-04-28 03:22:17,282 INFO L290 TraceCheckUtils]: 6: Hoare triple {1432#true} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {1437#(<= 10 main_~n~0)} is VALID [2022-04-28 03:22:17,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {1437#(<= 10 main_~n~0)} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {1438#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~i~0 0))} is VALID [2022-04-28 03:22:17,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {1438#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~i~0 0))} [87] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_44 v_main_~i~0_43)) (.cse1 (= v_main_~k~0_119 v_main_~k~0_113)) (.cse4 (= |v_main_#t~post4_85| |v_main_#t~post4_79|)) (.cse5 (= |v_main_#t~post3_34| |v_main_#t~post3_33|)) (.cse6 (= v_main_~j~0_126 v_main_~j~0_119)) (.cse2 (<= v_main_~m~0_47 6)) (.cse3 (< 5 v_main_~m~0_47))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~i~0_44 v_main_~n~0_18)) (not .cse3)) (= |v_main_#t~post5_79| |v_main_#t~post5_85|) .cse4 .cse5 .cse6) (and (= v_main_~m~0_47 v_main_~m~0_47) (= |v_main_#t~post5_85| |v_main_#t~post5_79|) .cse0 .cse1 (= v_main_~n~0_18 v_main_~n~0_18) .cse4 .cse5 .cse6) (and .cse2 (< v_main_~i~0_44 v_main_~i~0_43) (= (+ (* v_main_~i~0_44 6) v_main_~k~0_113) (+ (* v_main_~i~0_43 6) v_main_~k~0_119)) .cse3 (< v_main_~i~0_43 (+ v_main_~n~0_18 1)) (= v_main_~j~0_119 6)))) InVars {main_~m~0=v_main_~m~0_47, main_~k~0=v_main_~k~0_119, main_~j~0=v_main_~j~0_126, main_~i~0=v_main_~i~0_44, main_#t~post4=|v_main_#t~post4_85|, main_#t~post5=|v_main_#t~post5_85|, main_~n~0=v_main_~n~0_18, main_#t~post3=|v_main_#t~post3_34|} OutVars{main_~m~0=v_main_~m~0_47, main_~k~0=v_main_~k~0_113, main_~j~0=v_main_~j~0_119, main_~i~0=v_main_~i~0_43, main_#t~post4=|v_main_#t~post4_79|, main_#t~post5=|v_main_#t~post5_79|, main_#t~post3=|v_main_#t~post3_33|, main_~n~0=v_main_~n~0_18} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {1439#(and (<= 10 main_~n~0) (= main_~i~0 0))} is VALID [2022-04-28 03:22:17,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {1439#(and (<= 10 main_~n~0) (= main_~i~0 0))} [86] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1433#false} is VALID [2022-04-28 03:22:17,284 INFO L272 TraceCheckUtils]: 10: Hoare triple {1433#false} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {1433#false} is VALID [2022-04-28 03:22:17,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {1433#false} ~cond := #in~cond; {1433#false} is VALID [2022-04-28 03:22:17,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {1433#false} assume 0 == ~cond; {1433#false} is VALID [2022-04-28 03:22:17,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {1433#false} assume !false; {1433#false} is VALID [2022-04-28 03:22:17,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:22:17,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:22:17,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747083893] [2022-04-28 03:22:17,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747083893] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:22:17,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:22:17,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:22:17,484 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:22:17,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2020096256] [2022-04-28 03:22:17,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2020096256] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:22:17,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:22:17,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 03:22:17,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665757359] [2022-04-28 03:22:17,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:22:17,485 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 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 28 [2022-04-28 03:22:17,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:22:17,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:17,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:22:17,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 03:22:17,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:22:17,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 03:22:17,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-04-28 03:22:17,510 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:17,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:17,941 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-28 03:22:17,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 03:22:17,941 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 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 28 [2022-04-28 03:22:17,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:22:17,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:17,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 48 transitions. [2022-04-28 03:22:17,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:17,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 48 transitions. [2022-04-28 03:22:17,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 48 transitions. [2022-04-28 03:22:17,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:22:17,981 INFO L225 Difference]: With dead ends: 44 [2022-04-28 03:22:17,981 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 03:22:17,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2022-04-28 03:22:17,981 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 51 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:22:17,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 49 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:22:17,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 03:22:18,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-04-28 03:22:18,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:22:18,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:18,000 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:18,000 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:18,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:18,001 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-28 03:22:18,001 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-28 03:22:18,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:22:18,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:22:18,001 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-28 03:22:18,001 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-28 03:22:18,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:18,002 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-28 03:22:18,002 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-28 03:22:18,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:22:18,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:22:18,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:22:18,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:22:18,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:18,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2022-04-28 03:22:18,003 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2022-04-28 03:22:18,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:22:18,003 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2022-04-28 03:22:18,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:18,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 32 transitions. [2022-04-28 03:22:18,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:22:18,033 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-04-28 03:22:18,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 03:22:18,033 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:22:18,033 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:22:18,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 03:22:18,034 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:22:18,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:22:18,034 INFO L85 PathProgramCache]: Analyzing trace with hash -19343925, now seen corresponding path program 7 times [2022-04-28 03:22:18,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:22:18,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1926866254] [2022-04-28 03:22:18,204 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:22:18,687 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:22:18,688 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:22:18,690 INFO L85 PathProgramCache]: Analyzing trace with hash -365309534, now seen corresponding path program 1 times [2022-04-28 03:22:18,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:22:18,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730344812] [2022-04-28 03:22:18,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:22:18,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:22:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:18,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:22:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:18,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {1696#(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); {1688#true} is VALID [2022-04-28 03:22:18,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {1688#true} assume true; {1688#true} is VALID [2022-04-28 03:22:18,744 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1688#true} {1688#true} #71#return; {1688#true} is VALID [2022-04-28 03:22:18,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {1688#true} call ULTIMATE.init(); {1696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:22:18,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {1696#(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); {1688#true} is VALID [2022-04-28 03:22:18,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {1688#true} assume true; {1688#true} is VALID [2022-04-28 03:22:18,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1688#true} {1688#true} #71#return; {1688#true} is VALID [2022-04-28 03:22:18,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {1688#true} call #t~ret6 := main(); {1688#true} is VALID [2022-04-28 03:22:18,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {1688#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {1688#true} is VALID [2022-04-28 03:22:18,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {1688#true} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {1693#(<= 10 main_~n~0)} is VALID [2022-04-28 03:22:18,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {1693#(<= 10 main_~n~0)} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {1694#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~i~0 0))} is VALID [2022-04-28 03:22:18,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {1694#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~i~0 0))} [89] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post3_39| |v_main_#t~post3_38|)) (.cse1 (= v_main_~k~0_146 v_main_~k~0_139)) (.cse2 (<= v_main_~m~0_54 7)) (.cse3 (< 6 v_main_~m~0_54))) (or (and (= v_main_~j~0_153 v_main_~j~0_145) .cse0 (= |v_main_#t~post4_103| |v_main_#t~post4_96|) .cse1 (= v_main_~m~0_54 v_main_~m~0_54) (= v_main_~n~0_20 v_main_~n~0_20) (= |v_main_#t~post5_103| |v_main_#t~post5_96|) (= v_main_~i~0_50 v_main_~i~0_49)) (and .cse2 (= (+ v_main_~k~0_139 (* v_main_~i~0_50 7)) (+ v_main_~k~0_146 (* v_main_~i~0_49 7))) (< v_main_~i~0_50 v_main_~i~0_49) (= v_main_~j~0_145 7) .cse3 (< v_main_~i~0_49 (+ v_main_~n~0_20 1))) (and .cse0 .cse1 (or (not .cse2) (not .cse3) (not (< v_main_~i~0_50 v_main_~n~0_20))) (= v_main_~i~0_49 v_main_~i~0_50) (= |v_main_#t~post5_96| |v_main_#t~post5_103|) (= v_main_~j~0_145 v_main_~j~0_153) (= |v_main_#t~post4_96| |v_main_#t~post4_103|)))) InVars {main_~m~0=v_main_~m~0_54, main_~k~0=v_main_~k~0_146, main_~j~0=v_main_~j~0_153, main_~i~0=v_main_~i~0_50, main_#t~post4=|v_main_#t~post4_103|, main_#t~post5=|v_main_#t~post5_103|, main_~n~0=v_main_~n~0_20, main_#t~post3=|v_main_#t~post3_39|} OutVars{main_~m~0=v_main_~m~0_54, main_~k~0=v_main_~k~0_139, main_~j~0=v_main_~j~0_145, main_~i~0=v_main_~i~0_49, main_#t~post4=|v_main_#t~post4_96|, main_#t~post5=|v_main_#t~post5_96|, main_#t~post3=|v_main_#t~post3_38|, main_~n~0=v_main_~n~0_20} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {1695#(and (<= 10 main_~n~0) (= main_~i~0 0))} is VALID [2022-04-28 03:22:18,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {1695#(and (<= 10 main_~n~0) (= main_~i~0 0))} [88] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1689#false} is VALID [2022-04-28 03:22:18,747 INFO L272 TraceCheckUtils]: 10: Hoare triple {1689#false} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {1689#false} is VALID [2022-04-28 03:22:18,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {1689#false} ~cond := #in~cond; {1689#false} is VALID [2022-04-28 03:22:18,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {1689#false} assume 0 == ~cond; {1689#false} is VALID [2022-04-28 03:22:18,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {1689#false} assume !false; {1689#false} is VALID [2022-04-28 03:22:18,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:22:18,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:22:18,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730344812] [2022-04-28 03:22:18,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730344812] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:22:18,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:22:18,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:22:18,976 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:22:18,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1926866254] [2022-04-28 03:22:18,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1926866254] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:22:18,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:22:18,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 03:22:18,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774124267] [2022-04-28 03:22:18,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:22:18,977 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 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 30 [2022-04-28 03:22:18,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:22:18,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:18,998 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 03:22:18,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 03:22:18,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:22:18,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 03:22:18,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-04-28 03:22:18,999 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:19,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:19,447 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2022-04-28 03:22:19,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 03:22:19,447 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 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 30 [2022-04-28 03:22:19,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:22:19,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:19,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 50 transitions. [2022-04-28 03:22:19,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:19,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 50 transitions. [2022-04-28 03:22:19,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 50 transitions. [2022-04-28 03:22:19,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:22:19,485 INFO L225 Difference]: With dead ends: 46 [2022-04-28 03:22:19,485 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 03:22:19,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 9 SyntacticMatches, 8 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2022-04-28 03:22:19,486 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 55 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:22:19,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 29 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:22:19,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 03:22:19,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-04-28 03:22:19,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:22:19,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 33 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:19,509 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 33 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:19,509 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 33 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:19,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:19,510 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-28 03:22:19,510 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-28 03:22:19,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:22:19,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:22:19,510 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-28 03:22:19,510 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-28 03:22:19,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:19,511 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-28 03:22:19,511 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-28 03:22:19,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:22:19,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:22:19,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:22:19,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:22:19,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:19,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-04-28 03:22:19,512 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2022-04-28 03:22:19,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:22:19,512 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-04-28 03:22:19,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:19,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 34 transitions. [2022-04-28 03:22:19,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:22:19,551 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-04-28 03:22:19,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 03:22:19,551 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:22:19,551 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:22:19,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 03:22:19,551 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:22:19,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:22:19,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1284889879, now seen corresponding path program 8 times [2022-04-28 03:22:19,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:22:19,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [386195397] [2022-04-28 03:22:19,711 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:22:20,116 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:22:20,118 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:22:20,120 INFO L85 PathProgramCache]: Analyzing trace with hash -306204190, now seen corresponding path program 1 times [2022-04-28 03:22:20,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:22:20,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130647479] [2022-04-28 03:22:20,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:22:20,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:22:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:20,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:22:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:20,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {1967#(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); {1959#true} is VALID [2022-04-28 03:22:20,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {1959#true} assume true; {1959#true} is VALID [2022-04-28 03:22:20,180 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1959#true} {1959#true} #71#return; {1959#true} is VALID [2022-04-28 03:22:20,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {1959#true} call ULTIMATE.init(); {1967#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:22:20,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {1967#(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); {1959#true} is VALID [2022-04-28 03:22:20,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {1959#true} assume true; {1959#true} is VALID [2022-04-28 03:22:20,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1959#true} {1959#true} #71#return; {1959#true} is VALID [2022-04-28 03:22:20,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {1959#true} call #t~ret6 := main(); {1959#true} is VALID [2022-04-28 03:22:20,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {1959#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {1959#true} is VALID [2022-04-28 03:22:20,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {1959#true} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {1964#(<= 10 main_~n~0)} is VALID [2022-04-28 03:22:20,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {1964#(<= 10 main_~n~0)} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {1965#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~i~0 0))} is VALID [2022-04-28 03:22:20,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {1965#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~i~0 0))} [91] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= v_main_~j~0_182 v_main_~j~0_173)) (.cse1 (= v_main_~i~0_56 v_main_~i~0_55)) (.cse2 (= |v_main_#t~post3_44| |v_main_#t~post3_43|)) (.cse4 (< 7 v_main_~m~0_61)) (.cse3 (<= v_main_~m~0_61 8))) (or (and (= v_main_~k~0_175 v_main_~k~0_167) (= v_main_~n~0_22 v_main_~n~0_22) .cse0 (= |v_main_#t~post4_122| |v_main_#t~post4_114|) (= |v_main_#t~post5_122| |v_main_#t~post5_114|) .cse1 .cse2 (= v_main_~m~0_61 v_main_~m~0_61)) (and (= |v_main_#t~post4_114| |v_main_#t~post4_122|) (= v_main_~k~0_167 v_main_~k~0_175) .cse0 (= |v_main_#t~post5_114| |v_main_#t~post5_122|) (or (not .cse3) (not .cse4) (not (< v_main_~i~0_56 v_main_~n~0_22))) .cse1 .cse2) (and (< v_main_~i~0_56 v_main_~i~0_55) (= (+ (* v_main_~i~0_56 8) v_main_~k~0_167) (+ v_main_~k~0_175 (* v_main_~i~0_55 8))) .cse4 (< v_main_~i~0_55 (+ v_main_~n~0_22 1)) (= v_main_~j~0_173 8) .cse3))) InVars {main_~m~0=v_main_~m~0_61, main_~k~0=v_main_~k~0_175, main_~j~0=v_main_~j~0_182, main_~i~0=v_main_~i~0_56, main_#t~post4=|v_main_#t~post4_122|, main_#t~post5=|v_main_#t~post5_122|, main_~n~0=v_main_~n~0_22, main_#t~post3=|v_main_#t~post3_44|} OutVars{main_~m~0=v_main_~m~0_61, main_~k~0=v_main_~k~0_167, main_~j~0=v_main_~j~0_173, main_~i~0=v_main_~i~0_55, main_#t~post4=|v_main_#t~post4_114|, main_#t~post5=|v_main_#t~post5_114|, main_#t~post3=|v_main_#t~post3_43|, main_~n~0=v_main_~n~0_22} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {1966#(and (<= 10 main_~n~0) (= main_~i~0 0))} is VALID [2022-04-28 03:22:20,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {1966#(and (<= 10 main_~n~0) (= main_~i~0 0))} [90] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1960#false} is VALID [2022-04-28 03:22:20,183 INFO L272 TraceCheckUtils]: 10: Hoare triple {1960#false} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {1960#false} is VALID [2022-04-28 03:22:20,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {1960#false} ~cond := #in~cond; {1960#false} is VALID [2022-04-28 03:22:20,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {1960#false} assume 0 == ~cond; {1960#false} is VALID [2022-04-28 03:22:20,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {1960#false} assume !false; {1960#false} is VALID [2022-04-28 03:22:20,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:22:20,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:22:20,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130647479] [2022-04-28 03:22:20,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130647479] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:22:20,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:22:20,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:22:20,439 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:22:20,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [386195397] [2022-04-28 03:22:20,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [386195397] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:22:20,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:22:20,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 03:22:20,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682957256] [2022-04-28 03:22:20,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:22:20,440 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 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 32 [2022-04-28 03:22:20,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:22:20,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:20,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:22:20,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 03:22:20,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:22:20,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 03:22:20,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-04-28 03:22:20,462 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:20,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:20,994 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-04-28 03:22:20,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 03:22:20,994 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 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 32 [2022-04-28 03:22:20,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:22:20,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:20,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 52 transitions. [2022-04-28 03:22:20,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:20,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 52 transitions. [2022-04-28 03:22:20,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 52 transitions. [2022-04-28 03:22:21,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:22:21,040 INFO L225 Difference]: With dead ends: 48 [2022-04-28 03:22:21,040 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 03:22:21,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 9 SyntacticMatches, 9 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2022-04-28 03:22:21,041 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 57 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:22:21,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 44 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:22:21,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 03:22:21,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2022-04-28 03:22:21,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:22:21,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:21,065 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:21,067 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:21,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:21,068 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-28 03:22:21,068 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-28 03:22:21,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:22:21,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:22:21,068 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-28 03:22:21,068 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-28 03:22:21,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:21,069 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-28 03:22:21,069 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-28 03:22:21,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:22:21,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:22:21,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:22:21,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:22:21,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:21,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2022-04-28 03:22:21,070 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2022-04-28 03:22:21,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:22:21,070 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2022-04-28 03:22:21,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:21,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 36 transitions. [2022-04-28 03:22:21,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:22:21,109 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2022-04-28 03:22:21,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 03:22:21,110 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:22:21,110 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:22:21,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 03:22:21,110 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:22:21,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:22:21,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1998806905, now seen corresponding path program 9 times [2022-04-28 03:22:21,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:22:21,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1921841378] [2022-04-28 03:22:21,291 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:22:21,687 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:22:21,688 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:22:21,690 INFO L85 PathProgramCache]: Analyzing trace with hash -247098846, now seen corresponding path program 1 times [2022-04-28 03:22:21,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:22:21,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585382767] [2022-04-28 03:22:21,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:22:21,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:22:21,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:21,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:22:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:21,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {2253#(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); {2245#true} is VALID [2022-04-28 03:22:21,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {2245#true} assume true; {2245#true} is VALID [2022-04-28 03:22:21,747 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2245#true} {2245#true} #71#return; {2245#true} is VALID [2022-04-28 03:22:21,748 INFO L272 TraceCheckUtils]: 0: Hoare triple {2245#true} call ULTIMATE.init(); {2253#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:22:21,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {2253#(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); {2245#true} is VALID [2022-04-28 03:22:21,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {2245#true} assume true; {2245#true} is VALID [2022-04-28 03:22:21,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2245#true} {2245#true} #71#return; {2245#true} is VALID [2022-04-28 03:22:21,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {2245#true} call #t~ret6 := main(); {2245#true} is VALID [2022-04-28 03:22:21,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {2245#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {2245#true} is VALID [2022-04-28 03:22:21,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {2245#true} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {2250#(<= 10 main_~n~0)} is VALID [2022-04-28 03:22:21,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {2250#(<= 10 main_~n~0)} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {2251#(and (not (<= main_~m~0 9)) (<= 10 main_~n~0) (= main_~i~0 0))} is VALID [2022-04-28 03:22:21,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {2251#(and (not (<= main_~m~0 9)) (<= 10 main_~n~0) (= main_~i~0 0))} [93] L31-3-->L31-4_primed: Formula: (let ((.cse2 (= v_main_~i~0_62 v_main_~i~0_61)) (.cse3 (= |v_main_#t~post3_49| |v_main_#t~post3_48|)) (.cse1 (< 8 v_main_~m~0_68)) (.cse0 (<= v_main_~m~0_68 9)) (.cse4 (= v_main_~k~0_206 v_main_~k~0_197))) (or (and (= v_main_~j~0_203 9) .cse0 (= (+ (* v_main_~i~0_61 9) v_main_~k~0_206) (+ v_main_~k~0_197 (* v_main_~i~0_62 9))) (< v_main_~i~0_61 (+ v_main_~n~0_24 1)) (< v_main_~i~0_62 v_main_~i~0_61) .cse1) (and (= v_main_~j~0_213 v_main_~j~0_203) (= |v_main_#t~post4_142| |v_main_#t~post4_133|) .cse2 .cse3 (= v_main_~m~0_68 v_main_~m~0_68) (= |v_main_#t~post5_142| |v_main_#t~post5_133|) .cse4 (= v_main_~n~0_24 v_main_~n~0_24)) (and .cse2 (= |v_main_#t~post5_133| |v_main_#t~post5_142|) .cse3 (or (not .cse1) (not (< v_main_~i~0_62 v_main_~n~0_24)) (not .cse0)) .cse4 (= v_main_~j~0_203 v_main_~j~0_213) (= |v_main_#t~post4_133| |v_main_#t~post4_142|)))) InVars {main_~m~0=v_main_~m~0_68, main_~k~0=v_main_~k~0_206, main_~j~0=v_main_~j~0_213, main_~i~0=v_main_~i~0_62, main_#t~post4=|v_main_#t~post4_142|, main_#t~post5=|v_main_#t~post5_142|, main_~n~0=v_main_~n~0_24, main_#t~post3=|v_main_#t~post3_49|} OutVars{main_~m~0=v_main_~m~0_68, main_~k~0=v_main_~k~0_197, main_~j~0=v_main_~j~0_203, main_~i~0=v_main_~i~0_61, main_#t~post4=|v_main_#t~post4_133|, main_#t~post5=|v_main_#t~post5_133|, main_#t~post3=|v_main_#t~post3_48|, main_~n~0=v_main_~n~0_24} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {2252#(<= (+ main_~i~0 10) main_~n~0)} is VALID [2022-04-28 03:22:21,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {2252#(<= (+ main_~i~0 10) main_~n~0)} [92] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {2246#false} is VALID [2022-04-28 03:22:21,750 INFO L272 TraceCheckUtils]: 10: Hoare triple {2246#false} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {2246#false} is VALID [2022-04-28 03:22:21,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {2246#false} ~cond := #in~cond; {2246#false} is VALID [2022-04-28 03:22:21,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {2246#false} assume 0 == ~cond; {2246#false} is VALID [2022-04-28 03:22:21,751 INFO L290 TraceCheckUtils]: 13: Hoare triple {2246#false} assume !false; {2246#false} is VALID [2022-04-28 03:22:21,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:22:21,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:22:21,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585382767] [2022-04-28 03:22:21,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585382767] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:22:21,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:22:21,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:22:22,073 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:22:22,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1921841378] [2022-04-28 03:22:22,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1921841378] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:22:22,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:22:22,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 03:22:22,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452254267] [2022-04-28 03:22:22,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:22:22,075 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 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 34 [2022-04-28 03:22:22,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:22:22,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:22,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:22:22,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 03:22:22,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:22:22,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 03:22:22,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-04-28 03:22:22,100 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:22,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:22,688 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-04-28 03:22:22,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 03:22:22,688 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 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 34 [2022-04-28 03:22:22,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:22:22,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:22,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 54 transitions. [2022-04-28 03:22:22,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:22,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 54 transitions. [2022-04-28 03:22:22,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 54 transitions. [2022-04-28 03:22:22,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:22:22,732 INFO L225 Difference]: With dead ends: 50 [2022-04-28 03:22:22,732 INFO L226 Difference]: Without dead ends: 41 [2022-04-28 03:22:22,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 9 SyntacticMatches, 10 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2022-04-28 03:22:22,733 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 48 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:22:22,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 29 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:22:22,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-28 03:22:22,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2022-04-28 03:22:22,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:22:22,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:22,790 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:22,791 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:22,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:22,791 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-04-28 03:22:22,791 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-04-28 03:22:22,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:22:22,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:22:22,791 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-28 03:22:22,792 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-28 03:22:22,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:22,792 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-04-28 03:22:22,792 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-04-28 03:22:22,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:22:22,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:22:22,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:22:22,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:22:22,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:22,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2022-04-28 03:22:22,793 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2022-04-28 03:22:22,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:22:22,793 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2022-04-28 03:22:22,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:22,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 38 transitions. [2022-04-28 03:22:22,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:22:22,831 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-28 03:22:22,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 03:22:22,831 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:22:22,831 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:22:22,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 03:22:22,832 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:22:22,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:22:22,832 INFO L85 PathProgramCache]: Analyzing trace with hash -878301531, now seen corresponding path program 10 times [2022-04-28 03:22:22,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:22:22,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1058436358] [2022-04-28 03:22:22,988 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:22:23,309 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:22:23,311 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:22:23,313 INFO L85 PathProgramCache]: Analyzing trace with hash -187993502, now seen corresponding path program 1 times [2022-04-28 03:22:23,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:22:23,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580240678] [2022-04-28 03:22:23,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:22:23,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:22:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:23,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:22:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:23,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {2558#(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); {2546#true} is VALID [2022-04-28 03:22:23,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {2546#true} assume true; {2546#true} is VALID [2022-04-28 03:22:23,399 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2546#true} {2546#true} #71#return; {2546#true} is VALID [2022-04-28 03:22:23,399 INFO L272 TraceCheckUtils]: 0: Hoare triple {2546#true} call ULTIMATE.init(); {2558#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:22:23,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {2558#(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); {2546#true} is VALID [2022-04-28 03:22:23,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {2546#true} assume true; {2546#true} is VALID [2022-04-28 03:22:23,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2546#true} {2546#true} #71#return; {2546#true} is VALID [2022-04-28 03:22:23,399 INFO L272 TraceCheckUtils]: 4: Hoare triple {2546#true} call #t~ret6 := main(); {2546#true} is VALID [2022-04-28 03:22:23,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {2546#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {2551#(= main_~k~0 0)} is VALID [2022-04-28 03:22:23,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {2551#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {2552#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:22:23,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {2552#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {2553#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:22:23,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {2553#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [95] L31-3-->L31-4_primed: Formula: (let ((.cse2 (= |v_main_#t~post3_54| |v_main_#t~post3_53|)) (.cse0 (< 9 v_main_~m~0_75)) (.cse1 (<= v_main_~m~0_75 10)) (.cse3 (= v_main_~i~0_68 v_main_~i~0_67)) (.cse4 (= v_main_~j~0_246 v_main_~j~0_235))) (or (and (= (+ (* v_main_~i~0_67 10) v_main_~k~0_239) (+ v_main_~k~0_229 (* v_main_~i~0_68 10))) .cse0 (= v_main_~j~0_235 10) .cse1 (< v_main_~i~0_68 v_main_~i~0_67) (< v_main_~i~0_67 (+ v_main_~n~0_26 1))) (and .cse2 (= v_main_~n~0_26 v_main_~n~0_26) (= |v_main_#t~post5_163| |v_main_#t~post5_153|) (= |v_main_#t~post4_163| |v_main_#t~post4_153|) (= v_main_~m~0_75 v_main_~m~0_75) .cse3 (= v_main_~k~0_239 v_main_~k~0_229) .cse4) (and (= v_main_~k~0_229 v_main_~k~0_239) .cse2 (= |v_main_#t~post5_153| |v_main_#t~post5_163|) (or (not .cse0) (not .cse1) (not (< v_main_~i~0_68 v_main_~n~0_26))) (= |v_main_#t~post4_153| |v_main_#t~post4_163|) .cse3 .cse4))) InVars {main_~m~0=v_main_~m~0_75, main_~k~0=v_main_~k~0_239, main_~j~0=v_main_~j~0_246, main_~i~0=v_main_~i~0_68, main_#t~post4=|v_main_#t~post4_163|, main_#t~post5=|v_main_#t~post5_163|, main_~n~0=v_main_~n~0_26, main_#t~post3=|v_main_#t~post3_54|} OutVars{main_~m~0=v_main_~m~0_75, main_~k~0=v_main_~k~0_229, main_~j~0=v_main_~j~0_235, main_~i~0=v_main_~i~0_67, main_#t~post4=|v_main_#t~post4_153|, main_#t~post5=|v_main_#t~post5_153|, main_#t~post3=|v_main_#t~post3_53|, main_~n~0=v_main_~n~0_26} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {2554#(or (<= (+ main_~i~0 10) main_~n~0) (<= (+ (* main_~i~0 10) 100) (+ main_~k~0 (* main_~n~0 10))))} is VALID [2022-04-28 03:22:23,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {2554#(or (<= (+ main_~i~0 10) main_~n~0) (<= (+ (* main_~i~0 10) 100) (+ main_~k~0 (* main_~n~0 10))))} [94] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {2555#(<= 100 main_~k~0)} is VALID [2022-04-28 03:22:23,402 INFO L272 TraceCheckUtils]: 10: Hoare triple {2555#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {2556#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:22:23,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {2556#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2557#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:22:23,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {2557#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2547#false} is VALID [2022-04-28 03:22:23,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {2547#false} assume !false; {2547#false} is VALID [2022-04-28 03:22:23,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:22:23,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:22:23,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580240678] [2022-04-28 03:22:23,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580240678] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:22:23,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:22:23,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:22:24,734 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:22:24,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1058436358] [2022-04-28 03:22:24,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1058436358] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:22:24,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:22:24,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-28 03:22:24,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981505595] [2022-04-28 03:22:24,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:22:24,735 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.032258064516129) internal successors, (32), 30 states have internal predecessors, (32), 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 36 [2022-04-28 03:22:24,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:22:24,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 31 states have (on average 1.032258064516129) internal successors, (32), 30 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:24,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:22:24,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-28 03:22:24,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:22:24,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-28 03:22:24,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 03:22:24,770 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 32 states, 31 states have (on average 1.032258064516129) internal successors, (32), 30 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:28,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:28,803 INFO L93 Difference]: Finished difference Result 79 states and 93 transitions. [2022-04-28 03:22:28,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 03:22:28,803 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.032258064516129) internal successors, (32), 30 states have internal predecessors, (32), 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 36 [2022-04-28 03:22:28,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:22:28,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.032258064516129) internal successors, (32), 30 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:28,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 75 transitions. [2022-04-28 03:22:28,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.032258064516129) internal successors, (32), 30 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:28,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 75 transitions. [2022-04-28 03:22:28,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 75 transitions. [2022-04-28 03:22:28,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:22:28,889 INFO L225 Difference]: With dead ends: 79 [2022-04-28 03:22:28,889 INFO L226 Difference]: Without dead ends: 74 [2022-04-28 03:22:28,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=265, Invalid=3767, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 03:22:28,890 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 37 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 1627 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 1657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:22:28,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 160 Invalid, 1657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1627 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-28 03:22:28,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-28 03:22:29,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 60. [2022-04-28 03:22:29,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:22:29,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 60 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 55 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:29,054 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 60 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 55 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:29,054 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 60 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 55 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:29,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:29,055 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2022-04-28 03:22:29,055 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 88 transitions. [2022-04-28 03:22:29,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:22:29,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:22:29,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 55 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-28 03:22:29,056 INFO L87 Difference]: Start difference. First operand has 60 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 55 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-28 03:22:29,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:29,057 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2022-04-28 03:22:29,057 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 88 transitions. [2022-04-28 03:22:29,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:22:29,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:22:29,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:22:29,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:22:29,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 55 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:29,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2022-04-28 03:22:29,058 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 36 [2022-04-28 03:22:29,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:22:29,058 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2022-04-28 03:22:29,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.032258064516129) internal successors, (32), 30 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:29,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 72 transitions. [2022-04-28 03:22:29,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:22:29,163 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2022-04-28 03:22:29,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 03:22:29,163 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:22:29,163 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:22:29,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 03:22:29,163 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:22:29,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:22:29,164 INFO L85 PathProgramCache]: Analyzing trace with hash -2109428413, now seen corresponding path program 11 times [2022-04-28 03:22:29,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:22:29,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1022432952] [2022-04-28 03:22:33,272 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:22:33,339 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:22:33,687 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:22:33,689 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:22:33,691 INFO L85 PathProgramCache]: Analyzing trace with hash -128888158, now seen corresponding path program 1 times [2022-04-28 03:22:33,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:22:33,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615451353] [2022-04-28 03:22:33,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:22:33,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:22:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:33,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:22:33,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:33,771 INFO L290 TraceCheckUtils]: 0: Hoare triple {3083#(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); {3071#true} is VALID [2022-04-28 03:22:33,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {3071#true} assume true; {3071#true} is VALID [2022-04-28 03:22:33,771 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3071#true} {3071#true} #71#return; {3071#true} is VALID [2022-04-28 03:22:33,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {3071#true} call ULTIMATE.init(); {3083#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:22:33,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {3083#(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); {3071#true} is VALID [2022-04-28 03:22:33,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {3071#true} assume true; {3071#true} is VALID [2022-04-28 03:22:33,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3071#true} {3071#true} #71#return; {3071#true} is VALID [2022-04-28 03:22:33,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {3071#true} call #t~ret6 := main(); {3071#true} is VALID [2022-04-28 03:22:33,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {3071#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {3076#(= main_~k~0 0)} is VALID [2022-04-28 03:22:33,773 INFO L290 TraceCheckUtils]: 6: Hoare triple {3076#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {3077#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:22:33,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {3077#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {3078#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:22:33,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {3078#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [97] L31-3-->L31-4_primed: Formula: (let ((.cse2 (<= v_main_~m~0_82 11)) (.cse1 (< 10 v_main_~m~0_82)) (.cse0 (= v_main_~i~0_75 v_main_~i~0_74)) (.cse3 (= v_main_~j~0_282 v_main_~j~0_270))) (or (and .cse0 (or (not .cse1) (not .cse2) (not (< v_main_~i~0_75 v_main_~n~0_28))) (= v_main_~k~0_263 v_main_~k~0_274) (= |v_main_#t~post4_174| |v_main_#t~post4_185|) .cse3 (= |v_main_#t~post3_58| |v_main_#t~post3_59|) (= |v_main_#t~post5_174| |v_main_#t~post5_185|)) (and (< v_main_~i~0_75 v_main_~i~0_74) (< v_main_~i~0_74 (+ v_main_~n~0_28 1)) .cse2 (= (+ v_main_~k~0_274 (* v_main_~i~0_74 11)) (+ (* v_main_~i~0_75 11) v_main_~k~0_263)) .cse1 (= v_main_~j~0_270 11)) (and (= v_main_~n~0_28 v_main_~n~0_28) (= |v_main_#t~post5_185| |v_main_#t~post5_174|) (= |v_main_#t~post4_185| |v_main_#t~post4_174|) .cse0 (= v_main_~m~0_82 v_main_~m~0_82) (= v_main_~k~0_274 v_main_~k~0_263) (= |v_main_#t~post3_59| |v_main_#t~post3_58|) .cse3))) InVars {main_~m~0=v_main_~m~0_82, main_~k~0=v_main_~k~0_274, main_~j~0=v_main_~j~0_282, main_~i~0=v_main_~i~0_75, main_#t~post4=|v_main_#t~post4_185|, main_#t~post5=|v_main_#t~post5_185|, main_~n~0=v_main_~n~0_28, main_#t~post3=|v_main_#t~post3_59|} OutVars{main_~m~0=v_main_~m~0_82, main_~k~0=v_main_~k~0_263, main_~j~0=v_main_~j~0_270, main_~i~0=v_main_~i~0_74, main_#t~post4=|v_main_#t~post4_174|, main_#t~post5=|v_main_#t~post5_174|, main_#t~post3=|v_main_#t~post3_58|, main_~n~0=v_main_~n~0_28} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {3079#(or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ 110 (* main_~i~0 11)) (+ (* main_~n~0 11) main_~k~0)))} is VALID [2022-04-28 03:22:33,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {3079#(or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ 110 (* main_~i~0 11)) (+ (* main_~n~0 11) main_~k~0)))} [96] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {3080#(<= 110 main_~k~0)} is VALID [2022-04-28 03:22:33,775 INFO L272 TraceCheckUtils]: 10: Hoare triple {3080#(<= 110 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {3081#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:22:33,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {3081#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3082#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:22:33,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {3082#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3072#false} is VALID [2022-04-28 03:22:33,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {3072#false} assume !false; {3072#false} is VALID [2022-04-28 03:22:33,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:22:33,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:22:33,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615451353] [2022-04-28 03:22:33,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615451353] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:22:33,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:22:33,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:22:35,145 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:22:35,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1022432952] [2022-04-28 03:22:35,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1022432952] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:22:35,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:22:35,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-28 03:22:35,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012798495] [2022-04-28 03:22:35,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:22:35,146 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 32 states have internal predecessors, (34), 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 38 [2022-04-28 03:22:35,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:22:35,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 32 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:35,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:22:35,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-28 03:22:35,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:22:35,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-28 03:22:35,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 03:22:35,180 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand has 34 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 32 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:40,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:40,090 INFO L93 Difference]: Finished difference Result 108 states and 135 transitions. [2022-04-28 03:22:40,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 03:22:40,090 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 32 states have internal predecessors, (34), 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 38 [2022-04-28 03:22:40,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:22:40,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 32 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:40,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 79 transitions. [2022-04-28 03:22:40,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 32 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:40,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 79 transitions. [2022-04-28 03:22:40,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 79 transitions. [2022-04-28 03:22:40,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:22:40,180 INFO L225 Difference]: With dead ends: 108 [2022-04-28 03:22:40,180 INFO L226 Difference]: Without dead ends: 103 [2022-04-28 03:22:40,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=281, Invalid=4275, Unknown=0, NotChecked=0, Total=4556 [2022-04-28 03:22:40,182 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 39 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 1863 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 1895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:22:40,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 170 Invalid, 1895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1863 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-28 03:22:40,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-28 03:22:40,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 87. [2022-04-28 03:22:40,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:22:40,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 87 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:40,444 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 87 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:40,444 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 87 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:40,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:40,445 INFO L93 Difference]: Finished difference Result 103 states and 130 transitions. [2022-04-28 03:22:40,445 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 130 transitions. [2022-04-28 03:22:40,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:22:40,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:22:40,446 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 103 states. [2022-04-28 03:22:40,446 INFO L87 Difference]: Start difference. First operand has 87 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 103 states. [2022-04-28 03:22:40,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:40,447 INFO L93 Difference]: Finished difference Result 103 states and 130 transitions. [2022-04-28 03:22:40,447 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 130 transitions. [2022-04-28 03:22:40,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:22:40,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:22:40,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:22:40,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:22:40,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:40,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 112 transitions. [2022-04-28 03:22:40,449 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 112 transitions. Word has length 38 [2022-04-28 03:22:40,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:22:40,449 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 112 transitions. [2022-04-28 03:22:40,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 32 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:40,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 112 transitions. [2022-04-28 03:22:40,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:22:40,657 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2022-04-28 03:22:40,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 03:22:40,657 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:22:40,657 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:22:40,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 03:22:40,658 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:22:40,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:22:40,658 INFO L85 PathProgramCache]: Analyzing trace with hash 830724028, now seen corresponding path program 12 times [2022-04-28 03:22:40,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:22:40,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [690959216] [2022-04-28 03:22:40,840 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:22:41,199 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:22:41,334 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:22:41,336 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:22:41,338 INFO L85 PathProgramCache]: Analyzing trace with hash 121094337, now seen corresponding path program 1 times [2022-04-28 03:22:41,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:22:41,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153430685] [2022-04-28 03:22:41,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:22:41,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:22:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:41,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:22:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:41,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {3785#(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); {3772#true} is VALID [2022-04-28 03:22:41,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {3772#true} assume true; {3772#true} is VALID [2022-04-28 03:22:41,463 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3772#true} {3772#true} #71#return; {3772#true} is VALID [2022-04-28 03:22:41,463 INFO L272 TraceCheckUtils]: 0: Hoare triple {3772#true} call ULTIMATE.init(); {3785#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:22:41,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {3785#(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); {3772#true} is VALID [2022-04-28 03:22:41,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {3772#true} assume true; {3772#true} is VALID [2022-04-28 03:22:41,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3772#true} {3772#true} #71#return; {3772#true} is VALID [2022-04-28 03:22:41,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {3772#true} call #t~ret6 := main(); {3772#true} is VALID [2022-04-28 03:22:41,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {3772#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {3777#(= main_~k~0 0)} is VALID [2022-04-28 03:22:41,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {3777#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {3778#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:22:41,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {3778#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {3779#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:22:41,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {3779#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} [99] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_84 v_main_~i~0_83)) (.cse1 (= |v_main_#t~post5_206| |v_main_#t~post5_196|)) (.cse2 (= v_main_~k~0_309 v_main_~k~0_299)) (.cse3 (= |v_main_#t~post4_206| |v_main_#t~post4_196|)) (.cse4 (= v_main_~j~0_321 v_main_~j~0_309)) (.cse5 (= |v_main_#t~post3_66| |v_main_#t~post3_64|)) (.cse7 (<= v_main_~m~0_90 10)) (.cse6 (< 9 v_main_~m~0_90))) (or (and .cse0 (= v_main_~m~0_90 v_main_~m~0_90) .cse1 (= v_main_~n~0_31 v_main_~n~0_31) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (or (not .cse6) (not (< v_main_~i~0_84 v_main_~n~0_31)) (not .cse7)) .cse2 .cse3 .cse4 .cse5) (and .cse7 (< v_main_~i~0_83 (+ v_main_~n~0_31 1)) .cse6 (= (+ (* v_main_~i~0_84 10) v_main_~k~0_299) (+ (* v_main_~i~0_83 10) v_main_~k~0_309)) (= v_main_~j~0_309 10) (< v_main_~i~0_84 v_main_~i~0_83)))) InVars {main_~m~0=v_main_~m~0_90, main_~k~0=v_main_~k~0_309, main_~j~0=v_main_~j~0_321, main_~i~0=v_main_~i~0_84, main_#t~post4=|v_main_#t~post4_206|, main_#t~post5=|v_main_#t~post5_206|, main_~n~0=v_main_~n~0_31, main_#t~post3=|v_main_#t~post3_66|} OutVars{main_~m~0=v_main_~m~0_90, main_~k~0=v_main_~k~0_299, main_~j~0=v_main_~j~0_309, main_~i~0=v_main_~i~0_83, main_#t~post4=|v_main_#t~post4_196|, main_#t~post5=|v_main_#t~post5_196|, main_#t~post3=|v_main_#t~post3_64|, main_~n~0=v_main_~n~0_31} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {3780#(and (or (<= 10 main_~m~0) (<= main_~n~0 main_~i~0)) (or (not (<= main_~n~0 main_~i~0)) (<= (+ (* main_~i~0 10) 100) (+ main_~k~0 (* main_~n~0 10)))))} is VALID [2022-04-28 03:22:41,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {3780#(and (or (<= 10 main_~m~0) (<= main_~n~0 main_~i~0)) (or (not (<= main_~n~0 main_~i~0)) (<= (+ (* main_~i~0 10) 100) (+ main_~k~0 (* main_~n~0 10)))))} [100] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3780#(and (or (<= 10 main_~m~0) (<= main_~n~0 main_~i~0)) (or (not (<= main_~n~0 main_~i~0)) (<= (+ (* main_~i~0 10) 100) (+ main_~k~0 (* main_~n~0 10)))))} is VALID [2022-04-28 03:22:41,467 INFO L290 TraceCheckUtils]: 10: Hoare triple {3780#(and (or (<= 10 main_~m~0) (<= main_~n~0 main_~i~0)) (or (not (<= main_~n~0 main_~i~0)) (<= (+ (* main_~i~0 10) 100) (+ main_~k~0 (* main_~n~0 10)))))} [101] L31-3-->L31-4_primed: Formula: (let ((.cse1 (= |v_main_#t~post3_69| |v_main_#t~post3_65|)) (.cse2 (= v_main_~i~0_86 v_main_~i~0_85)) (.cse0 (<= v_main_~m~0_91 0))) (or (and (< v_main_~i~0_85 (+ v_main_~n~0_32 1)) (= v_main_~j~0_320 0) .cse0 (< v_main_~i~0_86 v_main_~i~0_85)) (and (= v_main_~m~0_91 v_main_~m~0_91) (= v_main_~j~0_324 v_main_~j~0_320) (= v_main_~n~0_32 v_main_~n~0_32) .cse1 .cse2) (and .cse1 .cse2 (= v_main_~j~0_320 v_main_~j~0_324) (or (not .cse0) (not (< v_main_~i~0_86 v_main_~n~0_32)))))) InVars {main_~i~0=v_main_~i~0_86, main_~n~0=v_main_~n~0_32, main_#t~post3=|v_main_#t~post3_69|, main_~m~0=v_main_~m~0_91, main_~j~0=v_main_~j~0_324} OutVars{main_~i~0=v_main_~i~0_85, main_#t~post3=|v_main_#t~post3_65|, main_~n~0=v_main_~n~0_32, main_~m~0=v_main_~m~0_91, main_~j~0=v_main_~j~0_320} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post3] {3781#(or (<= 100 main_~k~0) (<= (+ main_~i~0 1) main_~n~0))} is VALID [2022-04-28 03:22:41,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {3781#(or (<= 100 main_~k~0) (<= (+ main_~i~0 1) main_~n~0))} [98] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {3782#(<= 100 main_~k~0)} is VALID [2022-04-28 03:22:41,468 INFO L272 TraceCheckUtils]: 12: Hoare triple {3782#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {3783#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:22:41,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {3783#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3784#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:22:41,469 INFO L290 TraceCheckUtils]: 14: Hoare triple {3784#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3773#false} is VALID [2022-04-28 03:22:41,469 INFO L290 TraceCheckUtils]: 15: Hoare triple {3773#false} assume !false; {3773#false} is VALID [2022-04-28 03:22:41,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:22:41,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:22:41,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153430685] [2022-04-28 03:22:41,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153430685] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:22:41,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360473061] [2022-04-28 03:22:41,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:22:41,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:22:41,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:22:41,471 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:22:41,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 03:22:41,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:41,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:22:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:41,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:22:42,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {3772#true} call ULTIMATE.init(); {3772#true} is VALID [2022-04-28 03:22:42,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {3772#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); {3772#true} is VALID [2022-04-28 03:22:42,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {3772#true} assume true; {3772#true} is VALID [2022-04-28 03:22:42,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3772#true} {3772#true} #71#return; {3772#true} is VALID [2022-04-28 03:22:42,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {3772#true} call #t~ret6 := main(); {3772#true} is VALID [2022-04-28 03:22:42,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {3772#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {3804#(<= 0 main_~k~0)} is VALID [2022-04-28 03:22:42,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {3804#(<= 0 main_~k~0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {3808#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} is VALID [2022-04-28 03:22:42,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {3808#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {3812#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:22:42,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {3812#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [99] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_84 v_main_~i~0_83)) (.cse1 (= |v_main_#t~post5_206| |v_main_#t~post5_196|)) (.cse2 (= v_main_~k~0_309 v_main_~k~0_299)) (.cse3 (= |v_main_#t~post4_206| |v_main_#t~post4_196|)) (.cse4 (= v_main_~j~0_321 v_main_~j~0_309)) (.cse5 (= |v_main_#t~post3_66| |v_main_#t~post3_64|)) (.cse7 (<= v_main_~m~0_90 10)) (.cse6 (< 9 v_main_~m~0_90))) (or (and .cse0 (= v_main_~m~0_90 v_main_~m~0_90) .cse1 (= v_main_~n~0_31 v_main_~n~0_31) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (or (not .cse6) (not (< v_main_~i~0_84 v_main_~n~0_31)) (not .cse7)) .cse2 .cse3 .cse4 .cse5) (and .cse7 (< v_main_~i~0_83 (+ v_main_~n~0_31 1)) .cse6 (= (+ (* v_main_~i~0_84 10) v_main_~k~0_299) (+ (* v_main_~i~0_83 10) v_main_~k~0_309)) (= v_main_~j~0_309 10) (< v_main_~i~0_84 v_main_~i~0_83)))) InVars {main_~m~0=v_main_~m~0_90, main_~k~0=v_main_~k~0_309, main_~j~0=v_main_~j~0_321, main_~i~0=v_main_~i~0_84, main_#t~post4=|v_main_#t~post4_206|, main_#t~post5=|v_main_#t~post5_206|, main_~n~0=v_main_~n~0_31, main_#t~post3=|v_main_#t~post3_66|} OutVars{main_~m~0=v_main_~m~0_90, main_~k~0=v_main_~k~0_299, main_~j~0=v_main_~j~0_309, main_~i~0=v_main_~i~0_83, main_#t~post4=|v_main_#t~post4_196|, main_#t~post5=|v_main_#t~post5_196|, main_#t~post3=|v_main_#t~post3_64|, main_~n~0=v_main_~n~0_31} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {3816#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (or (and (<= main_~m~0 10) (<= (+ main_~i~0 (div main_~k~0 (- 10))) 0) (= main_~j~0 10) (< (div main_~k~0 (- 10)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:22:42,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {3816#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (or (and (<= main_~m~0 10) (<= (+ main_~i~0 (div main_~k~0 (- 10))) 0) (= main_~j~0 10) (< (div main_~k~0 (- 10)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [100] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3816#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (or (and (<= main_~m~0 10) (<= (+ main_~i~0 (div main_~k~0 (- 10))) 0) (= main_~j~0 10) (< (div main_~k~0 (- 10)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:22:42,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {3816#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (or (and (<= main_~m~0 10) (<= (+ main_~i~0 (div main_~k~0 (- 10))) 0) (= main_~j~0 10) (< (div main_~k~0 (- 10)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [101] L31-3-->L31-4_primed: Formula: (let ((.cse1 (= |v_main_#t~post3_69| |v_main_#t~post3_65|)) (.cse2 (= v_main_~i~0_86 v_main_~i~0_85)) (.cse0 (<= v_main_~m~0_91 0))) (or (and (< v_main_~i~0_85 (+ v_main_~n~0_32 1)) (= v_main_~j~0_320 0) .cse0 (< v_main_~i~0_86 v_main_~i~0_85)) (and (= v_main_~m~0_91 v_main_~m~0_91) (= v_main_~j~0_324 v_main_~j~0_320) (= v_main_~n~0_32 v_main_~n~0_32) .cse1 .cse2) (and .cse1 .cse2 (= v_main_~j~0_320 v_main_~j~0_324) (or (not .cse0) (not (< v_main_~i~0_86 v_main_~n~0_32)))))) InVars {main_~i~0=v_main_~i~0_86, main_~n~0=v_main_~n~0_32, main_#t~post3=|v_main_#t~post3_69|, main_~m~0=v_main_~m~0_91, main_~j~0=v_main_~j~0_324} OutVars{main_~i~0=v_main_~i~0_85, main_#t~post3=|v_main_#t~post3_65|, main_~n~0=v_main_~n~0_32, main_~m~0=v_main_~m~0_91, main_~j~0=v_main_~j~0_320} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post3] {3823#(and (<= 10 main_~n~0) (or (and (<= (+ main_~i~0 (div main_~k~0 (- 10))) 0) (< (div main_~k~0 (- 10)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:22:42,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {3823#(and (<= 10 main_~n~0) (or (and (<= (+ main_~i~0 (div main_~k~0 (- 10))) 0) (< (div main_~k~0 (- 10)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [98] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {3782#(<= 100 main_~k~0)} is VALID [2022-04-28 03:22:42,204 INFO L272 TraceCheckUtils]: 12: Hoare triple {3782#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {3830#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:22:42,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {3830#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3834#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:22:42,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {3834#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3773#false} is VALID [2022-04-28 03:22:42,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {3773#false} assume !false; {3773#false} is VALID [2022-04-28 03:22:42,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:22:42,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:22:42,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {3773#false} assume !false; {3773#false} is VALID [2022-04-28 03:22:42,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {3834#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3773#false} is VALID [2022-04-28 03:22:42,768 INFO L290 TraceCheckUtils]: 13: Hoare triple {3830#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3834#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:22:42,769 INFO L272 TraceCheckUtils]: 12: Hoare triple {3782#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {3830#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:22:42,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {3781#(or (<= 100 main_~k~0) (<= (+ main_~i~0 1) main_~n~0))} [98] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {3782#(<= 100 main_~k~0)} is VALID [2022-04-28 03:22:42,770 INFO L290 TraceCheckUtils]: 10: Hoare triple {3856#(or (<= 100 main_~k~0) (and (<= (+ main_~i~0 1) main_~n~0) (not (<= main_~m~0 0))))} [101] L31-3-->L31-4_primed: Formula: (let ((.cse1 (= |v_main_#t~post3_69| |v_main_#t~post3_65|)) (.cse2 (= v_main_~i~0_86 v_main_~i~0_85)) (.cse0 (<= v_main_~m~0_91 0))) (or (and (< v_main_~i~0_85 (+ v_main_~n~0_32 1)) (= v_main_~j~0_320 0) .cse0 (< v_main_~i~0_86 v_main_~i~0_85)) (and (= v_main_~m~0_91 v_main_~m~0_91) (= v_main_~j~0_324 v_main_~j~0_320) (= v_main_~n~0_32 v_main_~n~0_32) .cse1 .cse2) (and .cse1 .cse2 (= v_main_~j~0_320 v_main_~j~0_324) (or (not .cse0) (not (< v_main_~i~0_86 v_main_~n~0_32)))))) InVars {main_~i~0=v_main_~i~0_86, main_~n~0=v_main_~n~0_32, main_#t~post3=|v_main_#t~post3_69|, main_~m~0=v_main_~m~0_91, main_~j~0=v_main_~j~0_324} OutVars{main_~i~0=v_main_~i~0_85, main_#t~post3=|v_main_#t~post3_65|, main_~n~0=v_main_~n~0_32, main_~m~0=v_main_~m~0_91, main_~j~0=v_main_~j~0_320} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post3] {3781#(or (<= 100 main_~k~0) (<= (+ main_~i~0 1) main_~n~0))} is VALID [2022-04-28 03:22:42,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {3856#(or (<= 100 main_~k~0) (and (<= (+ main_~i~0 1) main_~n~0) (not (<= main_~m~0 0))))} [100] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3856#(or (<= 100 main_~k~0) (and (<= (+ main_~i~0 1) main_~n~0) (not (<= main_~m~0 0))))} is VALID [2022-04-28 03:22:42,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {3863#(and (or (not (< 9 main_~m~0)) (<= (+ (div (+ (- 100) main_~k~0) (- 10)) main_~i~0) main_~n~0) (not (<= main_~m~0 10)) (<= (div (+ (- 100) main_~k~0) (- 10)) 1)) (or (<= 100 main_~k~0) (and (<= (+ main_~i~0 1) main_~n~0) (not (<= main_~m~0 0)))))} [99] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_84 v_main_~i~0_83)) (.cse1 (= |v_main_#t~post5_206| |v_main_#t~post5_196|)) (.cse2 (= v_main_~k~0_309 v_main_~k~0_299)) (.cse3 (= |v_main_#t~post4_206| |v_main_#t~post4_196|)) (.cse4 (= v_main_~j~0_321 v_main_~j~0_309)) (.cse5 (= |v_main_#t~post3_66| |v_main_#t~post3_64|)) (.cse7 (<= v_main_~m~0_90 10)) (.cse6 (< 9 v_main_~m~0_90))) (or (and .cse0 (= v_main_~m~0_90 v_main_~m~0_90) .cse1 (= v_main_~n~0_31 v_main_~n~0_31) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (or (not .cse6) (not (< v_main_~i~0_84 v_main_~n~0_31)) (not .cse7)) .cse2 .cse3 .cse4 .cse5) (and .cse7 (< v_main_~i~0_83 (+ v_main_~n~0_31 1)) .cse6 (= (+ (* v_main_~i~0_84 10) v_main_~k~0_299) (+ (* v_main_~i~0_83 10) v_main_~k~0_309)) (= v_main_~j~0_309 10) (< v_main_~i~0_84 v_main_~i~0_83)))) InVars {main_~m~0=v_main_~m~0_90, main_~k~0=v_main_~k~0_309, main_~j~0=v_main_~j~0_321, main_~i~0=v_main_~i~0_84, main_#t~post4=|v_main_#t~post4_206|, main_#t~post5=|v_main_#t~post5_206|, main_~n~0=v_main_~n~0_31, main_#t~post3=|v_main_#t~post3_66|} OutVars{main_~m~0=v_main_~m~0_90, main_~k~0=v_main_~k~0_299, main_~j~0=v_main_~j~0_309, main_~i~0=v_main_~i~0_83, main_#t~post4=|v_main_#t~post4_196|, main_#t~post5=|v_main_#t~post5_196|, main_#t~post3=|v_main_#t~post3_64|, main_~n~0=v_main_~n~0_31} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {3856#(or (<= 100 main_~k~0) (and (<= (+ main_~i~0 1) main_~n~0) (not (<= main_~m~0 0))))} is VALID [2022-04-28 03:22:42,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {3867#(and (or (<= (div (+ (- 100) main_~k~0) (- 10)) 1) (<= (div (+ (- 100) main_~k~0) (- 10)) main_~n~0)) (or (<= 100 main_~k~0) (<= 1 main_~n~0)))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {3863#(and (or (not (< 9 main_~m~0)) (<= (+ (div (+ (- 100) main_~k~0) (- 10)) main_~i~0) main_~n~0) (not (<= main_~m~0 10)) (<= (div (+ (- 100) main_~k~0) (- 10)) 1)) (or (<= 100 main_~k~0) (and (<= (+ main_~i~0 1) main_~n~0) (not (<= main_~m~0 0)))))} is VALID [2022-04-28 03:22:42,773 INFO L290 TraceCheckUtils]: 6: Hoare triple {3804#(<= 0 main_~k~0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {3867#(and (or (<= (div (+ (- 100) main_~k~0) (- 10)) 1) (<= (div (+ (- 100) main_~k~0) (- 10)) main_~n~0)) (or (<= 100 main_~k~0) (<= 1 main_~n~0)))} is VALID [2022-04-28 03:22:42,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {3772#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {3804#(<= 0 main_~k~0)} is VALID [2022-04-28 03:22:42,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {3772#true} call #t~ret6 := main(); {3772#true} is VALID [2022-04-28 03:22:42,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3772#true} {3772#true} #71#return; {3772#true} is VALID [2022-04-28 03:22:42,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {3772#true} assume true; {3772#true} is VALID [2022-04-28 03:22:42,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {3772#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); {3772#true} is VALID [2022-04-28 03:22:42,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {3772#true} call ULTIMATE.init(); {3772#true} is VALID [2022-04-28 03:22:42,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:22:42,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360473061] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:22:42,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:22:42,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 21 [2022-04-28 03:22:44,209 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:22:44,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [690959216] [2022-04-28 03:22:44,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [690959216] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:22:44,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:22:44,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-28 03:22:44,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084118392] [2022-04-28 03:22:44,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:22:44,209 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 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 39 [2022-04-28 03:22:44,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:22:44,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:44,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:22:44,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-28 03:22:44,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:22:44,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-28 03:22:44,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1721, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 03:22:44,249 INFO L87 Difference]: Start difference. First operand 87 states and 112 transitions. Second operand has 33 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:46,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:46,850 INFO L93 Difference]: Finished difference Result 96 states and 122 transitions. [2022-04-28 03:22:46,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 03:22:46,850 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 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 39 [2022-04-28 03:22:46,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:22:46,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:46,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 64 transitions. [2022-04-28 03:22:46,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:46,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 64 transitions. [2022-04-28 03:22:46,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 64 transitions. [2022-04-28 03:22:46,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:22:46,906 INFO L225 Difference]: With dead ends: 96 [2022-04-28 03:22:46,906 INFO L226 Difference]: Without dead ends: 87 [2022-04-28 03:22:46,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1277 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=686, Invalid=4570, Unknown=0, NotChecked=0, Total=5256 [2022-04-28 03:22:46,907 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:22:46,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 145 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 03:22:46,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-28 03:22:47,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-04-28 03:22:47,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:22:47,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 87 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 82 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:47,161 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 87 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 82 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:47,161 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 87 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 82 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:47,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:47,162 INFO L93 Difference]: Finished difference Result 87 states and 102 transitions. [2022-04-28 03:22:47,162 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 102 transitions. [2022-04-28 03:22:47,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:22:47,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:22:47,162 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 82 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 87 states. [2022-04-28 03:22:47,163 INFO L87 Difference]: Start difference. First operand has 87 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 82 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 87 states. [2022-04-28 03:22:47,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:47,164 INFO L93 Difference]: Finished difference Result 87 states and 102 transitions. [2022-04-28 03:22:47,164 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 102 transitions. [2022-04-28 03:22:47,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:22:47,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:22:47,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:22:47,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:22:47,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 82 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:47,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 102 transitions. [2022-04-28 03:22:47,165 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 102 transitions. Word has length 39 [2022-04-28 03:22:47,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:22:47,165 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 102 transitions. [2022-04-28 03:22:47,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:47,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 102 transitions. [2022-04-28 03:22:47,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:22:47,360 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 102 transitions. [2022-04-28 03:22:47,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 03:22:47,360 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:22:47,360 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:22:47,379 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 03:22:47,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 03:22:47,561 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:22:47,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:22:47,561 INFO L85 PathProgramCache]: Analyzing trace with hash 188611681, now seen corresponding path program 13 times [2022-04-28 03:22:47,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:22:47,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [576944710] [2022-04-28 03:22:51,722 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:22:51,783 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:22:52,447 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:22:52,448 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:22:52,450 INFO L85 PathProgramCache]: Analyzing trace with hash 48427874, now seen corresponding path program 1 times [2022-04-28 03:22:52,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:22:52,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619006910] [2022-04-28 03:22:52,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:22:52,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:22:52,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:52,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:22:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:22:52,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {4522#(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); {4510#true} is VALID [2022-04-28 03:22:52,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {4510#true} assume true; {4510#true} is VALID [2022-04-28 03:22:52,521 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4510#true} {4510#true} #71#return; {4510#true} is VALID [2022-04-28 03:22:52,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {4510#true} call ULTIMATE.init(); {4522#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:22:52,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {4522#(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); {4510#true} is VALID [2022-04-28 03:22:52,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {4510#true} assume true; {4510#true} is VALID [2022-04-28 03:22:52,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4510#true} {4510#true} #71#return; {4510#true} is VALID [2022-04-28 03:22:52,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {4510#true} call #t~ret6 := main(); {4510#true} is VALID [2022-04-28 03:22:52,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {4510#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {4515#(= main_~k~0 0)} is VALID [2022-04-28 03:22:52,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {4515#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {4516#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:22:52,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {4516#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {4517#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:22:52,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {4517#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [103] L31-3-->L31-4_primed: Formula: (let ((.cse0 (<= v_main_~m~0_100 12)) (.cse1 (< 11 v_main_~m~0_100)) (.cse2 (= |v_main_#t~post4_231| |v_main_#t~post4_219|)) (.cse3 (= v_main_~j~0_368 v_main_~j~0_355)) (.cse4 (= v_main_~i~0_103 v_main_~i~0_102)) (.cse5 (= |v_main_#t~post3_79| |v_main_#t~post3_78|)) (.cse6 (= |v_main_#t~post5_231| |v_main_#t~post5_219|)) (.cse7 (= v_main_~k~0_348 v_main_~k~0_336))) (or (and .cse0 .cse1 (= (+ v_main_~k~0_336 (* 12 v_main_~i~0_103)) (+ v_main_~k~0_348 (* 12 v_main_~i~0_102))) (< v_main_~i~0_102 (+ v_main_~n~0_36 1)) (= v_main_~j~0_355 12) (< v_main_~i~0_103 v_main_~i~0_102)) (and .cse2 .cse3 (or (not .cse0) (not .cse1) (not (< v_main_~i~0_103 v_main_~n~0_36))) .cse4 .cse5 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse5 .cse6 (= v_main_~m~0_100 v_main_~m~0_100) .cse7 (= v_main_~n~0_36 v_main_~n~0_36)))) InVars {main_~m~0=v_main_~m~0_100, main_~k~0=v_main_~k~0_348, main_~j~0=v_main_~j~0_368, main_~i~0=v_main_~i~0_103, main_#t~post4=|v_main_#t~post4_231|, main_#t~post5=|v_main_#t~post5_231|, main_~n~0=v_main_~n~0_36, main_#t~post3=|v_main_#t~post3_79|} OutVars{main_~m~0=v_main_~m~0_100, main_~k~0=v_main_~k~0_336, main_~j~0=v_main_~j~0_355, main_~i~0=v_main_~i~0_102, main_#t~post4=|v_main_#t~post4_219|, main_#t~post5=|v_main_#t~post5_219|, main_#t~post3=|v_main_#t~post3_78|, main_~n~0=v_main_~n~0_36} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {4518#(or (<= (+ (* main_~i~0 12) 120) (+ (* main_~n~0 12) main_~k~0)) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:22:52,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {4518#(or (<= (+ (* main_~i~0 12) 120) (+ (* main_~n~0 12) main_~k~0)) (<= (+ main_~i~0 10) main_~n~0))} [102] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {4519#(<= 120 main_~k~0)} is VALID [2022-04-28 03:22:52,525 INFO L272 TraceCheckUtils]: 10: Hoare triple {4519#(<= 120 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {4520#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:22:52,525 INFO L290 TraceCheckUtils]: 11: Hoare triple {4520#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4521#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:22:52,526 INFO L290 TraceCheckUtils]: 12: Hoare triple {4521#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4511#false} is VALID [2022-04-28 03:22:52,526 INFO L290 TraceCheckUtils]: 13: Hoare triple {4511#false} assume !false; {4511#false} is VALID [2022-04-28 03:22:52,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:22:52,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:22:52,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619006910] [2022-04-28 03:22:52,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619006910] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:22:52,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:22:52,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:22:54,016 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:22:54,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [576944710] [2022-04-28 03:22:54,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [576944710] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:22:54,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:22:54,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-28 03:22:54,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745236553] [2022-04-28 03:22:54,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:22:54,017 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 34 states have internal predecessors, (36), 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 40 [2022-04-28 03:22:54,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:22:54,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 34 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:54,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:22:54,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-28 03:22:54,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:22:54,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-28 03:22:54,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 03:22:54,055 INFO L87 Difference]: Start difference. First operand 87 states and 102 transitions. Second operand has 36 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 34 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:59,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:59,095 INFO L93 Difference]: Finished difference Result 139 states and 170 transitions. [2022-04-28 03:22:59,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-28 03:22:59,095 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 34 states have internal predecessors, (36), 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 40 [2022-04-28 03:22:59,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:22:59,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 34 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:59,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 83 transitions. [2022-04-28 03:22:59,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 34 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:59,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 83 transitions. [2022-04-28 03:22:59,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 83 transitions. [2022-04-28 03:22:59,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:22:59,184 INFO L225 Difference]: With dead ends: 139 [2022-04-28 03:22:59,184 INFO L226 Difference]: Without dead ends: 134 [2022-04-28 03:22:59,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=297, Invalid=4815, Unknown=0, NotChecked=0, Total=5112 [2022-04-28 03:22:59,185 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 48 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 1937 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:22:59,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 165 Invalid, 1973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1937 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-28 03:22:59,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-28 03:22:59,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 116. [2022-04-28 03:22:59,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:22:59,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 116 states, 111 states have (on average 1.2702702702702702) internal successors, (141), 111 states have internal predecessors, (141), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:59,575 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 116 states, 111 states have (on average 1.2702702702702702) internal successors, (141), 111 states have internal predecessors, (141), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:59,575 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 116 states, 111 states have (on average 1.2702702702702702) internal successors, (141), 111 states have internal predecessors, (141), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:59,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:59,577 INFO L93 Difference]: Finished difference Result 134 states and 165 transitions. [2022-04-28 03:22:59,577 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 165 transitions. [2022-04-28 03:22:59,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:22:59,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:22:59,577 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 111 states have (on average 1.2702702702702702) internal successors, (141), 111 states have internal predecessors, (141), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 134 states. [2022-04-28 03:22:59,578 INFO L87 Difference]: Start difference. First operand has 116 states, 111 states have (on average 1.2702702702702702) internal successors, (141), 111 states have internal predecessors, (141), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 134 states. [2022-04-28 03:22:59,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:22:59,580 INFO L93 Difference]: Finished difference Result 134 states and 165 transitions. [2022-04-28 03:22:59,580 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 165 transitions. [2022-04-28 03:22:59,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:22:59,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:22:59,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:22:59,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:22:59,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 111 states have (on average 1.2702702702702702) internal successors, (141), 111 states have internal predecessors, (141), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:59,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 145 transitions. [2022-04-28 03:22:59,582 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 145 transitions. Word has length 40 [2022-04-28 03:22:59,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:22:59,582 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 145 transitions. [2022-04-28 03:22:59,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 34 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:22:59,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 116 states and 145 transitions. [2022-04-28 03:22:59,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:22:59,851 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 145 transitions. [2022-04-28 03:22:59,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 03:22:59,852 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:22:59,852 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:22:59,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 03:22:59,852 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:22:59,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:22:59,852 INFO L85 PathProgramCache]: Analyzing trace with hash -944477090, now seen corresponding path program 14 times [2022-04-28 03:22:59,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:22:59,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [178785628] [2022-04-28 03:23:00,014 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:23:00,300 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:23:04,415 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:23:04,522 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:23:04,523 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:23:04,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1099574719, now seen corresponding path program 1 times [2022-04-28 03:23:04,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:23:04,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446306403] [2022-04-28 03:23:04,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:23:04,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:23:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:23:04,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:23:04,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:23:04,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {5412#(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); {5399#true} is VALID [2022-04-28 03:23:04,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {5399#true} assume true; {5399#true} is VALID [2022-04-28 03:23:04,661 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5399#true} {5399#true} #71#return; {5399#true} is VALID [2022-04-28 03:23:04,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {5399#true} call ULTIMATE.init(); {5412#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:23:04,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {5412#(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); {5399#true} is VALID [2022-04-28 03:23:04,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {5399#true} assume true; {5399#true} is VALID [2022-04-28 03:23:04,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5399#true} {5399#true} #71#return; {5399#true} is VALID [2022-04-28 03:23:04,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {5399#true} call #t~ret6 := main(); {5399#true} is VALID [2022-04-28 03:23:04,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {5399#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {5404#(= main_~k~0 0)} is VALID [2022-04-28 03:23:04,663 INFO L290 TraceCheckUtils]: 6: Hoare triple {5404#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {5405#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:23:04,663 INFO L290 TraceCheckUtils]: 7: Hoare triple {5405#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {5406#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:23:04,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {5406#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} [105] L31-3-->L31-4_primed: Formula: (let ((.cse1 (= v_main_~j~0_409 v_main_~j~0_396)) (.cse2 (= |v_main_#t~post3_86| |v_main_#t~post3_84|)) (.cse3 (= v_main_~i~0_112 v_main_~i~0_111)) (.cse0 (<= v_main_~m~0_108 0))) (or (and (= v_main_~j~0_396 0) (< v_main_~i~0_112 v_main_~i~0_111) .cse0 (< v_main_~i~0_111 (+ v_main_~n~0_39 1))) (and .cse1 (= v_main_~m~0_108 v_main_~m~0_108) .cse2 .cse3 (= v_main_~n~0_39 v_main_~n~0_39)) (and .cse1 .cse2 .cse3 (or (not .cse0) (not (< v_main_~i~0_112 v_main_~n~0_39)))))) InVars {main_~i~0=v_main_~i~0_112, main_~n~0=v_main_~n~0_39, main_#t~post3=|v_main_#t~post3_86|, main_~m~0=v_main_~m~0_108, main_~j~0=v_main_~j~0_409} OutVars{main_~i~0=v_main_~i~0_111, main_#t~post3=|v_main_#t~post3_84|, main_~n~0=v_main_~n~0_39, main_~m~0=v_main_~m~0_108, main_~j~0=v_main_~j~0_396} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post3] {5407#(and (= main_~k~0 0) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:23:04,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {5407#(and (= main_~k~0 0) (<= (+ main_~i~0 10) main_~n~0))} [106] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5407#(and (= main_~k~0 0) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:23:04,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {5407#(and (= main_~k~0 0) (<= (+ main_~i~0 10) main_~n~0))} [107] L31-3-->L31-4_primed: Formula: (let ((.cse4 (<= v_main_~m~0_109 11)) (.cse3 (< 10 v_main_~m~0_109)) (.cse0 (= v_main_~j~0_412 v_main_~j~0_397)) (.cse1 (= v_main_~k~0_385 v_main_~k~0_374)) (.cse2 (= |v_main_#t~post4_253| |v_main_#t~post4_242|)) (.cse5 (= v_main_~i~0_114 v_main_~i~0_113)) (.cse6 (= |v_main_#t~post5_253| |v_main_#t~post5_242|)) (.cse7 (= |v_main_#t~post3_89| |v_main_#t~post3_85|))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not .cse4) (not (< v_main_~i~0_114 v_main_~n~0_40))) .cse5 .cse6 .cse7) (and (= (+ (* 11 v_main_~i~0_114) v_main_~k~0_374) (+ v_main_~k~0_385 (* 11 v_main_~i~0_113))) (< v_main_~i~0_113 (+ v_main_~n~0_40 1)) (< v_main_~i~0_114 v_main_~i~0_113) .cse4 (= v_main_~j~0_397 11) .cse3) (and (= v_main_~n~0_40 v_main_~n~0_40) .cse0 .cse1 .cse2 .cse5 (= v_main_~m~0_109 v_main_~m~0_109) .cse6 .cse7))) InVars {main_~m~0=v_main_~m~0_109, main_~k~0=v_main_~k~0_385, main_~j~0=v_main_~j~0_412, main_~i~0=v_main_~i~0_114, main_#t~post4=|v_main_#t~post4_253|, main_#t~post5=|v_main_#t~post5_253|, main_~n~0=v_main_~n~0_40, main_#t~post3=|v_main_#t~post3_89|} OutVars{main_~m~0=v_main_~m~0_109, main_~k~0=v_main_~k~0_374, main_~j~0=v_main_~j~0_397, main_~i~0=v_main_~i~0_113, main_#t~post4=|v_main_#t~post4_242|, main_#t~post5=|v_main_#t~post5_242|, main_#t~post3=|v_main_#t~post3_85|, main_~n~0=v_main_~n~0_40} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {5408#(or (<= (+ 110 (* main_~i~0 11)) (+ (* main_~n~0 11) main_~k~0)) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:23:04,666 INFO L290 TraceCheckUtils]: 11: Hoare triple {5408#(or (<= (+ 110 (* main_~i~0 11)) (+ (* main_~n~0 11) main_~k~0)) (<= (+ main_~i~0 10) main_~n~0))} [104] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {5409#(<= 110 main_~k~0)} is VALID [2022-04-28 03:23:04,666 INFO L272 TraceCheckUtils]: 12: Hoare triple {5409#(<= 110 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {5410#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:23:04,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {5410#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5411#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:23:04,667 INFO L290 TraceCheckUtils]: 14: Hoare triple {5411#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5400#false} is VALID [2022-04-28 03:23:04,667 INFO L290 TraceCheckUtils]: 15: Hoare triple {5400#false} assume !false; {5400#false} is VALID [2022-04-28 03:23:04,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:23:04,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:23:04,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446306403] [2022-04-28 03:23:04,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446306403] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:23:04,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664728419] [2022-04-28 03:23:04,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:23:04,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:23:04,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:23:04,668 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 03:23:04,669 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 03:23:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:23:04,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:23:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:23:04,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:23:05,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {5399#true} call ULTIMATE.init(); {5399#true} is VALID [2022-04-28 03:23:05,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {5399#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); {5399#true} is VALID [2022-04-28 03:23:05,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {5399#true} assume true; {5399#true} is VALID [2022-04-28 03:23:05,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5399#true} {5399#true} #71#return; {5399#true} is VALID [2022-04-28 03:23:05,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {5399#true} call #t~ret6 := main(); {5399#true} is VALID [2022-04-28 03:23:05,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {5399#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {5431#(<= 0 main_~k~0)} is VALID [2022-04-28 03:23:05,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {5431#(<= 0 main_~k~0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {5435#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} is VALID [2022-04-28 03:23:05,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {5435#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {5439#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:23:05,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {5439#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [105] L31-3-->L31-4_primed: Formula: (let ((.cse1 (= v_main_~j~0_409 v_main_~j~0_396)) (.cse2 (= |v_main_#t~post3_86| |v_main_#t~post3_84|)) (.cse3 (= v_main_~i~0_112 v_main_~i~0_111)) (.cse0 (<= v_main_~m~0_108 0))) (or (and (= v_main_~j~0_396 0) (< v_main_~i~0_112 v_main_~i~0_111) .cse0 (< v_main_~i~0_111 (+ v_main_~n~0_39 1))) (and .cse1 (= v_main_~m~0_108 v_main_~m~0_108) .cse2 .cse3 (= v_main_~n~0_39 v_main_~n~0_39)) (and .cse1 .cse2 .cse3 (or (not .cse0) (not (< v_main_~i~0_112 v_main_~n~0_39)))))) InVars {main_~i~0=v_main_~i~0_112, main_~n~0=v_main_~n~0_39, main_#t~post3=|v_main_#t~post3_86|, main_~m~0=v_main_~m~0_108, main_~j~0=v_main_~j~0_409} OutVars{main_~i~0=v_main_~i~0_111, main_#t~post3=|v_main_#t~post3_84|, main_~n~0=v_main_~n~0_39, main_~m~0=v_main_~m~0_108, main_~j~0=v_main_~j~0_396} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post3] {5439#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:23:05,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {5439#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [106] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5439#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:23:05,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {5439#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [107] L31-3-->L31-4_primed: Formula: (let ((.cse4 (<= v_main_~m~0_109 11)) (.cse3 (< 10 v_main_~m~0_109)) (.cse0 (= v_main_~j~0_412 v_main_~j~0_397)) (.cse1 (= v_main_~k~0_385 v_main_~k~0_374)) (.cse2 (= |v_main_#t~post4_253| |v_main_#t~post4_242|)) (.cse5 (= v_main_~i~0_114 v_main_~i~0_113)) (.cse6 (= |v_main_#t~post5_253| |v_main_#t~post5_242|)) (.cse7 (= |v_main_#t~post3_89| |v_main_#t~post3_85|))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not .cse4) (not (< v_main_~i~0_114 v_main_~n~0_40))) .cse5 .cse6 .cse7) (and (= (+ (* 11 v_main_~i~0_114) v_main_~k~0_374) (+ v_main_~k~0_385 (* 11 v_main_~i~0_113))) (< v_main_~i~0_113 (+ v_main_~n~0_40 1)) (< v_main_~i~0_114 v_main_~i~0_113) .cse4 (= v_main_~j~0_397 11) .cse3) (and (= v_main_~n~0_40 v_main_~n~0_40) .cse0 .cse1 .cse2 .cse5 (= v_main_~m~0_109 v_main_~m~0_109) .cse6 .cse7))) InVars {main_~m~0=v_main_~m~0_109, main_~k~0=v_main_~k~0_385, main_~j~0=v_main_~j~0_412, main_~i~0=v_main_~i~0_114, main_#t~post4=|v_main_#t~post4_253|, main_#t~post5=|v_main_#t~post5_253|, main_~n~0=v_main_~n~0_40, main_#t~post3=|v_main_#t~post3_89|} OutVars{main_~m~0=v_main_~m~0_109, main_~k~0=v_main_~k~0_374, main_~j~0=v_main_~j~0_397, main_~i~0=v_main_~i~0_113, main_#t~post4=|v_main_#t~post4_242|, main_#t~post5=|v_main_#t~post5_242|, main_#t~post3=|v_main_#t~post3_85|, main_~n~0=v_main_~n~0_40} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {5449#(and (<= 10 main_~n~0) (or (and (< (div main_~k~0 (- 11)) 0) (<= (+ main_~i~0 (div main_~k~0 (- 11))) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:23:05,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {5449#(and (<= 10 main_~n~0) (or (and (< (div main_~k~0 (- 11)) 0) (<= (+ main_~i~0 (div main_~k~0 (- 11))) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [104] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {5409#(<= 110 main_~k~0)} is VALID [2022-04-28 03:23:05,213 INFO L272 TraceCheckUtils]: 12: Hoare triple {5409#(<= 110 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {5456#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:23:05,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {5456#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5460#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:23:05,213 INFO L290 TraceCheckUtils]: 14: Hoare triple {5460#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5400#false} is VALID [2022-04-28 03:23:05,213 INFO L290 TraceCheckUtils]: 15: Hoare triple {5400#false} assume !false; {5400#false} is VALID [2022-04-28 03:23:05,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:23:05,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:23:05,952 INFO L290 TraceCheckUtils]: 15: Hoare triple {5400#false} assume !false; {5400#false} is VALID [2022-04-28 03:23:05,952 INFO L290 TraceCheckUtils]: 14: Hoare triple {5460#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5400#false} is VALID [2022-04-28 03:23:05,952 INFO L290 TraceCheckUtils]: 13: Hoare triple {5456#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5460#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:23:05,953 INFO L272 TraceCheckUtils]: 12: Hoare triple {5476#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {5456#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:23:05,953 INFO L290 TraceCheckUtils]: 11: Hoare triple {5480#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} [104] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {5476#(<= 100 main_~k~0)} is VALID [2022-04-28 03:23:05,954 INFO L290 TraceCheckUtils]: 10: Hoare triple {5484#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 11))) main_~n~0) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 11)) (not (< 10 main_~m~0))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [107] L31-3-->L31-4_primed: Formula: (let ((.cse4 (<= v_main_~m~0_109 11)) (.cse3 (< 10 v_main_~m~0_109)) (.cse0 (= v_main_~j~0_412 v_main_~j~0_397)) (.cse1 (= v_main_~k~0_385 v_main_~k~0_374)) (.cse2 (= |v_main_#t~post4_253| |v_main_#t~post4_242|)) (.cse5 (= v_main_~i~0_114 v_main_~i~0_113)) (.cse6 (= |v_main_#t~post5_253| |v_main_#t~post5_242|)) (.cse7 (= |v_main_#t~post3_89| |v_main_#t~post3_85|))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not .cse4) (not (< v_main_~i~0_114 v_main_~n~0_40))) .cse5 .cse6 .cse7) (and (= (+ (* 11 v_main_~i~0_114) v_main_~k~0_374) (+ v_main_~k~0_385 (* 11 v_main_~i~0_113))) (< v_main_~i~0_113 (+ v_main_~n~0_40 1)) (< v_main_~i~0_114 v_main_~i~0_113) .cse4 (= v_main_~j~0_397 11) .cse3) (and (= v_main_~n~0_40 v_main_~n~0_40) .cse0 .cse1 .cse2 .cse5 (= v_main_~m~0_109 v_main_~m~0_109) .cse6 .cse7))) InVars {main_~m~0=v_main_~m~0_109, main_~k~0=v_main_~k~0_385, main_~j~0=v_main_~j~0_412, main_~i~0=v_main_~i~0_114, main_#t~post4=|v_main_#t~post4_253|, main_#t~post5=|v_main_#t~post5_253|, main_~n~0=v_main_~n~0_40, main_#t~post3=|v_main_#t~post3_89|} OutVars{main_~m~0=v_main_~m~0_109, main_~k~0=v_main_~k~0_374, main_~j~0=v_main_~j~0_397, main_~i~0=v_main_~i~0_113, main_#t~post4=|v_main_#t~post4_242|, main_#t~post5=|v_main_#t~post5_242|, main_#t~post3=|v_main_#t~post3_85|, main_~n~0=v_main_~n~0_40} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {5480#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} is VALID [2022-04-28 03:23:05,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {5484#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 11))) main_~n~0) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 11)) (not (< 10 main_~m~0))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [106] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5484#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 11))) main_~n~0) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 11)) (not (< 10 main_~m~0))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:23:05,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {5491#(and (or (<= 100 main_~k~0) (and (< 0 main_~m~0) (< main_~i~0 main_~n~0))) (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 11))) main_~n~0) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 11)) (not (< 10 main_~m~0))))} [105] L31-3-->L31-4_primed: Formula: (let ((.cse1 (= v_main_~j~0_409 v_main_~j~0_396)) (.cse2 (= |v_main_#t~post3_86| |v_main_#t~post3_84|)) (.cse3 (= v_main_~i~0_112 v_main_~i~0_111)) (.cse0 (<= v_main_~m~0_108 0))) (or (and (= v_main_~j~0_396 0) (< v_main_~i~0_112 v_main_~i~0_111) .cse0 (< v_main_~i~0_111 (+ v_main_~n~0_39 1))) (and .cse1 (= v_main_~m~0_108 v_main_~m~0_108) .cse2 .cse3 (= v_main_~n~0_39 v_main_~n~0_39)) (and .cse1 .cse2 .cse3 (or (not .cse0) (not (< v_main_~i~0_112 v_main_~n~0_39)))))) InVars {main_~i~0=v_main_~i~0_112, main_~n~0=v_main_~n~0_39, main_#t~post3=|v_main_#t~post3_86|, main_~m~0=v_main_~m~0_108, main_~j~0=v_main_~j~0_409} OutVars{main_~i~0=v_main_~i~0_111, main_#t~post3=|v_main_#t~post3_84|, main_~n~0=v_main_~n~0_39, main_~m~0=v_main_~m~0_108, main_~j~0=v_main_~j~0_396} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post3] {5484#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 11))) main_~n~0) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 11)) (not (< 10 main_~m~0))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:23:05,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {5495#(and (or (<= (div (+ (- 100) main_~k~0) (- 11)) 1) (<= (div (+ (- 100) main_~k~0) (- 11)) main_~n~0)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {5491#(and (or (<= 100 main_~k~0) (and (< 0 main_~m~0) (< main_~i~0 main_~n~0))) (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 11))) main_~n~0) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 11)) (not (< 10 main_~m~0))))} is VALID [2022-04-28 03:23:05,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {5499#(<= (div (+ (- 100) main_~k~0) (- 11)) 10)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {5495#(and (or (<= (div (+ (- 100) main_~k~0) (- 11)) 1) (<= (div (+ (- 100) main_~k~0) (- 11)) main_~n~0)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} is VALID [2022-04-28 03:23:05,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {5399#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {5499#(<= (div (+ (- 100) main_~k~0) (- 11)) 10)} is VALID [2022-04-28 03:23:05,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {5399#true} call #t~ret6 := main(); {5399#true} is VALID [2022-04-28 03:23:05,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5399#true} {5399#true} #71#return; {5399#true} is VALID [2022-04-28 03:23:05,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {5399#true} assume true; {5399#true} is VALID [2022-04-28 03:23:05,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {5399#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); {5399#true} is VALID [2022-04-28 03:23:05,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {5399#true} call ULTIMATE.init(); {5399#true} is VALID [2022-04-28 03:23:05,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:23:05,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664728419] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:23:05,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:23:05,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 23 [2022-04-28 03:23:06,806 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:23:06,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [178785628] [2022-04-28 03:23:06,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [178785628] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:23:06,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:23:06,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-28 03:23:06,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446914655] [2022-04-28 03:23:06,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:23:06,807 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 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 41 [2022-04-28 03:23:06,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:23:06,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:06,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:23:06,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-28 03:23:06,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:23:06,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-28 03:23:06,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=1929, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 03:23:06,836 INFO L87 Difference]: Start difference. First operand 116 states and 145 transitions. Second operand has 35 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:09,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:23:09,262 INFO L93 Difference]: Finished difference Result 129 states and 160 transitions. [2022-04-28 03:23:09,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 03:23:09,263 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 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 41 [2022-04-28 03:23:09,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:23:09,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:09,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 59 transitions. [2022-04-28 03:23:09,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:09,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 59 transitions. [2022-04-28 03:23:09,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 59 transitions. [2022-04-28 03:23:09,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:23:09,317 INFO L225 Difference]: With dead ends: 129 [2022-04-28 03:23:09,318 INFO L226 Difference]: Without dead ends: 120 [2022-04-28 03:23:09,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=829, Invalid=5177, Unknown=0, NotChecked=0, Total=6006 [2022-04-28 03:23:09,319 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:23:09,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 160 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1105 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 03:23:09,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-28 03:23:09,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2022-04-28 03:23:09,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:23:09,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 119 states, 114 states have (on average 1.263157894736842) internal successors, (144), 114 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:09,699 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 119 states, 114 states have (on average 1.263157894736842) internal successors, (144), 114 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:09,699 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 119 states, 114 states have (on average 1.263157894736842) internal successors, (144), 114 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:09,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:23:09,701 INFO L93 Difference]: Finished difference Result 120 states and 149 transitions. [2022-04-28 03:23:09,701 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 149 transitions. [2022-04-28 03:23:09,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:23:09,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:23:09,701 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 114 states have (on average 1.263157894736842) internal successors, (144), 114 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 120 states. [2022-04-28 03:23:09,702 INFO L87 Difference]: Start difference. First operand has 119 states, 114 states have (on average 1.263157894736842) internal successors, (144), 114 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 120 states. [2022-04-28 03:23:09,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:23:09,703 INFO L93 Difference]: Finished difference Result 120 states and 149 transitions. [2022-04-28 03:23:09,703 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 149 transitions. [2022-04-28 03:23:09,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:23:09,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:23:09,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:23:09,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:23:09,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.263157894736842) internal successors, (144), 114 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:09,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 148 transitions. [2022-04-28 03:23:09,705 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 148 transitions. Word has length 41 [2022-04-28 03:23:09,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:23:09,705 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 148 transitions. [2022-04-28 03:23:09,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:09,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 148 transitions. [2022-04-28 03:23:09,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:23:09,981 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 148 transitions. [2022-04-28 03:23:09,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 03:23:09,982 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:23:09,982 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:23:09,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 03:23:10,182 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,SelfDestructingSolverStorable15 [2022-04-28 03:23:10,183 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:23:10,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:23:10,183 INFO L85 PathProgramCache]: Analyzing trace with hash 991951871, now seen corresponding path program 15 times [2022-04-28 03:23:10,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:23:10,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [11132596] [2022-04-28 03:23:10,345 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:23:12,320 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:23:12,460 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:23:12,461 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:23:12,463 INFO L85 PathProgramCache]: Analyzing trace with hash 225743906, now seen corresponding path program 1 times [2022-04-28 03:23:12,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:23:12,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858413283] [2022-04-28 03:23:12,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:23:12,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:23:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:23:12,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:23:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:23:12,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {6352#(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); {6340#true} is VALID [2022-04-28 03:23:12,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {6340#true} assume true; {6340#true} is VALID [2022-04-28 03:23:12,550 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6340#true} {6340#true} #71#return; {6340#true} is VALID [2022-04-28 03:23:12,551 INFO L272 TraceCheckUtils]: 0: Hoare triple {6340#true} call ULTIMATE.init(); {6352#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:23:12,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {6352#(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); {6340#true} is VALID [2022-04-28 03:23:12,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {6340#true} assume true; {6340#true} is VALID [2022-04-28 03:23:12,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6340#true} {6340#true} #71#return; {6340#true} is VALID [2022-04-28 03:23:12,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {6340#true} call #t~ret6 := main(); {6340#true} is VALID [2022-04-28 03:23:12,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {6340#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {6345#(= main_~k~0 0)} is VALID [2022-04-28 03:23:12,553 INFO L290 TraceCheckUtils]: 6: Hoare triple {6345#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {6346#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:23:12,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {6346#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {6347#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:23:12,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {6347#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [109] L31-3-->L31-4_primed: Formula: (let ((.cse1 (< 12 v_main_~m~0_118)) (.cse0 (<= v_main_~m~0_118 13)) (.cse2 (= v_main_~k~0_426 v_main_~k~0_413)) (.cse3 (= |v_main_#t~post4_279| |v_main_#t~post4_266|)) (.cse4 (= |v_main_#t~post5_279| |v_main_#t~post5_266|)) (.cse5 (= v_main_~i~0_131 v_main_~i~0_130)) (.cse6 (= |v_main_#t~post3_99| |v_main_#t~post3_98|))) (or (and .cse0 (= (+ (* 13 v_main_~i~0_130) v_main_~k~0_426) (+ v_main_~k~0_413 (* 13 v_main_~i~0_131))) (= v_main_~j~0_443 13) (< v_main_~i~0_131 v_main_~i~0_130) (< v_main_~i~0_130 (+ v_main_~n~0_44 1)) .cse1) (and .cse2 .cse3 (= v_main_~m~0_118 v_main_~m~0_118) .cse4 (= v_main_~n~0_44 v_main_~n~0_44) .cse5 (= v_main_~j~0_457 v_main_~j~0_443) .cse6) (and (or (not .cse1) (not .cse0) (not (< v_main_~i~0_131 v_main_~n~0_44))) .cse2 .cse3 .cse4 .cse5 (= v_main_~j~0_443 v_main_~j~0_457) .cse6))) InVars {main_~m~0=v_main_~m~0_118, main_~k~0=v_main_~k~0_426, main_~j~0=v_main_~j~0_457, main_~i~0=v_main_~i~0_131, main_#t~post4=|v_main_#t~post4_279|, main_#t~post5=|v_main_#t~post5_279|, main_~n~0=v_main_~n~0_44, main_#t~post3=|v_main_#t~post3_99|} OutVars{main_~m~0=v_main_~m~0_118, main_~k~0=v_main_~k~0_413, main_~j~0=v_main_~j~0_443, main_~i~0=v_main_~i~0_130, main_#t~post4=|v_main_#t~post4_266|, main_#t~post5=|v_main_#t~post5_266|, main_#t~post3=|v_main_#t~post3_98|, main_~n~0=v_main_~n~0_44} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {6348#(or (<= (+ (* main_~i~0 13) 130) (+ (* main_~n~0 13) main_~k~0)) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:23:12,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {6348#(or (<= (+ (* main_~i~0 13) 130) (+ (* main_~n~0 13) main_~k~0)) (<= (+ main_~i~0 10) main_~n~0))} [108] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {6349#(<= 130 main_~k~0)} is VALID [2022-04-28 03:23:12,556 INFO L272 TraceCheckUtils]: 10: Hoare triple {6349#(<= 130 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {6350#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:23:12,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {6350#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {6351#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:23:12,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {6351#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6341#false} is VALID [2022-04-28 03:23:12,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {6341#false} assume !false; {6341#false} is VALID [2022-04-28 03:23:12,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:23:12,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:23:12,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858413283] [2022-04-28 03:23:12,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858413283] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:23:12,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:23:12,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:23:14,127 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:23:14,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [11132596] [2022-04-28 03:23:14,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [11132596] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:23:14,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:23:14,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-28 03:23:14,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635152456] [2022-04-28 03:23:14,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:23:14,128 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.027027027027027) internal successors, (38), 36 states have internal predecessors, (38), 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 42 [2022-04-28 03:23:14,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:23:14,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 37 states have (on average 1.027027027027027) internal successors, (38), 36 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:14,164 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 03:23:14,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-28 03:23:14,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:23:14,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-28 03:23:14,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 03:23:14,165 INFO L87 Difference]: Start difference. First operand 119 states and 148 transitions. Second operand has 38 states, 37 states have (on average 1.027027027027027) internal successors, (38), 36 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:20,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:23:20,241 INFO L93 Difference]: Finished difference Result 174 states and 220 transitions. [2022-04-28 03:23:20,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-28 03:23:20,242 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.027027027027027) internal successors, (38), 36 states have internal predecessors, (38), 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 42 [2022-04-28 03:23:20,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:23:20,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.027027027027027) internal successors, (38), 36 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:20,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 87 transitions. [2022-04-28 03:23:20,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.027027027027027) internal successors, (38), 36 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:20,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 87 transitions. [2022-04-28 03:23:20,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 87 transitions. [2022-04-28 03:23:20,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:23:20,328 INFO L225 Difference]: With dead ends: 174 [2022-04-28 03:23:20,328 INFO L226 Difference]: Without dead ends: 169 [2022-04-28 03:23:20,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=313, Invalid=5387, Unknown=0, NotChecked=0, Total=5700 [2022-04-28 03:23:20,329 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 43 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 2385 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 2420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:23:20,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 190 Invalid, 2420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2385 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 03:23:20,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-04-28 03:23:20,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 150. [2022-04-28 03:23:20,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:23:20,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand has 150 states, 145 states have (on average 1.3103448275862069) internal successors, (190), 145 states have internal predecessors, (190), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:20,840 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand has 150 states, 145 states have (on average 1.3103448275862069) internal successors, (190), 145 states have internal predecessors, (190), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:20,840 INFO L87 Difference]: Start difference. First operand 169 states. Second operand has 150 states, 145 states have (on average 1.3103448275862069) internal successors, (190), 145 states have internal predecessors, (190), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:20,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:23:20,842 INFO L93 Difference]: Finished difference Result 169 states and 215 transitions. [2022-04-28 03:23:20,842 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 215 transitions. [2022-04-28 03:23:20,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:23:20,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:23:20,842 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 145 states have (on average 1.3103448275862069) internal successors, (190), 145 states have internal predecessors, (190), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 169 states. [2022-04-28 03:23:20,843 INFO L87 Difference]: Start difference. First operand has 150 states, 145 states have (on average 1.3103448275862069) internal successors, (190), 145 states have internal predecessors, (190), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 169 states. [2022-04-28 03:23:20,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:23:20,845 INFO L93 Difference]: Finished difference Result 169 states and 215 transitions. [2022-04-28 03:23:20,845 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 215 transitions. [2022-04-28 03:23:20,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:23:20,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:23:20,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:23:20,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:23:20,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.3103448275862069) internal successors, (190), 145 states have internal predecessors, (190), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:20,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 194 transitions. [2022-04-28 03:23:20,847 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 194 transitions. Word has length 42 [2022-04-28 03:23:20,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:23:20,847 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 194 transitions. [2022-04-28 03:23:20,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.027027027027027) internal successors, (38), 36 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:20,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 194 transitions. [2022-04-28 03:23:21,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:23:21,299 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 194 transitions. [2022-04-28 03:23:21,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 03:23:21,300 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:23:21,300 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:23:21,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 03:23:21,300 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:23:21,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:23:21,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1279631172, now seen corresponding path program 16 times [2022-04-28 03:23:21,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:23:21,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1450521829] [2022-04-28 03:23:21,482 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:23:21,760 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:23:22,037 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:23:22,278 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:23:22,280 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:23:22,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1974723521, now seen corresponding path program 1 times [2022-04-28 03:23:22,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:23:22,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448856110] [2022-04-28 03:23:22,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:23:22,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:23:22,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:23:22,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:23:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:23:22,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {7456#(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); {7443#true} is VALID [2022-04-28 03:23:22,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {7443#true} assume true; {7443#true} is VALID [2022-04-28 03:23:22,425 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7443#true} {7443#true} #71#return; {7443#true} is VALID [2022-04-28 03:23:22,426 INFO L272 TraceCheckUtils]: 0: Hoare triple {7443#true} call ULTIMATE.init(); {7456#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:23:22,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {7456#(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); {7443#true} is VALID [2022-04-28 03:23:22,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {7443#true} assume true; {7443#true} is VALID [2022-04-28 03:23:22,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7443#true} {7443#true} #71#return; {7443#true} is VALID [2022-04-28 03:23:22,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {7443#true} call #t~ret6 := main(); {7443#true} is VALID [2022-04-28 03:23:22,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {7443#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {7448#(= main_~k~0 0)} is VALID [2022-04-28 03:23:22,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {7448#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {7449#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:23:22,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {7449#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {7450#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:23:22,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {7450#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} [111] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_147 v_main_~i~0_146)) (.cse1 (= v_main_~j~0_508 v_main_~j~0_494)) (.cse2 (= |v_main_#t~post3_112| |v_main_#t~post3_110|)) (.cse3 (= |v_main_#t~post5_303| |v_main_#t~post5_291|)) (.cse4 (= v_main_~k~0_456 v_main_~k~0_455)) (.cse5 (< 0 v_main_~m~0_130)) (.cse6 (< 1 v_main_~m~0_130))) (or (and .cse0 (= |v_main_#t~post4_303| |v_main_#t~post4_291|) .cse1 .cse2 .cse3 .cse4 (= v_main_~n~0_51 v_main_~n~0_51) (= v_main_~m~0_130 v_main_~m~0_130)) (and .cse0 (or (not .cse5) (not (< v_main_~i~0_147 v_main_~n~0_51)) .cse6) (= |v_main_#t~post4_291| |v_main_#t~post4_303|) .cse1 .cse2 .cse3 .cse4) (let ((.cse7 (+ v_main_~k~0_455 v_main_~i~0_147))) (and (= (+ v_main_~k~0_456 v_main_~i~0_146) .cse7) (< v_main_~k~0_456 v_main_~k~0_455) (= v_main_~j~0_494 1) .cse5 (not .cse6) (< .cse7 (+ v_main_~n~0_51 v_main_~k~0_456 1)))))) InVars {main_~m~0=v_main_~m~0_130, main_~k~0=v_main_~k~0_456, main_~j~0=v_main_~j~0_508, main_~i~0=v_main_~i~0_147, main_#t~post4=|v_main_#t~post4_303|, main_#t~post5=|v_main_#t~post5_303|, main_~n~0=v_main_~n~0_51, main_#t~post3=|v_main_#t~post3_112|} OutVars{main_~m~0=v_main_~m~0_130, main_~k~0=v_main_~k~0_455, main_~j~0=v_main_~j~0_494, main_~i~0=v_main_~i~0_146, main_#t~post4=|v_main_#t~post4_291|, main_#t~post5=|v_main_#t~post5_291|, main_#t~post3=|v_main_#t~post3_110|, main_~n~0=v_main_~n~0_51} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {7451#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:23:22,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {7451#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [112] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7451#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:23:22,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {7451#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [113] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= v_main_~j~0_511 v_main_~j~0_496)) (.cse1 (= |v_main_#t~post3_115| |v_main_#t~post3_111|)) (.cse2 (= v_main_~k~0_468 v_main_~k~0_457)) (.cse3 (= |v_main_#t~post5_306| |v_main_#t~post5_292|)) (.cse4 (= v_main_~i~0_149 v_main_~i~0_148)) (.cse5 (<= v_main_~m~0_131 11)) (.cse6 (< 10 v_main_~m~0_131))) (or (and (= v_main_~n~0_52 v_main_~n~0_52) .cse0 .cse1 .cse2 .cse3 (= v_main_~m~0_131 v_main_~m~0_131) (= |v_main_#t~post4_306| |v_main_#t~post4_292|) .cse4) (and .cse0 (or (not (< v_main_~i~0_149 v_main_~n~0_52)) (not .cse5) (not .cse6)) .cse1 (= |v_main_#t~post4_292| |v_main_#t~post4_306|) .cse2 .cse3 .cse4) (and (= v_main_~j~0_496 11) .cse5 .cse6 (= (+ (* 11 v_main_~i~0_148) v_main_~k~0_468) (+ v_main_~k~0_457 (* 11 v_main_~i~0_149))) (< v_main_~i~0_148 (+ v_main_~n~0_52 1)) (< v_main_~i~0_149 v_main_~i~0_148)))) InVars {main_~m~0=v_main_~m~0_131, main_~k~0=v_main_~k~0_468, main_~j~0=v_main_~j~0_511, main_~i~0=v_main_~i~0_149, main_#t~post4=|v_main_#t~post4_306|, main_#t~post5=|v_main_#t~post5_306|, main_~n~0=v_main_~n~0_52, main_#t~post3=|v_main_#t~post3_115|} OutVars{main_~m~0=v_main_~m~0_131, main_~k~0=v_main_~k~0_457, main_~j~0=v_main_~j~0_496, main_~i~0=v_main_~i~0_148, main_#t~post4=|v_main_#t~post4_292|, main_#t~post5=|v_main_#t~post5_292|, main_#t~post3=|v_main_#t~post3_111|, main_~n~0=v_main_~n~0_52} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {7452#(or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ 110 (* main_~i~0 11)) (+ (* main_~n~0 11) main_~k~0)))} is VALID [2022-04-28 03:23:22,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {7452#(or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ 110 (* main_~i~0 11)) (+ (* main_~n~0 11) main_~k~0)))} [110] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {7453#(<= 110 main_~k~0)} is VALID [2022-04-28 03:23:22,430 INFO L272 TraceCheckUtils]: 12: Hoare triple {7453#(<= 110 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {7454#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:23:22,431 INFO L290 TraceCheckUtils]: 13: Hoare triple {7454#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {7455#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:23:22,431 INFO L290 TraceCheckUtils]: 14: Hoare triple {7455#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {7444#false} is VALID [2022-04-28 03:23:22,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {7444#false} assume !false; {7444#false} is VALID [2022-04-28 03:23:22,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:23:22,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:23:22,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448856110] [2022-04-28 03:23:22,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448856110] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:23:22,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667854725] [2022-04-28 03:23:22,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:23:22,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:23:22,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:23:22,437 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 03:23:22,437 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 03:23:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:23:22,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:23:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:23:22,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:23:22,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {7443#true} call ULTIMATE.init(); {7443#true} is VALID [2022-04-28 03:23:22,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {7443#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); {7443#true} is VALID [2022-04-28 03:23:22,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {7443#true} assume true; {7443#true} is VALID [2022-04-28 03:23:22,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7443#true} {7443#true} #71#return; {7443#true} is VALID [2022-04-28 03:23:22,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {7443#true} call #t~ret6 := main(); {7443#true} is VALID [2022-04-28 03:23:22,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {7443#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {7475#(<= 0 main_~k~0)} is VALID [2022-04-28 03:23:22,973 INFO L290 TraceCheckUtils]: 6: Hoare triple {7475#(<= 0 main_~k~0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {7479#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} is VALID [2022-04-28 03:23:22,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {7479#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {7483#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:23:22,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {7483#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [111] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_147 v_main_~i~0_146)) (.cse1 (= v_main_~j~0_508 v_main_~j~0_494)) (.cse2 (= |v_main_#t~post3_112| |v_main_#t~post3_110|)) (.cse3 (= |v_main_#t~post5_303| |v_main_#t~post5_291|)) (.cse4 (= v_main_~k~0_456 v_main_~k~0_455)) (.cse5 (< 0 v_main_~m~0_130)) (.cse6 (< 1 v_main_~m~0_130))) (or (and .cse0 (= |v_main_#t~post4_303| |v_main_#t~post4_291|) .cse1 .cse2 .cse3 .cse4 (= v_main_~n~0_51 v_main_~n~0_51) (= v_main_~m~0_130 v_main_~m~0_130)) (and .cse0 (or (not .cse5) (not (< v_main_~i~0_147 v_main_~n~0_51)) .cse6) (= |v_main_#t~post4_291| |v_main_#t~post4_303|) .cse1 .cse2 .cse3 .cse4) (let ((.cse7 (+ v_main_~k~0_455 v_main_~i~0_147))) (and (= (+ v_main_~k~0_456 v_main_~i~0_146) .cse7) (< v_main_~k~0_456 v_main_~k~0_455) (= v_main_~j~0_494 1) .cse5 (not .cse6) (< .cse7 (+ v_main_~n~0_51 v_main_~k~0_456 1)))))) InVars {main_~m~0=v_main_~m~0_130, main_~k~0=v_main_~k~0_456, main_~j~0=v_main_~j~0_508, main_~i~0=v_main_~i~0_147, main_#t~post4=|v_main_#t~post4_303|, main_#t~post5=|v_main_#t~post5_303|, main_~n~0=v_main_~n~0_51, main_#t~post3=|v_main_#t~post3_112|} OutVars{main_~m~0=v_main_~m~0_130, main_~k~0=v_main_~k~0_455, main_~j~0=v_main_~j~0_494, main_~i~0=v_main_~i~0_146, main_#t~post4=|v_main_#t~post4_291|, main_#t~post5=|v_main_#t~post5_291|, main_#t~post3=|v_main_#t~post3_110|, main_~n~0=v_main_~n~0_51} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {7483#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:23:22,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {7483#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [112] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7483#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:23:22,979 INFO L290 TraceCheckUtils]: 10: Hoare triple {7483#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [113] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= v_main_~j~0_511 v_main_~j~0_496)) (.cse1 (= |v_main_#t~post3_115| |v_main_#t~post3_111|)) (.cse2 (= v_main_~k~0_468 v_main_~k~0_457)) (.cse3 (= |v_main_#t~post5_306| |v_main_#t~post5_292|)) (.cse4 (= v_main_~i~0_149 v_main_~i~0_148)) (.cse5 (<= v_main_~m~0_131 11)) (.cse6 (< 10 v_main_~m~0_131))) (or (and (= v_main_~n~0_52 v_main_~n~0_52) .cse0 .cse1 .cse2 .cse3 (= v_main_~m~0_131 v_main_~m~0_131) (= |v_main_#t~post4_306| |v_main_#t~post4_292|) .cse4) (and .cse0 (or (not (< v_main_~i~0_149 v_main_~n~0_52)) (not .cse5) (not .cse6)) .cse1 (= |v_main_#t~post4_292| |v_main_#t~post4_306|) .cse2 .cse3 .cse4) (and (= v_main_~j~0_496 11) .cse5 .cse6 (= (+ (* 11 v_main_~i~0_148) v_main_~k~0_468) (+ v_main_~k~0_457 (* 11 v_main_~i~0_149))) (< v_main_~i~0_148 (+ v_main_~n~0_52 1)) (< v_main_~i~0_149 v_main_~i~0_148)))) InVars {main_~m~0=v_main_~m~0_131, main_~k~0=v_main_~k~0_468, main_~j~0=v_main_~j~0_511, main_~i~0=v_main_~i~0_149, main_#t~post4=|v_main_#t~post4_306|, main_#t~post5=|v_main_#t~post5_306|, main_~n~0=v_main_~n~0_52, main_#t~post3=|v_main_#t~post3_115|} OutVars{main_~m~0=v_main_~m~0_131, main_~k~0=v_main_~k~0_457, main_~j~0=v_main_~j~0_496, main_~i~0=v_main_~i~0_148, main_#t~post4=|v_main_#t~post4_292|, main_#t~post5=|v_main_#t~post5_292|, main_#t~post3=|v_main_#t~post3_111|, main_~n~0=v_main_~n~0_52} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {7493#(and (<= 10 main_~n~0) (or (and (< (div main_~k~0 (- 11)) 0) (<= (+ main_~i~0 (div main_~k~0 (- 11))) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:23:22,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {7493#(and (<= 10 main_~n~0) (or (and (< (div main_~k~0 (- 11)) 0) (<= (+ main_~i~0 (div main_~k~0 (- 11))) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [110] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {7453#(<= 110 main_~k~0)} is VALID [2022-04-28 03:23:22,980 INFO L272 TraceCheckUtils]: 12: Hoare triple {7453#(<= 110 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {7500#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:23:22,980 INFO L290 TraceCheckUtils]: 13: Hoare triple {7500#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7504#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:23:22,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {7504#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7444#false} is VALID [2022-04-28 03:23:22,981 INFO L290 TraceCheckUtils]: 15: Hoare triple {7444#false} assume !false; {7444#false} is VALID [2022-04-28 03:23:22,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:23:22,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:23:23,828 INFO L290 TraceCheckUtils]: 15: Hoare triple {7444#false} assume !false; {7444#false} is VALID [2022-04-28 03:23:23,828 INFO L290 TraceCheckUtils]: 14: Hoare triple {7504#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7444#false} is VALID [2022-04-28 03:23:23,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {7500#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7504#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:23:23,829 INFO L272 TraceCheckUtils]: 12: Hoare triple {7520#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {7500#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:23:23,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {7524#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} [110] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {7520#(<= 100 main_~k~0)} is VALID [2022-04-28 03:23:23,830 INFO L290 TraceCheckUtils]: 10: Hoare triple {7528#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 11))) main_~n~0) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 11)) (not (< 10 main_~m~0))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [113] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= v_main_~j~0_511 v_main_~j~0_496)) (.cse1 (= |v_main_#t~post3_115| |v_main_#t~post3_111|)) (.cse2 (= v_main_~k~0_468 v_main_~k~0_457)) (.cse3 (= |v_main_#t~post5_306| |v_main_#t~post5_292|)) (.cse4 (= v_main_~i~0_149 v_main_~i~0_148)) (.cse5 (<= v_main_~m~0_131 11)) (.cse6 (< 10 v_main_~m~0_131))) (or (and (= v_main_~n~0_52 v_main_~n~0_52) .cse0 .cse1 .cse2 .cse3 (= v_main_~m~0_131 v_main_~m~0_131) (= |v_main_#t~post4_306| |v_main_#t~post4_292|) .cse4) (and .cse0 (or (not (< v_main_~i~0_149 v_main_~n~0_52)) (not .cse5) (not .cse6)) .cse1 (= |v_main_#t~post4_292| |v_main_#t~post4_306|) .cse2 .cse3 .cse4) (and (= v_main_~j~0_496 11) .cse5 .cse6 (= (+ (* 11 v_main_~i~0_148) v_main_~k~0_468) (+ v_main_~k~0_457 (* 11 v_main_~i~0_149))) (< v_main_~i~0_148 (+ v_main_~n~0_52 1)) (< v_main_~i~0_149 v_main_~i~0_148)))) InVars {main_~m~0=v_main_~m~0_131, main_~k~0=v_main_~k~0_468, main_~j~0=v_main_~j~0_511, main_~i~0=v_main_~i~0_149, main_#t~post4=|v_main_#t~post4_306|, main_#t~post5=|v_main_#t~post5_306|, main_~n~0=v_main_~n~0_52, main_#t~post3=|v_main_#t~post3_115|} OutVars{main_~m~0=v_main_~m~0_131, main_~k~0=v_main_~k~0_457, main_~j~0=v_main_~j~0_496, main_~i~0=v_main_~i~0_148, main_#t~post4=|v_main_#t~post4_292|, main_#t~post5=|v_main_#t~post5_292|, main_#t~post3=|v_main_#t~post3_111|, main_~n~0=v_main_~n~0_52} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {7524#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} is VALID [2022-04-28 03:23:23,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {7528#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 11))) main_~n~0) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 11)) (not (< 10 main_~m~0))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [112] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7528#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 11))) main_~n~0) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 11)) (not (< 10 main_~m~0))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:23:23,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {7535#(and (or (< 1 main_~m~0) (not (< 0 main_~m~0)) (<= (+ main_~i~0 100) (+ main_~n~0 main_~k~0)) (<= 99 main_~k~0)) (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 11))) main_~n~0) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 11)) (not (< 10 main_~m~0))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [111] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_147 v_main_~i~0_146)) (.cse1 (= v_main_~j~0_508 v_main_~j~0_494)) (.cse2 (= |v_main_#t~post3_112| |v_main_#t~post3_110|)) (.cse3 (= |v_main_#t~post5_303| |v_main_#t~post5_291|)) (.cse4 (= v_main_~k~0_456 v_main_~k~0_455)) (.cse5 (< 0 v_main_~m~0_130)) (.cse6 (< 1 v_main_~m~0_130))) (or (and .cse0 (= |v_main_#t~post4_303| |v_main_#t~post4_291|) .cse1 .cse2 .cse3 .cse4 (= v_main_~n~0_51 v_main_~n~0_51) (= v_main_~m~0_130 v_main_~m~0_130)) (and .cse0 (or (not .cse5) (not (< v_main_~i~0_147 v_main_~n~0_51)) .cse6) (= |v_main_#t~post4_291| |v_main_#t~post4_303|) .cse1 .cse2 .cse3 .cse4) (let ((.cse7 (+ v_main_~k~0_455 v_main_~i~0_147))) (and (= (+ v_main_~k~0_456 v_main_~i~0_146) .cse7) (< v_main_~k~0_456 v_main_~k~0_455) (= v_main_~j~0_494 1) .cse5 (not .cse6) (< .cse7 (+ v_main_~n~0_51 v_main_~k~0_456 1)))))) InVars {main_~m~0=v_main_~m~0_130, main_~k~0=v_main_~k~0_456, main_~j~0=v_main_~j~0_508, main_~i~0=v_main_~i~0_147, main_#t~post4=|v_main_#t~post4_303|, main_#t~post5=|v_main_#t~post5_303|, main_~n~0=v_main_~n~0_51, main_#t~post3=|v_main_#t~post3_112|} OutVars{main_~m~0=v_main_~m~0_130, main_~k~0=v_main_~k~0_455, main_~j~0=v_main_~j~0_494, main_~i~0=v_main_~i~0_146, main_#t~post4=|v_main_#t~post4_291|, main_#t~post5=|v_main_#t~post5_291|, main_#t~post3=|v_main_#t~post3_110|, main_~n~0=v_main_~n~0_51} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {7528#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 11))) main_~n~0) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 11)) (not (< 10 main_~m~0))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:23:23,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {7539#(and (or (<= (div (+ (- 100) main_~k~0) (- 11)) 1) (<= (div (+ (- 100) main_~k~0) (- 11)) main_~n~0)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {7535#(and (or (< 1 main_~m~0) (not (< 0 main_~m~0)) (<= (+ main_~i~0 100) (+ main_~n~0 main_~k~0)) (<= 99 main_~k~0)) (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 11))) main_~n~0) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 11)) (not (< 10 main_~m~0))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:23:23,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {7543#(<= (div (+ (- 100) main_~k~0) (- 11)) 10)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {7539#(and (or (<= (div (+ (- 100) main_~k~0) (- 11)) 1) (<= (div (+ (- 100) main_~k~0) (- 11)) main_~n~0)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} is VALID [2022-04-28 03:23:23,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {7443#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {7543#(<= (div (+ (- 100) main_~k~0) (- 11)) 10)} is VALID [2022-04-28 03:23:23,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {7443#true} call #t~ret6 := main(); {7443#true} is VALID [2022-04-28 03:23:23,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7443#true} {7443#true} #71#return; {7443#true} is VALID [2022-04-28 03:23:23,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {7443#true} assume true; {7443#true} is VALID [2022-04-28 03:23:23,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {7443#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); {7443#true} is VALID [2022-04-28 03:23:23,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {7443#true} call ULTIMATE.init(); {7443#true} is VALID [2022-04-28 03:23:23,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:23:23,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667854725] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:23:23,837 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:23:23,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 23 [2022-04-28 03:23:24,833 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:23:24,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1450521829] [2022-04-28 03:23:24,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1450521829] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:23:24,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:23:24,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-28 03:23:24,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830016451] [2022-04-28 03:23:24,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:23:24,834 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 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 43 [2022-04-28 03:23:24,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:23:24,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:24,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:23:24,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-28 03:23:24,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:23:24,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-28 03:23:24,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=449, Invalid=2101, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 03:23:24,866 INFO L87 Difference]: Start difference. First operand 150 states and 194 transitions. Second operand has 37 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:27,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:23:27,643 INFO L93 Difference]: Finished difference Result 162 states and 208 transitions. [2022-04-28 03:23:27,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 03:23:27,643 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 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 43 [2022-04-28 03:23:27,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:23:27,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:27,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 61 transitions. [2022-04-28 03:23:27,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:27,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 61 transitions. [2022-04-28 03:23:27,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 61 transitions. [2022-04-28 03:23:27,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:23:27,687 INFO L225 Difference]: With dead ends: 162 [2022-04-28 03:23:27,687 INFO L226 Difference]: Without dead ends: 153 [2022-04-28 03:23:27,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1766 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=881, Invalid=5761, Unknown=0, NotChecked=0, Total=6642 [2022-04-28 03:23:27,689 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:23:27,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 170 Invalid, 1271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 03:23:27,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-04-28 03:23:28,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2022-04-28 03:23:28,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:23:28,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand has 152 states, 147 states have (on average 1.3061224489795917) internal successors, (192), 147 states have internal predecessors, (192), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:28,231 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand has 152 states, 147 states have (on average 1.3061224489795917) internal successors, (192), 147 states have internal predecessors, (192), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:28,231 INFO L87 Difference]: Start difference. First operand 153 states. Second operand has 152 states, 147 states have (on average 1.3061224489795917) internal successors, (192), 147 states have internal predecessors, (192), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:28,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:23:28,233 INFO L93 Difference]: Finished difference Result 153 states and 197 transitions. [2022-04-28 03:23:28,233 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 197 transitions. [2022-04-28 03:23:28,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:23:28,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:23:28,234 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 147 states have (on average 1.3061224489795917) internal successors, (192), 147 states have internal predecessors, (192), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 153 states. [2022-04-28 03:23:28,234 INFO L87 Difference]: Start difference. First operand has 152 states, 147 states have (on average 1.3061224489795917) internal successors, (192), 147 states have internal predecessors, (192), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 153 states. [2022-04-28 03:23:28,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:23:28,236 INFO L93 Difference]: Finished difference Result 153 states and 197 transitions. [2022-04-28 03:23:28,237 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 197 transitions. [2022-04-28 03:23:28,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:23:28,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:23:28,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:23:28,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:23:28,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 147 states have (on average 1.3061224489795917) internal successors, (192), 147 states have internal predecessors, (192), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:28,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 196 transitions. [2022-04-28 03:23:28,240 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 196 transitions. Word has length 43 [2022-04-28 03:23:28,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:23:28,240 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 196 transitions. [2022-04-28 03:23:28,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:28,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 152 states and 196 transitions. [2022-04-28 03:23:28,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:23:28,651 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 196 transitions. [2022-04-28 03:23:28,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 03:23:28,652 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:23:28,652 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:23:28,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-28 03:23:28,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 03:23:28,852 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:23:28,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:23:28,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1810734976, now seen corresponding path program 17 times [2022-04-28 03:23:28,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:23:28,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1836066283] [2022-04-28 03:23:29,034 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:23:29,398 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:23:29,557 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:23:29,559 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:23:29,561 INFO L85 PathProgramCache]: Analyzing trace with hash -270711615, now seen corresponding path program 1 times [2022-04-28 03:23:29,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:23:29,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269177908] [2022-04-28 03:23:29,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:23:29,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:23:29,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:23:29,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:23:29,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:23:29,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {8601#(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); {8588#true} is VALID [2022-04-28 03:23:29,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {8588#true} assume true; {8588#true} is VALID [2022-04-28 03:23:29,674 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8588#true} {8588#true} #71#return; {8588#true} is VALID [2022-04-28 03:23:29,675 INFO L272 TraceCheckUtils]: 0: Hoare triple {8588#true} call ULTIMATE.init(); {8601#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:23:29,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {8601#(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); {8588#true} is VALID [2022-04-28 03:23:29,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {8588#true} assume true; {8588#true} is VALID [2022-04-28 03:23:29,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8588#true} {8588#true} #71#return; {8588#true} is VALID [2022-04-28 03:23:29,675 INFO L272 TraceCheckUtils]: 4: Hoare triple {8588#true} call #t~ret6 := main(); {8588#true} is VALID [2022-04-28 03:23:29,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {8588#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {8593#(= main_~k~0 0)} is VALID [2022-04-28 03:23:29,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {8593#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {8594#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:23:29,676 INFO L290 TraceCheckUtils]: 7: Hoare triple {8594#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {8595#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:23:29,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {8595#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} [115] L31-3-->L31-4_primed: Formula: (let ((.cse4 (<= v_main_~m~0_141 12)) (.cse3 (< 11 v_main_~m~0_141)) (.cse0 (= |v_main_#t~post3_127| |v_main_#t~post3_125|)) (.cse1 (= |v_main_#t~post5_334| |v_main_#t~post5_322|)) (.cse2 (= |v_main_#t~post4_334| |v_main_#t~post4_322|)) (.cse5 (= v_main_~i~0_168 v_main_~i~0_167))) (or (and (= v_main_~j~0_545 v_main_~j~0_559) .cse0 .cse1 .cse2 (= v_main_~k~0_503 v_main_~k~0_515) (or (not .cse3) (not .cse4) (not (< v_main_~i~0_168 v_main_~n~0_57))) .cse5) (and .cse4 (= v_main_~j~0_545 12) (< v_main_~i~0_167 (+ v_main_~n~0_57 1)) (= (+ v_main_~k~0_503 (* 12 v_main_~i~0_168)) (+ (* 12 v_main_~i~0_167) v_main_~k~0_515)) (< v_main_~i~0_168 v_main_~i~0_167) .cse3) (and .cse0 (= v_main_~j~0_559 v_main_~j~0_545) .cse1 .cse2 (= v_main_~k~0_515 v_main_~k~0_503) (= v_main_~m~0_141 v_main_~m~0_141) (= v_main_~n~0_57 v_main_~n~0_57) .cse5))) InVars {main_~m~0=v_main_~m~0_141, main_~k~0=v_main_~k~0_515, main_~j~0=v_main_~j~0_559, main_~i~0=v_main_~i~0_168, main_#t~post4=|v_main_#t~post4_334|, main_#t~post5=|v_main_#t~post5_334|, main_~n~0=v_main_~n~0_57, main_#t~post3=|v_main_#t~post3_127|} OutVars{main_~m~0=v_main_~m~0_141, main_~k~0=v_main_~k~0_503, main_~j~0=v_main_~j~0_545, main_~i~0=v_main_~i~0_167, main_#t~post4=|v_main_#t~post4_322|, main_#t~post5=|v_main_#t~post5_322|, main_#t~post3=|v_main_#t~post3_125|, main_~n~0=v_main_~n~0_57} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {8596#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (or (= main_~i~0 0) (<= (+ (* main_~i~0 12) 120) (+ (* main_~n~0 12) main_~k~0))))} is VALID [2022-04-28 03:23:29,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {8596#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (or (= main_~i~0 0) (<= (+ (* main_~i~0 12) 120) (+ (* main_~n~0 12) main_~k~0))))} [116] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8596#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (or (= main_~i~0 0) (<= (+ (* main_~i~0 12) 120) (+ (* main_~n~0 12) main_~k~0))))} is VALID [2022-04-28 03:23:29,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {8596#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (or (= main_~i~0 0) (<= (+ (* main_~i~0 12) 120) (+ (* main_~n~0 12) main_~k~0))))} [117] L31-3-->L31-4_primed: Formula: (let ((.cse0 (<= v_main_~m~0_142 0)) (.cse1 (= v_main_~j~0_562 v_main_~j~0_558)) (.cse2 (= |v_main_#t~post3_130| |v_main_#t~post3_126|))) (or (and (or (not .cse0) (not (< v_main_~i~0_170 v_main_~n~0_58))) (= v_main_~i~0_169 v_main_~i~0_170) .cse1 .cse2) (and (< v_main_~i~0_169 (+ v_main_~n~0_58 1)) (= v_main_~j~0_558 0) (< v_main_~i~0_170 v_main_~i~0_169) .cse0) (and .cse1 (= v_main_~i~0_170 v_main_~i~0_169) (= v_main_~m~0_142 v_main_~m~0_142) .cse2 (= v_main_~n~0_58 v_main_~n~0_58)))) InVars {main_~i~0=v_main_~i~0_170, main_~n~0=v_main_~n~0_58, main_#t~post3=|v_main_#t~post3_130|, main_~m~0=v_main_~m~0_142, main_~j~0=v_main_~j~0_562} OutVars{main_~i~0=v_main_~i~0_169, main_#t~post3=|v_main_#t~post3_126|, main_~n~0=v_main_~n~0_58, main_~m~0=v_main_~m~0_142, main_~j~0=v_main_~j~0_558} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post3] {8597#(and (or (= main_~i~0 0) (<= (+ (* main_~i~0 12) 120) (+ (* main_~n~0 12) main_~k~0))) (or (<= 10 main_~n~0) (not (= main_~i~0 0))))} is VALID [2022-04-28 03:23:29,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {8597#(and (or (= main_~i~0 0) (<= (+ (* main_~i~0 12) 120) (+ (* main_~n~0 12) main_~k~0))) (or (<= 10 main_~n~0) (not (= main_~i~0 0))))} [114] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {8598#(<= 120 main_~k~0)} is VALID [2022-04-28 03:23:29,679 INFO L272 TraceCheckUtils]: 12: Hoare triple {8598#(<= 120 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {8599#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:23:29,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {8599#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {8600#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:23:29,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {8600#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {8589#false} is VALID [2022-04-28 03:23:29,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {8589#false} assume !false; {8589#false} is VALID [2022-04-28 03:23:29,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:23:29,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:23:29,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269177908] [2022-04-28 03:23:29,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269177908] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:23:29,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749327322] [2022-04-28 03:23:29,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:23:29,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:23:29,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:23:29,681 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 03:23:29,682 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 03:23:29,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:23:29,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:23:29,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:23:29,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:23:30,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {8588#true} call ULTIMATE.init(); {8588#true} is VALID [2022-04-28 03:23:30,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {8588#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); {8588#true} is VALID [2022-04-28 03:23:30,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {8588#true} assume true; {8588#true} is VALID [2022-04-28 03:23:30,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8588#true} {8588#true} #71#return; {8588#true} is VALID [2022-04-28 03:23:30,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {8588#true} call #t~ret6 := main(); {8588#true} is VALID [2022-04-28 03:23:30,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {8588#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {8620#(<= 0 main_~k~0)} is VALID [2022-04-28 03:23:30,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {8620#(<= 0 main_~k~0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {8624#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} is VALID [2022-04-28 03:23:30,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {8624#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {8628#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:23:30,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {8628#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [115] L31-3-->L31-4_primed: Formula: (let ((.cse4 (<= v_main_~m~0_141 12)) (.cse3 (< 11 v_main_~m~0_141)) (.cse0 (= |v_main_#t~post3_127| |v_main_#t~post3_125|)) (.cse1 (= |v_main_#t~post5_334| |v_main_#t~post5_322|)) (.cse2 (= |v_main_#t~post4_334| |v_main_#t~post4_322|)) (.cse5 (= v_main_~i~0_168 v_main_~i~0_167))) (or (and (= v_main_~j~0_545 v_main_~j~0_559) .cse0 .cse1 .cse2 (= v_main_~k~0_503 v_main_~k~0_515) (or (not .cse3) (not .cse4) (not (< v_main_~i~0_168 v_main_~n~0_57))) .cse5) (and .cse4 (= v_main_~j~0_545 12) (< v_main_~i~0_167 (+ v_main_~n~0_57 1)) (= (+ v_main_~k~0_503 (* 12 v_main_~i~0_168)) (+ (* 12 v_main_~i~0_167) v_main_~k~0_515)) (< v_main_~i~0_168 v_main_~i~0_167) .cse3) (and .cse0 (= v_main_~j~0_559 v_main_~j~0_545) .cse1 .cse2 (= v_main_~k~0_515 v_main_~k~0_503) (= v_main_~m~0_141 v_main_~m~0_141) (= v_main_~n~0_57 v_main_~n~0_57) .cse5))) InVars {main_~m~0=v_main_~m~0_141, main_~k~0=v_main_~k~0_515, main_~j~0=v_main_~j~0_559, main_~i~0=v_main_~i~0_168, main_#t~post4=|v_main_#t~post4_334|, main_#t~post5=|v_main_#t~post5_334|, main_~n~0=v_main_~n~0_57, main_#t~post3=|v_main_#t~post3_127|} OutVars{main_~m~0=v_main_~m~0_141, main_~k~0=v_main_~k~0_503, main_~j~0=v_main_~j~0_545, main_~i~0=v_main_~i~0_167, main_#t~post4=|v_main_#t~post4_322|, main_#t~post5=|v_main_#t~post5_322|, main_#t~post3=|v_main_#t~post3_125|, main_~n~0=v_main_~n~0_57} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {8632#(and (or (and (<= (+ (div main_~k~0 (- 12)) main_~i~0) 0) (<= main_~m~0 12) (= main_~j~0 12) (< 11 main_~m~0) (< (div main_~k~0 (- 12)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))) (<= 10 main_~n~0) (<= 10 main_~m~0))} is VALID [2022-04-28 03:23:30,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {8632#(and (or (and (<= (+ (div main_~k~0 (- 12)) main_~i~0) 0) (<= main_~m~0 12) (= main_~j~0 12) (< 11 main_~m~0) (< (div main_~k~0 (- 12)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))) (<= 10 main_~n~0) (<= 10 main_~m~0))} [116] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8632#(and (or (and (<= (+ (div main_~k~0 (- 12)) main_~i~0) 0) (<= main_~m~0 12) (= main_~j~0 12) (< 11 main_~m~0) (< (div main_~k~0 (- 12)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))) (<= 10 main_~n~0) (<= 10 main_~m~0))} is VALID [2022-04-28 03:23:30,296 INFO L290 TraceCheckUtils]: 10: Hoare triple {8632#(and (or (and (<= (+ (div main_~k~0 (- 12)) main_~i~0) 0) (<= main_~m~0 12) (= main_~j~0 12) (< 11 main_~m~0) (< (div main_~k~0 (- 12)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))) (<= 10 main_~n~0) (<= 10 main_~m~0))} [117] L31-3-->L31-4_primed: Formula: (let ((.cse0 (<= v_main_~m~0_142 0)) (.cse1 (= v_main_~j~0_562 v_main_~j~0_558)) (.cse2 (= |v_main_#t~post3_130| |v_main_#t~post3_126|))) (or (and (or (not .cse0) (not (< v_main_~i~0_170 v_main_~n~0_58))) (= v_main_~i~0_169 v_main_~i~0_170) .cse1 .cse2) (and (< v_main_~i~0_169 (+ v_main_~n~0_58 1)) (= v_main_~j~0_558 0) (< v_main_~i~0_170 v_main_~i~0_169) .cse0) (and .cse1 (= v_main_~i~0_170 v_main_~i~0_169) (= v_main_~m~0_142 v_main_~m~0_142) .cse2 (= v_main_~n~0_58 v_main_~n~0_58)))) InVars {main_~i~0=v_main_~i~0_170, main_~n~0=v_main_~n~0_58, main_#t~post3=|v_main_#t~post3_130|, main_~m~0=v_main_~m~0_142, main_~j~0=v_main_~j~0_562} OutVars{main_~i~0=v_main_~i~0_169, main_#t~post3=|v_main_#t~post3_126|, main_~n~0=v_main_~n~0_58, main_~m~0=v_main_~m~0_142, main_~j~0=v_main_~j~0_558} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post3] {8639#(and (<= 10 main_~n~0) (or (and (<= (+ (div main_~k~0 (- 12)) main_~i~0) 0) (< (div main_~k~0 (- 12)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:23:30,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {8639#(and (<= 10 main_~n~0) (or (and (<= (+ (div main_~k~0 (- 12)) main_~i~0) 0) (< (div main_~k~0 (- 12)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [114] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {8598#(<= 120 main_~k~0)} is VALID [2022-04-28 03:23:30,298 INFO L272 TraceCheckUtils]: 12: Hoare triple {8598#(<= 120 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {8646#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:23:30,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {8646#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8650#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:23:30,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {8650#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8589#false} is VALID [2022-04-28 03:23:30,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {8589#false} assume !false; {8589#false} is VALID [2022-04-28 03:23:30,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:23:30,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:23:30,884 INFO L290 TraceCheckUtils]: 15: Hoare triple {8589#false} assume !false; {8589#false} is VALID [2022-04-28 03:23:30,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {8650#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8589#false} is VALID [2022-04-28 03:23:30,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {8646#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8650#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:23:30,885 INFO L272 TraceCheckUtils]: 12: Hoare triple {8666#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {8646#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:23:30,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {8670#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} [114] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {8666#(<= 100 main_~k~0)} is VALID [2022-04-28 03:23:30,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {8674#(or (<= 100 main_~k~0) (and (< main_~i~0 main_~n~0) (not (<= main_~m~0 0))))} [117] L31-3-->L31-4_primed: Formula: (let ((.cse0 (<= v_main_~m~0_142 0)) (.cse1 (= v_main_~j~0_562 v_main_~j~0_558)) (.cse2 (= |v_main_#t~post3_130| |v_main_#t~post3_126|))) (or (and (or (not .cse0) (not (< v_main_~i~0_170 v_main_~n~0_58))) (= v_main_~i~0_169 v_main_~i~0_170) .cse1 .cse2) (and (< v_main_~i~0_169 (+ v_main_~n~0_58 1)) (= v_main_~j~0_558 0) (< v_main_~i~0_170 v_main_~i~0_169) .cse0) (and .cse1 (= v_main_~i~0_170 v_main_~i~0_169) (= v_main_~m~0_142 v_main_~m~0_142) .cse2 (= v_main_~n~0_58 v_main_~n~0_58)))) InVars {main_~i~0=v_main_~i~0_170, main_~n~0=v_main_~n~0_58, main_#t~post3=|v_main_#t~post3_130|, main_~m~0=v_main_~m~0_142, main_~j~0=v_main_~j~0_562} OutVars{main_~i~0=v_main_~i~0_169, main_#t~post3=|v_main_#t~post3_126|, main_~n~0=v_main_~n~0_58, main_~m~0=v_main_~m~0_142, main_~j~0=v_main_~j~0_558} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post3] {8670#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} is VALID [2022-04-28 03:23:30,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {8674#(or (<= 100 main_~k~0) (and (< main_~i~0 main_~n~0) (not (<= main_~m~0 0))))} [116] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8674#(or (<= 100 main_~k~0) (and (< main_~i~0 main_~n~0) (not (<= main_~m~0 0))))} is VALID [2022-04-28 03:23:30,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {8681#(and (or (not (< 11 main_~m~0)) (not (<= main_~m~0 12)) (<= main_~n~0 main_~i~0) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 12))) main_~n~0)) (or (<= 100 main_~k~0) (and (< main_~i~0 main_~n~0) (not (<= main_~m~0 0)))))} [115] L31-3-->L31-4_primed: Formula: (let ((.cse4 (<= v_main_~m~0_141 12)) (.cse3 (< 11 v_main_~m~0_141)) (.cse0 (= |v_main_#t~post3_127| |v_main_#t~post3_125|)) (.cse1 (= |v_main_#t~post5_334| |v_main_#t~post5_322|)) (.cse2 (= |v_main_#t~post4_334| |v_main_#t~post4_322|)) (.cse5 (= v_main_~i~0_168 v_main_~i~0_167))) (or (and (= v_main_~j~0_545 v_main_~j~0_559) .cse0 .cse1 .cse2 (= v_main_~k~0_503 v_main_~k~0_515) (or (not .cse3) (not .cse4) (not (< v_main_~i~0_168 v_main_~n~0_57))) .cse5) (and .cse4 (= v_main_~j~0_545 12) (< v_main_~i~0_167 (+ v_main_~n~0_57 1)) (= (+ v_main_~k~0_503 (* 12 v_main_~i~0_168)) (+ (* 12 v_main_~i~0_167) v_main_~k~0_515)) (< v_main_~i~0_168 v_main_~i~0_167) .cse3) (and .cse0 (= v_main_~j~0_559 v_main_~j~0_545) .cse1 .cse2 (= v_main_~k~0_515 v_main_~k~0_503) (= v_main_~m~0_141 v_main_~m~0_141) (= v_main_~n~0_57 v_main_~n~0_57) .cse5))) InVars {main_~m~0=v_main_~m~0_141, main_~k~0=v_main_~k~0_515, main_~j~0=v_main_~j~0_559, main_~i~0=v_main_~i~0_168, main_#t~post4=|v_main_#t~post4_334|, main_#t~post5=|v_main_#t~post5_334|, main_~n~0=v_main_~n~0_57, main_#t~post3=|v_main_#t~post3_127|} OutVars{main_~m~0=v_main_~m~0_141, main_~k~0=v_main_~k~0_503, main_~j~0=v_main_~j~0_545, main_~i~0=v_main_~i~0_167, main_#t~post4=|v_main_#t~post4_322|, main_#t~post5=|v_main_#t~post5_322|, main_#t~post3=|v_main_#t~post3_125|, main_~n~0=v_main_~n~0_57} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {8674#(or (<= 100 main_~k~0) (and (< main_~i~0 main_~n~0) (not (<= main_~m~0 0))))} is VALID [2022-04-28 03:23:30,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {8685#(and (or (< 0 main_~n~0) (<= 100 main_~k~0)) (or (<= (div (+ (- 100) main_~k~0) (- 12)) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 12)) 1)))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {8681#(and (or (not (< 11 main_~m~0)) (not (<= main_~m~0 12)) (<= main_~n~0 main_~i~0) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 12))) main_~n~0)) (or (<= 100 main_~k~0) (and (< main_~i~0 main_~n~0) (not (<= main_~m~0 0)))))} is VALID [2022-04-28 03:23:30,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {8689#(<= (div (+ (- 100) main_~k~0) (- 12)) 10)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {8685#(and (or (< 0 main_~n~0) (<= 100 main_~k~0)) (or (<= (div (+ (- 100) main_~k~0) (- 12)) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 12)) 1)))} is VALID [2022-04-28 03:23:30,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {8588#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {8689#(<= (div (+ (- 100) main_~k~0) (- 12)) 10)} is VALID [2022-04-28 03:23:30,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {8588#true} call #t~ret6 := main(); {8588#true} is VALID [2022-04-28 03:23:30,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8588#true} {8588#true} #71#return; {8588#true} is VALID [2022-04-28 03:23:30,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {8588#true} assume true; {8588#true} is VALID [2022-04-28 03:23:30,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {8588#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); {8588#true} is VALID [2022-04-28 03:23:30,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {8588#true} call ULTIMATE.init(); {8588#true} is VALID [2022-04-28 03:23:30,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:23:30,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749327322] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:23:30,890 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:23:30,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2022-04-28 03:23:32,796 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:23:32,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1836066283] [2022-04-28 03:23:32,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1836066283] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:23:32,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:23:32,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-28 03:23:32,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786045537] [2022-04-28 03:23:32,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:23:32,797 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 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 43 [2022-04-28 03:23:32,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:23:32,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:32,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:23:32,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-28 03:23:32,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:23:32,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-28 03:23:32,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=2281, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 03:23:32,838 INFO L87 Difference]: Start difference. First operand 152 states and 196 transitions. Second operand has 37 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:37,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:23:37,083 INFO L93 Difference]: Finished difference Result 165 states and 211 transitions. [2022-04-28 03:23:37,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 03:23:37,083 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 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 43 [2022-04-28 03:23:37,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:23:37,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:37,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 74 transitions. [2022-04-28 03:23:37,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:37,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 74 transitions. [2022-04-28 03:23:37,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 74 transitions. [2022-04-28 03:23:37,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:23:37,170 INFO L225 Difference]: With dead ends: 165 [2022-04-28 03:23:37,170 INFO L226 Difference]: Without dead ends: 156 [2022-04-28 03:23:37,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1605 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=882, Invalid=5760, Unknown=0, NotChecked=0, Total=6642 [2022-04-28 03:23:37,172 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:23:37,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 180 Invalid, 1361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1278 Invalid, 0 Unknown, 43 Unchecked, 1.3s Time] [2022-04-28 03:23:37,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-04-28 03:23:37,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2022-04-28 03:23:37,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:23:37,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand has 152 states, 147 states have (on average 1.2380952380952381) internal successors, (182), 147 states have internal predecessors, (182), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:37,665 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand has 152 states, 147 states have (on average 1.2380952380952381) internal successors, (182), 147 states have internal predecessors, (182), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:37,666 INFO L87 Difference]: Start difference. First operand 156 states. Second operand has 152 states, 147 states have (on average 1.2380952380952381) internal successors, (182), 147 states have internal predecessors, (182), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:37,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:23:37,668 INFO L93 Difference]: Finished difference Result 156 states and 191 transitions. [2022-04-28 03:23:37,668 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 191 transitions. [2022-04-28 03:23:37,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:23:37,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:23:37,668 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 147 states have (on average 1.2380952380952381) internal successors, (182), 147 states have internal predecessors, (182), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 156 states. [2022-04-28 03:23:37,668 INFO L87 Difference]: Start difference. First operand has 152 states, 147 states have (on average 1.2380952380952381) internal successors, (182), 147 states have internal predecessors, (182), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 156 states. [2022-04-28 03:23:37,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:23:37,670 INFO L93 Difference]: Finished difference Result 156 states and 191 transitions. [2022-04-28 03:23:37,670 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 191 transitions. [2022-04-28 03:23:37,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:23:37,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:23:37,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:23:37,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:23:37,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 147 states have (on average 1.2380952380952381) internal successors, (182), 147 states have internal predecessors, (182), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:37,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 186 transitions. [2022-04-28 03:23:37,673 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 186 transitions. Word has length 43 [2022-04-28 03:23:37,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:23:37,673 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 186 transitions. [2022-04-28 03:23:37,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:37,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 152 states and 186 transitions. [2022-04-28 03:23:38,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:23:38,067 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 186 transitions. [2022-04-28 03:23:38,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 03:23:38,068 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:23:38,068 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:23:38,083 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 03:23:38,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:23:38,268 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:23:38,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:23:38,269 INFO L85 PathProgramCache]: Analyzing trace with hash -92238819, now seen corresponding path program 18 times [2022-04-28 03:23:38,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:23:38,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [783712673] [2022-04-28 03:23:42,365 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:23:42,422 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:23:42,748 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:23:42,749 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:23:42,751 INFO L85 PathProgramCache]: Analyzing trace with hash 521270626, now seen corresponding path program 1 times [2022-04-28 03:23:42,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:23:42,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314868774] [2022-04-28 03:23:42,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:23:42,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:23:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:23:42,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:23:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:23:42,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {9755#(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); {9743#true} is VALID [2022-04-28 03:23:42,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {9743#true} assume true; {9743#true} is VALID [2022-04-28 03:23:42,851 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9743#true} {9743#true} #71#return; {9743#true} is VALID [2022-04-28 03:23:42,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {9743#true} call ULTIMATE.init(); {9755#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:23:42,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {9755#(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); {9743#true} is VALID [2022-04-28 03:23:42,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {9743#true} assume true; {9743#true} is VALID [2022-04-28 03:23:42,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9743#true} {9743#true} #71#return; {9743#true} is VALID [2022-04-28 03:23:42,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {9743#true} call #t~ret6 := main(); {9743#true} is VALID [2022-04-28 03:23:42,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {9743#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {9748#(= main_~k~0 0)} is VALID [2022-04-28 03:23:42,853 INFO L290 TraceCheckUtils]: 6: Hoare triple {9748#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {9749#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:23:42,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {9749#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {9750#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:23:42,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {9750#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [119] L31-3-->L31-4_primed: Formula: (let ((.cse4 (<= v_main_~m~0_151 14)) (.cse5 (< 13 v_main_~m~0_151)) (.cse0 (= v_main_~i~0_187 v_main_~i~0_186)) (.cse1 (= |v_main_#t~post4_361| |v_main_#t~post4_347|)) (.cse2 (= |v_main_#t~post5_361| |v_main_#t~post5_347|)) (.cse3 (= v_main_~j~0_610 v_main_~j~0_595))) (or (and .cse0 .cse1 .cse2 (= |v_main_#t~post3_139| |v_main_#t~post3_140|) .cse3 (= v_main_~k~0_544 v_main_~k~0_558) (or (not .cse4) (not (< v_main_~i~0_187 v_main_~n~0_62)) (not .cse5))) (and .cse4 (< v_main_~i~0_187 v_main_~i~0_186) (= v_main_~j~0_595 14) (< v_main_~i~0_186 (+ v_main_~n~0_62 1)) .cse5 (= (+ v_main_~k~0_558 (* 14 v_main_~i~0_186)) (+ v_main_~k~0_544 (* 14 v_main_~i~0_187)))) (and (= v_main_~k~0_558 v_main_~k~0_544) .cse0 .cse1 .cse2 (= |v_main_#t~post3_140| |v_main_#t~post3_139|) (= v_main_~n~0_62 v_main_~n~0_62) (= v_main_~m~0_151 v_main_~m~0_151) .cse3))) InVars {main_~m~0=v_main_~m~0_151, main_~k~0=v_main_~k~0_558, main_~j~0=v_main_~j~0_610, main_~i~0=v_main_~i~0_187, main_#t~post4=|v_main_#t~post4_361|, main_#t~post5=|v_main_#t~post5_361|, main_~n~0=v_main_~n~0_62, main_#t~post3=|v_main_#t~post3_140|} OutVars{main_~m~0=v_main_~m~0_151, main_~k~0=v_main_~k~0_544, main_~j~0=v_main_~j~0_595, main_~i~0=v_main_~i~0_186, main_#t~post4=|v_main_#t~post4_347|, main_#t~post5=|v_main_#t~post5_347|, main_#t~post3=|v_main_#t~post3_139|, main_~n~0=v_main_~n~0_62} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {9751#(or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ 140 (* main_~i~0 14)) (+ main_~k~0 (* main_~n~0 14))))} is VALID [2022-04-28 03:23:42,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {9751#(or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ 140 (* main_~i~0 14)) (+ main_~k~0 (* main_~n~0 14))))} [118] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {9752#(<= 140 main_~k~0)} is VALID [2022-04-28 03:23:42,855 INFO L272 TraceCheckUtils]: 10: Hoare triple {9752#(<= 140 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {9753#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:23:42,856 INFO L290 TraceCheckUtils]: 11: Hoare triple {9753#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {9754#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:23:42,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {9754#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {9744#false} is VALID [2022-04-28 03:23:42,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {9744#false} assume !false; {9744#false} is VALID [2022-04-28 03:23:42,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:23:42,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:23:42,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314868774] [2022-04-28 03:23:42,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314868774] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:23:42,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:23:42,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:23:44,620 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:23:44,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [783712673] [2022-04-28 03:23:44,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [783712673] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:23:44,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:23:44,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-28 03:23:44,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86249542] [2022-04-28 03:23:44,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:23:44,621 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 38 states have internal predecessors, (40), 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 44 [2022-04-28 03:23:44,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:23:44,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 38 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:44,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:23:44,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-28 03:23:44,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:23:44,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-28 03:23:44,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 03:23:44,659 INFO L87 Difference]: Start difference. First operand 152 states and 186 transitions. Second operand has 40 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 38 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:51,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:23:51,341 INFO L93 Difference]: Finished difference Result 211 states and 263 transitions. [2022-04-28 03:23:51,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-28 03:23:51,341 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 38 states have internal predecessors, (40), 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 44 [2022-04-28 03:23:51,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:23:51,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 38 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:51,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 91 transitions. [2022-04-28 03:23:51,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 38 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:51,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 91 transitions. [2022-04-28 03:23:51,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 91 transitions. [2022-04-28 03:23:51,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:23:51,509 INFO L225 Difference]: With dead ends: 211 [2022-04-28 03:23:51,509 INFO L226 Difference]: Without dead ends: 206 [2022-04-28 03:23:51,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=329, Invalid=5991, Unknown=0, NotChecked=0, Total=6320 [2022-04-28 03:23:51,513 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 46 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 2532 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 2568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:23:51,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 190 Invalid, 2568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2532 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 03:23:51,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-04-28 03:23:52,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 185. [2022-04-28 03:23:52,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:23:52,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand has 185 states, 180 states have (on average 1.2833333333333334) internal successors, (231), 180 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:52,357 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand has 185 states, 180 states have (on average 1.2833333333333334) internal successors, (231), 180 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:52,357 INFO L87 Difference]: Start difference. First operand 206 states. Second operand has 185 states, 180 states have (on average 1.2833333333333334) internal successors, (231), 180 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:52,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:23:52,360 INFO L93 Difference]: Finished difference Result 206 states and 258 transitions. [2022-04-28 03:23:52,360 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 258 transitions. [2022-04-28 03:23:52,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:23:52,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:23:52,360 INFO L74 IsIncluded]: Start isIncluded. First operand has 185 states, 180 states have (on average 1.2833333333333334) internal successors, (231), 180 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 206 states. [2022-04-28 03:23:52,361 INFO L87 Difference]: Start difference. First operand has 185 states, 180 states have (on average 1.2833333333333334) internal successors, (231), 180 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 206 states. [2022-04-28 03:23:52,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:23:52,363 INFO L93 Difference]: Finished difference Result 206 states and 258 transitions. [2022-04-28 03:23:52,363 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 258 transitions. [2022-04-28 03:23:52,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:23:52,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:23:52,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:23:52,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:23:52,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 180 states have (on average 1.2833333333333334) internal successors, (231), 180 states have internal predecessors, (231), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:52,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 235 transitions. [2022-04-28 03:23:52,366 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 235 transitions. Word has length 44 [2022-04-28 03:23:52,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:23:52,366 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 235 transitions. [2022-04-28 03:23:52,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 38 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:23:52,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 185 states and 235 transitions. [2022-04-28 03:23:52,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:23:52,933 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 235 transitions. [2022-04-28 03:23:52,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 03:23:52,934 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:23:52,934 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:23:52,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 03:23:52,934 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:23:52,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:23:52,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1240156774, now seen corresponding path program 19 times [2022-04-28 03:23:52,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:23:52,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1646982751] [2022-04-28 03:23:53,318 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:23:53,497 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:23:56,128 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:23:58,723 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:23:58,868 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:23:58,869 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:23:58,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1491380671, now seen corresponding path program 1 times [2022-04-28 03:23:58,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:23:58,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077768647] [2022-04-28 03:23:58,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:23:58,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:23:58,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:23:58,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:23:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:23:58,974 INFO L290 TraceCheckUtils]: 0: Hoare triple {11083#(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); {11070#true} is VALID [2022-04-28 03:23:58,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-28 03:23:58,974 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11070#true} {11070#true} #71#return; {11070#true} is VALID [2022-04-28 03:23:58,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {11070#true} call ULTIMATE.init(); {11083#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:23:58,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {11083#(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); {11070#true} is VALID [2022-04-28 03:23:58,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-28 03:23:58,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11070#true} {11070#true} #71#return; {11070#true} is VALID [2022-04-28 03:23:58,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {11070#true} call #t~ret6 := main(); {11070#true} is VALID [2022-04-28 03:23:58,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {11070#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {11075#(= main_~k~0 0)} is VALID [2022-04-28 03:23:58,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {11075#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {11076#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:23:58,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {11076#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {11077#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:23:58,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {11077#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} [121] L31-3-->L31-4_primed: Formula: (let ((.cse2 (< 1 v_main_~m~0_163)) (.cse3 (<= v_main_~m~0_163 2)) (.cse0 (= v_main_~k~0_595 v_main_~k~0_593)) (.cse1 (= v_main_~j~0_663 v_main_~j~0_648)) (.cse4 (= |v_main_#t~post3_153| |v_main_#t~post3_151|)) (.cse5 (= |v_main_#t~post4_391| |v_main_#t~post4_378|)) (.cse6 (= |v_main_#t~post5_391| |v_main_#t~post5_378|))) (or (and .cse0 .cse1 (or (not .cse2) (not .cse3) (not (< v_main_~i~0_203 v_main_~n~0_69))) .cse4 .cse5 (= v_main_~i~0_202 v_main_~i~0_203) .cse6) (and .cse2 (< v_main_~i~0_203 v_main_~i~0_202) (< v_main_~i~0_202 (+ v_main_~n~0_69 1)) (= v_main_~j~0_648 2) .cse3 (= (+ (* 2 v_main_~i~0_203) v_main_~k~0_593) (+ v_main_~k~0_595 (* 2 v_main_~i~0_202)))) (and .cse0 .cse1 (= v_main_~m~0_163 v_main_~m~0_163) .cse4 (= v_main_~n~0_69 v_main_~n~0_69) .cse5 .cse6 (= v_main_~i~0_203 v_main_~i~0_202)))) InVars {main_~m~0=v_main_~m~0_163, main_~k~0=v_main_~k~0_595, main_~j~0=v_main_~j~0_663, main_~i~0=v_main_~i~0_203, main_#t~post4=|v_main_#t~post4_391|, main_#t~post5=|v_main_#t~post5_391|, main_~n~0=v_main_~n~0_69, main_#t~post3=|v_main_#t~post3_153|} OutVars{main_~m~0=v_main_~m~0_163, main_~k~0=v_main_~k~0_593, main_~j~0=v_main_~j~0_648, main_~i~0=v_main_~i~0_202, main_#t~post4=|v_main_#t~post4_378|, main_#t~post5=|v_main_#t~post5_378|, main_#t~post3=|v_main_#t~post3_151|, main_~n~0=v_main_~n~0_69} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {11078#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:23:58,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {11078#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [122] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11078#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:23:58,977 INFO L290 TraceCheckUtils]: 10: Hoare triple {11078#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [123] L31-3-->L31-4_primed: Formula: (let ((.cse2 (= v_main_~k~0_607 v_main_~k~0_596)) (.cse3 (= |v_main_#t~post5_394| |v_main_#t~post5_380|)) (.cse4 (= |v_main_#t~post3_156| |v_main_#t~post3_152|)) (.cse5 (= |v_main_#t~post4_394| |v_main_#t~post4_380|)) (.cse6 (= v_main_~j~0_666 v_main_~j~0_651)) (.cse1 (<= v_main_~m~0_164 11)) (.cse0 (< 10 v_main_~m~0_164)) (.cse7 (= v_main_~i~0_205 v_main_~i~0_204))) (or (and (< v_main_~i~0_204 (+ v_main_~n~0_70 1)) (= v_main_~j~0_651 11) .cse0 (= (+ v_main_~k~0_596 (* 11 v_main_~i~0_205)) (+ v_main_~k~0_607 (* 11 v_main_~i~0_204))) (< v_main_~i~0_205 v_main_~i~0_204) .cse1) (and .cse2 .cse3 .cse4 (= v_main_~n~0_70 v_main_~n~0_70) .cse5 .cse6 (= v_main_~m~0_164 v_main_~m~0_164) .cse7) (and .cse2 .cse3 .cse4 .cse5 .cse6 (or (not (< v_main_~i~0_205 v_main_~n~0_70)) (not .cse1) (not .cse0)) .cse7))) InVars {main_~m~0=v_main_~m~0_164, main_~k~0=v_main_~k~0_607, main_~j~0=v_main_~j~0_666, main_~i~0=v_main_~i~0_205, main_#t~post4=|v_main_#t~post4_394|, main_#t~post5=|v_main_#t~post5_394|, main_~n~0=v_main_~n~0_70, main_#t~post3=|v_main_#t~post3_156|} OutVars{main_~m~0=v_main_~m~0_164, main_~k~0=v_main_~k~0_596, main_~j~0=v_main_~j~0_651, main_~i~0=v_main_~i~0_204, main_#t~post4=|v_main_#t~post4_380|, main_#t~post5=|v_main_#t~post5_380|, main_#t~post3=|v_main_#t~post3_152|, main_~n~0=v_main_~n~0_70} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {11079#(or (<= (+ (* main_~i~0 11) 100) (+ (* main_~n~0 11) main_~k~0)) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:23:58,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {11079#(or (<= (+ (* main_~i~0 11) 100) (+ (* main_~n~0 11) main_~k~0)) (<= (+ main_~i~0 10) main_~n~0))} [120] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {11080#(<= 100 main_~k~0)} is VALID [2022-04-28 03:23:58,978 INFO L272 TraceCheckUtils]: 12: Hoare triple {11080#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {11081#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:23:58,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {11081#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {11082#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:23:58,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {11082#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {11071#false} is VALID [2022-04-28 03:23:58,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {11071#false} assume !false; {11071#false} is VALID [2022-04-28 03:23:58,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:23:58,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:23:58,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077768647] [2022-04-28 03:23:58,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077768647] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:23:58,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480753228] [2022-04-28 03:23:58,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:23:58,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:23:58,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:23:58,981 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 03:23:58,981 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 03:23:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:23:59,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:23:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:23:59,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:23:59,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {11070#true} call ULTIMATE.init(); {11070#true} is VALID [2022-04-28 03:23:59,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {11070#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); {11070#true} is VALID [2022-04-28 03:23:59,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-28 03:23:59,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11070#true} {11070#true} #71#return; {11070#true} is VALID [2022-04-28 03:23:59,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {11070#true} call #t~ret6 := main(); {11070#true} is VALID [2022-04-28 03:23:59,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {11070#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {11102#(<= 0 main_~k~0)} is VALID [2022-04-28 03:23:59,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {11102#(<= 0 main_~k~0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {11106#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} is VALID [2022-04-28 03:23:59,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {11106#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {11110#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:23:59,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {11110#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [121] L31-3-->L31-4_primed: Formula: (let ((.cse2 (< 1 v_main_~m~0_163)) (.cse3 (<= v_main_~m~0_163 2)) (.cse0 (= v_main_~k~0_595 v_main_~k~0_593)) (.cse1 (= v_main_~j~0_663 v_main_~j~0_648)) (.cse4 (= |v_main_#t~post3_153| |v_main_#t~post3_151|)) (.cse5 (= |v_main_#t~post4_391| |v_main_#t~post4_378|)) (.cse6 (= |v_main_#t~post5_391| |v_main_#t~post5_378|))) (or (and .cse0 .cse1 (or (not .cse2) (not .cse3) (not (< v_main_~i~0_203 v_main_~n~0_69))) .cse4 .cse5 (= v_main_~i~0_202 v_main_~i~0_203) .cse6) (and .cse2 (< v_main_~i~0_203 v_main_~i~0_202) (< v_main_~i~0_202 (+ v_main_~n~0_69 1)) (= v_main_~j~0_648 2) .cse3 (= (+ (* 2 v_main_~i~0_203) v_main_~k~0_593) (+ v_main_~k~0_595 (* 2 v_main_~i~0_202)))) (and .cse0 .cse1 (= v_main_~m~0_163 v_main_~m~0_163) .cse4 (= v_main_~n~0_69 v_main_~n~0_69) .cse5 .cse6 (= v_main_~i~0_203 v_main_~i~0_202)))) InVars {main_~m~0=v_main_~m~0_163, main_~k~0=v_main_~k~0_595, main_~j~0=v_main_~j~0_663, main_~i~0=v_main_~i~0_203, main_#t~post4=|v_main_#t~post4_391|, main_#t~post5=|v_main_#t~post5_391|, main_~n~0=v_main_~n~0_69, main_#t~post3=|v_main_#t~post3_153|} OutVars{main_~m~0=v_main_~m~0_163, main_~k~0=v_main_~k~0_593, main_~j~0=v_main_~j~0_648, main_~i~0=v_main_~i~0_202, main_#t~post4=|v_main_#t~post4_378|, main_#t~post5=|v_main_#t~post5_378|, main_#t~post3=|v_main_#t~post3_151|, main_~n~0=v_main_~n~0_69} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {11110#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:23:59,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {11110#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [122] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11110#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:23:59,576 INFO L290 TraceCheckUtils]: 10: Hoare triple {11110#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [123] L31-3-->L31-4_primed: Formula: (let ((.cse2 (= v_main_~k~0_607 v_main_~k~0_596)) (.cse3 (= |v_main_#t~post5_394| |v_main_#t~post5_380|)) (.cse4 (= |v_main_#t~post3_156| |v_main_#t~post3_152|)) (.cse5 (= |v_main_#t~post4_394| |v_main_#t~post4_380|)) (.cse6 (= v_main_~j~0_666 v_main_~j~0_651)) (.cse1 (<= v_main_~m~0_164 11)) (.cse0 (< 10 v_main_~m~0_164)) (.cse7 (= v_main_~i~0_205 v_main_~i~0_204))) (or (and (< v_main_~i~0_204 (+ v_main_~n~0_70 1)) (= v_main_~j~0_651 11) .cse0 (= (+ v_main_~k~0_596 (* 11 v_main_~i~0_205)) (+ v_main_~k~0_607 (* 11 v_main_~i~0_204))) (< v_main_~i~0_205 v_main_~i~0_204) .cse1) (and .cse2 .cse3 .cse4 (= v_main_~n~0_70 v_main_~n~0_70) .cse5 .cse6 (= v_main_~m~0_164 v_main_~m~0_164) .cse7) (and .cse2 .cse3 .cse4 .cse5 .cse6 (or (not (< v_main_~i~0_205 v_main_~n~0_70)) (not .cse1) (not .cse0)) .cse7))) InVars {main_~m~0=v_main_~m~0_164, main_~k~0=v_main_~k~0_607, main_~j~0=v_main_~j~0_666, main_~i~0=v_main_~i~0_205, main_#t~post4=|v_main_#t~post4_394|, main_#t~post5=|v_main_#t~post5_394|, main_~n~0=v_main_~n~0_70, main_#t~post3=|v_main_#t~post3_156|} OutVars{main_~m~0=v_main_~m~0_164, main_~k~0=v_main_~k~0_596, main_~j~0=v_main_~j~0_651, main_~i~0=v_main_~i~0_204, main_#t~post4=|v_main_#t~post4_380|, main_#t~post5=|v_main_#t~post5_380|, main_#t~post3=|v_main_#t~post3_152|, main_~n~0=v_main_~n~0_70} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {11120#(and (<= 10 main_~n~0) (or (and (< (div main_~k~0 (- 11)) 0) (<= (+ main_~i~0 (div main_~k~0 (- 11))) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:23:59,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {11120#(and (<= 10 main_~n~0) (or (and (< (div main_~k~0 (- 11)) 0) (<= (+ main_~i~0 (div main_~k~0 (- 11))) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [120] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {11124#(<= (+ (div main_~k~0 (- 11)) 10) 0)} is VALID [2022-04-28 03:23:59,578 INFO L272 TraceCheckUtils]: 12: Hoare triple {11124#(<= (+ (div main_~k~0 (- 11)) 10) 0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {11128#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:23:59,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {11128#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11132#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:23:59,578 INFO L290 TraceCheckUtils]: 14: Hoare triple {11132#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11071#false} is VALID [2022-04-28 03:23:59,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {11071#false} assume !false; {11071#false} is VALID [2022-04-28 03:23:59,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:23:59,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:24:00,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {11071#false} assume !false; {11071#false} is VALID [2022-04-28 03:24:00,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {11132#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11071#false} is VALID [2022-04-28 03:24:00,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {11128#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11132#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:24:00,368 INFO L272 TraceCheckUtils]: 12: Hoare triple {11080#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {11128#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:24:00,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {11151#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} [120] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {11080#(<= 100 main_~k~0)} is VALID [2022-04-28 03:24:00,369 INFO L290 TraceCheckUtils]: 10: Hoare triple {11155#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 11))) main_~n~0) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 11)) (not (< 10 main_~m~0))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [123] L31-3-->L31-4_primed: Formula: (let ((.cse2 (= v_main_~k~0_607 v_main_~k~0_596)) (.cse3 (= |v_main_#t~post5_394| |v_main_#t~post5_380|)) (.cse4 (= |v_main_#t~post3_156| |v_main_#t~post3_152|)) (.cse5 (= |v_main_#t~post4_394| |v_main_#t~post4_380|)) (.cse6 (= v_main_~j~0_666 v_main_~j~0_651)) (.cse1 (<= v_main_~m~0_164 11)) (.cse0 (< 10 v_main_~m~0_164)) (.cse7 (= v_main_~i~0_205 v_main_~i~0_204))) (or (and (< v_main_~i~0_204 (+ v_main_~n~0_70 1)) (= v_main_~j~0_651 11) .cse0 (= (+ v_main_~k~0_596 (* 11 v_main_~i~0_205)) (+ v_main_~k~0_607 (* 11 v_main_~i~0_204))) (< v_main_~i~0_205 v_main_~i~0_204) .cse1) (and .cse2 .cse3 .cse4 (= v_main_~n~0_70 v_main_~n~0_70) .cse5 .cse6 (= v_main_~m~0_164 v_main_~m~0_164) .cse7) (and .cse2 .cse3 .cse4 .cse5 .cse6 (or (not (< v_main_~i~0_205 v_main_~n~0_70)) (not .cse1) (not .cse0)) .cse7))) InVars {main_~m~0=v_main_~m~0_164, main_~k~0=v_main_~k~0_607, main_~j~0=v_main_~j~0_666, main_~i~0=v_main_~i~0_205, main_#t~post4=|v_main_#t~post4_394|, main_#t~post5=|v_main_#t~post5_394|, main_~n~0=v_main_~n~0_70, main_#t~post3=|v_main_#t~post3_156|} OutVars{main_~m~0=v_main_~m~0_164, main_~k~0=v_main_~k~0_596, main_~j~0=v_main_~j~0_651, main_~i~0=v_main_~i~0_204, main_#t~post4=|v_main_#t~post4_380|, main_#t~post5=|v_main_#t~post5_380|, main_#t~post3=|v_main_#t~post3_152|, main_~n~0=v_main_~n~0_70} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {11151#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} is VALID [2022-04-28 03:24:00,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {11155#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 11))) main_~n~0) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 11)) (not (< 10 main_~m~0))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [122] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11155#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 11))) main_~n~0) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 11)) (not (< 10 main_~m~0))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:24:00,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {11162#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 11))) main_~n~0) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 11)) (not (< 10 main_~m~0))) (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 2))) main_~n~0) (not (< 1 main_~m~0)) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 2))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [121] L31-3-->L31-4_primed: Formula: (let ((.cse2 (< 1 v_main_~m~0_163)) (.cse3 (<= v_main_~m~0_163 2)) (.cse0 (= v_main_~k~0_595 v_main_~k~0_593)) (.cse1 (= v_main_~j~0_663 v_main_~j~0_648)) (.cse4 (= |v_main_#t~post3_153| |v_main_#t~post3_151|)) (.cse5 (= |v_main_#t~post4_391| |v_main_#t~post4_378|)) (.cse6 (= |v_main_#t~post5_391| |v_main_#t~post5_378|))) (or (and .cse0 .cse1 (or (not .cse2) (not .cse3) (not (< v_main_~i~0_203 v_main_~n~0_69))) .cse4 .cse5 (= v_main_~i~0_202 v_main_~i~0_203) .cse6) (and .cse2 (< v_main_~i~0_203 v_main_~i~0_202) (< v_main_~i~0_202 (+ v_main_~n~0_69 1)) (= v_main_~j~0_648 2) .cse3 (= (+ (* 2 v_main_~i~0_203) v_main_~k~0_593) (+ v_main_~k~0_595 (* 2 v_main_~i~0_202)))) (and .cse0 .cse1 (= v_main_~m~0_163 v_main_~m~0_163) .cse4 (= v_main_~n~0_69 v_main_~n~0_69) .cse5 .cse6 (= v_main_~i~0_203 v_main_~i~0_202)))) InVars {main_~m~0=v_main_~m~0_163, main_~k~0=v_main_~k~0_595, main_~j~0=v_main_~j~0_663, main_~i~0=v_main_~i~0_203, main_#t~post4=|v_main_#t~post4_391|, main_#t~post5=|v_main_#t~post5_391|, main_~n~0=v_main_~n~0_69, main_#t~post3=|v_main_#t~post3_153|} OutVars{main_~m~0=v_main_~m~0_163, main_~k~0=v_main_~k~0_593, main_~j~0=v_main_~j~0_648, main_~i~0=v_main_~i~0_202, main_#t~post4=|v_main_#t~post4_378|, main_#t~post5=|v_main_#t~post5_378|, main_#t~post3=|v_main_#t~post3_151|, main_~n~0=v_main_~n~0_69} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {11155#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 11))) main_~n~0) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 11)) (not (< 10 main_~m~0))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:24:00,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {11166#(and (or (<= (div (+ (- 100) main_~k~0) (- 11)) 1) (<= (div (+ (- 100) main_~k~0) (- 11)) main_~n~0)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {11162#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 11))) main_~n~0) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 11)) (not (< 10 main_~m~0))) (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 2))) main_~n~0) (not (< 1 main_~m~0)) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 2))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:24:00,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {11170#(<= (div (+ (- 100) main_~k~0) (- 11)) 10)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {11166#(and (or (<= (div (+ (- 100) main_~k~0) (- 11)) 1) (<= (div (+ (- 100) main_~k~0) (- 11)) main_~n~0)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} is VALID [2022-04-28 03:24:00,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {11070#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {11170#(<= (div (+ (- 100) main_~k~0) (- 11)) 10)} is VALID [2022-04-28 03:24:00,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {11070#true} call #t~ret6 := main(); {11070#true} is VALID [2022-04-28 03:24:00,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11070#true} {11070#true} #71#return; {11070#true} is VALID [2022-04-28 03:24:00,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-04-28 03:24:00,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {11070#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); {11070#true} is VALID [2022-04-28 03:24:00,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {11070#true} call ULTIMATE.init(); {11070#true} is VALID [2022-04-28 03:24:00,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:24:00,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480753228] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:24:00,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:24:00,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 23 [2022-04-28 03:24:01,389 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:24:01,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1646982751] [2022-04-28 03:24:01,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1646982751] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:24:01,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:24:01,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-28 03:24:01,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520604911] [2022-04-28 03:24:01,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:24:01,390 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 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 45 [2022-04-28 03:24:01,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:24:01,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:01,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:24:01,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-28 03:24:01,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:24:01,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-28 03:24:01,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=471, Invalid=2285, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 03:24:01,424 INFO L87 Difference]: Start difference. First operand 185 states and 235 transitions. Second operand has 39 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:04,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:24:04,682 INFO L93 Difference]: Finished difference Result 197 states and 249 transitions. [2022-04-28 03:24:04,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 03:24:04,683 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 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 45 [2022-04-28 03:24:04,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:24:04,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:04,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 63 transitions. [2022-04-28 03:24:04,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:04,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 63 transitions. [2022-04-28 03:24:04,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 63 transitions. [2022-04-28 03:24:04,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:24:04,729 INFO L225 Difference]: With dead ends: 197 [2022-04-28 03:24:04,729 INFO L226 Difference]: Without dead ends: 188 [2022-04-28 03:24:04,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1993 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=929, Invalid=6381, Unknown=0, NotChecked=0, Total=7310 [2022-04-28 03:24:04,730 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 1431 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 1458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:24:04,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 185 Invalid, 1458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1431 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 03:24:04,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-04-28 03:24:05,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2022-04-28 03:24:05,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:24:05,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand has 187 states, 182 states have (on average 1.2802197802197801) internal successors, (233), 182 states have internal predecessors, (233), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:05,439 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand has 187 states, 182 states have (on average 1.2802197802197801) internal successors, (233), 182 states have internal predecessors, (233), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:05,439 INFO L87 Difference]: Start difference. First operand 188 states. Second operand has 187 states, 182 states have (on average 1.2802197802197801) internal successors, (233), 182 states have internal predecessors, (233), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:05,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:24:05,442 INFO L93 Difference]: Finished difference Result 188 states and 238 transitions. [2022-04-28 03:24:05,442 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 238 transitions. [2022-04-28 03:24:05,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:24:05,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:24:05,442 INFO L74 IsIncluded]: Start isIncluded. First operand has 187 states, 182 states have (on average 1.2802197802197801) internal successors, (233), 182 states have internal predecessors, (233), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 188 states. [2022-04-28 03:24:05,442 INFO L87 Difference]: Start difference. First operand has 187 states, 182 states have (on average 1.2802197802197801) internal successors, (233), 182 states have internal predecessors, (233), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 188 states. [2022-04-28 03:24:05,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:24:05,444 INFO L93 Difference]: Finished difference Result 188 states and 238 transitions. [2022-04-28 03:24:05,444 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 238 transitions. [2022-04-28 03:24:05,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:24:05,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:24:05,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:24:05,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:24:05,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 182 states have (on average 1.2802197802197801) internal successors, (233), 182 states have internal predecessors, (233), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:05,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 237 transitions. [2022-04-28 03:24:05,447 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 237 transitions. Word has length 45 [2022-04-28 03:24:05,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:24:05,447 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 237 transitions. [2022-04-28 03:24:05,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:05,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 187 states and 237 transitions. [2022-04-28 03:24:06,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 237 edges. 237 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:24:06,245 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 237 transitions. [2022-04-28 03:24:06,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 03:24:06,249 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:24:06,250 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:24:06,265 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 03:24:06,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:24:06,450 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:24:06,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:24:06,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1060907998, now seen corresponding path program 20 times [2022-04-28 03:24:06,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:24:06,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1011421702] [2022-04-28 03:24:06,612 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:24:06,867 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:24:10,976 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:24:11,084 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:24:11,085 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:24:11,088 INFO L85 PathProgramCache]: Analyzing trace with hash 558151489, now seen corresponding path program 1 times [2022-04-28 03:24:11,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:24:11,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955658950] [2022-04-28 03:24:11,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:24:11,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:24:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:24:11,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:24:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:24:11,186 INFO L290 TraceCheckUtils]: 0: Hoare triple {12444#(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); {12431#true} is VALID [2022-04-28 03:24:11,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {12431#true} assume true; {12431#true} is VALID [2022-04-28 03:24:11,186 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12431#true} {12431#true} #71#return; {12431#true} is VALID [2022-04-28 03:24:11,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {12431#true} call ULTIMATE.init(); {12444#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:24:11,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {12444#(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); {12431#true} is VALID [2022-04-28 03:24:11,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {12431#true} assume true; {12431#true} is VALID [2022-04-28 03:24:11,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12431#true} {12431#true} #71#return; {12431#true} is VALID [2022-04-28 03:24:11,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {12431#true} call #t~ret6 := main(); {12431#true} is VALID [2022-04-28 03:24:11,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {12431#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {12436#(= main_~k~0 0)} is VALID [2022-04-28 03:24:11,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {12436#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {12437#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:24:11,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {12437#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {12438#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:24:11,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {12438#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} [125] L31-3-->L31-4_primed: Formula: (let ((.cse1 (= |v_main_#t~post3_168| |v_main_#t~post3_166|)) (.cse0 (<= v_main_~m~0_174 0)) (.cse2 (= v_main_~i~0_224 v_main_~i~0_223))) (or (and (< v_main_~i~0_223 (+ v_main_~n~0_75 1)) (< v_main_~i~0_224 v_main_~i~0_223) .cse0 (= v_main_~j~0_701 0)) (and (= v_main_~m~0_174 v_main_~m~0_174) (= v_main_~n~0_75 v_main_~n~0_75) .cse1 (= v_main_~j~0_716 v_main_~j~0_701) .cse2) (and .cse1 (= v_main_~j~0_701 v_main_~j~0_716) (or (not .cse0) (not (< v_main_~i~0_224 v_main_~n~0_75))) .cse2))) InVars {main_~i~0=v_main_~i~0_224, main_~n~0=v_main_~n~0_75, main_#t~post3=|v_main_#t~post3_168|, main_~m~0=v_main_~m~0_174, main_~j~0=v_main_~j~0_716} OutVars{main_~i~0=v_main_~i~0_223, main_#t~post3=|v_main_#t~post3_166|, main_~n~0=v_main_~n~0_75, main_~m~0=v_main_~m~0_174, main_~j~0=v_main_~j~0_701} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post3] {12439#(and (= main_~k~0 0) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:24:11,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {12439#(and (= main_~k~0 0) (<= (+ main_~i~0 10) main_~n~0))} [126] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12439#(and (= main_~k~0 0) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:24:11,189 INFO L290 TraceCheckUtils]: 10: Hoare triple {12439#(and (= main_~k~0 0) (<= (+ main_~i~0 10) main_~n~0))} [127] L31-3-->L31-4_primed: Formula: (let ((.cse0 (< 12 v_main_~m~0_175)) (.cse1 (<= v_main_~m~0_175 13)) (.cse2 (= v_main_~i~0_226 v_main_~i~0_225)) (.cse3 (= |v_main_#t~post3_171| |v_main_#t~post3_167|))) (or (and .cse0 (= (+ v_main_~k~0_643 (* 13 v_main_~i~0_226)) (+ v_main_~k~0_656 (* 13 v_main_~i~0_225))) (< v_main_~i~0_226 v_main_~i~0_225) (= v_main_~j~0_702 13) .cse1 (< v_main_~i~0_225 (+ v_main_~n~0_76 1))) (and (= |v_main_#t~post4_410| |v_main_#t~post4_423|) (= |v_main_#t~post5_410| |v_main_#t~post5_423|) (= v_main_~j~0_702 v_main_~j~0_719) (= v_main_~k~0_643 v_main_~k~0_656) (or (not (< v_main_~i~0_226 v_main_~n~0_76)) (not .cse0) (not .cse1)) .cse2 .cse3) (and (= |v_main_#t~post4_423| |v_main_#t~post4_410|) (= |v_main_#t~post5_423| |v_main_#t~post5_410|) (= v_main_~n~0_76 v_main_~n~0_76) (= v_main_~j~0_719 v_main_~j~0_702) (= v_main_~m~0_175 v_main_~m~0_175) .cse2 .cse3 (= v_main_~k~0_656 v_main_~k~0_643)))) InVars {main_~m~0=v_main_~m~0_175, main_~k~0=v_main_~k~0_656, main_~j~0=v_main_~j~0_719, main_~i~0=v_main_~i~0_226, main_#t~post4=|v_main_#t~post4_423|, main_#t~post5=|v_main_#t~post5_423|, main_~n~0=v_main_~n~0_76, main_#t~post3=|v_main_#t~post3_171|} OutVars{main_~m~0=v_main_~m~0_175, main_~k~0=v_main_~k~0_643, main_~j~0=v_main_~j~0_702, main_~i~0=v_main_~i~0_225, main_#t~post4=|v_main_#t~post4_410|, main_#t~post5=|v_main_#t~post5_410|, main_#t~post3=|v_main_#t~post3_167|, main_~n~0=v_main_~n~0_76} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {12440#(or (<= (+ (* main_~i~0 13) 130) (+ (* main_~n~0 13) main_~k~0)) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:24:11,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {12440#(or (<= (+ (* main_~i~0 13) 130) (+ (* main_~n~0 13) main_~k~0)) (<= (+ main_~i~0 10) main_~n~0))} [124] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {12441#(<= 130 main_~k~0)} is VALID [2022-04-28 03:24:11,190 INFO L272 TraceCheckUtils]: 12: Hoare triple {12441#(<= 130 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {12442#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:24:11,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {12442#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {12443#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:24:11,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {12443#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {12432#false} is VALID [2022-04-28 03:24:11,191 INFO L290 TraceCheckUtils]: 15: Hoare triple {12432#false} assume !false; {12432#false} is VALID [2022-04-28 03:24:11,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:24:11,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:24:11,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955658950] [2022-04-28 03:24:11,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955658950] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:24:11,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969385465] [2022-04-28 03:24:11,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:24:11,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:24:11,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:24:11,192 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:24:11,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 03:24:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:24:11,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:24:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:24:11,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:24:11,672 INFO L272 TraceCheckUtils]: 0: Hoare triple {12431#true} call ULTIMATE.init(); {12431#true} is VALID [2022-04-28 03:24:11,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {12431#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); {12431#true} is VALID [2022-04-28 03:24:11,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {12431#true} assume true; {12431#true} is VALID [2022-04-28 03:24:11,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12431#true} {12431#true} #71#return; {12431#true} is VALID [2022-04-28 03:24:11,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {12431#true} call #t~ret6 := main(); {12431#true} is VALID [2022-04-28 03:24:11,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {12431#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {12463#(<= 0 main_~k~0)} is VALID [2022-04-28 03:24:11,673 INFO L290 TraceCheckUtils]: 6: Hoare triple {12463#(<= 0 main_~k~0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {12467#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} is VALID [2022-04-28 03:24:11,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {12467#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {12471#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:24:11,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {12471#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [125] L31-3-->L31-4_primed: Formula: (let ((.cse1 (= |v_main_#t~post3_168| |v_main_#t~post3_166|)) (.cse0 (<= v_main_~m~0_174 0)) (.cse2 (= v_main_~i~0_224 v_main_~i~0_223))) (or (and (< v_main_~i~0_223 (+ v_main_~n~0_75 1)) (< v_main_~i~0_224 v_main_~i~0_223) .cse0 (= v_main_~j~0_701 0)) (and (= v_main_~m~0_174 v_main_~m~0_174) (= v_main_~n~0_75 v_main_~n~0_75) .cse1 (= v_main_~j~0_716 v_main_~j~0_701) .cse2) (and .cse1 (= v_main_~j~0_701 v_main_~j~0_716) (or (not .cse0) (not (< v_main_~i~0_224 v_main_~n~0_75))) .cse2))) InVars {main_~i~0=v_main_~i~0_224, main_~n~0=v_main_~n~0_75, main_#t~post3=|v_main_#t~post3_168|, main_~m~0=v_main_~m~0_174, main_~j~0=v_main_~j~0_716} OutVars{main_~i~0=v_main_~i~0_223, main_#t~post3=|v_main_#t~post3_166|, main_~n~0=v_main_~n~0_75, main_~m~0=v_main_~m~0_174, main_~j~0=v_main_~j~0_701} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post3] {12471#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:24:11,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {12471#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [126] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12471#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:24:11,676 INFO L290 TraceCheckUtils]: 10: Hoare triple {12471#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [127] L31-3-->L31-4_primed: Formula: (let ((.cse0 (< 12 v_main_~m~0_175)) (.cse1 (<= v_main_~m~0_175 13)) (.cse2 (= v_main_~i~0_226 v_main_~i~0_225)) (.cse3 (= |v_main_#t~post3_171| |v_main_#t~post3_167|))) (or (and .cse0 (= (+ v_main_~k~0_643 (* 13 v_main_~i~0_226)) (+ v_main_~k~0_656 (* 13 v_main_~i~0_225))) (< v_main_~i~0_226 v_main_~i~0_225) (= v_main_~j~0_702 13) .cse1 (< v_main_~i~0_225 (+ v_main_~n~0_76 1))) (and (= |v_main_#t~post4_410| |v_main_#t~post4_423|) (= |v_main_#t~post5_410| |v_main_#t~post5_423|) (= v_main_~j~0_702 v_main_~j~0_719) (= v_main_~k~0_643 v_main_~k~0_656) (or (not (< v_main_~i~0_226 v_main_~n~0_76)) (not .cse0) (not .cse1)) .cse2 .cse3) (and (= |v_main_#t~post4_423| |v_main_#t~post4_410|) (= |v_main_#t~post5_423| |v_main_#t~post5_410|) (= v_main_~n~0_76 v_main_~n~0_76) (= v_main_~j~0_719 v_main_~j~0_702) (= v_main_~m~0_175 v_main_~m~0_175) .cse2 .cse3 (= v_main_~k~0_656 v_main_~k~0_643)))) InVars {main_~m~0=v_main_~m~0_175, main_~k~0=v_main_~k~0_656, main_~j~0=v_main_~j~0_719, main_~i~0=v_main_~i~0_226, main_#t~post4=|v_main_#t~post4_423|, main_#t~post5=|v_main_#t~post5_423|, main_~n~0=v_main_~n~0_76, main_#t~post3=|v_main_#t~post3_171|} OutVars{main_~m~0=v_main_~m~0_175, main_~k~0=v_main_~k~0_643, main_~j~0=v_main_~j~0_702, main_~i~0=v_main_~i~0_225, main_#t~post4=|v_main_#t~post4_410|, main_#t~post5=|v_main_#t~post5_410|, main_#t~post3=|v_main_#t~post3_167|, main_~n~0=v_main_~n~0_76} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {12481#(and (<= 10 main_~n~0) (or (and (<= (+ main_~i~0 (div main_~k~0 (- 13))) 0) (< (div main_~k~0 (- 13)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:24:11,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {12481#(and (<= 10 main_~n~0) (or (and (<= (+ main_~i~0 (div main_~k~0 (- 13))) 0) (< (div main_~k~0 (- 13)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [124] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {12441#(<= 130 main_~k~0)} is VALID [2022-04-28 03:24:11,677 INFO L272 TraceCheckUtils]: 12: Hoare triple {12441#(<= 130 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {12488#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:24:11,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {12488#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12492#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:24:11,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {12492#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12432#false} is VALID [2022-04-28 03:24:11,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {12432#false} assume !false; {12432#false} is VALID [2022-04-28 03:24:11,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:24:11,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:24:12,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {12432#false} assume !false; {12432#false} is VALID [2022-04-28 03:24:12,345 INFO L290 TraceCheckUtils]: 14: Hoare triple {12492#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12432#false} is VALID [2022-04-28 03:24:12,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {12488#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12492#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:24:12,346 INFO L272 TraceCheckUtils]: 12: Hoare triple {12508#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {12488#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:24:12,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {12512#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} [124] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {12508#(<= 100 main_~k~0)} is VALID [2022-04-28 03:24:12,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {12516#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 13))) main_~n~0) (<= main_~n~0 main_~i~0) (not (< 12 main_~m~0)) (not (<= main_~m~0 13))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [127] L31-3-->L31-4_primed: Formula: (let ((.cse0 (< 12 v_main_~m~0_175)) (.cse1 (<= v_main_~m~0_175 13)) (.cse2 (= v_main_~i~0_226 v_main_~i~0_225)) (.cse3 (= |v_main_#t~post3_171| |v_main_#t~post3_167|))) (or (and .cse0 (= (+ v_main_~k~0_643 (* 13 v_main_~i~0_226)) (+ v_main_~k~0_656 (* 13 v_main_~i~0_225))) (< v_main_~i~0_226 v_main_~i~0_225) (= v_main_~j~0_702 13) .cse1 (< v_main_~i~0_225 (+ v_main_~n~0_76 1))) (and (= |v_main_#t~post4_410| |v_main_#t~post4_423|) (= |v_main_#t~post5_410| |v_main_#t~post5_423|) (= v_main_~j~0_702 v_main_~j~0_719) (= v_main_~k~0_643 v_main_~k~0_656) (or (not (< v_main_~i~0_226 v_main_~n~0_76)) (not .cse0) (not .cse1)) .cse2 .cse3) (and (= |v_main_#t~post4_423| |v_main_#t~post4_410|) (= |v_main_#t~post5_423| |v_main_#t~post5_410|) (= v_main_~n~0_76 v_main_~n~0_76) (= v_main_~j~0_719 v_main_~j~0_702) (= v_main_~m~0_175 v_main_~m~0_175) .cse2 .cse3 (= v_main_~k~0_656 v_main_~k~0_643)))) InVars {main_~m~0=v_main_~m~0_175, main_~k~0=v_main_~k~0_656, main_~j~0=v_main_~j~0_719, main_~i~0=v_main_~i~0_226, main_#t~post4=|v_main_#t~post4_423|, main_#t~post5=|v_main_#t~post5_423|, main_~n~0=v_main_~n~0_76, main_#t~post3=|v_main_#t~post3_171|} OutVars{main_~m~0=v_main_~m~0_175, main_~k~0=v_main_~k~0_643, main_~j~0=v_main_~j~0_702, main_~i~0=v_main_~i~0_225, main_#t~post4=|v_main_#t~post4_410|, main_#t~post5=|v_main_#t~post5_410|, main_#t~post3=|v_main_#t~post3_167|, main_~n~0=v_main_~n~0_76} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {12512#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} is VALID [2022-04-28 03:24:12,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {12516#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 13))) main_~n~0) (<= main_~n~0 main_~i~0) (not (< 12 main_~m~0)) (not (<= main_~m~0 13))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [126] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12516#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 13))) main_~n~0) (<= main_~n~0 main_~i~0) (not (< 12 main_~m~0)) (not (<= main_~m~0 13))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:24:12,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {12523#(and (or (<= 100 main_~k~0) (not (<= main_~m~0 0))) (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 13))) main_~n~0) (<= main_~n~0 main_~i~0) (not (< 12 main_~m~0)) (not (<= main_~m~0 13))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [125] L31-3-->L31-4_primed: Formula: (let ((.cse1 (= |v_main_#t~post3_168| |v_main_#t~post3_166|)) (.cse0 (<= v_main_~m~0_174 0)) (.cse2 (= v_main_~i~0_224 v_main_~i~0_223))) (or (and (< v_main_~i~0_223 (+ v_main_~n~0_75 1)) (< v_main_~i~0_224 v_main_~i~0_223) .cse0 (= v_main_~j~0_701 0)) (and (= v_main_~m~0_174 v_main_~m~0_174) (= v_main_~n~0_75 v_main_~n~0_75) .cse1 (= v_main_~j~0_716 v_main_~j~0_701) .cse2) (and .cse1 (= v_main_~j~0_701 v_main_~j~0_716) (or (not .cse0) (not (< v_main_~i~0_224 v_main_~n~0_75))) .cse2))) InVars {main_~i~0=v_main_~i~0_224, main_~n~0=v_main_~n~0_75, main_#t~post3=|v_main_#t~post3_168|, main_~m~0=v_main_~m~0_174, main_~j~0=v_main_~j~0_716} OutVars{main_~i~0=v_main_~i~0_223, main_#t~post3=|v_main_#t~post3_166|, main_~n~0=v_main_~n~0_75, main_~m~0=v_main_~m~0_174, main_~j~0=v_main_~j~0_701} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post3] {12516#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 13))) main_~n~0) (<= main_~n~0 main_~i~0) (not (< 12 main_~m~0)) (not (<= main_~m~0 13))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:24:12,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {12527#(and (or (<= (div (+ (- 100) main_~k~0) (- 13)) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 13)) 1)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {12523#(and (or (<= 100 main_~k~0) (not (<= main_~m~0 0))) (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 13))) main_~n~0) (<= main_~n~0 main_~i~0) (not (< 12 main_~m~0)) (not (<= main_~m~0 13))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:24:12,350 INFO L290 TraceCheckUtils]: 6: Hoare triple {12531#(<= (div (+ (- 100) main_~k~0) (- 13)) 10)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {12527#(and (or (<= (div (+ (- 100) main_~k~0) (- 13)) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 13)) 1)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} is VALID [2022-04-28 03:24:12,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {12431#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {12531#(<= (div (+ (- 100) main_~k~0) (- 13)) 10)} is VALID [2022-04-28 03:24:12,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {12431#true} call #t~ret6 := main(); {12431#true} is VALID [2022-04-28 03:24:12,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12431#true} {12431#true} #71#return; {12431#true} is VALID [2022-04-28 03:24:12,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {12431#true} assume true; {12431#true} is VALID [2022-04-28 03:24:12,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {12431#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); {12431#true} is VALID [2022-04-28 03:24:12,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {12431#true} call ULTIMATE.init(); {12431#true} is VALID [2022-04-28 03:24:12,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:24:12,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969385465] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:24:12,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:24:12,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 23 [2022-04-28 03:24:13,355 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:24:13,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1011421702] [2022-04-28 03:24:13,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1011421702] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:24:13,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:24:13,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-28 03:24:13,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175120645] [2022-04-28 03:24:13,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:24:13,356 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 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 45 [2022-04-28 03:24:13,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:24:13,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:13,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:24:13,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-28 03:24:13,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:24:13,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-28 03:24:13,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=471, Invalid=2285, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 03:24:13,386 INFO L87 Difference]: Start difference. First operand 187 states and 237 transitions. Second operand has 39 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:16,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:24:16,974 INFO L93 Difference]: Finished difference Result 201 states and 253 transitions. [2022-04-28 03:24:16,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 03:24:16,975 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 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 45 [2022-04-28 03:24:16,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:24:16,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:16,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 67 transitions. [2022-04-28 03:24:16,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:16,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 67 transitions. [2022-04-28 03:24:16,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 67 transitions. [2022-04-28 03:24:17,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:24:17,030 INFO L225 Difference]: With dead ends: 201 [2022-04-28 03:24:17,030 INFO L226 Difference]: Without dead ends: 192 [2022-04-28 03:24:17,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1811 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=933, Invalid=6377, Unknown=0, NotChecked=0, Total=7310 [2022-04-28 03:24:17,032 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 25 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 1612 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 1642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:24:17,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 190 Invalid, 1642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1612 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 03:24:17,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-04-28 03:24:17,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190. [2022-04-28 03:24:17,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:24:17,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 192 states. Second operand has 190 states, 185 states have (on average 1.2756756756756757) internal successors, (236), 185 states have internal predecessors, (236), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:17,749 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand has 190 states, 185 states have (on average 1.2756756756756757) internal successors, (236), 185 states have internal predecessors, (236), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:17,749 INFO L87 Difference]: Start difference. First operand 192 states. Second operand has 190 states, 185 states have (on average 1.2756756756756757) internal successors, (236), 185 states have internal predecessors, (236), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:17,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:24:17,752 INFO L93 Difference]: Finished difference Result 192 states and 242 transitions. [2022-04-28 03:24:17,752 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 242 transitions. [2022-04-28 03:24:17,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:24:17,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:24:17,753 INFO L74 IsIncluded]: Start isIncluded. First operand has 190 states, 185 states have (on average 1.2756756756756757) internal successors, (236), 185 states have internal predecessors, (236), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 192 states. [2022-04-28 03:24:17,753 INFO L87 Difference]: Start difference. First operand has 190 states, 185 states have (on average 1.2756756756756757) internal successors, (236), 185 states have internal predecessors, (236), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 192 states. [2022-04-28 03:24:17,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:24:17,756 INFO L93 Difference]: Finished difference Result 192 states and 242 transitions. [2022-04-28 03:24:17,756 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 242 transitions. [2022-04-28 03:24:17,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:24:17,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:24:17,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:24:17,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:24:17,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 185 states have (on average 1.2756756756756757) internal successors, (236), 185 states have internal predecessors, (236), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:17,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 240 transitions. [2022-04-28 03:24:17,759 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 240 transitions. Word has length 45 [2022-04-28 03:24:17,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:24:17,759 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 240 transitions. [2022-04-28 03:24:17,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:17,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 190 states and 240 transitions. [2022-04-28 03:24:18,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:24:18,340 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 240 transitions. [2022-04-28 03:24:18,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-28 03:24:18,340 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:24:18,340 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:24:18,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 03:24:18,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:24:18,541 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:24:18,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:24:18,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1677561019, now seen corresponding path program 21 times [2022-04-28 03:24:18,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:24:18,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [23817210] [2022-04-28 03:24:18,685 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:24:19,018 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:24:19,020 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:24:19,022 INFO L85 PathProgramCache]: Analyzing trace with hash 816797346, now seen corresponding path program 1 times [2022-04-28 03:24:19,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:24:19,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839237227] [2022-04-28 03:24:19,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:24:19,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:24:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:24:19,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:24:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:24:19,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {13826#(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); {13814#true} is VALID [2022-04-28 03:24:19,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {13814#true} assume true; {13814#true} is VALID [2022-04-28 03:24:19,101 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13814#true} {13814#true} #71#return; {13814#true} is VALID [2022-04-28 03:24:19,101 INFO L272 TraceCheckUtils]: 0: Hoare triple {13814#true} call ULTIMATE.init(); {13826#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:24:19,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {13826#(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); {13814#true} is VALID [2022-04-28 03:24:19,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {13814#true} assume true; {13814#true} is VALID [2022-04-28 03:24:19,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13814#true} {13814#true} #71#return; {13814#true} is VALID [2022-04-28 03:24:19,101 INFO L272 TraceCheckUtils]: 4: Hoare triple {13814#true} call #t~ret6 := main(); {13814#true} is VALID [2022-04-28 03:24:19,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {13814#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {13819#(= main_~k~0 0)} is VALID [2022-04-28 03:24:19,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {13819#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {13820#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:24:19,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {13820#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {13821#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:24:19,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {13821#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [129] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= v_main_~j~0_768 v_main_~j~0_752)) (.cse1 (= |v_main_#t~post4_451| |v_main_#t~post4_436|)) (.cse2 (= |v_main_#t~post3_181| |v_main_#t~post3_180|)) (.cse3 (= v_main_~k~0_701 v_main_~k~0_686)) (.cse4 (= v_main_~i~0_243 v_main_~i~0_242)) (.cse5 (= |v_main_#t~post5_451| |v_main_#t~post5_436|)) (.cse6 (< 14 v_main_~m~0_184)) (.cse7 (<= v_main_~m~0_184 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~m~0_184 v_main_~m~0_184) (= v_main_~n~0_80 v_main_~n~0_80) .cse5) (and .cse0 .cse1 .cse2 (or (not .cse6) (not (< v_main_~i~0_243 v_main_~n~0_80)) (not .cse7)) .cse3 .cse4 .cse5) (and (< v_main_~i~0_242 (+ v_main_~n~0_80 1)) .cse6 (= v_main_~j~0_752 15) (< v_main_~i~0_243 v_main_~i~0_242) .cse7 (= (+ v_main_~k~0_686 (* 15 v_main_~i~0_243)) (+ v_main_~k~0_701 (* 15 v_main_~i~0_242)))))) InVars {main_~m~0=v_main_~m~0_184, main_~k~0=v_main_~k~0_701, main_~j~0=v_main_~j~0_768, main_~i~0=v_main_~i~0_243, main_#t~post4=|v_main_#t~post4_451|, main_#t~post5=|v_main_#t~post5_451|, main_~n~0=v_main_~n~0_80, main_#t~post3=|v_main_#t~post3_181|} OutVars{main_~m~0=v_main_~m~0_184, main_~k~0=v_main_~k~0_686, main_~j~0=v_main_~j~0_752, main_~i~0=v_main_~i~0_242, main_#t~post4=|v_main_#t~post4_436|, main_#t~post5=|v_main_#t~post5_436|, main_#t~post3=|v_main_#t~post3_180|, main_~n~0=v_main_~n~0_80} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {13822#(or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ (* main_~i~0 15) 150) (+ main_~k~0 (* main_~n~0 15))))} is VALID [2022-04-28 03:24:19,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {13822#(or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ (* main_~i~0 15) 150) (+ main_~k~0 (* main_~n~0 15))))} [128] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {13823#(<= 150 main_~k~0)} is VALID [2022-04-28 03:24:19,104 INFO L272 TraceCheckUtils]: 10: Hoare triple {13823#(<= 150 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {13824#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:24:19,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {13824#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {13825#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:24:19,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {13825#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {13815#false} is VALID [2022-04-28 03:24:19,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {13815#false} assume !false; {13815#false} is VALID [2022-04-28 03:24:19,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:24:19,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:24:19,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839237227] [2022-04-28 03:24:19,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839237227] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:24:19,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:24:19,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:24:21,016 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:24:21,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [23817210] [2022-04-28 03:24:21,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [23817210] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:24:21,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:24:21,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-28 03:24:21,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538855561] [2022-04-28 03:24:21,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:24:21,016 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.024390243902439) internal successors, (42), 40 states have internal predecessors, (42), 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 46 [2022-04-28 03:24:21,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:24:21,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 41 states have (on average 1.024390243902439) internal successors, (42), 40 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:21,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:24:21,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-28 03:24:21,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:24:21,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-28 03:24:21,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 03:24:21,057 INFO L87 Difference]: Start difference. First operand 190 states and 240 transitions. Second operand has 42 states, 41 states have (on average 1.024390243902439) internal successors, (42), 40 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:28,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:24:28,635 INFO L93 Difference]: Finished difference Result 252 states and 321 transitions. [2022-04-28 03:24:28,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-28 03:24:28,635 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.024390243902439) internal successors, (42), 40 states have internal predecessors, (42), 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 46 [2022-04-28 03:24:28,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:24:28,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.024390243902439) internal successors, (42), 40 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:28,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 95 transitions. [2022-04-28 03:24:28,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.024390243902439) internal successors, (42), 40 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:28,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 95 transitions. [2022-04-28 03:24:28,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 95 transitions. [2022-04-28 03:24:28,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:24:28,727 INFO L225 Difference]: With dead ends: 252 [2022-04-28 03:24:28,727 INFO L226 Difference]: Without dead ends: 247 [2022-04-28 03:24:28,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1195 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=345, Invalid=6627, Unknown=0, NotChecked=0, Total=6972 [2022-04-28 03:24:28,728 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 48 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 2825 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 2862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:24:28,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 200 Invalid, 2862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2825 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-28 03:24:28,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-04-28 03:24:29,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 225. [2022-04-28 03:24:29,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:24:29,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 247 states. Second operand has 225 states, 220 states have (on average 1.309090909090909) internal successors, (288), 220 states have internal predecessors, (288), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:29,579 INFO L74 IsIncluded]: Start isIncluded. First operand 247 states. Second operand has 225 states, 220 states have (on average 1.309090909090909) internal successors, (288), 220 states have internal predecessors, (288), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:29,579 INFO L87 Difference]: Start difference. First operand 247 states. Second operand has 225 states, 220 states have (on average 1.309090909090909) internal successors, (288), 220 states have internal predecessors, (288), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:29,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:24:29,582 INFO L93 Difference]: Finished difference Result 247 states and 316 transitions. [2022-04-28 03:24:29,582 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 316 transitions. [2022-04-28 03:24:29,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:24:29,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:24:29,583 INFO L74 IsIncluded]: Start isIncluded. First operand has 225 states, 220 states have (on average 1.309090909090909) internal successors, (288), 220 states have internal predecessors, (288), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 247 states. [2022-04-28 03:24:29,583 INFO L87 Difference]: Start difference. First operand has 225 states, 220 states have (on average 1.309090909090909) internal successors, (288), 220 states have internal predecessors, (288), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 247 states. [2022-04-28 03:24:29,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:24:29,586 INFO L93 Difference]: Finished difference Result 247 states and 316 transitions. [2022-04-28 03:24:29,586 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 316 transitions. [2022-04-28 03:24:29,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:24:29,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:24:29,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:24:29,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:24:29,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 220 states have (on average 1.309090909090909) internal successors, (288), 220 states have internal predecessors, (288), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:29,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 292 transitions. [2022-04-28 03:24:29,589 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 292 transitions. Word has length 46 [2022-04-28 03:24:29,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:24:29,589 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 292 transitions. [2022-04-28 03:24:29,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.024390243902439) internal successors, (42), 40 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:29,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 225 states and 292 transitions. [2022-04-28 03:24:30,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 292 edges. 292 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:24:30,309 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 292 transitions. [2022-04-28 03:24:30,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 03:24:30,310 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:24:30,310 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:24:30,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-28 03:24:30,310 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:24:30,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:24:30,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1959965960, now seen corresponding path program 22 times [2022-04-28 03:24:30,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:24:30,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [506066264] [2022-04-28 03:24:30,629 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:24:30,797 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:24:33,410 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:24:34,761 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:24:34,860 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:24:34,861 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:24:34,864 INFO L85 PathProgramCache]: Analyzing trace with hash -662517567, now seen corresponding path program 1 times [2022-04-28 03:24:34,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:24:34,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671890658] [2022-04-28 03:24:34,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:24:34,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:24:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:24:34,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:24:34,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:24:34,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {15404#(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); {15391#true} is VALID [2022-04-28 03:24:34,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {15391#true} assume true; {15391#true} is VALID [2022-04-28 03:24:34,976 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15391#true} {15391#true} #71#return; {15391#true} is VALID [2022-04-28 03:24:34,976 INFO L272 TraceCheckUtils]: 0: Hoare triple {15391#true} call ULTIMATE.init(); {15404#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:24:34,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {15404#(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); {15391#true} is VALID [2022-04-28 03:24:34,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {15391#true} assume true; {15391#true} is VALID [2022-04-28 03:24:34,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15391#true} {15391#true} #71#return; {15391#true} is VALID [2022-04-28 03:24:34,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {15391#true} call #t~ret6 := main(); {15391#true} is VALID [2022-04-28 03:24:34,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {15391#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {15396#(= main_~k~0 0)} is VALID [2022-04-28 03:24:34,977 INFO L290 TraceCheckUtils]: 6: Hoare triple {15396#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {15397#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:24:34,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {15397#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {15398#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:24:34,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {15398#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} [131] L31-3-->L31-4_primed: Formula: (let ((.cse3 (< 10 v_main_~m~0_196)) (.cse2 (<= v_main_~m~0_196 11)) (.cse0 (= v_main_~i~0_259 v_main_~i~0_258)) (.cse1 (= v_main_~j~0_823 v_main_~j~0_807)) (.cse4 (= v_main_~k~0_748 v_main_~k~0_737)) (.cse5 (= |v_main_#t~post5_482| |v_main_#t~post5_468|)) (.cse6 (= |v_main_#t~post4_482| |v_main_#t~post4_468|))) (or (and .cse0 .cse1 (= |v_main_#t~post3_192| |v_main_#t~post3_194|) (or (not .cse2) (not .cse3) (not (< v_main_~i~0_259 v_main_~n~0_87))) .cse4 .cse5 .cse6) (and (< v_main_~i~0_259 v_main_~i~0_258) (= (+ v_main_~k~0_748 (* 11 v_main_~i~0_258)) (+ v_main_~k~0_737 (* 11 v_main_~i~0_259))) .cse3 .cse2 (= v_main_~j~0_807 11) (< v_main_~i~0_258 (+ v_main_~n~0_87 1))) (and (= |v_main_#t~post3_194| |v_main_#t~post3_192|) .cse0 .cse1 (= v_main_~m~0_196 v_main_~m~0_196) .cse4 (= v_main_~n~0_87 v_main_~n~0_87) .cse5 .cse6))) InVars {main_~m~0=v_main_~m~0_196, main_~k~0=v_main_~k~0_748, main_~j~0=v_main_~j~0_823, main_~i~0=v_main_~i~0_259, main_#t~post4=|v_main_#t~post4_482|, main_#t~post5=|v_main_#t~post5_482|, main_~n~0=v_main_~n~0_87, main_#t~post3=|v_main_#t~post3_194|} OutVars{main_~m~0=v_main_~m~0_196, main_~k~0=v_main_~k~0_737, main_~j~0=v_main_~j~0_807, main_~i~0=v_main_~i~0_258, main_#t~post4=|v_main_#t~post4_468|, main_#t~post5=|v_main_#t~post5_468|, main_#t~post3=|v_main_#t~post3_192|, main_~n~0=v_main_~n~0_87} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {15399#(and (<= 10 main_~m~0) (or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ 110 (* main_~i~0 11)) (+ (* main_~n~0 11) main_~k~0))))} is VALID [2022-04-28 03:24:34,979 INFO L290 TraceCheckUtils]: 9: Hoare triple {15399#(and (<= 10 main_~m~0) (or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ 110 (* main_~i~0 11)) (+ (* main_~n~0 11) main_~k~0))))} [132] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15399#(and (<= 10 main_~m~0) (or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ 110 (* main_~i~0 11)) (+ (* main_~n~0 11) main_~k~0))))} is VALID [2022-04-28 03:24:34,980 INFO L290 TraceCheckUtils]: 10: Hoare triple {15399#(and (<= 10 main_~m~0) (or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ 110 (* main_~i~0 11)) (+ (* main_~n~0 11) main_~k~0))))} [133] L31-3-->L31-4_primed: Formula: (let ((.cse2 (< 2 v_main_~m~0_197)) (.cse3 (<= v_main_~m~0_197 3)) (.cse0 (= v_main_~j~0_826 v_main_~j~0_819)) (.cse1 (= v_main_~i~0_261 v_main_~i~0_260))) (or (and (= |v_main_#t~post5_479| |v_main_#t~post5_485|) .cse0 (= |v_main_#t~post3_193| |v_main_#t~post3_197|) (= v_main_~k~0_749 v_main_~k~0_752) .cse1 (= |v_main_#t~post4_479| |v_main_#t~post4_485|) (or (not (< v_main_~i~0_261 v_main_~n~0_88)) (not .cse2) (not .cse3))) (and .cse2 (< v_main_~i~0_260 (+ v_main_~n~0_88 1)) (< v_main_~i~0_261 v_main_~i~0_260) .cse3 (= (+ v_main_~k~0_752 (* 3 v_main_~i~0_260)) (+ v_main_~k~0_749 (* 3 v_main_~i~0_261))) (= v_main_~j~0_819 3)) (and (= v_main_~n~0_88 v_main_~n~0_88) .cse0 (= |v_main_#t~post5_485| |v_main_#t~post5_479|) (= v_main_~m~0_197 v_main_~m~0_197) (= |v_main_#t~post4_485| |v_main_#t~post4_479|) (= |v_main_#t~post3_197| |v_main_#t~post3_193|) .cse1 (= v_main_~k~0_752 v_main_~k~0_749)))) InVars {main_~m~0=v_main_~m~0_197, main_~k~0=v_main_~k~0_752, main_~j~0=v_main_~j~0_826, main_~i~0=v_main_~i~0_261, main_#t~post4=|v_main_#t~post4_485|, main_#t~post5=|v_main_#t~post5_485|, main_~n~0=v_main_~n~0_88, main_#t~post3=|v_main_#t~post3_197|} OutVars{main_~m~0=v_main_~m~0_197, main_~k~0=v_main_~k~0_749, main_~j~0=v_main_~j~0_819, main_~i~0=v_main_~i~0_260, main_#t~post4=|v_main_#t~post4_479|, main_#t~post5=|v_main_#t~post5_479|, main_#t~post3=|v_main_#t~post3_193|, main_~n~0=v_main_~n~0_88} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {15400#(or (<= (+ main_~i~0 1) main_~n~0) (<= (+ (* main_~i~0 11) 100) (+ (* main_~n~0 11) main_~k~0)))} is VALID [2022-04-28 03:24:34,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {15400#(or (<= (+ main_~i~0 1) main_~n~0) (<= (+ (* main_~i~0 11) 100) (+ (* main_~n~0 11) main_~k~0)))} [130] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {15401#(<= 100 main_~k~0)} is VALID [2022-04-28 03:24:34,980 INFO L272 TraceCheckUtils]: 12: Hoare triple {15401#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {15402#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:24:34,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {15402#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {15403#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:24:34,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {15403#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {15392#false} is VALID [2022-04-28 03:24:34,981 INFO L290 TraceCheckUtils]: 15: Hoare triple {15392#false} assume !false; {15392#false} is VALID [2022-04-28 03:24:34,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:24:34,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:24:34,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671890658] [2022-04-28 03:24:34,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671890658] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:24:34,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058987678] [2022-04-28 03:24:34,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:24:34,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:24:34,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:24:34,982 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:24:34,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 03:24:35,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:24:35,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:24:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:24:35,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:24:36,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {15391#true} call ULTIMATE.init(); {15391#true} is VALID [2022-04-28 03:24:36,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {15391#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); {15391#true} is VALID [2022-04-28 03:24:36,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {15391#true} assume true; {15391#true} is VALID [2022-04-28 03:24:36,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15391#true} {15391#true} #71#return; {15391#true} is VALID [2022-04-28 03:24:36,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {15391#true} call #t~ret6 := main(); {15391#true} is VALID [2022-04-28 03:24:36,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {15391#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {15423#(<= 0 main_~k~0)} is VALID [2022-04-28 03:24:36,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {15423#(<= 0 main_~k~0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {15427#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} is VALID [2022-04-28 03:24:36,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {15427#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {15431#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:24:36,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {15431#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [131] L31-3-->L31-4_primed: Formula: (let ((.cse3 (< 10 v_main_~m~0_196)) (.cse2 (<= v_main_~m~0_196 11)) (.cse0 (= v_main_~i~0_259 v_main_~i~0_258)) (.cse1 (= v_main_~j~0_823 v_main_~j~0_807)) (.cse4 (= v_main_~k~0_748 v_main_~k~0_737)) (.cse5 (= |v_main_#t~post5_482| |v_main_#t~post5_468|)) (.cse6 (= |v_main_#t~post4_482| |v_main_#t~post4_468|))) (or (and .cse0 .cse1 (= |v_main_#t~post3_192| |v_main_#t~post3_194|) (or (not .cse2) (not .cse3) (not (< v_main_~i~0_259 v_main_~n~0_87))) .cse4 .cse5 .cse6) (and (< v_main_~i~0_259 v_main_~i~0_258) (= (+ v_main_~k~0_748 (* 11 v_main_~i~0_258)) (+ v_main_~k~0_737 (* 11 v_main_~i~0_259))) .cse3 .cse2 (= v_main_~j~0_807 11) (< v_main_~i~0_258 (+ v_main_~n~0_87 1))) (and (= |v_main_#t~post3_194| |v_main_#t~post3_192|) .cse0 .cse1 (= v_main_~m~0_196 v_main_~m~0_196) .cse4 (= v_main_~n~0_87 v_main_~n~0_87) .cse5 .cse6))) InVars {main_~m~0=v_main_~m~0_196, main_~k~0=v_main_~k~0_748, main_~j~0=v_main_~j~0_823, main_~i~0=v_main_~i~0_259, main_#t~post4=|v_main_#t~post4_482|, main_#t~post5=|v_main_#t~post5_482|, main_~n~0=v_main_~n~0_87, main_#t~post3=|v_main_#t~post3_194|} OutVars{main_~m~0=v_main_~m~0_196, main_~k~0=v_main_~k~0_737, main_~j~0=v_main_~j~0_807, main_~i~0=v_main_~i~0_258, main_#t~post4=|v_main_#t~post4_468|, main_#t~post5=|v_main_#t~post5_468|, main_#t~post3=|v_main_#t~post3_192|, main_~n~0=v_main_~n~0_87} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {15435#(and (or (and (<= 0 main_~k~0) (<= main_~i~0 0)) (and (< 10 main_~m~0) (< (div main_~k~0 (- 11)) 0) (<= (+ main_~i~0 (div main_~k~0 (- 11))) 0) (<= main_~m~0 11) (= main_~j~0 11) (< main_~i~0 (+ main_~n~0 1)))) (<= 10 main_~n~0) (<= 10 main_~m~0))} is VALID [2022-04-28 03:24:36,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {15435#(and (or (and (<= 0 main_~k~0) (<= main_~i~0 0)) (and (< 10 main_~m~0) (< (div main_~k~0 (- 11)) 0) (<= (+ main_~i~0 (div main_~k~0 (- 11))) 0) (<= main_~m~0 11) (= main_~j~0 11) (< main_~i~0 (+ main_~n~0 1)))) (<= 10 main_~n~0) (<= 10 main_~m~0))} [132] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15435#(and (or (and (<= 0 main_~k~0) (<= main_~i~0 0)) (and (< 10 main_~m~0) (< (div main_~k~0 (- 11)) 0) (<= (+ main_~i~0 (div main_~k~0 (- 11))) 0) (<= main_~m~0 11) (= main_~j~0 11) (< main_~i~0 (+ main_~n~0 1)))) (<= 10 main_~n~0) (<= 10 main_~m~0))} is VALID [2022-04-28 03:24:36,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {15435#(and (or (and (<= 0 main_~k~0) (<= main_~i~0 0)) (and (< 10 main_~m~0) (< (div main_~k~0 (- 11)) 0) (<= (+ main_~i~0 (div main_~k~0 (- 11))) 0) (<= main_~m~0 11) (= main_~j~0 11) (< main_~i~0 (+ main_~n~0 1)))) (<= 10 main_~n~0) (<= 10 main_~m~0))} [133] L31-3-->L31-4_primed: Formula: (let ((.cse2 (< 2 v_main_~m~0_197)) (.cse3 (<= v_main_~m~0_197 3)) (.cse0 (= v_main_~j~0_826 v_main_~j~0_819)) (.cse1 (= v_main_~i~0_261 v_main_~i~0_260))) (or (and (= |v_main_#t~post5_479| |v_main_#t~post5_485|) .cse0 (= |v_main_#t~post3_193| |v_main_#t~post3_197|) (= v_main_~k~0_749 v_main_~k~0_752) .cse1 (= |v_main_#t~post4_479| |v_main_#t~post4_485|) (or (not (< v_main_~i~0_261 v_main_~n~0_88)) (not .cse2) (not .cse3))) (and .cse2 (< v_main_~i~0_260 (+ v_main_~n~0_88 1)) (< v_main_~i~0_261 v_main_~i~0_260) .cse3 (= (+ v_main_~k~0_752 (* 3 v_main_~i~0_260)) (+ v_main_~k~0_749 (* 3 v_main_~i~0_261))) (= v_main_~j~0_819 3)) (and (= v_main_~n~0_88 v_main_~n~0_88) .cse0 (= |v_main_#t~post5_485| |v_main_#t~post5_479|) (= v_main_~m~0_197 v_main_~m~0_197) (= |v_main_#t~post4_485| |v_main_#t~post4_479|) (= |v_main_#t~post3_197| |v_main_#t~post3_193|) .cse1 (= v_main_~k~0_752 v_main_~k~0_749)))) InVars {main_~m~0=v_main_~m~0_197, main_~k~0=v_main_~k~0_752, main_~j~0=v_main_~j~0_826, main_~i~0=v_main_~i~0_261, main_#t~post4=|v_main_#t~post4_485|, main_#t~post5=|v_main_#t~post5_485|, main_~n~0=v_main_~n~0_88, main_#t~post3=|v_main_#t~post3_197|} OutVars{main_~m~0=v_main_~m~0_197, main_~k~0=v_main_~k~0_749, main_~j~0=v_main_~j~0_819, main_~i~0=v_main_~i~0_260, main_#t~post4=|v_main_#t~post4_479|, main_#t~post5=|v_main_#t~post5_479|, main_#t~post3=|v_main_#t~post3_193|, main_~n~0=v_main_~n~0_88} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {15442#(and (<= 10 main_~n~0) (or (and (< (div main_~k~0 (- 11)) 0) (<= (+ main_~i~0 (div main_~k~0 (- 11))) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:24:36,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {15442#(and (<= 10 main_~n~0) (or (and (< (div main_~k~0 (- 11)) 0) (<= (+ main_~i~0 (div main_~k~0 (- 11))) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [130] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {15446#(<= (+ (div main_~k~0 (- 11)) 10) 0)} is VALID [2022-04-28 03:24:36,085 INFO L272 TraceCheckUtils]: 12: Hoare triple {15446#(<= (+ (div main_~k~0 (- 11)) 10) 0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {15450#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:24:36,086 INFO L290 TraceCheckUtils]: 13: Hoare triple {15450#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15454#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:24:36,086 INFO L290 TraceCheckUtils]: 14: Hoare triple {15454#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15392#false} is VALID [2022-04-28 03:24:36,086 INFO L290 TraceCheckUtils]: 15: Hoare triple {15392#false} assume !false; {15392#false} is VALID [2022-04-28 03:24:36,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:24:36,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:24:36,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {15392#false} assume !false; {15392#false} is VALID [2022-04-28 03:24:36,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {15454#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15392#false} is VALID [2022-04-28 03:24:36,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {15450#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15454#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:24:36,826 INFO L272 TraceCheckUtils]: 12: Hoare triple {15401#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {15450#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:24:36,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {15473#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} [130] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {15401#(<= 100 main_~k~0)} is VALID [2022-04-28 03:24:36,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {15477#(and (or (not (<= main_~m~0 3)) (<= (+ (div (+ (- 100) main_~k~0) (- 3)) main_~i~0) main_~n~0) (not (< 2 main_~m~0)) (<= (div (+ (- 100) main_~k~0) (- 3)) 1)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [133] L31-3-->L31-4_primed: Formula: (let ((.cse2 (< 2 v_main_~m~0_197)) (.cse3 (<= v_main_~m~0_197 3)) (.cse0 (= v_main_~j~0_826 v_main_~j~0_819)) (.cse1 (= v_main_~i~0_261 v_main_~i~0_260))) (or (and (= |v_main_#t~post5_479| |v_main_#t~post5_485|) .cse0 (= |v_main_#t~post3_193| |v_main_#t~post3_197|) (= v_main_~k~0_749 v_main_~k~0_752) .cse1 (= |v_main_#t~post4_479| |v_main_#t~post4_485|) (or (not (< v_main_~i~0_261 v_main_~n~0_88)) (not .cse2) (not .cse3))) (and .cse2 (< v_main_~i~0_260 (+ v_main_~n~0_88 1)) (< v_main_~i~0_261 v_main_~i~0_260) .cse3 (= (+ v_main_~k~0_752 (* 3 v_main_~i~0_260)) (+ v_main_~k~0_749 (* 3 v_main_~i~0_261))) (= v_main_~j~0_819 3)) (and (= v_main_~n~0_88 v_main_~n~0_88) .cse0 (= |v_main_#t~post5_485| |v_main_#t~post5_479|) (= v_main_~m~0_197 v_main_~m~0_197) (= |v_main_#t~post4_485| |v_main_#t~post4_479|) (= |v_main_#t~post3_197| |v_main_#t~post3_193|) .cse1 (= v_main_~k~0_752 v_main_~k~0_749)))) InVars {main_~m~0=v_main_~m~0_197, main_~k~0=v_main_~k~0_752, main_~j~0=v_main_~j~0_826, main_~i~0=v_main_~i~0_261, main_#t~post4=|v_main_#t~post4_485|, main_#t~post5=|v_main_#t~post5_485|, main_~n~0=v_main_~n~0_88, main_#t~post3=|v_main_#t~post3_197|} OutVars{main_~m~0=v_main_~m~0_197, main_~k~0=v_main_~k~0_749, main_~j~0=v_main_~j~0_819, main_~i~0=v_main_~i~0_260, main_#t~post4=|v_main_#t~post4_479|, main_#t~post5=|v_main_#t~post5_479|, main_#t~post3=|v_main_#t~post3_193|, main_~n~0=v_main_~n~0_88} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {15473#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} is VALID [2022-04-28 03:24:36,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {15477#(and (or (not (<= main_~m~0 3)) (<= (+ (div (+ (- 100) main_~k~0) (- 3)) main_~i~0) main_~n~0) (not (< 2 main_~m~0)) (<= (div (+ (- 100) main_~k~0) (- 3)) 1)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [132] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15477#(and (or (not (<= main_~m~0 3)) (<= (+ (div (+ (- 100) main_~k~0) (- 3)) main_~i~0) main_~n~0) (not (< 2 main_~m~0)) (<= (div (+ (- 100) main_~k~0) (- 3)) 1)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:24:36,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {15484#(and (or (not (<= main_~m~0 3)) (<= (+ (div (+ (- 100) main_~k~0) (- 3)) main_~i~0) main_~n~0) (not (< 2 main_~m~0)) (<= (div (+ (- 100) main_~k~0) (- 3)) 1)) (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 11))) main_~n~0) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 11)) (not (< 10 main_~m~0))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [131] L31-3-->L31-4_primed: Formula: (let ((.cse3 (< 10 v_main_~m~0_196)) (.cse2 (<= v_main_~m~0_196 11)) (.cse0 (= v_main_~i~0_259 v_main_~i~0_258)) (.cse1 (= v_main_~j~0_823 v_main_~j~0_807)) (.cse4 (= v_main_~k~0_748 v_main_~k~0_737)) (.cse5 (= |v_main_#t~post5_482| |v_main_#t~post5_468|)) (.cse6 (= |v_main_#t~post4_482| |v_main_#t~post4_468|))) (or (and .cse0 .cse1 (= |v_main_#t~post3_192| |v_main_#t~post3_194|) (or (not .cse2) (not .cse3) (not (< v_main_~i~0_259 v_main_~n~0_87))) .cse4 .cse5 .cse6) (and (< v_main_~i~0_259 v_main_~i~0_258) (= (+ v_main_~k~0_748 (* 11 v_main_~i~0_258)) (+ v_main_~k~0_737 (* 11 v_main_~i~0_259))) .cse3 .cse2 (= v_main_~j~0_807 11) (< v_main_~i~0_258 (+ v_main_~n~0_87 1))) (and (= |v_main_#t~post3_194| |v_main_#t~post3_192|) .cse0 .cse1 (= v_main_~m~0_196 v_main_~m~0_196) .cse4 (= v_main_~n~0_87 v_main_~n~0_87) .cse5 .cse6))) InVars {main_~m~0=v_main_~m~0_196, main_~k~0=v_main_~k~0_748, main_~j~0=v_main_~j~0_823, main_~i~0=v_main_~i~0_259, main_#t~post4=|v_main_#t~post4_482|, main_#t~post5=|v_main_#t~post5_482|, main_~n~0=v_main_~n~0_87, main_#t~post3=|v_main_#t~post3_194|} OutVars{main_~m~0=v_main_~m~0_196, main_~k~0=v_main_~k~0_737, main_~j~0=v_main_~j~0_807, main_~i~0=v_main_~i~0_258, main_#t~post4=|v_main_#t~post4_468|, main_#t~post5=|v_main_#t~post5_468|, main_#t~post3=|v_main_#t~post3_192|, main_~n~0=v_main_~n~0_87} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {15477#(and (or (not (<= main_~m~0 3)) (<= (+ (div (+ (- 100) main_~k~0) (- 3)) main_~i~0) main_~n~0) (not (< 2 main_~m~0)) (<= (div (+ (- 100) main_~k~0) (- 3)) 1)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:24:36,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {15488#(and (or (<= (div (+ (- 100) main_~k~0) (- 11)) 1) (<= (div (+ (- 100) main_~k~0) (- 11)) main_~n~0)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {15484#(and (or (not (<= main_~m~0 3)) (<= (+ (div (+ (- 100) main_~k~0) (- 3)) main_~i~0) main_~n~0) (not (< 2 main_~m~0)) (<= (div (+ (- 100) main_~k~0) (- 3)) 1)) (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 11))) main_~n~0) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 11)) (not (< 10 main_~m~0))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:24:36,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {15492#(<= (div (+ (- 100) main_~k~0) (- 11)) 10)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {15488#(and (or (<= (div (+ (- 100) main_~k~0) (- 11)) 1) (<= (div (+ (- 100) main_~k~0) (- 11)) main_~n~0)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} is VALID [2022-04-28 03:24:36,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {15391#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {15492#(<= (div (+ (- 100) main_~k~0) (- 11)) 10)} is VALID [2022-04-28 03:24:36,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {15391#true} call #t~ret6 := main(); {15391#true} is VALID [2022-04-28 03:24:36,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15391#true} {15391#true} #71#return; {15391#true} is VALID [2022-04-28 03:24:36,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {15391#true} assume true; {15391#true} is VALID [2022-04-28 03:24:36,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {15391#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); {15391#true} is VALID [2022-04-28 03:24:36,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {15391#true} call ULTIMATE.init(); {15391#true} is VALID [2022-04-28 03:24:36,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:24:36,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058987678] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:24:36,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:24:36,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2022-04-28 03:24:38,864 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:24:38,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [506066264] [2022-04-28 03:24:38,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [506066264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:24:38,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:24:38,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-28 03:24:38,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094118836] [2022-04-28 03:24:38,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:24:38,864 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 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 47 [2022-04-28 03:24:38,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:24:38,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:38,905 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 03:24:38,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-28 03:24:38,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:24:38,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-28 03:24:38,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=529, Invalid=2663, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 03:24:38,905 INFO L87 Difference]: Start difference. First operand 225 states and 292 transitions. Second operand has 41 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:43,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:24:43,740 INFO L93 Difference]: Finished difference Result 236 states and 304 transitions. [2022-04-28 03:24:43,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 03:24:43,740 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 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 47 [2022-04-28 03:24:43,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:24:43,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:43,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 74 transitions. [2022-04-28 03:24:43,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:43,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 74 transitions. [2022-04-28 03:24:43,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 74 transitions. [2022-04-28 03:24:43,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:24:43,805 INFO L225 Difference]: With dead ends: 236 [2022-04-28 03:24:43,806 INFO L226 Difference]: Without dead ends: 227 [2022-04-28 03:24:43,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2190 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1042, Invalid=7330, Unknown=0, NotChecked=0, Total=8372 [2022-04-28 03:24:43,807 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 1615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:24:43,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 195 Invalid, 1615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1578 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 03:24:43,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-04-28 03:24:44,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 218. [2022-04-28 03:24:44,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:24:44,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 227 states. Second operand has 218 states, 213 states have (on average 1.272300469483568) internal successors, (271), 213 states have internal predecessors, (271), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:44,654 INFO L74 IsIncluded]: Start isIncluded. First operand 227 states. Second operand has 218 states, 213 states have (on average 1.272300469483568) internal successors, (271), 213 states have internal predecessors, (271), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:44,654 INFO L87 Difference]: Start difference. First operand 227 states. Second operand has 218 states, 213 states have (on average 1.272300469483568) internal successors, (271), 213 states have internal predecessors, (271), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:44,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:24:44,657 INFO L93 Difference]: Finished difference Result 227 states and 284 transitions. [2022-04-28 03:24:44,657 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 284 transitions. [2022-04-28 03:24:44,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:24:44,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:24:44,657 INFO L74 IsIncluded]: Start isIncluded. First operand has 218 states, 213 states have (on average 1.272300469483568) internal successors, (271), 213 states have internal predecessors, (271), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 227 states. [2022-04-28 03:24:44,657 INFO L87 Difference]: Start difference. First operand has 218 states, 213 states have (on average 1.272300469483568) internal successors, (271), 213 states have internal predecessors, (271), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 227 states. [2022-04-28 03:24:44,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:24:44,660 INFO L93 Difference]: Finished difference Result 227 states and 284 transitions. [2022-04-28 03:24:44,660 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 284 transitions. [2022-04-28 03:24:44,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:24:44,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:24:44,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:24:44,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:24:44,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 213 states have (on average 1.272300469483568) internal successors, (271), 213 states have internal predecessors, (271), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:44,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 275 transitions. [2022-04-28 03:24:44,663 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 275 transitions. Word has length 47 [2022-04-28 03:24:44,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:24:44,663 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 275 transitions. [2022-04-28 03:24:44,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:44,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 218 states and 275 transitions. [2022-04-28 03:24:45,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 275 edges. 275 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:24:45,327 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 275 transitions. [2022-04-28 03:24:45,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 03:24:45,327 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:24:45,327 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:24:45,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 03:24:45,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:24:45,528 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:24:45,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:24:45,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1500584064, now seen corresponding path program 23 times [2022-04-28 03:24:45,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:24:45,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1416020189] [2022-04-28 03:24:45,727 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:24:45,950 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:24:48,785 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:24:48,894 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:24:50,716 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:24:50,717 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:24:50,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1387014593, now seen corresponding path program 1 times [2022-04-28 03:24:50,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:24:50,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875097885] [2022-04-28 03:24:50,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:24:50,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:24:50,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:24:50,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:24:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:24:50,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {16991#(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); {16978#true} is VALID [2022-04-28 03:24:50,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {16978#true} assume true; {16978#true} is VALID [2022-04-28 03:24:50,820 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16978#true} {16978#true} #71#return; {16978#true} is VALID [2022-04-28 03:24:50,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {16978#true} call ULTIMATE.init(); {16991#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:24:50,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {16991#(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); {16978#true} is VALID [2022-04-28 03:24:50,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {16978#true} assume true; {16978#true} is VALID [2022-04-28 03:24:50,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16978#true} {16978#true} #71#return; {16978#true} is VALID [2022-04-28 03:24:50,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {16978#true} call #t~ret6 := main(); {16978#true} is VALID [2022-04-28 03:24:50,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {16978#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {16983#(= main_~k~0 0)} is VALID [2022-04-28 03:24:50,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {16983#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {16984#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:24:50,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {16984#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {16985#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:24:50,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {16985#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} [135] L31-3-->L31-4_primed: Formula: (let ((.cse0 (<= v_main_~m~0_211 1)) (.cse1 (< 0 v_main_~m~0_211)) (.cse2 (= |v_main_#t~post3_215| |v_main_#t~post3_213|)) (.cse3 (= v_main_~j~0_887 v_main_~j~0_871)) (.cse4 (= v_main_~i~0_287 v_main_~i~0_286)) (.cse5 (= v_main_~k~0_792 v_main_~k~0_791)) (.cse6 (= |v_main_#t~post5_516| |v_main_#t~post5_502|)) (.cse7 (= |v_main_#t~post4_516| |v_main_#t~post4_502|))) (or (and (or (not (< v_main_~i~0_287 v_main_~n~0_97)) (not .cse0) (not .cse1)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= (+ v_main_~k~0_792 v_main_~i~0_286) (+ v_main_~k~0_791 v_main_~i~0_287)) (< v_main_~i~0_286 (+ v_main_~n~0_97 1)) (< v_main_~i~0_287 v_main_~i~0_286) .cse0 .cse1 (= v_main_~j~0_871 1)) (and (= v_main_~m~0_211 v_main_~m~0_211) .cse2 .cse3 .cse4 .cse5 .cse6 (= v_main_~n~0_97 v_main_~n~0_97) .cse7))) InVars {main_~m~0=v_main_~m~0_211, main_~k~0=v_main_~k~0_792, main_~j~0=v_main_~j~0_887, main_~i~0=v_main_~i~0_287, main_#t~post4=|v_main_#t~post4_516|, main_#t~post5=|v_main_#t~post5_516|, main_~n~0=v_main_~n~0_97, main_#t~post3=|v_main_#t~post3_215|} OutVars{main_~m~0=v_main_~m~0_211, main_~k~0=v_main_~k~0_791, main_~j~0=v_main_~j~0_871, main_~i~0=v_main_~i~0_286, main_#t~post4=|v_main_#t~post4_502|, main_#t~post5=|v_main_#t~post5_502|, main_#t~post3=|v_main_#t~post3_213|, main_~n~0=v_main_~n~0_97} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {16986#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:24:50,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {16986#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [136] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16986#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:24:50,824 INFO L290 TraceCheckUtils]: 10: Hoare triple {16986#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [137] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post3_218| |v_main_#t~post3_214|)) (.cse1 (= |v_main_#t~post4_519| |v_main_#t~post4_503|)) (.cse2 (= v_main_~i~0_289 v_main_~i~0_288)) (.cse3 (= v_main_~k~0_806 v_main_~k~0_793)) (.cse4 (= |v_main_#t~post5_519| |v_main_#t~post5_503|)) (.cse5 (= v_main_~j~0_890 v_main_~j~0_873)) (.cse6 (<= v_main_~m~0_212 13)) (.cse7 (< 12 v_main_~m~0_212))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (or (not .cse6) (not (< v_main_~i~0_289 v_main_~n~0_98)) (not .cse7))) (and .cse0 .cse1 .cse2 .cse3 (= v_main_~m~0_212 v_main_~m~0_212) .cse4 .cse5 (= v_main_~n~0_98 v_main_~n~0_98)) (and .cse6 .cse7 (< v_main_~i~0_289 v_main_~i~0_288) (< v_main_~i~0_288 (+ v_main_~n~0_98 1)) (= (+ v_main_~k~0_806 (* 13 v_main_~i~0_288)) (+ (* 13 v_main_~i~0_289) v_main_~k~0_793)) (= v_main_~j~0_873 13)))) InVars {main_~m~0=v_main_~m~0_212, main_~k~0=v_main_~k~0_806, main_~j~0=v_main_~j~0_890, main_~i~0=v_main_~i~0_289, main_#t~post4=|v_main_#t~post4_519|, main_#t~post5=|v_main_#t~post5_519|, main_~n~0=v_main_~n~0_98, main_#t~post3=|v_main_#t~post3_218|} OutVars{main_~m~0=v_main_~m~0_212, main_~k~0=v_main_~k~0_793, main_~j~0=v_main_~j~0_873, main_~i~0=v_main_~i~0_288, main_#t~post4=|v_main_#t~post4_503|, main_#t~post5=|v_main_#t~post5_503|, main_#t~post3=|v_main_#t~post3_214|, main_~n~0=v_main_~n~0_98} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {16987#(or (<= (+ (* main_~i~0 13) 130) (+ (* main_~n~0 13) main_~k~0)) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:24:50,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {16987#(or (<= (+ (* main_~i~0 13) 130) (+ (* main_~n~0 13) main_~k~0)) (<= (+ main_~i~0 10) main_~n~0))} [134] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {16988#(<= 130 main_~k~0)} is VALID [2022-04-28 03:24:50,825 INFO L272 TraceCheckUtils]: 12: Hoare triple {16988#(<= 130 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {16989#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:24:50,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {16989#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {16990#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:24:50,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {16990#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {16979#false} is VALID [2022-04-28 03:24:50,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {16979#false} assume !false; {16979#false} is VALID [2022-04-28 03:24:50,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:24:50,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:24:50,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875097885] [2022-04-28 03:24:50,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875097885] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:24:50,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546489799] [2022-04-28 03:24:50,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:24:50,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:24:50,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:24:50,827 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:24:50,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 03:24:50,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:24:50,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:24:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:24:50,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:24:51,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {16978#true} call ULTIMATE.init(); {16978#true} is VALID [2022-04-28 03:24:51,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {16978#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); {16978#true} is VALID [2022-04-28 03:24:51,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {16978#true} assume true; {16978#true} is VALID [2022-04-28 03:24:51,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16978#true} {16978#true} #71#return; {16978#true} is VALID [2022-04-28 03:24:51,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {16978#true} call #t~ret6 := main(); {16978#true} is VALID [2022-04-28 03:24:51,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {16978#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {17010#(<= 0 main_~k~0)} is VALID [2022-04-28 03:24:51,316 INFO L290 TraceCheckUtils]: 6: Hoare triple {17010#(<= 0 main_~k~0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {17014#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} is VALID [2022-04-28 03:24:51,316 INFO L290 TraceCheckUtils]: 7: Hoare triple {17014#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {17018#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:24:51,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {17018#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [135] L31-3-->L31-4_primed: Formula: (let ((.cse0 (<= v_main_~m~0_211 1)) (.cse1 (< 0 v_main_~m~0_211)) (.cse2 (= |v_main_#t~post3_215| |v_main_#t~post3_213|)) (.cse3 (= v_main_~j~0_887 v_main_~j~0_871)) (.cse4 (= v_main_~i~0_287 v_main_~i~0_286)) (.cse5 (= v_main_~k~0_792 v_main_~k~0_791)) (.cse6 (= |v_main_#t~post5_516| |v_main_#t~post5_502|)) (.cse7 (= |v_main_#t~post4_516| |v_main_#t~post4_502|))) (or (and (or (not (< v_main_~i~0_287 v_main_~n~0_97)) (not .cse0) (not .cse1)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= (+ v_main_~k~0_792 v_main_~i~0_286) (+ v_main_~k~0_791 v_main_~i~0_287)) (< v_main_~i~0_286 (+ v_main_~n~0_97 1)) (< v_main_~i~0_287 v_main_~i~0_286) .cse0 .cse1 (= v_main_~j~0_871 1)) (and (= v_main_~m~0_211 v_main_~m~0_211) .cse2 .cse3 .cse4 .cse5 .cse6 (= v_main_~n~0_97 v_main_~n~0_97) .cse7))) InVars {main_~m~0=v_main_~m~0_211, main_~k~0=v_main_~k~0_792, main_~j~0=v_main_~j~0_887, main_~i~0=v_main_~i~0_287, main_#t~post4=|v_main_#t~post4_516|, main_#t~post5=|v_main_#t~post5_516|, main_~n~0=v_main_~n~0_97, main_#t~post3=|v_main_#t~post3_215|} OutVars{main_~m~0=v_main_~m~0_211, main_~k~0=v_main_~k~0_791, main_~j~0=v_main_~j~0_871, main_~i~0=v_main_~i~0_286, main_#t~post4=|v_main_#t~post4_502|, main_#t~post5=|v_main_#t~post5_502|, main_#t~post3=|v_main_#t~post3_213|, main_~n~0=v_main_~n~0_97} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {17018#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:24:51,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {17018#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [136] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17018#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:24:51,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {17018#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [137] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post3_218| |v_main_#t~post3_214|)) (.cse1 (= |v_main_#t~post4_519| |v_main_#t~post4_503|)) (.cse2 (= v_main_~i~0_289 v_main_~i~0_288)) (.cse3 (= v_main_~k~0_806 v_main_~k~0_793)) (.cse4 (= |v_main_#t~post5_519| |v_main_#t~post5_503|)) (.cse5 (= v_main_~j~0_890 v_main_~j~0_873)) (.cse6 (<= v_main_~m~0_212 13)) (.cse7 (< 12 v_main_~m~0_212))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (or (not .cse6) (not (< v_main_~i~0_289 v_main_~n~0_98)) (not .cse7))) (and .cse0 .cse1 .cse2 .cse3 (= v_main_~m~0_212 v_main_~m~0_212) .cse4 .cse5 (= v_main_~n~0_98 v_main_~n~0_98)) (and .cse6 .cse7 (< v_main_~i~0_289 v_main_~i~0_288) (< v_main_~i~0_288 (+ v_main_~n~0_98 1)) (= (+ v_main_~k~0_806 (* 13 v_main_~i~0_288)) (+ (* 13 v_main_~i~0_289) v_main_~k~0_793)) (= v_main_~j~0_873 13)))) InVars {main_~m~0=v_main_~m~0_212, main_~k~0=v_main_~k~0_806, main_~j~0=v_main_~j~0_890, main_~i~0=v_main_~i~0_289, main_#t~post4=|v_main_#t~post4_519|, main_#t~post5=|v_main_#t~post5_519|, main_~n~0=v_main_~n~0_98, main_#t~post3=|v_main_#t~post3_218|} OutVars{main_~m~0=v_main_~m~0_212, main_~k~0=v_main_~k~0_793, main_~j~0=v_main_~j~0_873, main_~i~0=v_main_~i~0_288, main_#t~post4=|v_main_#t~post4_503|, main_#t~post5=|v_main_#t~post5_503|, main_#t~post3=|v_main_#t~post3_214|, main_~n~0=v_main_~n~0_98} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {17028#(and (<= 10 main_~n~0) (or (and (<= (+ main_~i~0 (div main_~k~0 (- 13))) 0) (< (div main_~k~0 (- 13)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:24:51,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {17028#(and (<= 10 main_~n~0) (or (and (<= (+ main_~i~0 (div main_~k~0 (- 13))) 0) (< (div main_~k~0 (- 13)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [134] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {16988#(<= 130 main_~k~0)} is VALID [2022-04-28 03:24:51,320 INFO L272 TraceCheckUtils]: 12: Hoare triple {16988#(<= 130 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {17035#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:24:51,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {17035#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17039#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:24:51,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {17039#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16979#false} is VALID [2022-04-28 03:24:51,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {16979#false} assume !false; {16979#false} is VALID [2022-04-28 03:24:51,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:24:51,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:24:52,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {16979#false} assume !false; {16979#false} is VALID [2022-04-28 03:24:52,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {17039#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16979#false} is VALID [2022-04-28 03:24:52,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {17035#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17039#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:24:52,066 INFO L272 TraceCheckUtils]: 12: Hoare triple {17055#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {17035#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:24:52,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {17059#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} [134] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {17055#(<= 100 main_~k~0)} is VALID [2022-04-28 03:24:52,068 INFO L290 TraceCheckUtils]: 10: Hoare triple {17063#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 13))) main_~n~0) (<= main_~n~0 main_~i~0) (not (< 12 main_~m~0)) (not (<= main_~m~0 13))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [137] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post3_218| |v_main_#t~post3_214|)) (.cse1 (= |v_main_#t~post4_519| |v_main_#t~post4_503|)) (.cse2 (= v_main_~i~0_289 v_main_~i~0_288)) (.cse3 (= v_main_~k~0_806 v_main_~k~0_793)) (.cse4 (= |v_main_#t~post5_519| |v_main_#t~post5_503|)) (.cse5 (= v_main_~j~0_890 v_main_~j~0_873)) (.cse6 (<= v_main_~m~0_212 13)) (.cse7 (< 12 v_main_~m~0_212))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (or (not .cse6) (not (< v_main_~i~0_289 v_main_~n~0_98)) (not .cse7))) (and .cse0 .cse1 .cse2 .cse3 (= v_main_~m~0_212 v_main_~m~0_212) .cse4 .cse5 (= v_main_~n~0_98 v_main_~n~0_98)) (and .cse6 .cse7 (< v_main_~i~0_289 v_main_~i~0_288) (< v_main_~i~0_288 (+ v_main_~n~0_98 1)) (= (+ v_main_~k~0_806 (* 13 v_main_~i~0_288)) (+ (* 13 v_main_~i~0_289) v_main_~k~0_793)) (= v_main_~j~0_873 13)))) InVars {main_~m~0=v_main_~m~0_212, main_~k~0=v_main_~k~0_806, main_~j~0=v_main_~j~0_890, main_~i~0=v_main_~i~0_289, main_#t~post4=|v_main_#t~post4_519|, main_#t~post5=|v_main_#t~post5_519|, main_~n~0=v_main_~n~0_98, main_#t~post3=|v_main_#t~post3_218|} OutVars{main_~m~0=v_main_~m~0_212, main_~k~0=v_main_~k~0_793, main_~j~0=v_main_~j~0_873, main_~i~0=v_main_~i~0_288, main_#t~post4=|v_main_#t~post4_503|, main_#t~post5=|v_main_#t~post5_503|, main_#t~post3=|v_main_#t~post3_214|, main_~n~0=v_main_~n~0_98} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {17059#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} is VALID [2022-04-28 03:24:52,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {17063#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 13))) main_~n~0) (<= main_~n~0 main_~i~0) (not (< 12 main_~m~0)) (not (<= main_~m~0 13))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [136] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17063#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 13))) main_~n~0) (<= main_~n~0 main_~i~0) (not (< 12 main_~m~0)) (not (<= main_~m~0 13))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:24:52,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {17070#(and (or (not (< 0 main_~m~0)) (<= (+ main_~i~0 100) (+ main_~n~0 main_~k~0)) (<= 99 main_~k~0) (not (<= main_~m~0 1))) (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 13))) main_~n~0) (<= main_~n~0 main_~i~0) (not (< 12 main_~m~0)) (not (<= main_~m~0 13))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [135] L31-3-->L31-4_primed: Formula: (let ((.cse0 (<= v_main_~m~0_211 1)) (.cse1 (< 0 v_main_~m~0_211)) (.cse2 (= |v_main_#t~post3_215| |v_main_#t~post3_213|)) (.cse3 (= v_main_~j~0_887 v_main_~j~0_871)) (.cse4 (= v_main_~i~0_287 v_main_~i~0_286)) (.cse5 (= v_main_~k~0_792 v_main_~k~0_791)) (.cse6 (= |v_main_#t~post5_516| |v_main_#t~post5_502|)) (.cse7 (= |v_main_#t~post4_516| |v_main_#t~post4_502|))) (or (and (or (not (< v_main_~i~0_287 v_main_~n~0_97)) (not .cse0) (not .cse1)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= (+ v_main_~k~0_792 v_main_~i~0_286) (+ v_main_~k~0_791 v_main_~i~0_287)) (< v_main_~i~0_286 (+ v_main_~n~0_97 1)) (< v_main_~i~0_287 v_main_~i~0_286) .cse0 .cse1 (= v_main_~j~0_871 1)) (and (= v_main_~m~0_211 v_main_~m~0_211) .cse2 .cse3 .cse4 .cse5 .cse6 (= v_main_~n~0_97 v_main_~n~0_97) .cse7))) InVars {main_~m~0=v_main_~m~0_211, main_~k~0=v_main_~k~0_792, main_~j~0=v_main_~j~0_887, main_~i~0=v_main_~i~0_287, main_#t~post4=|v_main_#t~post4_516|, main_#t~post5=|v_main_#t~post5_516|, main_~n~0=v_main_~n~0_97, main_#t~post3=|v_main_#t~post3_215|} OutVars{main_~m~0=v_main_~m~0_211, main_~k~0=v_main_~k~0_791, main_~j~0=v_main_~j~0_871, main_~i~0=v_main_~i~0_286, main_#t~post4=|v_main_#t~post4_502|, main_#t~post5=|v_main_#t~post5_502|, main_#t~post3=|v_main_#t~post3_213|, main_~n~0=v_main_~n~0_97} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {17063#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 13))) main_~n~0) (<= main_~n~0 main_~i~0) (not (< 12 main_~m~0)) (not (<= main_~m~0 13))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:24:52,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {17074#(and (or (<= (div (+ (- 100) main_~k~0) (- 13)) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 13)) 1)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {17070#(and (or (not (< 0 main_~m~0)) (<= (+ main_~i~0 100) (+ main_~n~0 main_~k~0)) (<= 99 main_~k~0) (not (<= main_~m~0 1))) (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 13))) main_~n~0) (<= main_~n~0 main_~i~0) (not (< 12 main_~m~0)) (not (<= main_~m~0 13))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:24:52,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {17078#(<= (div (+ (- 100) main_~k~0) (- 13)) 10)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {17074#(and (or (<= (div (+ (- 100) main_~k~0) (- 13)) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 13)) 1)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} is VALID [2022-04-28 03:24:52,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {16978#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {17078#(<= (div (+ (- 100) main_~k~0) (- 13)) 10)} is VALID [2022-04-28 03:24:52,072 INFO L272 TraceCheckUtils]: 4: Hoare triple {16978#true} call #t~ret6 := main(); {16978#true} is VALID [2022-04-28 03:24:52,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16978#true} {16978#true} #71#return; {16978#true} is VALID [2022-04-28 03:24:52,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {16978#true} assume true; {16978#true} is VALID [2022-04-28 03:24:52,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {16978#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); {16978#true} is VALID [2022-04-28 03:24:52,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {16978#true} call ULTIMATE.init(); {16978#true} is VALID [2022-04-28 03:24:52,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:24:52,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546489799] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:24:52,072 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:24:52,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 23 [2022-04-28 03:24:53,142 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:24:53,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1416020189] [2022-04-28 03:24:53,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1416020189] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:24:53,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:24:53,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-28 03:24:53,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118310764] [2022-04-28 03:24:53,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:24:53,142 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 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 47 [2022-04-28 03:24:53,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:24:53,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:53,173 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 03:24:53,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-28 03:24:53,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:24:53,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-28 03:24:53,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=497, Invalid=2473, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 03:24:53,180 INFO L87 Difference]: Start difference. First operand 218 states and 275 transitions. Second operand has 41 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:57,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:24:57,116 INFO L93 Difference]: Finished difference Result 232 states and 291 transitions. [2022-04-28 03:24:57,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 03:24:57,117 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 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 47 [2022-04-28 03:24:57,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:24:57,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:57,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 69 transitions. [2022-04-28 03:24:57,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:57,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 69 transitions. [2022-04-28 03:24:57,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 69 transitions. [2022-04-28 03:24:57,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:24:57,175 INFO L225 Difference]: With dead ends: 232 [2022-04-28 03:24:57,175 INFO L226 Difference]: Without dead ends: 223 [2022-04-28 03:24:57,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2045 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=985, Invalid=7025, Unknown=0, NotChecked=0, Total=8010 [2022-04-28 03:24:57,176 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 27 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 1688 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 1718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:24:57,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 190 Invalid, 1718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1688 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 03:24:57,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-04-28 03:24:58,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 220. [2022-04-28 03:24:58,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:24:58,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 223 states. Second operand has 220 states, 215 states have (on average 1.2697674418604652) internal successors, (273), 215 states have internal predecessors, (273), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:58,032 INFO L74 IsIncluded]: Start isIncluded. First operand 223 states. Second operand has 220 states, 215 states have (on average 1.2697674418604652) internal successors, (273), 215 states have internal predecessors, (273), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:58,032 INFO L87 Difference]: Start difference. First operand 223 states. Second operand has 220 states, 215 states have (on average 1.2697674418604652) internal successors, (273), 215 states have internal predecessors, (273), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:58,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:24:58,034 INFO L93 Difference]: Finished difference Result 223 states and 280 transitions. [2022-04-28 03:24:58,034 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 280 transitions. [2022-04-28 03:24:58,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:24:58,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:24:58,035 INFO L74 IsIncluded]: Start isIncluded. First operand has 220 states, 215 states have (on average 1.2697674418604652) internal successors, (273), 215 states have internal predecessors, (273), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 223 states. [2022-04-28 03:24:58,035 INFO L87 Difference]: Start difference. First operand has 220 states, 215 states have (on average 1.2697674418604652) internal successors, (273), 215 states have internal predecessors, (273), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 223 states. [2022-04-28 03:24:58,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:24:58,038 INFO L93 Difference]: Finished difference Result 223 states and 280 transitions. [2022-04-28 03:24:58,038 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 280 transitions. [2022-04-28 03:24:58,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:24:58,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:24:58,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:24:58,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:24:58,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 215 states have (on average 1.2697674418604652) internal successors, (273), 215 states have internal predecessors, (273), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:58,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 277 transitions. [2022-04-28 03:24:58,041 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 277 transitions. Word has length 47 [2022-04-28 03:24:58,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:24:58,041 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 277 transitions. [2022-04-28 03:24:58,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:24:58,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 220 states and 277 transitions. [2022-04-28 03:24:58,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 277 edges. 277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:24:58,731 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 277 transitions. [2022-04-28 03:24:58,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 03:24:58,731 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:24:58,731 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:24:58,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 03:24:58,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-28 03:24:58,947 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:24:58,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:24:58,947 INFO L85 PathProgramCache]: Analyzing trace with hash -2031687868, now seen corresponding path program 24 times [2022-04-28 03:24:58,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:24:58,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [774624087] [2022-04-28 03:24:59,127 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:25:03,290 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:25:03,355 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:25:07,459 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:25:07,570 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:25:07,571 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:25:07,574 INFO L85 PathProgramCache]: Analyzing trace with hash -858420543, now seen corresponding path program 1 times [2022-04-28 03:25:07,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:25:07,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360477470] [2022-04-28 03:25:07,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:25:07,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:25:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:25:07,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:25:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:25:07,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {18564#(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); {18551#true} is VALID [2022-04-28 03:25:07,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {18551#true} assume true; {18551#true} is VALID [2022-04-28 03:25:07,663 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18551#true} {18551#true} #71#return; {18551#true} is VALID [2022-04-28 03:25:07,664 INFO L272 TraceCheckUtils]: 0: Hoare triple {18551#true} call ULTIMATE.init(); {18564#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:25:07,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {18564#(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); {18551#true} is VALID [2022-04-28 03:25:07,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {18551#true} assume true; {18551#true} is VALID [2022-04-28 03:25:07,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18551#true} {18551#true} #71#return; {18551#true} is VALID [2022-04-28 03:25:07,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {18551#true} call #t~ret6 := main(); {18551#true} is VALID [2022-04-28 03:25:07,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {18551#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {18556#(= main_~k~0 0)} is VALID [2022-04-28 03:25:07,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {18556#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {18557#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:25:07,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {18557#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {18558#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:25:07,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {18558#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} [139] L31-3-->L31-4_primed: Formula: (let ((.cse0 (<= v_main_~m~0_222 0)) (.cse1 (= v_main_~i~0_308 v_main_~i~0_307)) (.cse2 (= v_main_~j~0_942 v_main_~j~0_926)) (.cse3 (= |v_main_#t~post3_230| |v_main_#t~post3_228|))) (or (and (= v_main_~j~0_926 0) .cse0 (< v_main_~i~0_308 v_main_~i~0_307) (< v_main_~i~0_307 (+ 1 v_main_~n~0_103))) (and .cse1 (or (not .cse0) (not (< v_main_~i~0_308 v_main_~n~0_103))) .cse2 .cse3) (and (= v_main_~m~0_222 v_main_~m~0_222) (= v_main_~n~0_103 v_main_~n~0_103) .cse1 .cse2 .cse3))) InVars {main_~i~0=v_main_~i~0_308, main_~n~0=v_main_~n~0_103, main_#t~post3=|v_main_#t~post3_230|, main_~m~0=v_main_~m~0_222, main_~j~0=v_main_~j~0_942} OutVars{main_~i~0=v_main_~i~0_307, main_#t~post3=|v_main_#t~post3_228|, main_~n~0=v_main_~n~0_103, main_~m~0=v_main_~m~0_222, main_~j~0=v_main_~j~0_926} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post3] {18559#(and (= main_~k~0 0) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:25:07,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {18559#(and (= main_~k~0 0) (<= (+ main_~i~0 10) main_~n~0))} [140] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18559#(and (= main_~k~0 0) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:25:07,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {18559#(and (= main_~k~0 0) (<= (+ main_~i~0 10) main_~n~0))} [141] L31-3-->L31-4_primed: Formula: (let ((.cse1 (<= v_main_~m~0_223 14)) (.cse0 (< 13 v_main_~m~0_223)) (.cse2 (= |v_main_#t~post5_549| |v_main_#t~post5_535|)) (.cse3 (= v_main_~j~0_945 v_main_~j~0_927)) (.cse4 (= |v_main_#t~post3_233| |v_main_#t~post3_229|))) (or (and (< v_main_~i~0_309 (+ 1 v_main_~n~0_104)) (= (+ v_main_~k~0_843 (* 14 v_main_~i~0_310)) (+ (* 14 v_main_~i~0_309) v_main_~k~0_857)) (= v_main_~j~0_927 14) (< v_main_~i~0_310 v_main_~i~0_309) .cse0 .cse1) (and (= |v_main_#t~post4_535| |v_main_#t~post4_549|) (= v_main_~k~0_843 v_main_~k~0_857) .cse2 .cse3 (or (not .cse1) (not .cse0) (not (< v_main_~i~0_310 v_main_~n~0_104))) .cse4 (= v_main_~i~0_309 v_main_~i~0_310)) (and (= v_main_~k~0_857 v_main_~k~0_843) (= |v_main_#t~post4_549| |v_main_#t~post4_535|) .cse2 (= v_main_~m~0_223 v_main_~m~0_223) .cse3 (= v_main_~i~0_310 v_main_~i~0_309) .cse4 (= v_main_~n~0_104 v_main_~n~0_104)))) InVars {main_~m~0=v_main_~m~0_223, main_~k~0=v_main_~k~0_857, main_~j~0=v_main_~j~0_945, main_~i~0=v_main_~i~0_310, main_#t~post4=|v_main_#t~post4_549|, main_#t~post5=|v_main_#t~post5_549|, main_~n~0=v_main_~n~0_104, main_#t~post3=|v_main_#t~post3_233|} OutVars{main_~m~0=v_main_~m~0_223, main_~k~0=v_main_~k~0_843, main_~j~0=v_main_~j~0_927, main_~i~0=v_main_~i~0_309, main_#t~post4=|v_main_#t~post4_535|, main_#t~post5=|v_main_#t~post5_535|, main_#t~post3=|v_main_#t~post3_229|, main_~n~0=v_main_~n~0_104} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {18560#(or (<= (+ 140 (* main_~i~0 14)) (+ main_~k~0 (* main_~n~0 14))) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:25:07,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {18560#(or (<= (+ 140 (* main_~i~0 14)) (+ main_~k~0 (* main_~n~0 14))) (<= (+ main_~i~0 10) main_~n~0))} [138] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {18561#(<= 140 main_~k~0)} is VALID [2022-04-28 03:25:07,668 INFO L272 TraceCheckUtils]: 12: Hoare triple {18561#(<= 140 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {18562#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:25:07,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {18562#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {18563#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:25:07,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {18563#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {18552#false} is VALID [2022-04-28 03:25:07,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {18552#false} assume !false; {18552#false} is VALID [2022-04-28 03:25:07,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:25:07,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:25:07,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360477470] [2022-04-28 03:25:07,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360477470] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:25:07,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308205949] [2022-04-28 03:25:07,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:25:07,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:25:07,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:25:07,670 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:25:07,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 03:25:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:25:07,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:25:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:25:07,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:25:08,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {18551#true} call ULTIMATE.init(); {18551#true} is VALID [2022-04-28 03:25:08,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {18551#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); {18551#true} is VALID [2022-04-28 03:25:08,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {18551#true} assume true; {18551#true} is VALID [2022-04-28 03:25:08,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18551#true} {18551#true} #71#return; {18551#true} is VALID [2022-04-28 03:25:08,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {18551#true} call #t~ret6 := main(); {18551#true} is VALID [2022-04-28 03:25:08,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {18551#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {18583#(<= 0 main_~k~0)} is VALID [2022-04-28 03:25:08,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {18583#(<= 0 main_~k~0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {18587#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} is VALID [2022-04-28 03:25:08,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {18587#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {18591#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:25:08,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {18591#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [139] L31-3-->L31-4_primed: Formula: (let ((.cse0 (<= v_main_~m~0_222 0)) (.cse1 (= v_main_~i~0_308 v_main_~i~0_307)) (.cse2 (= v_main_~j~0_942 v_main_~j~0_926)) (.cse3 (= |v_main_#t~post3_230| |v_main_#t~post3_228|))) (or (and (= v_main_~j~0_926 0) .cse0 (< v_main_~i~0_308 v_main_~i~0_307) (< v_main_~i~0_307 (+ 1 v_main_~n~0_103))) (and .cse1 (or (not .cse0) (not (< v_main_~i~0_308 v_main_~n~0_103))) .cse2 .cse3) (and (= v_main_~m~0_222 v_main_~m~0_222) (= v_main_~n~0_103 v_main_~n~0_103) .cse1 .cse2 .cse3))) InVars {main_~i~0=v_main_~i~0_308, main_~n~0=v_main_~n~0_103, main_#t~post3=|v_main_#t~post3_230|, main_~m~0=v_main_~m~0_222, main_~j~0=v_main_~j~0_942} OutVars{main_~i~0=v_main_~i~0_307, main_#t~post3=|v_main_#t~post3_228|, main_~n~0=v_main_~n~0_103, main_~m~0=v_main_~m~0_222, main_~j~0=v_main_~j~0_926} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post3] {18591#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:25:08,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {18591#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [140] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18591#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:25:08,179 INFO L290 TraceCheckUtils]: 10: Hoare triple {18591#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [141] L31-3-->L31-4_primed: Formula: (let ((.cse1 (<= v_main_~m~0_223 14)) (.cse0 (< 13 v_main_~m~0_223)) (.cse2 (= |v_main_#t~post5_549| |v_main_#t~post5_535|)) (.cse3 (= v_main_~j~0_945 v_main_~j~0_927)) (.cse4 (= |v_main_#t~post3_233| |v_main_#t~post3_229|))) (or (and (< v_main_~i~0_309 (+ 1 v_main_~n~0_104)) (= (+ v_main_~k~0_843 (* 14 v_main_~i~0_310)) (+ (* 14 v_main_~i~0_309) v_main_~k~0_857)) (= v_main_~j~0_927 14) (< v_main_~i~0_310 v_main_~i~0_309) .cse0 .cse1) (and (= |v_main_#t~post4_535| |v_main_#t~post4_549|) (= v_main_~k~0_843 v_main_~k~0_857) .cse2 .cse3 (or (not .cse1) (not .cse0) (not (< v_main_~i~0_310 v_main_~n~0_104))) .cse4 (= v_main_~i~0_309 v_main_~i~0_310)) (and (= v_main_~k~0_857 v_main_~k~0_843) (= |v_main_#t~post4_549| |v_main_#t~post4_535|) .cse2 (= v_main_~m~0_223 v_main_~m~0_223) .cse3 (= v_main_~i~0_310 v_main_~i~0_309) .cse4 (= v_main_~n~0_104 v_main_~n~0_104)))) InVars {main_~m~0=v_main_~m~0_223, main_~k~0=v_main_~k~0_857, main_~j~0=v_main_~j~0_945, main_~i~0=v_main_~i~0_310, main_#t~post4=|v_main_#t~post4_549|, main_#t~post5=|v_main_#t~post5_549|, main_~n~0=v_main_~n~0_104, main_#t~post3=|v_main_#t~post3_233|} OutVars{main_~m~0=v_main_~m~0_223, main_~k~0=v_main_~k~0_843, main_~j~0=v_main_~j~0_927, main_~i~0=v_main_~i~0_309, main_#t~post4=|v_main_#t~post4_535|, main_#t~post5=|v_main_#t~post5_535|, main_#t~post3=|v_main_#t~post3_229|, main_~n~0=v_main_~n~0_104} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {18601#(and (<= 10 main_~n~0) (or (and (< (div main_~k~0 (- 14)) 0) (<= (+ main_~i~0 (div main_~k~0 (- 14))) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:25:08,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {18601#(and (<= 10 main_~n~0) (or (and (< (div main_~k~0 (- 14)) 0) (<= (+ main_~i~0 (div main_~k~0 (- 14))) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [138] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {18561#(<= 140 main_~k~0)} is VALID [2022-04-28 03:25:08,180 INFO L272 TraceCheckUtils]: 12: Hoare triple {18561#(<= 140 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {18608#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:25:08,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {18608#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18612#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:25:08,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {18612#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18552#false} is VALID [2022-04-28 03:25:08,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {18552#false} assume !false; {18552#false} is VALID [2022-04-28 03:25:08,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:25:08,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:25:08,865 INFO L290 TraceCheckUtils]: 15: Hoare triple {18552#false} assume !false; {18552#false} is VALID [2022-04-28 03:25:08,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {18612#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18552#false} is VALID [2022-04-28 03:25:08,866 INFO L290 TraceCheckUtils]: 13: Hoare triple {18608#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18612#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:25:08,866 INFO L272 TraceCheckUtils]: 12: Hoare triple {18628#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {18608#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:25:08,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {18632#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} [138] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {18628#(<= 100 main_~k~0)} is VALID [2022-04-28 03:25:08,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {18636#(and (or (<= main_~n~0 main_~i~0) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 14))) main_~n~0) (not (<= main_~m~0 14)) (not (< 13 main_~m~0))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [141] L31-3-->L31-4_primed: Formula: (let ((.cse1 (<= v_main_~m~0_223 14)) (.cse0 (< 13 v_main_~m~0_223)) (.cse2 (= |v_main_#t~post5_549| |v_main_#t~post5_535|)) (.cse3 (= v_main_~j~0_945 v_main_~j~0_927)) (.cse4 (= |v_main_#t~post3_233| |v_main_#t~post3_229|))) (or (and (< v_main_~i~0_309 (+ 1 v_main_~n~0_104)) (= (+ v_main_~k~0_843 (* 14 v_main_~i~0_310)) (+ (* 14 v_main_~i~0_309) v_main_~k~0_857)) (= v_main_~j~0_927 14) (< v_main_~i~0_310 v_main_~i~0_309) .cse0 .cse1) (and (= |v_main_#t~post4_535| |v_main_#t~post4_549|) (= v_main_~k~0_843 v_main_~k~0_857) .cse2 .cse3 (or (not .cse1) (not .cse0) (not (< v_main_~i~0_310 v_main_~n~0_104))) .cse4 (= v_main_~i~0_309 v_main_~i~0_310)) (and (= v_main_~k~0_857 v_main_~k~0_843) (= |v_main_#t~post4_549| |v_main_#t~post4_535|) .cse2 (= v_main_~m~0_223 v_main_~m~0_223) .cse3 (= v_main_~i~0_310 v_main_~i~0_309) .cse4 (= v_main_~n~0_104 v_main_~n~0_104)))) InVars {main_~m~0=v_main_~m~0_223, main_~k~0=v_main_~k~0_857, main_~j~0=v_main_~j~0_945, main_~i~0=v_main_~i~0_310, main_#t~post4=|v_main_#t~post4_549|, main_#t~post5=|v_main_#t~post5_549|, main_~n~0=v_main_~n~0_104, main_#t~post3=|v_main_#t~post3_233|} OutVars{main_~m~0=v_main_~m~0_223, main_~k~0=v_main_~k~0_843, main_~j~0=v_main_~j~0_927, main_~i~0=v_main_~i~0_309, main_#t~post4=|v_main_#t~post4_535|, main_#t~post5=|v_main_#t~post5_535|, main_#t~post3=|v_main_#t~post3_229|, main_~n~0=v_main_~n~0_104} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {18632#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} is VALID [2022-04-28 03:25:08,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {18636#(and (or (<= main_~n~0 main_~i~0) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 14))) main_~n~0) (not (<= main_~m~0 14)) (not (< 13 main_~m~0))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [140] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18636#(and (or (<= main_~n~0 main_~i~0) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 14))) main_~n~0) (not (<= main_~m~0 14)) (not (< 13 main_~m~0))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:25:08,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {18643#(and (or (<= 100 main_~k~0) (and (< main_~i~0 main_~n~0) (not (<= main_~m~0 0)))) (or (<= main_~n~0 main_~i~0) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 14))) main_~n~0) (not (<= main_~m~0 14)) (not (< 13 main_~m~0))))} [139] L31-3-->L31-4_primed: Formula: (let ((.cse0 (<= v_main_~m~0_222 0)) (.cse1 (= v_main_~i~0_308 v_main_~i~0_307)) (.cse2 (= v_main_~j~0_942 v_main_~j~0_926)) (.cse3 (= |v_main_#t~post3_230| |v_main_#t~post3_228|))) (or (and (= v_main_~j~0_926 0) .cse0 (< v_main_~i~0_308 v_main_~i~0_307) (< v_main_~i~0_307 (+ 1 v_main_~n~0_103))) (and .cse1 (or (not .cse0) (not (< v_main_~i~0_308 v_main_~n~0_103))) .cse2 .cse3) (and (= v_main_~m~0_222 v_main_~m~0_222) (= v_main_~n~0_103 v_main_~n~0_103) .cse1 .cse2 .cse3))) InVars {main_~i~0=v_main_~i~0_308, main_~n~0=v_main_~n~0_103, main_#t~post3=|v_main_#t~post3_230|, main_~m~0=v_main_~m~0_222, main_~j~0=v_main_~j~0_942} OutVars{main_~i~0=v_main_~i~0_307, main_#t~post3=|v_main_#t~post3_228|, main_~n~0=v_main_~n~0_103, main_~m~0=v_main_~m~0_222, main_~j~0=v_main_~j~0_926} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post3] {18636#(and (or (<= main_~n~0 main_~i~0) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 14))) main_~n~0) (not (<= main_~m~0 14)) (not (< 13 main_~m~0))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:25:08,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {18647#(and (or (<= (div (+ (- 100) main_~k~0) (- 14)) 1) (<= (div (+ (- 100) main_~k~0) (- 14)) main_~n~0)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {18643#(and (or (<= 100 main_~k~0) (and (< main_~i~0 main_~n~0) (not (<= main_~m~0 0)))) (or (<= main_~n~0 main_~i~0) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 14))) main_~n~0) (not (<= main_~m~0 14)) (not (< 13 main_~m~0))))} is VALID [2022-04-28 03:25:08,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {18651#(<= (div (+ (- 100) main_~k~0) (- 14)) 10)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {18647#(and (or (<= (div (+ (- 100) main_~k~0) (- 14)) 1) (<= (div (+ (- 100) main_~k~0) (- 14)) main_~n~0)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} is VALID [2022-04-28 03:25:08,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {18551#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {18651#(<= (div (+ (- 100) main_~k~0) (- 14)) 10)} is VALID [2022-04-28 03:25:08,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {18551#true} call #t~ret6 := main(); {18551#true} is VALID [2022-04-28 03:25:08,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18551#true} {18551#true} #71#return; {18551#true} is VALID [2022-04-28 03:25:08,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {18551#true} assume true; {18551#true} is VALID [2022-04-28 03:25:08,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {18551#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); {18551#true} is VALID [2022-04-28 03:25:08,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {18551#true} call ULTIMATE.init(); {18551#true} is VALID [2022-04-28 03:25:08,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:25:08,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308205949] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:25:08,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:25:08,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 23 [2022-04-28 03:25:09,925 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:25:09,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [774624087] [2022-04-28 03:25:09,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [774624087] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:25:09,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:25:09,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-28 03:25:09,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263706932] [2022-04-28 03:25:09,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:25:09,925 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 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 47 [2022-04-28 03:25:09,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:25:09,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:25:09,957 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 03:25:09,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-28 03:25:09,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:25:09,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-28 03:25:09,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=495, Invalid=2475, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 03:25:09,958 INFO L87 Difference]: Start difference. First operand 220 states and 277 transitions. Second operand has 41 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:25:13,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:25:13,863 INFO L93 Difference]: Finished difference Result 235 states and 294 transitions. [2022-04-28 03:25:13,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 03:25:13,863 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 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 47 [2022-04-28 03:25:13,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:25:13,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:25:13,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 71 transitions. [2022-04-28 03:25:13,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:25:13,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 71 transitions. [2022-04-28 03:25:13,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 71 transitions. [2022-04-28 03:25:13,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:25:13,924 INFO L225 Difference]: With dead ends: 235 [2022-04-28 03:25:13,924 INFO L226 Difference]: Without dead ends: 226 [2022-04-28 03:25:13,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1952 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=985, Invalid=7025, Unknown=0, NotChecked=0, Total=8010 [2022-04-28 03:25:13,924 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 28 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 1712 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 1743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:25:13,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 185 Invalid, 1743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1712 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 03:25:13,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-04-28 03:25:14,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 223. [2022-04-28 03:25:14,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:25:14,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 226 states. Second operand has 223 states, 218 states have (on average 1.2660550458715596) internal successors, (276), 218 states have internal predecessors, (276), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:25:14,814 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand has 223 states, 218 states have (on average 1.2660550458715596) internal successors, (276), 218 states have internal predecessors, (276), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:25:14,814 INFO L87 Difference]: Start difference. First operand 226 states. Second operand has 223 states, 218 states have (on average 1.2660550458715596) internal successors, (276), 218 states have internal predecessors, (276), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:25:14,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:25:14,816 INFO L93 Difference]: Finished difference Result 226 states and 283 transitions. [2022-04-28 03:25:14,816 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 283 transitions. [2022-04-28 03:25:14,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:25:14,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:25:14,817 INFO L74 IsIncluded]: Start isIncluded. First operand has 223 states, 218 states have (on average 1.2660550458715596) internal successors, (276), 218 states have internal predecessors, (276), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 226 states. [2022-04-28 03:25:14,817 INFO L87 Difference]: Start difference. First operand has 223 states, 218 states have (on average 1.2660550458715596) internal successors, (276), 218 states have internal predecessors, (276), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 226 states. [2022-04-28 03:25:14,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:25:14,819 INFO L93 Difference]: Finished difference Result 226 states and 283 transitions. [2022-04-28 03:25:14,819 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 283 transitions. [2022-04-28 03:25:14,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:25:14,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:25:14,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:25:14,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:25:14,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 218 states have (on average 1.2660550458715596) internal successors, (276), 218 states have internal predecessors, (276), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:25:14,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 280 transitions. [2022-04-28 03:25:14,822 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 280 transitions. Word has length 47 [2022-04-28 03:25:14,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:25:14,823 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 280 transitions. [2022-04-28 03:25:14,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:25:14,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 223 states and 280 transitions. [2022-04-28 03:25:15,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 280 edges. 280 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:25:15,499 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 280 transitions. [2022-04-28 03:25:15,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-28 03:25:15,499 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:25:15,499 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:25:15,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 03:25:15,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-28 03:25:15,713 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:25:15,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:25:15,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1648156121, now seen corresponding path program 25 times [2022-04-28 03:25:15,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:25:15,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1593588196] [2022-04-28 03:25:15,869 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:25:18,726 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:25:18,864 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:25:18,865 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:25:18,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1230534754, now seen corresponding path program 1 times [2022-04-28 03:25:18,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:25:18,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138867030] [2022-04-28 03:25:18,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:25:18,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:25:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:25:18,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:25:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:25:18,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {20154#(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); {20142#true} is VALID [2022-04-28 03:25:18,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {20142#true} assume true; {20142#true} is VALID [2022-04-28 03:25:18,939 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20142#true} {20142#true} #71#return; {20142#true} is VALID [2022-04-28 03:25:18,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {20142#true} call ULTIMATE.init(); {20154#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:25:18,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {20154#(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); {20142#true} is VALID [2022-04-28 03:25:18,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {20142#true} assume true; {20142#true} is VALID [2022-04-28 03:25:18,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20142#true} {20142#true} #71#return; {20142#true} is VALID [2022-04-28 03:25:18,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {20142#true} call #t~ret6 := main(); {20142#true} is VALID [2022-04-28 03:25:18,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {20142#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {20147#(= main_~k~0 0)} is VALID [2022-04-28 03:25:18,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {20147#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {20148#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:25:18,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {20148#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {20149#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:25:18,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {20149#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [143] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post3_243| |v_main_#t~post3_242|)) (.cse1 (= |v_main_#t~post4_578| |v_main_#t~post4_562|)) (.cse2 (= v_main_~i~0_327 v_main_~i~0_326)) (.cse3 (= v_main_~k~0_904 v_main_~k~0_888)) (.cse6 (= v_main_~j~0_996 v_main_~j~0_979)) (.cse5 (< 15 v_main_~m~0_232)) (.cse4 (<= v_main_~m~0_232 16))) (or (and (= |v_main_#t~post5_562| |v_main_#t~post5_578|) .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~i~0_327 v_main_~n~0_108)) (not .cse5)) .cse6) (and (= v_main_~m~0_232 v_main_~m~0_232) .cse0 .cse1 .cse2 .cse3 (= v_main_~n~0_108 v_main_~n~0_108) (= |v_main_#t~post5_578| |v_main_#t~post5_562|) .cse6) (and .cse5 (< v_main_~i~0_326 (+ 1 v_main_~n~0_108)) (= (+ (* 16 v_main_~i~0_326) v_main_~k~0_904) (+ v_main_~k~0_888 (* 16 v_main_~i~0_327))) (= v_main_~j~0_979 16) (< v_main_~i~0_327 v_main_~i~0_326) .cse4))) InVars {main_~m~0=v_main_~m~0_232, main_~k~0=v_main_~k~0_904, main_~j~0=v_main_~j~0_996, main_~i~0=v_main_~i~0_327, main_#t~post4=|v_main_#t~post4_578|, main_#t~post5=|v_main_#t~post5_578|, main_~n~0=v_main_~n~0_108, main_#t~post3=|v_main_#t~post3_243|} OutVars{main_~m~0=v_main_~m~0_232, main_~k~0=v_main_~k~0_888, main_~j~0=v_main_~j~0_979, main_~i~0=v_main_~i~0_326, main_#t~post4=|v_main_#t~post4_562|, main_#t~post5=|v_main_#t~post5_562|, main_#t~post3=|v_main_#t~post3_242|, main_~n~0=v_main_~n~0_108} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {20150#(or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ 160 (* main_~i~0 16)) (+ main_~k~0 (* main_~n~0 16))))} is VALID [2022-04-28 03:25:18,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {20150#(or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ 160 (* main_~i~0 16)) (+ main_~k~0 (* main_~n~0 16))))} [142] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {20151#(<= 160 main_~k~0)} is VALID [2022-04-28 03:25:18,942 INFO L272 TraceCheckUtils]: 10: Hoare triple {20151#(<= 160 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {20152#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:25:18,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {20152#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {20153#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:25:18,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {20153#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {20143#false} is VALID [2022-04-28 03:25:18,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {20143#false} assume !false; {20143#false} is VALID [2022-04-28 03:25:18,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:25:18,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:25:18,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138867030] [2022-04-28 03:25:18,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138867030] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:25:18,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:25:18,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:25:20,963 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:25:20,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1593588196] [2022-04-28 03:25:20,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1593588196] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:25:20,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:25:20,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-28 03:25:20,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198455241] [2022-04-28 03:25:20,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:25:20,963 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 42 states have internal predecessors, (44), 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 48 [2022-04-28 03:25:20,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:25:20,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 42 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:25:21,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:25:21,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-28 03:25:21,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:25:21,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-28 03:25:21,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 03:25:21,012 INFO L87 Difference]: Start difference. First operand 223 states and 280 transitions. Second operand has 44 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 42 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:25:29,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:25:29,606 INFO L93 Difference]: Finished difference Result 289 states and 366 transitions. [2022-04-28 03:25:29,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-28 03:25:29,606 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 42 states have internal predecessors, (44), 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 48 [2022-04-28 03:25:29,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:25:29,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 42 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:25:29,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 99 transitions. [2022-04-28 03:25:29,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 42 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:25:29,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 99 transitions. [2022-04-28 03:25:29,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 99 transitions. [2022-04-28 03:25:29,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:25:29,722 INFO L225 Difference]: With dead ends: 289 [2022-04-28 03:25:29,722 INFO L226 Difference]: Without dead ends: 284 [2022-04-28 03:25:29,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=361, Invalid=7295, Unknown=0, NotChecked=0, Total=7656 [2022-04-28 03:25:29,723 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 50 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 3212 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 3250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 3212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:25:29,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 215 Invalid, 3250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 3212 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-28 03:25:29,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-04-28 03:25:30,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 260. [2022-04-28 03:25:30,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:25:30,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 284 states. Second operand has 260 states, 255 states have (on average 1.2980392156862746) internal successors, (331), 255 states have internal predecessors, (331), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:25:30,782 INFO L74 IsIncluded]: Start isIncluded. First operand 284 states. Second operand has 260 states, 255 states have (on average 1.2980392156862746) internal successors, (331), 255 states have internal predecessors, (331), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:25:30,782 INFO L87 Difference]: Start difference. First operand 284 states. Second operand has 260 states, 255 states have (on average 1.2980392156862746) internal successors, (331), 255 states have internal predecessors, (331), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:25:30,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:25:30,785 INFO L93 Difference]: Finished difference Result 284 states and 361 transitions. [2022-04-28 03:25:30,785 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 361 transitions. [2022-04-28 03:25:30,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:25:30,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:25:30,786 INFO L74 IsIncluded]: Start isIncluded. First operand has 260 states, 255 states have (on average 1.2980392156862746) internal successors, (331), 255 states have internal predecessors, (331), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 284 states. [2022-04-28 03:25:30,786 INFO L87 Difference]: Start difference. First operand has 260 states, 255 states have (on average 1.2980392156862746) internal successors, (331), 255 states have internal predecessors, (331), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 284 states. [2022-04-28 03:25:30,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:25:30,790 INFO L93 Difference]: Finished difference Result 284 states and 361 transitions. [2022-04-28 03:25:30,790 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 361 transitions. [2022-04-28 03:25:30,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:25:30,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:25:30,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:25:30,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:25:30,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 255 states have (on average 1.2980392156862746) internal successors, (331), 255 states have internal predecessors, (331), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:25:30,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 335 transitions. [2022-04-28 03:25:30,793 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 335 transitions. Word has length 48 [2022-04-28 03:25:30,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:25:30,793 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 335 transitions. [2022-04-28 03:25:30,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 42 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:25:30,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 260 states and 335 transitions. [2022-04-28 03:25:31,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 335 edges. 335 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:25:31,711 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 335 transitions. [2022-04-28 03:25:31,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 03:25:31,712 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:25:31,712 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:25:31,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-28 03:25:31,712 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:25:31,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:25:31,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1172478814, now seen corresponding path program 26 times [2022-04-28 03:25:31,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:25:31,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [661819517] [2022-04-28 03:25:35,923 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:25:36,059 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:25:36,226 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:25:37,650 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:25:41,751 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:25:41,849 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:25:41,851 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:25:41,853 INFO L85 PathProgramCache]: Analyzing trace with hash -2079089599, now seen corresponding path program 1 times [2022-04-28 03:25:41,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:25:41,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484277116] [2022-04-28 03:25:41,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:25:41,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:25:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:25:41,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:25:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:25:41,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {21956#(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); {21943#true} is VALID [2022-04-28 03:25:41,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {21943#true} assume true; {21943#true} is VALID [2022-04-28 03:25:41,957 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21943#true} {21943#true} #71#return; {21943#true} is VALID [2022-04-28 03:25:41,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {21943#true} call ULTIMATE.init(); {21956#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:25:41,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {21956#(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); {21943#true} is VALID [2022-04-28 03:25:41,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {21943#true} assume true; {21943#true} is VALID [2022-04-28 03:25:41,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21943#true} {21943#true} #71#return; {21943#true} is VALID [2022-04-28 03:25:41,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {21943#true} call #t~ret6 := main(); {21943#true} is VALID [2022-04-28 03:25:41,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {21943#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {21948#(= main_~k~0 0)} is VALID [2022-04-28 03:25:41,958 INFO L290 TraceCheckUtils]: 6: Hoare triple {21948#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {21949#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:25:41,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {21949#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {21950#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:25:41,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {21950#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} [145] L31-3-->L31-4_primed: Formula: (let ((.cse0 (< 12 v_main_~m~0_244)) (.cse1 (<= v_main_~m~0_244 13)) (.cse2 (= |v_main_#t~post3_256| |v_main_#t~post3_254|)) (.cse3 (= |v_main_#t~post5_610| |v_main_#t~post5_595|)) (.cse4 (= |v_main_#t~post4_610| |v_main_#t~post4_595|)) (.cse5 (= v_main_~j~0_1053 v_main_~j~0_1036)) (.cse6 (= v_main_~i~0_343 v_main_~i~0_342))) (or (and .cse0 (= v_main_~j~0_1036 13) (< v_main_~i~0_342 (+ 1 v_main_~n~0_115)) (= (+ v_main_~k~0_954 (* 13 v_main_~i~0_342)) (+ v_main_~k~0_941 (* 13 v_main_~i~0_343))) (< v_main_~i~0_343 v_main_~i~0_342) .cse1) (and (= v_main_~k~0_941 v_main_~k~0_954) .cse2 .cse3 (or (not .cse0) (not (< v_main_~i~0_343 v_main_~n~0_115)) (not .cse1)) .cse4 .cse5 .cse6) (and .cse2 .cse3 .cse4 (= v_main_~k~0_954 v_main_~k~0_941) (= v_main_~m~0_244 v_main_~m~0_244) (= v_main_~n~0_115 v_main_~n~0_115) .cse5 .cse6))) InVars {main_~m~0=v_main_~m~0_244, main_~k~0=v_main_~k~0_954, main_~j~0=v_main_~j~0_1053, main_~i~0=v_main_~i~0_343, main_#t~post4=|v_main_#t~post4_610|, main_#t~post5=|v_main_#t~post5_610|, main_~n~0=v_main_~n~0_115, main_#t~post3=|v_main_#t~post3_256|} OutVars{main_~m~0=v_main_~m~0_244, main_~k~0=v_main_~k~0_941, main_~j~0=v_main_~j~0_1036, main_~i~0=v_main_~i~0_342, main_#t~post4=|v_main_#t~post4_595|, main_#t~post5=|v_main_#t~post5_595|, main_#t~post3=|v_main_#t~post3_254|, main_~n~0=v_main_~n~0_115} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {21951#(and (<= 10 main_~m~0) (or (<= (+ (* main_~i~0 13) 130) (+ (* main_~n~0 13) main_~k~0)) (<= (+ main_~i~0 10) main_~n~0)))} is VALID [2022-04-28 03:25:41,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {21951#(and (<= 10 main_~m~0) (or (<= (+ (* main_~i~0 13) 130) (+ (* main_~n~0 13) main_~k~0)) (<= (+ main_~i~0 10) main_~n~0)))} [146] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21951#(and (<= 10 main_~m~0) (or (<= (+ (* main_~i~0 13) 130) (+ (* main_~n~0 13) main_~k~0)) (<= (+ main_~i~0 10) main_~n~0)))} is VALID [2022-04-28 03:25:41,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {21951#(and (<= 10 main_~m~0) (or (<= (+ (* main_~i~0 13) 130) (+ (* main_~n~0 13) main_~k~0)) (<= (+ main_~i~0 10) main_~n~0)))} [147] L31-3-->L31-4_primed: Formula: (let ((.cse2 (<= v_main_~m~0_245 2)) (.cse1 (< 1 v_main_~m~0_245)) (.cse0 (= v_main_~i~0_345 v_main_~i~0_344)) (.cse3 (= |v_main_#t~post3_259| |v_main_#t~post3_255|)) (.cse4 (= v_main_~k~0_957 v_main_~k~0_955))) (or (and (= v_main_~j~0_1050 v_main_~j~0_1056) .cse0 (or (not .cse1) (not .cse2) (not (< v_main_~i~0_345 v_main_~n~0_116))) .cse3 .cse4 (= |v_main_#t~post5_608| |v_main_#t~post5_613|) (= |v_main_#t~post4_608| |v_main_#t~post4_613|)) (and (< v_main_~i~0_344 (+ 1 v_main_~n~0_116)) .cse2 (= (+ v_main_~k~0_955 (* 2 v_main_~i~0_345)) (+ v_main_~k~0_957 (* 2 v_main_~i~0_344))) (= 2 v_main_~j~0_1050) (< v_main_~i~0_345 v_main_~i~0_344) .cse1) (and (= v_main_~m~0_245 v_main_~m~0_245) (= v_main_~j~0_1056 v_main_~j~0_1050) .cse0 .cse3 (= v_main_~n~0_116 v_main_~n~0_116) .cse4 (= |v_main_#t~post4_613| |v_main_#t~post4_608|) (= |v_main_#t~post5_613| |v_main_#t~post5_608|)))) InVars {main_~m~0=v_main_~m~0_245, main_~k~0=v_main_~k~0_957, main_~j~0=v_main_~j~0_1056, main_~i~0=v_main_~i~0_345, main_#t~post4=|v_main_#t~post4_613|, main_#t~post5=|v_main_#t~post5_613|, main_~n~0=v_main_~n~0_116, main_#t~post3=|v_main_#t~post3_259|} OutVars{main_~m~0=v_main_~m~0_245, main_~k~0=v_main_~k~0_955, main_~j~0=v_main_~j~0_1050, main_~i~0=v_main_~i~0_344, main_#t~post4=|v_main_#t~post4_608|, main_#t~post5=|v_main_#t~post5_608|, main_#t~post3=|v_main_#t~post3_255|, main_~n~0=v_main_~n~0_116} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {21952#(or (<= (+ (* main_~i~0 13) 130) (+ (* main_~n~0 13) main_~k~0)) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:25:41,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {21952#(or (<= (+ (* main_~i~0 13) 130) (+ (* main_~n~0 13) main_~k~0)) (<= (+ main_~i~0 10) main_~n~0))} [144] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {21953#(<= 130 main_~k~0)} is VALID [2022-04-28 03:25:41,962 INFO L272 TraceCheckUtils]: 12: Hoare triple {21953#(<= 130 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {21954#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:25:41,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {21954#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {21955#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:25:41,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {21955#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {21944#false} is VALID [2022-04-28 03:25:41,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {21944#false} assume !false; {21944#false} is VALID [2022-04-28 03:25:41,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:25:41,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:25:41,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484277116] [2022-04-28 03:25:41,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484277116] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:25:41,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388028263] [2022-04-28 03:25:41,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:25:41,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:25:41,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:25:41,969 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:25:41,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 03:25:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:25:42,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:25:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:25:42,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:25:42,547 INFO L272 TraceCheckUtils]: 0: Hoare triple {21943#true} call ULTIMATE.init(); {21943#true} is VALID [2022-04-28 03:25:42,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {21943#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); {21943#true} is VALID [2022-04-28 03:25:42,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {21943#true} assume true; {21943#true} is VALID [2022-04-28 03:25:42,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21943#true} {21943#true} #71#return; {21943#true} is VALID [2022-04-28 03:25:42,547 INFO L272 TraceCheckUtils]: 4: Hoare triple {21943#true} call #t~ret6 := main(); {21943#true} is VALID [2022-04-28 03:25:42,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {21943#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {21975#(<= 0 main_~k~0)} is VALID [2022-04-28 03:25:42,548 INFO L290 TraceCheckUtils]: 6: Hoare triple {21975#(<= 0 main_~k~0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {21979#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} is VALID [2022-04-28 03:25:42,548 INFO L290 TraceCheckUtils]: 7: Hoare triple {21979#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {21983#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:25:42,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {21983#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [145] L31-3-->L31-4_primed: Formula: (let ((.cse0 (< 12 v_main_~m~0_244)) (.cse1 (<= v_main_~m~0_244 13)) (.cse2 (= |v_main_#t~post3_256| |v_main_#t~post3_254|)) (.cse3 (= |v_main_#t~post5_610| |v_main_#t~post5_595|)) (.cse4 (= |v_main_#t~post4_610| |v_main_#t~post4_595|)) (.cse5 (= v_main_~j~0_1053 v_main_~j~0_1036)) (.cse6 (= v_main_~i~0_343 v_main_~i~0_342))) (or (and .cse0 (= v_main_~j~0_1036 13) (< v_main_~i~0_342 (+ 1 v_main_~n~0_115)) (= (+ v_main_~k~0_954 (* 13 v_main_~i~0_342)) (+ v_main_~k~0_941 (* 13 v_main_~i~0_343))) (< v_main_~i~0_343 v_main_~i~0_342) .cse1) (and (= v_main_~k~0_941 v_main_~k~0_954) .cse2 .cse3 (or (not .cse0) (not (< v_main_~i~0_343 v_main_~n~0_115)) (not .cse1)) .cse4 .cse5 .cse6) (and .cse2 .cse3 .cse4 (= v_main_~k~0_954 v_main_~k~0_941) (= v_main_~m~0_244 v_main_~m~0_244) (= v_main_~n~0_115 v_main_~n~0_115) .cse5 .cse6))) InVars {main_~m~0=v_main_~m~0_244, main_~k~0=v_main_~k~0_954, main_~j~0=v_main_~j~0_1053, main_~i~0=v_main_~i~0_343, main_#t~post4=|v_main_#t~post4_610|, main_#t~post5=|v_main_#t~post5_610|, main_~n~0=v_main_~n~0_115, main_#t~post3=|v_main_#t~post3_256|} OutVars{main_~m~0=v_main_~m~0_244, main_~k~0=v_main_~k~0_941, main_~j~0=v_main_~j~0_1036, main_~i~0=v_main_~i~0_342, main_#t~post4=|v_main_#t~post4_595|, main_#t~post5=|v_main_#t~post5_595|, main_#t~post3=|v_main_#t~post3_254|, main_~n~0=v_main_~n~0_115} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {21987#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (or (and (<= (+ main_~i~0 (div main_~k~0 (- 13))) 0) (< 12 main_~m~0) (= main_~j~0 13) (< (div main_~k~0 (- 13)) 0) (<= main_~m~0 13) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:25:42,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {21987#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (or (and (<= (+ main_~i~0 (div main_~k~0 (- 13))) 0) (< 12 main_~m~0) (= main_~j~0 13) (< (div main_~k~0 (- 13)) 0) (<= main_~m~0 13) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [146] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21987#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (or (and (<= (+ main_~i~0 (div main_~k~0 (- 13))) 0) (< 12 main_~m~0) (= main_~j~0 13) (< (div main_~k~0 (- 13)) 0) (<= main_~m~0 13) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:25:42,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {21987#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (or (and (<= (+ main_~i~0 (div main_~k~0 (- 13))) 0) (< 12 main_~m~0) (= main_~j~0 13) (< (div main_~k~0 (- 13)) 0) (<= main_~m~0 13) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [147] L31-3-->L31-4_primed: Formula: (let ((.cse2 (<= v_main_~m~0_245 2)) (.cse1 (< 1 v_main_~m~0_245)) (.cse0 (= v_main_~i~0_345 v_main_~i~0_344)) (.cse3 (= |v_main_#t~post3_259| |v_main_#t~post3_255|)) (.cse4 (= v_main_~k~0_957 v_main_~k~0_955))) (or (and (= v_main_~j~0_1050 v_main_~j~0_1056) .cse0 (or (not .cse1) (not .cse2) (not (< v_main_~i~0_345 v_main_~n~0_116))) .cse3 .cse4 (= |v_main_#t~post5_608| |v_main_#t~post5_613|) (= |v_main_#t~post4_608| |v_main_#t~post4_613|)) (and (< v_main_~i~0_344 (+ 1 v_main_~n~0_116)) .cse2 (= (+ v_main_~k~0_955 (* 2 v_main_~i~0_345)) (+ v_main_~k~0_957 (* 2 v_main_~i~0_344))) (= 2 v_main_~j~0_1050) (< v_main_~i~0_345 v_main_~i~0_344) .cse1) (and (= v_main_~m~0_245 v_main_~m~0_245) (= v_main_~j~0_1056 v_main_~j~0_1050) .cse0 .cse3 (= v_main_~n~0_116 v_main_~n~0_116) .cse4 (= |v_main_#t~post4_613| |v_main_#t~post4_608|) (= |v_main_#t~post5_613| |v_main_#t~post5_608|)))) InVars {main_~m~0=v_main_~m~0_245, main_~k~0=v_main_~k~0_957, main_~j~0=v_main_~j~0_1056, main_~i~0=v_main_~i~0_345, main_#t~post4=|v_main_#t~post4_613|, main_#t~post5=|v_main_#t~post5_613|, main_~n~0=v_main_~n~0_116, main_#t~post3=|v_main_#t~post3_259|} OutVars{main_~m~0=v_main_~m~0_245, main_~k~0=v_main_~k~0_955, main_~j~0=v_main_~j~0_1050, main_~i~0=v_main_~i~0_344, main_#t~post4=|v_main_#t~post4_608|, main_#t~post5=|v_main_#t~post5_608|, main_#t~post3=|v_main_#t~post3_255|, main_~n~0=v_main_~n~0_116} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {21994#(and (<= 10 main_~n~0) (or (and (<= (+ main_~i~0 (div main_~k~0 (- 13))) 0) (< (div main_~k~0 (- 13)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:25:42,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {21994#(and (<= 10 main_~n~0) (or (and (<= (+ main_~i~0 (div main_~k~0 (- 13))) 0) (< (div main_~k~0 (- 13)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [144] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {21953#(<= 130 main_~k~0)} is VALID [2022-04-28 03:25:42,552 INFO L272 TraceCheckUtils]: 12: Hoare triple {21953#(<= 130 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {22001#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:25:42,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {22001#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22005#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:25:42,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {22005#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21944#false} is VALID [2022-04-28 03:25:42,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {21944#false} assume !false; {21944#false} is VALID [2022-04-28 03:25:42,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:25:42,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:25:43,269 INFO L290 TraceCheckUtils]: 15: Hoare triple {21944#false} assume !false; {21944#false} is VALID [2022-04-28 03:25:43,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {22005#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21944#false} is VALID [2022-04-28 03:25:43,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {22001#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22005#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:25:43,271 INFO L272 TraceCheckUtils]: 12: Hoare triple {22021#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {22001#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:25:43,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {22025#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} [144] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {22021#(<= 100 main_~k~0)} is VALID [2022-04-28 03:25:43,272 INFO L290 TraceCheckUtils]: 10: Hoare triple {22029#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 2))) main_~n~0) (not (< 1 main_~m~0)) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 2))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [147] L31-3-->L31-4_primed: Formula: (let ((.cse2 (<= v_main_~m~0_245 2)) (.cse1 (< 1 v_main_~m~0_245)) (.cse0 (= v_main_~i~0_345 v_main_~i~0_344)) (.cse3 (= |v_main_#t~post3_259| |v_main_#t~post3_255|)) (.cse4 (= v_main_~k~0_957 v_main_~k~0_955))) (or (and (= v_main_~j~0_1050 v_main_~j~0_1056) .cse0 (or (not .cse1) (not .cse2) (not (< v_main_~i~0_345 v_main_~n~0_116))) .cse3 .cse4 (= |v_main_#t~post5_608| |v_main_#t~post5_613|) (= |v_main_#t~post4_608| |v_main_#t~post4_613|)) (and (< v_main_~i~0_344 (+ 1 v_main_~n~0_116)) .cse2 (= (+ v_main_~k~0_955 (* 2 v_main_~i~0_345)) (+ v_main_~k~0_957 (* 2 v_main_~i~0_344))) (= 2 v_main_~j~0_1050) (< v_main_~i~0_345 v_main_~i~0_344) .cse1) (and (= v_main_~m~0_245 v_main_~m~0_245) (= v_main_~j~0_1056 v_main_~j~0_1050) .cse0 .cse3 (= v_main_~n~0_116 v_main_~n~0_116) .cse4 (= |v_main_#t~post4_613| |v_main_#t~post4_608|) (= |v_main_#t~post5_613| |v_main_#t~post5_608|)))) InVars {main_~m~0=v_main_~m~0_245, main_~k~0=v_main_~k~0_957, main_~j~0=v_main_~j~0_1056, main_~i~0=v_main_~i~0_345, main_#t~post4=|v_main_#t~post4_613|, main_#t~post5=|v_main_#t~post5_613|, main_~n~0=v_main_~n~0_116, main_#t~post3=|v_main_#t~post3_259|} OutVars{main_~m~0=v_main_~m~0_245, main_~k~0=v_main_~k~0_955, main_~j~0=v_main_~j~0_1050, main_~i~0=v_main_~i~0_344, main_#t~post4=|v_main_#t~post4_608|, main_#t~post5=|v_main_#t~post5_608|, main_#t~post3=|v_main_#t~post3_255|, main_~n~0=v_main_~n~0_116} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {22025#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} is VALID [2022-04-28 03:25:43,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {22029#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 2))) main_~n~0) (not (< 1 main_~m~0)) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 2))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [146] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22029#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 2))) main_~n~0) (not (< 1 main_~m~0)) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 2))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:25:43,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {22036#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 2))) main_~n~0) (not (< 1 main_~m~0)) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 2))) (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 13))) main_~n~0) (<= main_~n~0 main_~i~0) (not (< 12 main_~m~0)) (not (<= main_~m~0 13))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [145] L31-3-->L31-4_primed: Formula: (let ((.cse0 (< 12 v_main_~m~0_244)) (.cse1 (<= v_main_~m~0_244 13)) (.cse2 (= |v_main_#t~post3_256| |v_main_#t~post3_254|)) (.cse3 (= |v_main_#t~post5_610| |v_main_#t~post5_595|)) (.cse4 (= |v_main_#t~post4_610| |v_main_#t~post4_595|)) (.cse5 (= v_main_~j~0_1053 v_main_~j~0_1036)) (.cse6 (= v_main_~i~0_343 v_main_~i~0_342))) (or (and .cse0 (= v_main_~j~0_1036 13) (< v_main_~i~0_342 (+ 1 v_main_~n~0_115)) (= (+ v_main_~k~0_954 (* 13 v_main_~i~0_342)) (+ v_main_~k~0_941 (* 13 v_main_~i~0_343))) (< v_main_~i~0_343 v_main_~i~0_342) .cse1) (and (= v_main_~k~0_941 v_main_~k~0_954) .cse2 .cse3 (or (not .cse0) (not (< v_main_~i~0_343 v_main_~n~0_115)) (not .cse1)) .cse4 .cse5 .cse6) (and .cse2 .cse3 .cse4 (= v_main_~k~0_954 v_main_~k~0_941) (= v_main_~m~0_244 v_main_~m~0_244) (= v_main_~n~0_115 v_main_~n~0_115) .cse5 .cse6))) InVars {main_~m~0=v_main_~m~0_244, main_~k~0=v_main_~k~0_954, main_~j~0=v_main_~j~0_1053, main_~i~0=v_main_~i~0_343, main_#t~post4=|v_main_#t~post4_610|, main_#t~post5=|v_main_#t~post5_610|, main_~n~0=v_main_~n~0_115, main_#t~post3=|v_main_#t~post3_256|} OutVars{main_~m~0=v_main_~m~0_244, main_~k~0=v_main_~k~0_941, main_~j~0=v_main_~j~0_1036, main_~i~0=v_main_~i~0_342, main_#t~post4=|v_main_#t~post4_595|, main_#t~post5=|v_main_#t~post5_595|, main_#t~post3=|v_main_#t~post3_254|, main_~n~0=v_main_~n~0_115} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {22029#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 2))) main_~n~0) (not (< 1 main_~m~0)) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 2))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:25:43,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {22040#(and (or (<= (div (+ (- 100) main_~k~0) (- 13)) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 13)) 1)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {22036#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 2))) main_~n~0) (not (< 1 main_~m~0)) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 2))) (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 13))) main_~n~0) (<= main_~n~0 main_~i~0) (not (< 12 main_~m~0)) (not (<= main_~m~0 13))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:25:43,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {22044#(<= (div (+ (- 100) main_~k~0) (- 13)) 10)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {22040#(and (or (<= (div (+ (- 100) main_~k~0) (- 13)) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 13)) 1)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} is VALID [2022-04-28 03:25:43,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {21943#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {22044#(<= (div (+ (- 100) main_~k~0) (- 13)) 10)} is VALID [2022-04-28 03:25:43,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {21943#true} call #t~ret6 := main(); {21943#true} is VALID [2022-04-28 03:25:43,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21943#true} {21943#true} #71#return; {21943#true} is VALID [2022-04-28 03:25:43,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {21943#true} assume true; {21943#true} is VALID [2022-04-28 03:25:43,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {21943#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); {21943#true} is VALID [2022-04-28 03:25:43,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {21943#true} call ULTIMATE.init(); {21943#true} is VALID [2022-04-28 03:25:43,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:25:43,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388028263] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:25:43,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:25:43,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2022-04-28 03:25:45,706 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:25:45,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [661819517] [2022-04-28 03:25:45,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [661819517] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:25:45,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:25:45,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-28 03:25:45,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871746035] [2022-04-28 03:25:45,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:25:45,707 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 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 49 [2022-04-28 03:25:45,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:25:45,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:25:45,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:25:45,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-28 03:25:45,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:25:45,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-28 03:25:45,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=2871, Unknown=0, NotChecked=0, Total=3422 [2022-04-28 03:25:45,753 INFO L87 Difference]: Start difference. First operand 260 states and 335 transitions. Second operand has 43 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:25:51,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:25:51,507 INFO L93 Difference]: Finished difference Result 276 states and 353 transitions. [2022-04-28 03:25:51,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-28 03:25:51,507 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 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 49 [2022-04-28 03:25:51,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:25:51,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:25:51,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 82 transitions. [2022-04-28 03:25:51,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:25:51,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 82 transitions. [2022-04-28 03:25:51,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 82 transitions. [2022-04-28 03:25:51,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:25:51,585 INFO L225 Difference]: With dead ends: 276 [2022-04-28 03:25:51,586 INFO L226 Difference]: Without dead ends: 267 [2022-04-28 03:25:51,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2146 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1050, Invalid=7692, Unknown=0, NotChecked=0, Total=8742 [2022-04-28 03:25:51,586 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 1684 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 1774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:25:51,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 195 Invalid, 1774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1684 Invalid, 0 Unknown, 49 Unchecked, 1.7s Time] [2022-04-28 03:25:51,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-04-28 03:25:52,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 255. [2022-04-28 03:25:52,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:25:52,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand has 255 states, 250 states have (on average 1.264) internal successors, (316), 250 states have internal predecessors, (316), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:25:52,632 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand has 255 states, 250 states have (on average 1.264) internal successors, (316), 250 states have internal predecessors, (316), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:25:52,632 INFO L87 Difference]: Start difference. First operand 267 states. Second operand has 255 states, 250 states have (on average 1.264) internal successors, (316), 250 states have internal predecessors, (316), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:25:52,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:25:52,635 INFO L93 Difference]: Finished difference Result 267 states and 333 transitions. [2022-04-28 03:25:52,635 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 333 transitions. [2022-04-28 03:25:52,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:25:52,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:25:52,635 INFO L74 IsIncluded]: Start isIncluded. First operand has 255 states, 250 states have (on average 1.264) internal successors, (316), 250 states have internal predecessors, (316), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 267 states. [2022-04-28 03:25:52,635 INFO L87 Difference]: Start difference. First operand has 255 states, 250 states have (on average 1.264) internal successors, (316), 250 states have internal predecessors, (316), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 267 states. [2022-04-28 03:25:52,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:25:52,640 INFO L93 Difference]: Finished difference Result 267 states and 333 transitions. [2022-04-28 03:25:52,640 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 333 transitions. [2022-04-28 03:25:52,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:25:52,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:25:52,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:25:52,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:25:52,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 250 states have (on average 1.264) internal successors, (316), 250 states have internal predecessors, (316), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:25:52,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 320 transitions. [2022-04-28 03:25:52,644 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 320 transitions. Word has length 49 [2022-04-28 03:25:52,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:25:52,644 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 320 transitions. [2022-04-28 03:25:52,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:25:52,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 255 states and 320 transitions. [2022-04-28 03:25:53,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 320 edges. 320 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:25:53,480 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 320 transitions. [2022-04-28 03:25:53,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 03:25:53,481 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:25:53,481 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:25:53,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 03:25:53,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-28 03:25:53,696 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:25:53,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:25:53,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1882831394, now seen corresponding path program 27 times [2022-04-28 03:25:53,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:25:53,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2099889571] [2022-04-28 03:25:53,878 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:25:54,133 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:25:54,462 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:25:55,484 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:25:55,485 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:25:55,488 INFO L85 PathProgramCache]: Analyzing trace with hash -29557439, now seen corresponding path program 1 times [2022-04-28 03:25:55,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:25:55,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484968508] [2022-04-28 03:25:55,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:25:55,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:25:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:25:55,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:25:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:25:55,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {23779#(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); {23766#true} is VALID [2022-04-28 03:25:55,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {23766#true} assume true; {23766#true} is VALID [2022-04-28 03:25:55,579 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23766#true} {23766#true} #71#return; {23766#true} is VALID [2022-04-28 03:25:55,579 INFO L272 TraceCheckUtils]: 0: Hoare triple {23766#true} call ULTIMATE.init(); {23779#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:25:55,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {23779#(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); {23766#true} is VALID [2022-04-28 03:25:55,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {23766#true} assume true; {23766#true} is VALID [2022-04-28 03:25:55,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23766#true} {23766#true} #71#return; {23766#true} is VALID [2022-04-28 03:25:55,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {23766#true} call #t~ret6 := main(); {23766#true} is VALID [2022-04-28 03:25:55,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {23766#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {23771#(= main_~k~0 0)} is VALID [2022-04-28 03:25:55,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {23771#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {23772#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:25:55,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {23772#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {23773#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:25:55,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {23773#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} [149] L31-3-->L31-4_primed: Formula: (let ((.cse0 (< 0 v_main_~m~0_259)) (.cse1 (< 1 v_main_~m~0_259)) (.cse2 (= |v_main_#t~post3_277| |v_main_#t~post3_275|)) (.cse3 (= v_main_~i~0_371 v_main_~i~0_370)) (.cse4 (= v_main_~k~0_998 v_main_~k~0_997))) (or (and (< v_main_~i~0_371 v_main_~i~0_370) (< v_main_~i~0_370 (+ 1 v_main_~n~0_125)) (= v_main_~j~0_1102 1) .cse0 (= (+ v_main_~k~0_998 v_main_~i~0_370) (+ v_main_~k~0_997 v_main_~i~0_371)) (not .cse1)) (and .cse2 .cse3 (or (not .cse0) (not (< v_main_~i~0_371 v_main_~n~0_125)) .cse1) (= |v_main_#t~post4_630| |v_main_#t~post4_645|) (= |v_main_#t~post5_630| |v_main_#t~post5_645|) (= v_main_~j~0_1102 v_main_~j~0_1119) .cse4) (and (= v_main_~n~0_125 v_main_~n~0_125) .cse2 .cse3 (= |v_main_#t~post4_645| |v_main_#t~post4_630|) (= v_main_~m~0_259 v_main_~m~0_259) (= v_main_~j~0_1119 v_main_~j~0_1102) (= |v_main_#t~post5_645| |v_main_#t~post5_630|) .cse4))) InVars {main_~m~0=v_main_~m~0_259, main_~k~0=v_main_~k~0_998, main_~j~0=v_main_~j~0_1119, main_~i~0=v_main_~i~0_371, main_#t~post4=|v_main_#t~post4_645|, main_#t~post5=|v_main_#t~post5_645|, main_~n~0=v_main_~n~0_125, main_#t~post3=|v_main_#t~post3_277|} OutVars{main_~m~0=v_main_~m~0_259, main_~k~0=v_main_~k~0_997, main_~j~0=v_main_~j~0_1102, main_~i~0=v_main_~i~0_370, main_#t~post4=|v_main_#t~post4_630|, main_#t~post5=|v_main_#t~post5_630|, main_#t~post3=|v_main_#t~post3_275|, main_~n~0=v_main_~n~0_125} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {23774#(and (<= (+ 140 (* main_~i~0 14)) (+ main_~k~0 (* main_~n~0 14))) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:25:55,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {23774#(and (<= (+ 140 (* main_~i~0 14)) (+ main_~k~0 (* main_~n~0 14))) (<= (+ main_~i~0 10) main_~n~0))} [150] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23774#(and (<= (+ 140 (* main_~i~0 14)) (+ main_~k~0 (* main_~n~0 14))) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:25:55,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {23774#(and (<= (+ 140 (* main_~i~0 14)) (+ main_~k~0 (* main_~n~0 14))) (<= (+ main_~i~0 10) main_~n~0))} [151] L31-3-->L31-4_primed: Formula: (let ((.cse4 (<= v_main_~m~0_260 14)) (.cse3 (< 13 v_main_~m~0_260)) (.cse0 (= v_main_~j~0_1122 v_main_~j~0_1104)) (.cse1 (= v_main_~i~0_373 v_main_~i~0_372)) (.cse2 (= |v_main_#t~post5_648| |v_main_#t~post5_631|))) (or (and .cse0 .cse1 (= |v_main_#t~post4_631| |v_main_#t~post4_648|) .cse2 (= v_main_~k~0_999 v_main_~k~0_1013) (or (not (< v_main_~i~0_373 v_main_~n~0_126)) (not .cse3) (not .cse4)) (= |v_main_#t~post3_276| |v_main_#t~post3_280|)) (and (< v_main_~i~0_373 v_main_~i~0_372) (= (+ v_main_~k~0_999 (* 14 v_main_~i~0_373)) (+ (* 14 v_main_~i~0_372) v_main_~k~0_1013)) .cse4 (< v_main_~i~0_372 (+ 1 v_main_~n~0_126)) .cse3 (= 14 v_main_~j~0_1104)) (and .cse0 (= |v_main_#t~post3_280| |v_main_#t~post3_276|) .cse1 .cse2 (= |v_main_#t~post4_648| |v_main_#t~post4_631|) (= v_main_~n~0_126 v_main_~n~0_126) (= v_main_~k~0_1013 v_main_~k~0_999) (= v_main_~m~0_260 v_main_~m~0_260)))) InVars {main_~m~0=v_main_~m~0_260, main_~k~0=v_main_~k~0_1013, main_~j~0=v_main_~j~0_1122, main_~i~0=v_main_~i~0_373, main_#t~post4=|v_main_#t~post4_648|, main_#t~post5=|v_main_#t~post5_648|, main_~n~0=v_main_~n~0_126, main_#t~post3=|v_main_#t~post3_280|} OutVars{main_~m~0=v_main_~m~0_260, main_~k~0=v_main_~k~0_999, main_~j~0=v_main_~j~0_1104, main_~i~0=v_main_~i~0_372, main_#t~post4=|v_main_#t~post4_631|, main_#t~post5=|v_main_#t~post5_631|, main_#t~post3=|v_main_#t~post3_276|, main_~n~0=v_main_~n~0_126} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {23775#(or (<= (+ 140 (* main_~i~0 14)) (+ main_~k~0 (* main_~n~0 14))) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:25:55,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {23775#(or (<= (+ 140 (* main_~i~0 14)) (+ main_~k~0 (* main_~n~0 14))) (<= (+ main_~i~0 10) main_~n~0))} [148] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {23776#(<= 140 main_~k~0)} is VALID [2022-04-28 03:25:55,584 INFO L272 TraceCheckUtils]: 12: Hoare triple {23776#(<= 140 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {23777#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:25:55,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {23777#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {23778#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:25:55,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {23778#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {23767#false} is VALID [2022-04-28 03:25:55,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {23767#false} assume !false; {23767#false} is VALID [2022-04-28 03:25:55,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:25:55,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:25:55,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484968508] [2022-04-28 03:25:55,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484968508] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:25:55,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33009393] [2022-04-28 03:25:55,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:25:55,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:25:55,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:25:55,588 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:25:55,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 03:25:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:25:55,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:25:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:25:55,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:25:56,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {23766#true} call ULTIMATE.init(); {23766#true} is VALID [2022-04-28 03:25:56,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {23766#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); {23766#true} is VALID [2022-04-28 03:25:56,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {23766#true} assume true; {23766#true} is VALID [2022-04-28 03:25:56,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23766#true} {23766#true} #71#return; {23766#true} is VALID [2022-04-28 03:25:56,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {23766#true} call #t~ret6 := main(); {23766#true} is VALID [2022-04-28 03:25:56,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {23766#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {23798#(<= 0 main_~k~0)} is VALID [2022-04-28 03:25:56,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {23798#(<= 0 main_~k~0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {23802#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} is VALID [2022-04-28 03:25:56,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {23802#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {23806#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:25:56,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {23806#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [149] L31-3-->L31-4_primed: Formula: (let ((.cse0 (< 0 v_main_~m~0_259)) (.cse1 (< 1 v_main_~m~0_259)) (.cse2 (= |v_main_#t~post3_277| |v_main_#t~post3_275|)) (.cse3 (= v_main_~i~0_371 v_main_~i~0_370)) (.cse4 (= v_main_~k~0_998 v_main_~k~0_997))) (or (and (< v_main_~i~0_371 v_main_~i~0_370) (< v_main_~i~0_370 (+ 1 v_main_~n~0_125)) (= v_main_~j~0_1102 1) .cse0 (= (+ v_main_~k~0_998 v_main_~i~0_370) (+ v_main_~k~0_997 v_main_~i~0_371)) (not .cse1)) (and .cse2 .cse3 (or (not .cse0) (not (< v_main_~i~0_371 v_main_~n~0_125)) .cse1) (= |v_main_#t~post4_630| |v_main_#t~post4_645|) (= |v_main_#t~post5_630| |v_main_#t~post5_645|) (= v_main_~j~0_1102 v_main_~j~0_1119) .cse4) (and (= v_main_~n~0_125 v_main_~n~0_125) .cse2 .cse3 (= |v_main_#t~post4_645| |v_main_#t~post4_630|) (= v_main_~m~0_259 v_main_~m~0_259) (= v_main_~j~0_1119 v_main_~j~0_1102) (= |v_main_#t~post5_645| |v_main_#t~post5_630|) .cse4))) InVars {main_~m~0=v_main_~m~0_259, main_~k~0=v_main_~k~0_998, main_~j~0=v_main_~j~0_1119, main_~i~0=v_main_~i~0_371, main_#t~post4=|v_main_#t~post4_645|, main_#t~post5=|v_main_#t~post5_645|, main_~n~0=v_main_~n~0_125, main_#t~post3=|v_main_#t~post3_277|} OutVars{main_~m~0=v_main_~m~0_259, main_~k~0=v_main_~k~0_997, main_~j~0=v_main_~j~0_1102, main_~i~0=v_main_~i~0_370, main_#t~post4=|v_main_#t~post4_630|, main_#t~post5=|v_main_#t~post5_630|, main_#t~post3=|v_main_#t~post3_275|, main_~n~0=v_main_~n~0_125} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {23806#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:25:56,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {23806#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [150] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23806#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:25:56,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {23806#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [151] L31-3-->L31-4_primed: Formula: (let ((.cse4 (<= v_main_~m~0_260 14)) (.cse3 (< 13 v_main_~m~0_260)) (.cse0 (= v_main_~j~0_1122 v_main_~j~0_1104)) (.cse1 (= v_main_~i~0_373 v_main_~i~0_372)) (.cse2 (= |v_main_#t~post5_648| |v_main_#t~post5_631|))) (or (and .cse0 .cse1 (= |v_main_#t~post4_631| |v_main_#t~post4_648|) .cse2 (= v_main_~k~0_999 v_main_~k~0_1013) (or (not (< v_main_~i~0_373 v_main_~n~0_126)) (not .cse3) (not .cse4)) (= |v_main_#t~post3_276| |v_main_#t~post3_280|)) (and (< v_main_~i~0_373 v_main_~i~0_372) (= (+ v_main_~k~0_999 (* 14 v_main_~i~0_373)) (+ (* 14 v_main_~i~0_372) v_main_~k~0_1013)) .cse4 (< v_main_~i~0_372 (+ 1 v_main_~n~0_126)) .cse3 (= 14 v_main_~j~0_1104)) (and .cse0 (= |v_main_#t~post3_280| |v_main_#t~post3_276|) .cse1 .cse2 (= |v_main_#t~post4_648| |v_main_#t~post4_631|) (= v_main_~n~0_126 v_main_~n~0_126) (= v_main_~k~0_1013 v_main_~k~0_999) (= v_main_~m~0_260 v_main_~m~0_260)))) InVars {main_~m~0=v_main_~m~0_260, main_~k~0=v_main_~k~0_1013, main_~j~0=v_main_~j~0_1122, main_~i~0=v_main_~i~0_373, main_#t~post4=|v_main_#t~post4_648|, main_#t~post5=|v_main_#t~post5_648|, main_~n~0=v_main_~n~0_126, main_#t~post3=|v_main_#t~post3_280|} OutVars{main_~m~0=v_main_~m~0_260, main_~k~0=v_main_~k~0_999, main_~j~0=v_main_~j~0_1104, main_~i~0=v_main_~i~0_372, main_#t~post4=|v_main_#t~post4_631|, main_#t~post5=|v_main_#t~post5_631|, main_#t~post3=|v_main_#t~post3_276|, main_~n~0=v_main_~n~0_126} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {23816#(and (<= 10 main_~n~0) (or (and (< (div main_~k~0 (- 14)) 0) (<= (+ main_~i~0 (div main_~k~0 (- 14))) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:25:56,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {23816#(and (<= 10 main_~n~0) (or (and (< (div main_~k~0 (- 14)) 0) (<= (+ main_~i~0 (div main_~k~0 (- 14))) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [148] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {23776#(<= 140 main_~k~0)} is VALID [2022-04-28 03:25:56,130 INFO L272 TraceCheckUtils]: 12: Hoare triple {23776#(<= 140 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {23823#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:25:56,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {23823#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23827#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:25:56,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {23827#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {23767#false} is VALID [2022-04-28 03:25:56,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {23767#false} assume !false; {23767#false} is VALID [2022-04-28 03:25:56,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:25:56,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:25:56,882 INFO L290 TraceCheckUtils]: 15: Hoare triple {23767#false} assume !false; {23767#false} is VALID [2022-04-28 03:25:56,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {23827#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {23767#false} is VALID [2022-04-28 03:25:56,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {23823#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23827#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:25:56,883 INFO L272 TraceCheckUtils]: 12: Hoare triple {23843#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {23823#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:25:56,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {23847#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} [148] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {23843#(<= 100 main_~k~0)} is VALID [2022-04-28 03:25:56,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {23851#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 14))) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 14)) 1) (not (<= main_~m~0 14)) (not (< 13 main_~m~0))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [151] L31-3-->L31-4_primed: Formula: (let ((.cse4 (<= v_main_~m~0_260 14)) (.cse3 (< 13 v_main_~m~0_260)) (.cse0 (= v_main_~j~0_1122 v_main_~j~0_1104)) (.cse1 (= v_main_~i~0_373 v_main_~i~0_372)) (.cse2 (= |v_main_#t~post5_648| |v_main_#t~post5_631|))) (or (and .cse0 .cse1 (= |v_main_#t~post4_631| |v_main_#t~post4_648|) .cse2 (= v_main_~k~0_999 v_main_~k~0_1013) (or (not (< v_main_~i~0_373 v_main_~n~0_126)) (not .cse3) (not .cse4)) (= |v_main_#t~post3_276| |v_main_#t~post3_280|)) (and (< v_main_~i~0_373 v_main_~i~0_372) (= (+ v_main_~k~0_999 (* 14 v_main_~i~0_373)) (+ (* 14 v_main_~i~0_372) v_main_~k~0_1013)) .cse4 (< v_main_~i~0_372 (+ 1 v_main_~n~0_126)) .cse3 (= 14 v_main_~j~0_1104)) (and .cse0 (= |v_main_#t~post3_280| |v_main_#t~post3_276|) .cse1 .cse2 (= |v_main_#t~post4_648| |v_main_#t~post4_631|) (= v_main_~n~0_126 v_main_~n~0_126) (= v_main_~k~0_1013 v_main_~k~0_999) (= v_main_~m~0_260 v_main_~m~0_260)))) InVars {main_~m~0=v_main_~m~0_260, main_~k~0=v_main_~k~0_1013, main_~j~0=v_main_~j~0_1122, main_~i~0=v_main_~i~0_373, main_#t~post4=|v_main_#t~post4_648|, main_#t~post5=|v_main_#t~post5_648|, main_~n~0=v_main_~n~0_126, main_#t~post3=|v_main_#t~post3_280|} OutVars{main_~m~0=v_main_~m~0_260, main_~k~0=v_main_~k~0_999, main_~j~0=v_main_~j~0_1104, main_~i~0=v_main_~i~0_372, main_#t~post4=|v_main_#t~post4_631|, main_#t~post5=|v_main_#t~post5_631|, main_#t~post3=|v_main_#t~post3_276|, main_~n~0=v_main_~n~0_126} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {23847#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} is VALID [2022-04-28 03:25:56,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {23851#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 14))) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 14)) 1) (not (<= main_~m~0 14)) (not (< 13 main_~m~0))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [150] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23851#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 14))) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 14)) 1) (not (<= main_~m~0 14)) (not (< 13 main_~m~0))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:25:56,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {23858#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 14))) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 14)) 1) (not (<= main_~m~0 14)) (not (< 13 main_~m~0))) (or (< 1 main_~m~0) (not (< 0 main_~m~0)) (<= (+ main_~i~0 100) (+ main_~n~0 main_~k~0)) (<= 99 main_~k~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [149] L31-3-->L31-4_primed: Formula: (let ((.cse0 (< 0 v_main_~m~0_259)) (.cse1 (< 1 v_main_~m~0_259)) (.cse2 (= |v_main_#t~post3_277| |v_main_#t~post3_275|)) (.cse3 (= v_main_~i~0_371 v_main_~i~0_370)) (.cse4 (= v_main_~k~0_998 v_main_~k~0_997))) (or (and (< v_main_~i~0_371 v_main_~i~0_370) (< v_main_~i~0_370 (+ 1 v_main_~n~0_125)) (= v_main_~j~0_1102 1) .cse0 (= (+ v_main_~k~0_998 v_main_~i~0_370) (+ v_main_~k~0_997 v_main_~i~0_371)) (not .cse1)) (and .cse2 .cse3 (or (not .cse0) (not (< v_main_~i~0_371 v_main_~n~0_125)) .cse1) (= |v_main_#t~post4_630| |v_main_#t~post4_645|) (= |v_main_#t~post5_630| |v_main_#t~post5_645|) (= v_main_~j~0_1102 v_main_~j~0_1119) .cse4) (and (= v_main_~n~0_125 v_main_~n~0_125) .cse2 .cse3 (= |v_main_#t~post4_645| |v_main_#t~post4_630|) (= v_main_~m~0_259 v_main_~m~0_259) (= v_main_~j~0_1119 v_main_~j~0_1102) (= |v_main_#t~post5_645| |v_main_#t~post5_630|) .cse4))) InVars {main_~m~0=v_main_~m~0_259, main_~k~0=v_main_~k~0_998, main_~j~0=v_main_~j~0_1119, main_~i~0=v_main_~i~0_371, main_#t~post4=|v_main_#t~post4_645|, main_#t~post5=|v_main_#t~post5_645|, main_~n~0=v_main_~n~0_125, main_#t~post3=|v_main_#t~post3_277|} OutVars{main_~m~0=v_main_~m~0_259, main_~k~0=v_main_~k~0_997, main_~j~0=v_main_~j~0_1102, main_~i~0=v_main_~i~0_370, main_#t~post4=|v_main_#t~post4_630|, main_#t~post5=|v_main_#t~post5_630|, main_#t~post3=|v_main_#t~post3_275|, main_~n~0=v_main_~n~0_125} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {23851#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 14))) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 14)) 1) (not (<= main_~m~0 14)) (not (< 13 main_~m~0))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:25:56,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {23862#(and (or (<= (div (+ (- 100) main_~k~0) (- 14)) 1) (<= (div (+ (- 100) main_~k~0) (- 14)) main_~n~0)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {23858#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 14))) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 14)) 1) (not (<= main_~m~0 14)) (not (< 13 main_~m~0))) (or (< 1 main_~m~0) (not (< 0 main_~m~0)) (<= (+ main_~i~0 100) (+ main_~n~0 main_~k~0)) (<= 99 main_~k~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:25:56,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {23866#(<= (div (+ (- 100) main_~k~0) (- 14)) 10)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {23862#(and (or (<= (div (+ (- 100) main_~k~0) (- 14)) 1) (<= (div (+ (- 100) main_~k~0) (- 14)) main_~n~0)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} is VALID [2022-04-28 03:25:56,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {23766#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {23866#(<= (div (+ (- 100) main_~k~0) (- 14)) 10)} is VALID [2022-04-28 03:25:56,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {23766#true} call #t~ret6 := main(); {23766#true} is VALID [2022-04-28 03:25:56,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23766#true} {23766#true} #71#return; {23766#true} is VALID [2022-04-28 03:25:56,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {23766#true} assume true; {23766#true} is VALID [2022-04-28 03:25:56,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {23766#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); {23766#true} is VALID [2022-04-28 03:25:56,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {23766#true} call ULTIMATE.init(); {23766#true} is VALID [2022-04-28 03:25:56,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:25:56,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33009393] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:25:56,889 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:25:56,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 23 [2022-04-28 03:25:58,080 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:25:58,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2099889571] [2022-04-28 03:25:58,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2099889571] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:25:58,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:25:58,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-28 03:25:58,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511680064] [2022-04-28 03:25:58,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:25:58,081 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 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 49 [2022-04-28 03:25:58,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:25:58,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:25:58,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:25:58,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-28 03:25:58,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:25:58,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-28 03:25:58,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=544, Invalid=2648, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 03:25:58,114 INFO L87 Difference]: Start difference. First operand 255 states and 320 transitions. Second operand has 43 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:02,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:26:02,629 INFO L93 Difference]: Finished difference Result 270 states and 337 transitions. [2022-04-28 03:26:02,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-28 03:26:02,629 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 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 49 [2022-04-28 03:26:02,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:26:02,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:02,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 73 transitions. [2022-04-28 03:26:02,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:02,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 73 transitions. [2022-04-28 03:26:02,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 73 transitions. [2022-04-28 03:26:02,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:26:02,689 INFO L225 Difference]: With dead ends: 270 [2022-04-28 03:26:02,690 INFO L226 Difference]: Without dead ends: 261 [2022-04-28 03:26:02,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2156 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1089, Invalid=7653, Unknown=0, NotChecked=0, Total=8742 [2022-04-28 03:26:02,691 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 28 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 1882 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:26:02,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 195 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1882 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 03:26:02,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-04-28 03:26:03,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 257. [2022-04-28 03:26:03,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:26:03,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 261 states. Second operand has 257 states, 252 states have (on average 1.2619047619047619) internal successors, (318), 252 states have internal predecessors, (318), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:03,771 INFO L74 IsIncluded]: Start isIncluded. First operand 261 states. Second operand has 257 states, 252 states have (on average 1.2619047619047619) internal successors, (318), 252 states have internal predecessors, (318), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:03,787 INFO L87 Difference]: Start difference. First operand 261 states. Second operand has 257 states, 252 states have (on average 1.2619047619047619) internal successors, (318), 252 states have internal predecessors, (318), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:03,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:26:03,790 INFO L93 Difference]: Finished difference Result 261 states and 326 transitions. [2022-04-28 03:26:03,790 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 326 transitions. [2022-04-28 03:26:03,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:26:03,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:26:03,790 INFO L74 IsIncluded]: Start isIncluded. First operand has 257 states, 252 states have (on average 1.2619047619047619) internal successors, (318), 252 states have internal predecessors, (318), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 261 states. [2022-04-28 03:26:03,791 INFO L87 Difference]: Start difference. First operand has 257 states, 252 states have (on average 1.2619047619047619) internal successors, (318), 252 states have internal predecessors, (318), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 261 states. [2022-04-28 03:26:03,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:26:03,793 INFO L93 Difference]: Finished difference Result 261 states and 326 transitions. [2022-04-28 03:26:03,793 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 326 transitions. [2022-04-28 03:26:03,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:26:03,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:26:03,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:26:03,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:26:03,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 252 states have (on average 1.2619047619047619) internal successors, (318), 252 states have internal predecessors, (318), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:03,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 322 transitions. [2022-04-28 03:26:03,798 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 322 transitions. Word has length 49 [2022-04-28 03:26:03,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:26:03,798 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 322 transitions. [2022-04-28 03:26:03,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:03,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 257 states and 322 transitions. [2022-04-28 03:26:04,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 322 edges. 322 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:26:04,664 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 322 transitions. [2022-04-28 03:26:04,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 03:26:04,664 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:26:04,664 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:26:04,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 03:26:04,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-28 03:26:04,865 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:26:04,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:26:04,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1351727590, now seen corresponding path program 28 times [2022-04-28 03:26:04,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:26:04,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [667993736] [2022-04-28 03:26:08,996 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:26:09,063 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:26:09,318 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:26:09,534 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:26:09,535 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:26:09,538 INFO L85 PathProgramCache]: Analyzing trace with hash 2019974721, now seen corresponding path program 1 times [2022-04-28 03:26:09,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:26:09,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550455810] [2022-04-28 03:26:09,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:26:09,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:26:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:26:09,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:26:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:26:09,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {25584#(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); {25571#true} is VALID [2022-04-28 03:26:09,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {25571#true} assume true; {25571#true} is VALID [2022-04-28 03:26:09,622 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25571#true} {25571#true} #71#return; {25571#true} is VALID [2022-04-28 03:26:09,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {25571#true} call ULTIMATE.init(); {25584#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:26:09,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {25584#(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); {25571#true} is VALID [2022-04-28 03:26:09,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {25571#true} assume true; {25571#true} is VALID [2022-04-28 03:26:09,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25571#true} {25571#true} #71#return; {25571#true} is VALID [2022-04-28 03:26:09,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {25571#true} call #t~ret6 := main(); {25571#true} is VALID [2022-04-28 03:26:09,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {25571#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {25576#(= main_~k~0 0)} is VALID [2022-04-28 03:26:09,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {25576#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {25577#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:26:09,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {25577#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {25578#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:26:09,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {25578#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} [153] L31-3-->L31-4_primed: Formula: (let ((.cse1 (= v_main_~i~0_392 v_main_~i~0_391)) (.cse2 (= |v_main_#t~post3_292| |v_main_#t~post3_290|)) (.cse3 (= v_main_~j~0_1176 v_main_~j~0_1159)) (.cse0 (<= v_main_~m~0_270 0))) (or (and (or (not .cse0) (not (< v_main_~i~0_392 v_main_~n~0_131))) .cse1 .cse2 .cse3) (and (= v_main_~n~0_131 v_main_~n~0_131) (= v_main_~m~0_270 v_main_~m~0_270) .cse1 .cse2 .cse3) (and (< v_main_~i~0_391 (+ 1 v_main_~n~0_131)) (< v_main_~i~0_392 v_main_~i~0_391) (= v_main_~j~0_1159 0) .cse0))) InVars {main_~i~0=v_main_~i~0_392, main_~n~0=v_main_~n~0_131, main_#t~post3=|v_main_#t~post3_292|, main_~m~0=v_main_~m~0_270, main_~j~0=v_main_~j~0_1176} OutVars{main_~i~0=v_main_~i~0_391, main_#t~post3=|v_main_#t~post3_290|, main_~n~0=v_main_~n~0_131, main_~m~0=v_main_~m~0_270, main_~j~0=v_main_~j~0_1159} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post3] {25579#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:26:09,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {25579#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [154] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25579#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:26:09,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {25579#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [155] L31-3-->L31-4_primed: Formula: (let ((.cse2 (= v_main_~k~0_1066 v_main_~k~0_1051)) (.cse3 (= |v_main_#t~post4_679| |v_main_#t~post4_664|)) (.cse4 (= v_main_~j~0_1179 v_main_~j~0_1160)) (.cse5 (= |v_main_#t~post5_679| |v_main_#t~post5_664|)) (.cse1 (<= v_main_~m~0_271 15)) (.cse0 (< 14 v_main_~m~0_271)) (.cse6 (= v_main_~i~0_394 v_main_~i~0_393))) (or (and (< v_main_~i~0_394 v_main_~i~0_393) (= v_main_~j~0_1160 15) .cse0 (< v_main_~i~0_393 (+ 1 v_main_~n~0_132)) .cse1 (= (+ (* 15 v_main_~i~0_393) v_main_~k~0_1066) (+ (* 15 v_main_~i~0_394) v_main_~k~0_1051))) (and .cse2 .cse3 (= v_main_~n~0_132 v_main_~n~0_132) (= |v_main_#t~post3_295| |v_main_#t~post3_291|) .cse4 .cse5 (= v_main_~m~0_271 v_main_~m~0_271) .cse6) (and .cse2 .cse3 .cse4 (= |v_main_#t~post3_291| |v_main_#t~post3_295|) .cse5 (or (not (< v_main_~i~0_394 v_main_~n~0_132)) (not .cse1) (not .cse0)) .cse6))) InVars {main_~m~0=v_main_~m~0_271, main_~k~0=v_main_~k~0_1066, main_~j~0=v_main_~j~0_1179, main_~i~0=v_main_~i~0_394, main_#t~post4=|v_main_#t~post4_679|, main_#t~post5=|v_main_#t~post5_679|, main_~n~0=v_main_~n~0_132, main_#t~post3=|v_main_#t~post3_295|} OutVars{main_~m~0=v_main_~m~0_271, main_~k~0=v_main_~k~0_1051, main_~j~0=v_main_~j~0_1160, main_~i~0=v_main_~i~0_393, main_#t~post4=|v_main_#t~post4_664|, main_#t~post5=|v_main_#t~post5_664|, main_#t~post3=|v_main_#t~post3_291|, main_~n~0=v_main_~n~0_132} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {25580#(or (<= (+ (* main_~i~0 15) 150) (+ main_~k~0 (* main_~n~0 15))) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:26:09,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {25580#(or (<= (+ (* main_~i~0 15) 150) (+ main_~k~0 (* main_~n~0 15))) (<= (+ main_~i~0 10) main_~n~0))} [152] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {25581#(<= 150 main_~k~0)} is VALID [2022-04-28 03:26:09,627 INFO L272 TraceCheckUtils]: 12: Hoare triple {25581#(<= 150 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {25582#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:26:09,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {25582#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {25583#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:26:09,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {25583#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {25572#false} is VALID [2022-04-28 03:26:09,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {25572#false} assume !false; {25572#false} is VALID [2022-04-28 03:26:09,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:26:09,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:26:09,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550455810] [2022-04-28 03:26:09,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550455810] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:26:09,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694096580] [2022-04-28 03:26:09,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:26:09,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:26:09,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:26:09,629 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:26:09,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 03:26:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:26:09,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:26:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:26:09,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:26:10,108 INFO L272 TraceCheckUtils]: 0: Hoare triple {25571#true} call ULTIMATE.init(); {25571#true} is VALID [2022-04-28 03:26:10,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {25571#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); {25571#true} is VALID [2022-04-28 03:26:10,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {25571#true} assume true; {25571#true} is VALID [2022-04-28 03:26:10,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25571#true} {25571#true} #71#return; {25571#true} is VALID [2022-04-28 03:26:10,109 INFO L272 TraceCheckUtils]: 4: Hoare triple {25571#true} call #t~ret6 := main(); {25571#true} is VALID [2022-04-28 03:26:10,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {25571#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {25603#(<= 0 main_~k~0)} is VALID [2022-04-28 03:26:10,112 INFO L290 TraceCheckUtils]: 6: Hoare triple {25603#(<= 0 main_~k~0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {25607#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} is VALID [2022-04-28 03:26:10,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {25607#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {25611#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:26:10,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {25611#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [153] L31-3-->L31-4_primed: Formula: (let ((.cse1 (= v_main_~i~0_392 v_main_~i~0_391)) (.cse2 (= |v_main_#t~post3_292| |v_main_#t~post3_290|)) (.cse3 (= v_main_~j~0_1176 v_main_~j~0_1159)) (.cse0 (<= v_main_~m~0_270 0))) (or (and (or (not .cse0) (not (< v_main_~i~0_392 v_main_~n~0_131))) .cse1 .cse2 .cse3) (and (= v_main_~n~0_131 v_main_~n~0_131) (= v_main_~m~0_270 v_main_~m~0_270) .cse1 .cse2 .cse3) (and (< v_main_~i~0_391 (+ 1 v_main_~n~0_131)) (< v_main_~i~0_392 v_main_~i~0_391) (= v_main_~j~0_1159 0) .cse0))) InVars {main_~i~0=v_main_~i~0_392, main_~n~0=v_main_~n~0_131, main_#t~post3=|v_main_#t~post3_292|, main_~m~0=v_main_~m~0_270, main_~j~0=v_main_~j~0_1176} OutVars{main_~i~0=v_main_~i~0_391, main_#t~post3=|v_main_#t~post3_290|, main_~n~0=v_main_~n~0_131, main_~m~0=v_main_~m~0_270, main_~j~0=v_main_~j~0_1159} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post3] {25611#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:26:10,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {25611#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [154] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25611#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:26:10,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {25611#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [155] L31-3-->L31-4_primed: Formula: (let ((.cse2 (= v_main_~k~0_1066 v_main_~k~0_1051)) (.cse3 (= |v_main_#t~post4_679| |v_main_#t~post4_664|)) (.cse4 (= v_main_~j~0_1179 v_main_~j~0_1160)) (.cse5 (= |v_main_#t~post5_679| |v_main_#t~post5_664|)) (.cse1 (<= v_main_~m~0_271 15)) (.cse0 (< 14 v_main_~m~0_271)) (.cse6 (= v_main_~i~0_394 v_main_~i~0_393))) (or (and (< v_main_~i~0_394 v_main_~i~0_393) (= v_main_~j~0_1160 15) .cse0 (< v_main_~i~0_393 (+ 1 v_main_~n~0_132)) .cse1 (= (+ (* 15 v_main_~i~0_393) v_main_~k~0_1066) (+ (* 15 v_main_~i~0_394) v_main_~k~0_1051))) (and .cse2 .cse3 (= v_main_~n~0_132 v_main_~n~0_132) (= |v_main_#t~post3_295| |v_main_#t~post3_291|) .cse4 .cse5 (= v_main_~m~0_271 v_main_~m~0_271) .cse6) (and .cse2 .cse3 .cse4 (= |v_main_#t~post3_291| |v_main_#t~post3_295|) .cse5 (or (not (< v_main_~i~0_394 v_main_~n~0_132)) (not .cse1) (not .cse0)) .cse6))) InVars {main_~m~0=v_main_~m~0_271, main_~k~0=v_main_~k~0_1066, main_~j~0=v_main_~j~0_1179, main_~i~0=v_main_~i~0_394, main_#t~post4=|v_main_#t~post4_679|, main_#t~post5=|v_main_#t~post5_679|, main_~n~0=v_main_~n~0_132, main_#t~post3=|v_main_#t~post3_295|} OutVars{main_~m~0=v_main_~m~0_271, main_~k~0=v_main_~k~0_1051, main_~j~0=v_main_~j~0_1160, main_~i~0=v_main_~i~0_393, main_#t~post4=|v_main_#t~post4_664|, main_#t~post5=|v_main_#t~post5_664|, main_#t~post3=|v_main_#t~post3_291|, main_~n~0=v_main_~n~0_132} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {25621#(and (<= 10 main_~n~0) (or (and (<= (+ (div main_~k~0 (- 15)) main_~i~0) 0) (< (div main_~k~0 (- 15)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:26:10,115 INFO L290 TraceCheckUtils]: 11: Hoare triple {25621#(and (<= 10 main_~n~0) (or (and (<= (+ (div main_~k~0 (- 15)) main_~i~0) 0) (< (div main_~k~0 (- 15)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [152] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {25581#(<= 150 main_~k~0)} is VALID [2022-04-28 03:26:10,115 INFO L272 TraceCheckUtils]: 12: Hoare triple {25581#(<= 150 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {25628#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:26:10,115 INFO L290 TraceCheckUtils]: 13: Hoare triple {25628#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25632#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:26:10,116 INFO L290 TraceCheckUtils]: 14: Hoare triple {25632#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25572#false} is VALID [2022-04-28 03:26:10,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {25572#false} assume !false; {25572#false} is VALID [2022-04-28 03:26:10,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:26:10,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:26:10,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {25572#false} assume !false; {25572#false} is VALID [2022-04-28 03:26:10,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {25632#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25572#false} is VALID [2022-04-28 03:26:10,768 INFO L290 TraceCheckUtils]: 13: Hoare triple {25628#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25632#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:26:10,769 INFO L272 TraceCheckUtils]: 12: Hoare triple {25648#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {25628#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:26:10,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {25652#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} [152] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {25648#(<= 100 main_~k~0)} is VALID [2022-04-28 03:26:10,770 INFO L290 TraceCheckUtils]: 10: Hoare triple {25656#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [155] L31-3-->L31-4_primed: Formula: (let ((.cse2 (= v_main_~k~0_1066 v_main_~k~0_1051)) (.cse3 (= |v_main_#t~post4_679| |v_main_#t~post4_664|)) (.cse4 (= v_main_~j~0_1179 v_main_~j~0_1160)) (.cse5 (= |v_main_#t~post5_679| |v_main_#t~post5_664|)) (.cse1 (<= v_main_~m~0_271 15)) (.cse0 (< 14 v_main_~m~0_271)) (.cse6 (= v_main_~i~0_394 v_main_~i~0_393))) (or (and (< v_main_~i~0_394 v_main_~i~0_393) (= v_main_~j~0_1160 15) .cse0 (< v_main_~i~0_393 (+ 1 v_main_~n~0_132)) .cse1 (= (+ (* 15 v_main_~i~0_393) v_main_~k~0_1066) (+ (* 15 v_main_~i~0_394) v_main_~k~0_1051))) (and .cse2 .cse3 (= v_main_~n~0_132 v_main_~n~0_132) (= |v_main_#t~post3_295| |v_main_#t~post3_291|) .cse4 .cse5 (= v_main_~m~0_271 v_main_~m~0_271) .cse6) (and .cse2 .cse3 .cse4 (= |v_main_#t~post3_291| |v_main_#t~post3_295|) .cse5 (or (not (< v_main_~i~0_394 v_main_~n~0_132)) (not .cse1) (not .cse0)) .cse6))) InVars {main_~m~0=v_main_~m~0_271, main_~k~0=v_main_~k~0_1066, main_~j~0=v_main_~j~0_1179, main_~i~0=v_main_~i~0_394, main_#t~post4=|v_main_#t~post4_679|, main_#t~post5=|v_main_#t~post5_679|, main_~n~0=v_main_~n~0_132, main_#t~post3=|v_main_#t~post3_295|} OutVars{main_~m~0=v_main_~m~0_271, main_~k~0=v_main_~k~0_1051, main_~j~0=v_main_~j~0_1160, main_~i~0=v_main_~i~0_393, main_#t~post4=|v_main_#t~post4_664|, main_#t~post5=|v_main_#t~post5_664|, main_#t~post3=|v_main_#t~post3_291|, main_~n~0=v_main_~n~0_132} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {25652#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} is VALID [2022-04-28 03:26:10,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {25656#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [154] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25656#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:26:10,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {25663#(and (or (<= 100 main_~k~0) (not (<= main_~m~0 0))) (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [153] L31-3-->L31-4_primed: Formula: (let ((.cse1 (= v_main_~i~0_392 v_main_~i~0_391)) (.cse2 (= |v_main_#t~post3_292| |v_main_#t~post3_290|)) (.cse3 (= v_main_~j~0_1176 v_main_~j~0_1159)) (.cse0 (<= v_main_~m~0_270 0))) (or (and (or (not .cse0) (not (< v_main_~i~0_392 v_main_~n~0_131))) .cse1 .cse2 .cse3) (and (= v_main_~n~0_131 v_main_~n~0_131) (= v_main_~m~0_270 v_main_~m~0_270) .cse1 .cse2 .cse3) (and (< v_main_~i~0_391 (+ 1 v_main_~n~0_131)) (< v_main_~i~0_392 v_main_~i~0_391) (= v_main_~j~0_1159 0) .cse0))) InVars {main_~i~0=v_main_~i~0_392, main_~n~0=v_main_~n~0_131, main_#t~post3=|v_main_#t~post3_292|, main_~m~0=v_main_~m~0_270, main_~j~0=v_main_~j~0_1176} OutVars{main_~i~0=v_main_~i~0_391, main_#t~post3=|v_main_#t~post3_290|, main_~n~0=v_main_~n~0_131, main_~m~0=v_main_~m~0_270, main_~j~0=v_main_~j~0_1159} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post3] {25656#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:26:10,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {25667#(and (or (< 0 main_~n~0) (<= 100 main_~k~0)) (or (<= (div (+ (- 100) main_~k~0) (- 15)) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 15)) 1)))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {25663#(and (or (<= 100 main_~k~0) (not (<= main_~m~0 0))) (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:26:10,773 INFO L290 TraceCheckUtils]: 6: Hoare triple {25671#(<= (div (+ (- 100) main_~k~0) (- 15)) 10)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {25667#(and (or (< 0 main_~n~0) (<= 100 main_~k~0)) (or (<= (div (+ (- 100) main_~k~0) (- 15)) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 15)) 1)))} is VALID [2022-04-28 03:26:10,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {25571#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {25671#(<= (div (+ (- 100) main_~k~0) (- 15)) 10)} is VALID [2022-04-28 03:26:10,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {25571#true} call #t~ret6 := main(); {25571#true} is VALID [2022-04-28 03:26:10,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25571#true} {25571#true} #71#return; {25571#true} is VALID [2022-04-28 03:26:10,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {25571#true} assume true; {25571#true} is VALID [2022-04-28 03:26:10,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {25571#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); {25571#true} is VALID [2022-04-28 03:26:10,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {25571#true} call ULTIMATE.init(); {25571#true} is VALID [2022-04-28 03:26:10,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:26:10,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694096580] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:26:10,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:26:10,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 23 [2022-04-28 03:26:11,938 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:26:11,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [667993736] [2022-04-28 03:26:11,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [667993736] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:26:11,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:26:11,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-28 03:26:11,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945897190] [2022-04-28 03:26:11,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:26:11,938 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 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 49 [2022-04-28 03:26:11,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:26:11,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:11,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:26:11,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-28 03:26:11,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:26:11,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-28 03:26:11,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=2669, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 03:26:11,973 INFO L87 Difference]: Start difference. First operand 257 states and 322 transitions. Second operand has 43 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:16,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:26:16,732 INFO L93 Difference]: Finished difference Result 273 states and 340 transitions. [2022-04-28 03:26:16,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-28 03:26:16,732 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 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 49 [2022-04-28 03:26:16,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:26:16,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:16,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 75 transitions. [2022-04-28 03:26:16,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:16,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 75 transitions. [2022-04-28 03:26:16,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 75 transitions. [2022-04-28 03:26:16,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:26:16,794 INFO L225 Difference]: With dead ends: 273 [2022-04-28 03:26:16,794 INFO L226 Difference]: Without dead ends: 264 [2022-04-28 03:26:16,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2096 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1041, Invalid=7701, Unknown=0, NotChecked=0, Total=8742 [2022-04-28 03:26:16,795 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 29 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 2006 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 2038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:26:16,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 200 Invalid, 2038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2006 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-28 03:26:16,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-04-28 03:26:17,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 260. [2022-04-28 03:26:17,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:26:17,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 264 states. Second operand has 260 states, 255 states have (on average 1.2588235294117647) internal successors, (321), 255 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:17,873 INFO L74 IsIncluded]: Start isIncluded. First operand 264 states. Second operand has 260 states, 255 states have (on average 1.2588235294117647) internal successors, (321), 255 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:17,873 INFO L87 Difference]: Start difference. First operand 264 states. Second operand has 260 states, 255 states have (on average 1.2588235294117647) internal successors, (321), 255 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:17,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:26:17,876 INFO L93 Difference]: Finished difference Result 264 states and 329 transitions. [2022-04-28 03:26:17,876 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 329 transitions. [2022-04-28 03:26:17,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:26:17,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:26:17,876 INFO L74 IsIncluded]: Start isIncluded. First operand has 260 states, 255 states have (on average 1.2588235294117647) internal successors, (321), 255 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 264 states. [2022-04-28 03:26:17,876 INFO L87 Difference]: Start difference. First operand has 260 states, 255 states have (on average 1.2588235294117647) internal successors, (321), 255 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 264 states. [2022-04-28 03:26:17,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:26:17,879 INFO L93 Difference]: Finished difference Result 264 states and 329 transitions. [2022-04-28 03:26:17,879 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 329 transitions. [2022-04-28 03:26:17,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:26:17,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:26:17,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:26:17,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:26:17,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 255 states have (on average 1.2588235294117647) internal successors, (321), 255 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:17,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 325 transitions. [2022-04-28 03:26:17,883 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 325 transitions. Word has length 49 [2022-04-28 03:26:17,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:26:17,883 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 325 transitions. [2022-04-28 03:26:17,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:17,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 260 states and 325 transitions. [2022-04-28 03:26:18,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 325 edges. 325 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:26:18,772 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 325 transitions. [2022-04-28 03:26:18,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 03:26:18,772 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:26:18,772 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:26:18,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-28 03:26:18,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:26:18,973 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:26:18,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:26:18,973 INFO L85 PathProgramCache]: Analyzing trace with hash -840147081, now seen corresponding path program 29 times [2022-04-28 03:26:18,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:26:18,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1067986385] [2022-04-28 03:26:19,116 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:26:20,218 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:26:20,219 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:26:20,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1644272162, now seen corresponding path program 1 times [2022-04-28 03:26:20,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:26:20,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342414356] [2022-04-28 03:26:20,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:26:20,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:26:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:26:20,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:26:20,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:26:20,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {27406#(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); {27394#true} is VALID [2022-04-28 03:26:20,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {27394#true} assume true; {27394#true} is VALID [2022-04-28 03:26:20,324 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27394#true} {27394#true} #71#return; {27394#true} is VALID [2022-04-28 03:26:20,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {27394#true} call ULTIMATE.init(); {27406#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:26:20,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {27406#(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); {27394#true} is VALID [2022-04-28 03:26:20,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {27394#true} assume true; {27394#true} is VALID [2022-04-28 03:26:20,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27394#true} {27394#true} #71#return; {27394#true} is VALID [2022-04-28 03:26:20,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {27394#true} call #t~ret6 := main(); {27394#true} is VALID [2022-04-28 03:26:20,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {27394#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {27399#(= main_~k~0 0)} is VALID [2022-04-28 03:26:20,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {27399#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {27400#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:26:20,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {27400#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {27401#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:26:20,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {27401#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [157] L31-3-->L31-4_primed: Formula: (let ((.cse5 (< 16 v_main_~m~0_280)) (.cse4 (<= v_main_~m~0_280 17)) (.cse0 (= v_main_~k~0_1115 v_main_~k~0_1098)) (.cse1 (= |v_main_#t~post4_709| |v_main_#t~post4_692|)) (.cse2 (= |v_main_#t~post3_305| |v_main_#t~post3_304|)) (.cse3 (= v_main_~j~0_1232 v_main_~j~0_1214)) (.cse6 (= v_main_~i~0_411 v_main_~i~0_410)) (.cse7 (= |v_main_#t~post5_709| |v_main_#t~post5_692|))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~i~0_411 v_main_~n~0_136)) (not .cse4) (not .cse5)) .cse6 .cse7) (and (< v_main_~i~0_410 (+ 1 v_main_~n~0_136)) (= (+ (* 17 v_main_~i~0_411) v_main_~k~0_1098) (+ (* 17 v_main_~i~0_410) v_main_~k~0_1115)) (= v_main_~j~0_1214 17) .cse5 (< v_main_~i~0_411 v_main_~i~0_410) .cse4) (and .cse0 .cse1 .cse2 (= v_main_~n~0_136 v_main_~n~0_136) .cse3 (= v_main_~m~0_280 v_main_~m~0_280) .cse6 .cse7))) InVars {main_~m~0=v_main_~m~0_280, main_~k~0=v_main_~k~0_1115, main_~j~0=v_main_~j~0_1232, main_~i~0=v_main_~i~0_411, main_#t~post4=|v_main_#t~post4_709|, main_#t~post5=|v_main_#t~post5_709|, main_~n~0=v_main_~n~0_136, main_#t~post3=|v_main_#t~post3_305|} OutVars{main_~m~0=v_main_~m~0_280, main_~k~0=v_main_~k~0_1098, main_~j~0=v_main_~j~0_1214, main_~i~0=v_main_~i~0_410, main_#t~post4=|v_main_#t~post4_692|, main_#t~post5=|v_main_#t~post5_692|, main_#t~post3=|v_main_#t~post3_304|, main_~n~0=v_main_~n~0_136} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {27402#(or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ 170 (* main_~i~0 17)) (+ main_~k~0 (* main_~n~0 17))))} is VALID [2022-04-28 03:26:20,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {27402#(or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ 170 (* main_~i~0 17)) (+ main_~k~0 (* main_~n~0 17))))} [156] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {27403#(<= 170 main_~k~0)} is VALID [2022-04-28 03:26:20,327 INFO L272 TraceCheckUtils]: 10: Hoare triple {27403#(<= 170 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {27404#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:26:20,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {27404#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {27405#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:26:20,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {27405#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {27395#false} is VALID [2022-04-28 03:26:20,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {27395#false} assume !false; {27395#false} is VALID [2022-04-28 03:26:20,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:26:20,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:26:20,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342414356] [2022-04-28 03:26:20,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342414356] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:26:20,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:26:20,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:26:22,610 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:26:22,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1067986385] [2022-04-28 03:26:22,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1067986385] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:26:22,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:26:22,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-28 03:26:22,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313216643] [2022-04-28 03:26:22,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:26:22,611 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 44 states have internal predecessors, (46), 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 50 [2022-04-28 03:26:22,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:26:22,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 44 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:22,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:26:22,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-28 03:26:22,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:26:22,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-28 03:26:22,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 03:26:22,656 INFO L87 Difference]: Start difference. First operand 260 states and 325 transitions. Second operand has 46 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 44 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:32,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:26:32,295 INFO L93 Difference]: Finished difference Result 330 states and 416 transitions. [2022-04-28 03:26:32,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-28 03:26:32,295 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 44 states have internal predecessors, (46), 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 50 [2022-04-28 03:26:32,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:26:32,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 44 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:32,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 103 transitions. [2022-04-28 03:26:32,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 44 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:32,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 103 transitions. [2022-04-28 03:26:32,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 103 transitions. [2022-04-28 03:26:32,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:26:32,398 INFO L225 Difference]: With dead ends: 330 [2022-04-28 03:26:32,398 INFO L226 Difference]: Without dead ends: 325 [2022-04-28 03:26:32,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1409 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=377, Invalid=7995, Unknown=0, NotChecked=0, Total=8372 [2022-04-28 03:26:32,399 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 52 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 3459 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 3498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:26:32,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 220 Invalid, 3498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3459 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-28 03:26:32,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-04-28 03:26:33,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 299. [2022-04-28 03:26:33,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:26:33,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 325 states. Second operand has 299 states, 294 states have (on average 1.2891156462585034) internal successors, (379), 294 states have internal predecessors, (379), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:33,645 INFO L74 IsIncluded]: Start isIncluded. First operand 325 states. Second operand has 299 states, 294 states have (on average 1.2891156462585034) internal successors, (379), 294 states have internal predecessors, (379), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:33,645 INFO L87 Difference]: Start difference. First operand 325 states. Second operand has 299 states, 294 states have (on average 1.2891156462585034) internal successors, (379), 294 states have internal predecessors, (379), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:33,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:26:33,649 INFO L93 Difference]: Finished difference Result 325 states and 411 transitions. [2022-04-28 03:26:33,649 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 411 transitions. [2022-04-28 03:26:33,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:26:33,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:26:33,650 INFO L74 IsIncluded]: Start isIncluded. First operand has 299 states, 294 states have (on average 1.2891156462585034) internal successors, (379), 294 states have internal predecessors, (379), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 325 states. [2022-04-28 03:26:33,650 INFO L87 Difference]: Start difference. First operand has 299 states, 294 states have (on average 1.2891156462585034) internal successors, (379), 294 states have internal predecessors, (379), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 325 states. [2022-04-28 03:26:33,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:26:33,655 INFO L93 Difference]: Finished difference Result 325 states and 411 transitions. [2022-04-28 03:26:33,655 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 411 transitions. [2022-04-28 03:26:33,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:26:33,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:26:33,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:26:33,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:26:33,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.2891156462585034) internal successors, (379), 294 states have internal predecessors, (379), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:33,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 383 transitions. [2022-04-28 03:26:33,662 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 383 transitions. Word has length 50 [2022-04-28 03:26:33,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:26:33,662 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 383 transitions. [2022-04-28 03:26:33,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 44 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:33,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 299 states and 383 transitions. [2022-04-28 03:26:34,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 383 edges. 383 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:26:34,840 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 383 transitions. [2022-04-28 03:26:34,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 03:26:34,840 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:26:34,840 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:26:34,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-28 03:26:34,841 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:26:34,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:26:34,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1344490880, now seen corresponding path program 30 times [2022-04-28 03:26:34,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:26:34,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1256231893] [2022-04-28 03:26:35,183 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:26:35,332 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:26:35,637 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:26:35,827 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:26:35,828 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:26:35,830 INFO L85 PathProgramCache]: Analyzing trace with hash 799305665, now seen corresponding path program 1 times [2022-04-28 03:26:35,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:26:35,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966090522] [2022-04-28 03:26:35,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:26:35,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:26:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:26:35,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:26:35,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:26:35,937 INFO L290 TraceCheckUtils]: 0: Hoare triple {29456#(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); {29443#true} is VALID [2022-04-28 03:26:35,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {29443#true} assume true; {29443#true} is VALID [2022-04-28 03:26:35,937 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29443#true} {29443#true} #71#return; {29443#true} is VALID [2022-04-28 03:26:35,938 INFO L272 TraceCheckUtils]: 0: Hoare triple {29443#true} call ULTIMATE.init(); {29456#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:26:35,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {29456#(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); {29443#true} is VALID [2022-04-28 03:26:35,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {29443#true} assume true; {29443#true} is VALID [2022-04-28 03:26:35,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29443#true} {29443#true} #71#return; {29443#true} is VALID [2022-04-28 03:26:35,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {29443#true} call #t~ret6 := main(); {29443#true} is VALID [2022-04-28 03:26:35,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {29443#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {29448#(= main_~k~0 0)} is VALID [2022-04-28 03:26:35,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {29448#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {29449#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:26:35,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {29449#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {29450#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:26:35,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {29450#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} [159] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post3_318| |v_main_#t~post3_316|)) (.cse1 (= v_main_~i~0_427 v_main_~i~0_426)) (.cse2 (= v_main_~j~0_1291 v_main_~j~0_1273)) (.cse4 (<= v_main_~m~0_292 14)) (.cse3 (< 13 v_main_~m~0_292))) (or (and (= v_main_~n~0_143 v_main_~n~0_143) (= |v_main_#t~post4_742| |v_main_#t~post4_726|) .cse0 (= |v_main_#t~post5_742| |v_main_#t~post5_726|) .cse1 .cse2 (= v_main_~m~0_292 v_main_~m~0_292) (= v_main_~k~0_1167 v_main_~k~0_1153)) (and (= |v_main_#t~post5_726| |v_main_#t~post5_742|) .cse0 (= |v_main_#t~post4_726| |v_main_#t~post4_742|) .cse1 (or (not (< v_main_~i~0_427 v_main_~n~0_143)) (not .cse3) (not .cse4)) .cse2 (= v_main_~k~0_1153 v_main_~k~0_1167)) (and .cse4 (= 14 v_main_~j~0_1273) .cse3 (< v_main_~i~0_427 v_main_~i~0_426) (= (+ (* 14 v_main_~i~0_427) v_main_~k~0_1153) (+ (* 14 v_main_~i~0_426) v_main_~k~0_1167)) (< v_main_~i~0_426 (+ 1 v_main_~n~0_143))))) InVars {main_~m~0=v_main_~m~0_292, main_~k~0=v_main_~k~0_1167, main_~j~0=v_main_~j~0_1291, main_~i~0=v_main_~i~0_427, main_#t~post4=|v_main_#t~post4_742|, main_#t~post5=|v_main_#t~post5_742|, main_~n~0=v_main_~n~0_143, main_#t~post3=|v_main_#t~post3_318|} OutVars{main_~m~0=v_main_~m~0_292, main_~k~0=v_main_~k~0_1153, main_~j~0=v_main_~j~0_1273, main_~i~0=v_main_~i~0_426, main_#t~post4=|v_main_#t~post4_726|, main_#t~post5=|v_main_#t~post5_726|, main_#t~post3=|v_main_#t~post3_316|, main_~n~0=v_main_~n~0_143} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {29451#(and (or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ 140 (* main_~i~0 14)) (+ main_~k~0 (* main_~n~0 14)))) (<= 10 main_~m~0))} is VALID [2022-04-28 03:26:35,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {29451#(and (or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ 140 (* main_~i~0 14)) (+ main_~k~0 (* main_~n~0 14)))) (<= 10 main_~m~0))} [160] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29451#(and (or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ 140 (* main_~i~0 14)) (+ main_~k~0 (* main_~n~0 14)))) (<= 10 main_~m~0))} is VALID [2022-04-28 03:26:35,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {29451#(and (or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ 140 (* main_~i~0 14)) (+ main_~k~0 (* main_~n~0 14)))) (<= 10 main_~m~0))} [161] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_745| |v_main_#t~post4_740|)) (.cse1 (= v_main_~i~0_429 v_main_~i~0_428)) (.cse2 (= |v_main_#t~post5_745| |v_main_#t~post5_740|)) (.cse4 (< 1 v_main_~m~0_293)) (.cse3 (<= v_main_~m~0_293 2))) (or (and (= v_main_~m~0_293 v_main_~m~0_293) (= |v_main_#t~post3_321| |v_main_#t~post3_317|) (= v_main_~k~0_1170 v_main_~k~0_1168) (= v_main_~n~0_144 v_main_~n~0_144) .cse0 .cse1 .cse2 (= v_main_~j~0_1294 v_main_~j~0_1288)) (and (= v_main_~j~0_1288 v_main_~j~0_1294) .cse0 (= v_main_~k~0_1168 v_main_~k~0_1170) .cse1 .cse2 (or (not .cse3) (not .cse4) (not (< v_main_~i~0_429 v_main_~n~0_144))) (= |v_main_#t~post3_317| |v_main_#t~post3_321|)) (and (< v_main_~i~0_429 v_main_~i~0_428) .cse4 (< v_main_~i~0_428 (+ 1 v_main_~n~0_144)) (= (+ (* 2 v_main_~i~0_428) v_main_~k~0_1170) (+ (* 2 v_main_~i~0_429) v_main_~k~0_1168)) (= 2 v_main_~j~0_1288) .cse3))) InVars {main_~m~0=v_main_~m~0_293, main_~k~0=v_main_~k~0_1170, main_~j~0=v_main_~j~0_1294, main_~i~0=v_main_~i~0_429, main_#t~post4=|v_main_#t~post4_745|, main_#t~post5=|v_main_#t~post5_745|, main_~n~0=v_main_~n~0_144, main_#t~post3=|v_main_#t~post3_321|} OutVars{main_~m~0=v_main_~m~0_293, main_~k~0=v_main_~k~0_1168, main_~j~0=v_main_~j~0_1288, main_~i~0=v_main_~i~0_428, main_#t~post4=|v_main_#t~post4_740|, main_#t~post5=|v_main_#t~post5_740|, main_#t~post3=|v_main_#t~post3_317|, main_~n~0=v_main_~n~0_144} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {29452#(or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ 140 (* main_~i~0 14)) (+ main_~k~0 (* main_~n~0 14))))} is VALID [2022-04-28 03:26:35,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {29452#(or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ 140 (* main_~i~0 14)) (+ main_~k~0 (* main_~n~0 14))))} [158] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {29453#(<= 140 main_~k~0)} is VALID [2022-04-28 03:26:35,943 INFO L272 TraceCheckUtils]: 12: Hoare triple {29453#(<= 140 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {29454#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:26:35,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {29454#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {29455#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:26:35,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {29455#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {29444#false} is VALID [2022-04-28 03:26:35,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {29444#false} assume !false; {29444#false} is VALID [2022-04-28 03:26:35,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:26:35,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:26:35,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966090522] [2022-04-28 03:26:35,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966090522] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:26:35,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269073263] [2022-04-28 03:26:35,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:26:35,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:26:35,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:26:35,945 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:26:35,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 03:26:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:26:35,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:26:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:26:35,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:26:36,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {29443#true} call ULTIMATE.init(); {29443#true} is VALID [2022-04-28 03:26:36,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {29443#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); {29443#true} is VALID [2022-04-28 03:26:36,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {29443#true} assume true; {29443#true} is VALID [2022-04-28 03:26:36,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29443#true} {29443#true} #71#return; {29443#true} is VALID [2022-04-28 03:26:36,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {29443#true} call #t~ret6 := main(); {29443#true} is VALID [2022-04-28 03:26:36,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {29443#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {29475#(<= 0 main_~k~0)} is VALID [2022-04-28 03:26:36,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {29475#(<= 0 main_~k~0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {29479#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} is VALID [2022-04-28 03:26:36,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {29479#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {29483#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:26:36,518 INFO L290 TraceCheckUtils]: 8: Hoare triple {29483#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [159] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post3_318| |v_main_#t~post3_316|)) (.cse1 (= v_main_~i~0_427 v_main_~i~0_426)) (.cse2 (= v_main_~j~0_1291 v_main_~j~0_1273)) (.cse4 (<= v_main_~m~0_292 14)) (.cse3 (< 13 v_main_~m~0_292))) (or (and (= v_main_~n~0_143 v_main_~n~0_143) (= |v_main_#t~post4_742| |v_main_#t~post4_726|) .cse0 (= |v_main_#t~post5_742| |v_main_#t~post5_726|) .cse1 .cse2 (= v_main_~m~0_292 v_main_~m~0_292) (= v_main_~k~0_1167 v_main_~k~0_1153)) (and (= |v_main_#t~post5_726| |v_main_#t~post5_742|) .cse0 (= |v_main_#t~post4_726| |v_main_#t~post4_742|) .cse1 (or (not (< v_main_~i~0_427 v_main_~n~0_143)) (not .cse3) (not .cse4)) .cse2 (= v_main_~k~0_1153 v_main_~k~0_1167)) (and .cse4 (= 14 v_main_~j~0_1273) .cse3 (< v_main_~i~0_427 v_main_~i~0_426) (= (+ (* 14 v_main_~i~0_427) v_main_~k~0_1153) (+ (* 14 v_main_~i~0_426) v_main_~k~0_1167)) (< v_main_~i~0_426 (+ 1 v_main_~n~0_143))))) InVars {main_~m~0=v_main_~m~0_292, main_~k~0=v_main_~k~0_1167, main_~j~0=v_main_~j~0_1291, main_~i~0=v_main_~i~0_427, main_#t~post4=|v_main_#t~post4_742|, main_#t~post5=|v_main_#t~post5_742|, main_~n~0=v_main_~n~0_143, main_#t~post3=|v_main_#t~post3_318|} OutVars{main_~m~0=v_main_~m~0_292, main_~k~0=v_main_~k~0_1153, main_~j~0=v_main_~j~0_1273, main_~i~0=v_main_~i~0_426, main_#t~post4=|v_main_#t~post4_726|, main_#t~post5=|v_main_#t~post5_726|, main_#t~post3=|v_main_#t~post3_316|, main_~n~0=v_main_~n~0_143} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {29487#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (or (and (< (div main_~k~0 (- 14)) 0) (<= main_~m~0 14) (<= (+ main_~i~0 (div main_~k~0 (- 14))) 0) (< 13 main_~m~0) (= main_~j~0 14) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:26:36,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {29487#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (or (and (< (div main_~k~0 (- 14)) 0) (<= main_~m~0 14) (<= (+ main_~i~0 (div main_~k~0 (- 14))) 0) (< 13 main_~m~0) (= main_~j~0 14) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [160] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29487#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (or (and (< (div main_~k~0 (- 14)) 0) (<= main_~m~0 14) (<= (+ main_~i~0 (div main_~k~0 (- 14))) 0) (< 13 main_~m~0) (= main_~j~0 14) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:26:36,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {29487#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (or (and (< (div main_~k~0 (- 14)) 0) (<= main_~m~0 14) (<= (+ main_~i~0 (div main_~k~0 (- 14))) 0) (< 13 main_~m~0) (= main_~j~0 14) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [161] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_745| |v_main_#t~post4_740|)) (.cse1 (= v_main_~i~0_429 v_main_~i~0_428)) (.cse2 (= |v_main_#t~post5_745| |v_main_#t~post5_740|)) (.cse4 (< 1 v_main_~m~0_293)) (.cse3 (<= v_main_~m~0_293 2))) (or (and (= v_main_~m~0_293 v_main_~m~0_293) (= |v_main_#t~post3_321| |v_main_#t~post3_317|) (= v_main_~k~0_1170 v_main_~k~0_1168) (= v_main_~n~0_144 v_main_~n~0_144) .cse0 .cse1 .cse2 (= v_main_~j~0_1294 v_main_~j~0_1288)) (and (= v_main_~j~0_1288 v_main_~j~0_1294) .cse0 (= v_main_~k~0_1168 v_main_~k~0_1170) .cse1 .cse2 (or (not .cse3) (not .cse4) (not (< v_main_~i~0_429 v_main_~n~0_144))) (= |v_main_#t~post3_317| |v_main_#t~post3_321|)) (and (< v_main_~i~0_429 v_main_~i~0_428) .cse4 (< v_main_~i~0_428 (+ 1 v_main_~n~0_144)) (= (+ (* 2 v_main_~i~0_428) v_main_~k~0_1170) (+ (* 2 v_main_~i~0_429) v_main_~k~0_1168)) (= 2 v_main_~j~0_1288) .cse3))) InVars {main_~m~0=v_main_~m~0_293, main_~k~0=v_main_~k~0_1170, main_~j~0=v_main_~j~0_1294, main_~i~0=v_main_~i~0_429, main_#t~post4=|v_main_#t~post4_745|, main_#t~post5=|v_main_#t~post5_745|, main_~n~0=v_main_~n~0_144, main_#t~post3=|v_main_#t~post3_321|} OutVars{main_~m~0=v_main_~m~0_293, main_~k~0=v_main_~k~0_1168, main_~j~0=v_main_~j~0_1288, main_~i~0=v_main_~i~0_428, main_#t~post4=|v_main_#t~post4_740|, main_#t~post5=|v_main_#t~post5_740|, main_#t~post3=|v_main_#t~post3_317|, main_~n~0=v_main_~n~0_144} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {29494#(and (<= 10 main_~n~0) (or (and (< (div main_~k~0 (- 14)) 0) (<= (+ main_~i~0 (div main_~k~0 (- 14))) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:26:36,521 INFO L290 TraceCheckUtils]: 11: Hoare triple {29494#(and (<= 10 main_~n~0) (or (and (< (div main_~k~0 (- 14)) 0) (<= (+ main_~i~0 (div main_~k~0 (- 14))) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [158] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {29453#(<= 140 main_~k~0)} is VALID [2022-04-28 03:26:36,522 INFO L272 TraceCheckUtils]: 12: Hoare triple {29453#(<= 140 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {29501#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:26:36,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {29501#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {29505#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:26:36,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {29505#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29444#false} is VALID [2022-04-28 03:26:36,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {29444#false} assume !false; {29444#false} is VALID [2022-04-28 03:26:36,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:26:36,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:26:37,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {29444#false} assume !false; {29444#false} is VALID [2022-04-28 03:26:37,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {29505#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29444#false} is VALID [2022-04-28 03:26:37,236 INFO L290 TraceCheckUtils]: 13: Hoare triple {29501#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {29505#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:26:37,237 INFO L272 TraceCheckUtils]: 12: Hoare triple {29521#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {29501#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:26:37,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {29525#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} [158] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {29521#(<= 100 main_~k~0)} is VALID [2022-04-28 03:26:37,238 INFO L290 TraceCheckUtils]: 10: Hoare triple {29529#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 2))) main_~n~0) (not (< 1 main_~m~0)) (<= (div (+ (- 100) main_~k~0) (- 2)) 1) (not (<= main_~m~0 2))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [161] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_745| |v_main_#t~post4_740|)) (.cse1 (= v_main_~i~0_429 v_main_~i~0_428)) (.cse2 (= |v_main_#t~post5_745| |v_main_#t~post5_740|)) (.cse4 (< 1 v_main_~m~0_293)) (.cse3 (<= v_main_~m~0_293 2))) (or (and (= v_main_~m~0_293 v_main_~m~0_293) (= |v_main_#t~post3_321| |v_main_#t~post3_317|) (= v_main_~k~0_1170 v_main_~k~0_1168) (= v_main_~n~0_144 v_main_~n~0_144) .cse0 .cse1 .cse2 (= v_main_~j~0_1294 v_main_~j~0_1288)) (and (= v_main_~j~0_1288 v_main_~j~0_1294) .cse0 (= v_main_~k~0_1168 v_main_~k~0_1170) .cse1 .cse2 (or (not .cse3) (not .cse4) (not (< v_main_~i~0_429 v_main_~n~0_144))) (= |v_main_#t~post3_317| |v_main_#t~post3_321|)) (and (< v_main_~i~0_429 v_main_~i~0_428) .cse4 (< v_main_~i~0_428 (+ 1 v_main_~n~0_144)) (= (+ (* 2 v_main_~i~0_428) v_main_~k~0_1170) (+ (* 2 v_main_~i~0_429) v_main_~k~0_1168)) (= 2 v_main_~j~0_1288) .cse3))) InVars {main_~m~0=v_main_~m~0_293, main_~k~0=v_main_~k~0_1170, main_~j~0=v_main_~j~0_1294, main_~i~0=v_main_~i~0_429, main_#t~post4=|v_main_#t~post4_745|, main_#t~post5=|v_main_#t~post5_745|, main_~n~0=v_main_~n~0_144, main_#t~post3=|v_main_#t~post3_321|} OutVars{main_~m~0=v_main_~m~0_293, main_~k~0=v_main_~k~0_1168, main_~j~0=v_main_~j~0_1288, main_~i~0=v_main_~i~0_428, main_#t~post4=|v_main_#t~post4_740|, main_#t~post5=|v_main_#t~post5_740|, main_#t~post3=|v_main_#t~post3_317|, main_~n~0=v_main_~n~0_144} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {29525#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} is VALID [2022-04-28 03:26:37,238 INFO L290 TraceCheckUtils]: 9: Hoare triple {29529#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 2))) main_~n~0) (not (< 1 main_~m~0)) (<= (div (+ (- 100) main_~k~0) (- 2)) 1) (not (<= main_~m~0 2))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [160] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29529#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 2))) main_~n~0) (not (< 1 main_~m~0)) (<= (div (+ (- 100) main_~k~0) (- 2)) 1) (not (<= main_~m~0 2))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:26:37,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {29536#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 2))) main_~n~0) (not (< 1 main_~m~0)) (<= (div (+ (- 100) main_~k~0) (- 2)) 1) (not (<= main_~m~0 2))) (or (<= main_~n~0 main_~i~0) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 14))) main_~n~0) (not (<= main_~m~0 14)) (not (< 13 main_~m~0))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [159] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post3_318| |v_main_#t~post3_316|)) (.cse1 (= v_main_~i~0_427 v_main_~i~0_426)) (.cse2 (= v_main_~j~0_1291 v_main_~j~0_1273)) (.cse4 (<= v_main_~m~0_292 14)) (.cse3 (< 13 v_main_~m~0_292))) (or (and (= v_main_~n~0_143 v_main_~n~0_143) (= |v_main_#t~post4_742| |v_main_#t~post4_726|) .cse0 (= |v_main_#t~post5_742| |v_main_#t~post5_726|) .cse1 .cse2 (= v_main_~m~0_292 v_main_~m~0_292) (= v_main_~k~0_1167 v_main_~k~0_1153)) (and (= |v_main_#t~post5_726| |v_main_#t~post5_742|) .cse0 (= |v_main_#t~post4_726| |v_main_#t~post4_742|) .cse1 (or (not (< v_main_~i~0_427 v_main_~n~0_143)) (not .cse3) (not .cse4)) .cse2 (= v_main_~k~0_1153 v_main_~k~0_1167)) (and .cse4 (= 14 v_main_~j~0_1273) .cse3 (< v_main_~i~0_427 v_main_~i~0_426) (= (+ (* 14 v_main_~i~0_427) v_main_~k~0_1153) (+ (* 14 v_main_~i~0_426) v_main_~k~0_1167)) (< v_main_~i~0_426 (+ 1 v_main_~n~0_143))))) InVars {main_~m~0=v_main_~m~0_292, main_~k~0=v_main_~k~0_1167, main_~j~0=v_main_~j~0_1291, main_~i~0=v_main_~i~0_427, main_#t~post4=|v_main_#t~post4_742|, main_#t~post5=|v_main_#t~post5_742|, main_~n~0=v_main_~n~0_143, main_#t~post3=|v_main_#t~post3_318|} OutVars{main_~m~0=v_main_~m~0_292, main_~k~0=v_main_~k~0_1153, main_~j~0=v_main_~j~0_1273, main_~i~0=v_main_~i~0_426, main_#t~post4=|v_main_#t~post4_726|, main_#t~post5=|v_main_#t~post5_726|, main_#t~post3=|v_main_#t~post3_316|, main_~n~0=v_main_~n~0_143} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {29529#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 2))) main_~n~0) (not (< 1 main_~m~0)) (<= (div (+ (- 100) main_~k~0) (- 2)) 1) (not (<= main_~m~0 2))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:26:37,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {29540#(and (or (<= (div (+ (- 100) main_~k~0) (- 14)) 1) (<= (div (+ (- 100) main_~k~0) (- 14)) main_~n~0)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {29536#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 2))) main_~n~0) (not (< 1 main_~m~0)) (<= (div (+ (- 100) main_~k~0) (- 2)) 1) (not (<= main_~m~0 2))) (or (<= main_~n~0 main_~i~0) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 14))) main_~n~0) (not (<= main_~m~0 14)) (not (< 13 main_~m~0))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:26:37,241 INFO L290 TraceCheckUtils]: 6: Hoare triple {29544#(<= (div (+ (- 100) main_~k~0) (- 14)) 10)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {29540#(and (or (<= (div (+ (- 100) main_~k~0) (- 14)) 1) (<= (div (+ (- 100) main_~k~0) (- 14)) main_~n~0)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} is VALID [2022-04-28 03:26:37,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {29443#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {29544#(<= (div (+ (- 100) main_~k~0) (- 14)) 10)} is VALID [2022-04-28 03:26:37,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {29443#true} call #t~ret6 := main(); {29443#true} is VALID [2022-04-28 03:26:37,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29443#true} {29443#true} #71#return; {29443#true} is VALID [2022-04-28 03:26:37,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {29443#true} assume true; {29443#true} is VALID [2022-04-28 03:26:37,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {29443#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); {29443#true} is VALID [2022-04-28 03:26:37,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {29443#true} call ULTIMATE.init(); {29443#true} is VALID [2022-04-28 03:26:37,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:26:37,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269073263] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:26:37,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:26:37,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2022-04-28 03:26:39,887 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:26:39,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1256231893] [2022-04-28 03:26:39,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1256231893] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:26:39,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:26:39,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-28 03:26:39,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637644803] [2022-04-28 03:26:39,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:26:39,888 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 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 51 [2022-04-28 03:26:39,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:26:39,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 45 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:39,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:26:39,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-28 03:26:39,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:26:39,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-28 03:26:39,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=3085, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 03:26:39,942 INFO L87 Difference]: Start difference. First operand 299 states and 383 transitions. Second operand has 45 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:47,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:26:47,027 INFO L93 Difference]: Finished difference Result 317 states and 403 transitions. [2022-04-28 03:26:47,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-28 03:26:47,027 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 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 51 [2022-04-28 03:26:47,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:26:47,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:47,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 86 transitions. [2022-04-28 03:26:47,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:47,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 86 transitions. [2022-04-28 03:26:47,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 86 transitions. [2022-04-28 03:26:47,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:26:47,113 INFO L225 Difference]: With dead ends: 317 [2022-04-28 03:26:47,113 INFO L226 Difference]: Without dead ends: 308 [2022-04-28 03:26:47,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2295 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1102, Invalid=8404, Unknown=0, NotChecked=0, Total=9506 [2022-04-28 03:26:47,114 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 22 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 2026 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 2120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:26:47,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 215 Invalid, 2120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2026 Invalid, 0 Unknown, 52 Unchecked, 2.1s Time] [2022-04-28 03:26:47,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-04-28 03:26:48,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 294. [2022-04-28 03:26:48,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:26:48,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 308 states. Second operand has 294 states, 289 states have (on average 1.259515570934256) internal successors, (364), 289 states have internal predecessors, (364), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:48,396 INFO L74 IsIncluded]: Start isIncluded. First operand 308 states. Second operand has 294 states, 289 states have (on average 1.259515570934256) internal successors, (364), 289 states have internal predecessors, (364), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:48,397 INFO L87 Difference]: Start difference. First operand 308 states. Second operand has 294 states, 289 states have (on average 1.259515570934256) internal successors, (364), 289 states have internal predecessors, (364), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:48,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:26:48,400 INFO L93 Difference]: Finished difference Result 308 states and 383 transitions. [2022-04-28 03:26:48,400 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 383 transitions. [2022-04-28 03:26:48,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:26:48,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:26:48,401 INFO L74 IsIncluded]: Start isIncluded. First operand has 294 states, 289 states have (on average 1.259515570934256) internal successors, (364), 289 states have internal predecessors, (364), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 308 states. [2022-04-28 03:26:48,401 INFO L87 Difference]: Start difference. First operand has 294 states, 289 states have (on average 1.259515570934256) internal successors, (364), 289 states have internal predecessors, (364), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 308 states. [2022-04-28 03:26:48,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:26:48,404 INFO L93 Difference]: Finished difference Result 308 states and 383 transitions. [2022-04-28 03:26:48,404 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 383 transitions. [2022-04-28 03:26:48,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:26:48,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:26:48,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:26:48,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:26:48,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 289 states have (on average 1.259515570934256) internal successors, (364), 289 states have internal predecessors, (364), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:48,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 368 transitions. [2022-04-28 03:26:48,409 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 368 transitions. Word has length 51 [2022-04-28 03:26:48,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:26:48,409 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 368 transitions. [2022-04-28 03:26:48,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:48,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 294 states and 368 transitions. [2022-04-28 03:26:49,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 368 edges. 368 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:26:49,507 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 368 transitions. [2022-04-28 03:26:49,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 03:26:49,507 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:26:49,507 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:26:49,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 03:26:49,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-04-28 03:26:49,724 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:26:49,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:26:49,724 INFO L85 PathProgramCache]: Analyzing trace with hash 2054843460, now seen corresponding path program 31 times [2022-04-28 03:26:49,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:26:49,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [529592353] [2022-04-28 03:26:53,873 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:26:53,936 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:26:54,159 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:26:58,260 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:26:58,373 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:26:58,599 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:26:58,601 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:26:58,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1446129471, now seen corresponding path program 1 times [2022-04-28 03:26:58,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:26:58,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950368445] [2022-04-28 03:26:58,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:26:58,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:26:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:26:58,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:26:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:26:58,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {31527#(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); {31514#true} is VALID [2022-04-28 03:26:58,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {31514#true} assume true; {31514#true} is VALID [2022-04-28 03:26:58,712 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31514#true} {31514#true} #71#return; {31514#true} is VALID [2022-04-28 03:26:58,712 INFO L272 TraceCheckUtils]: 0: Hoare triple {31514#true} call ULTIMATE.init(); {31527#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:26:58,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {31527#(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); {31514#true} is VALID [2022-04-28 03:26:58,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {31514#true} assume true; {31514#true} is VALID [2022-04-28 03:26:58,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31514#true} {31514#true} #71#return; {31514#true} is VALID [2022-04-28 03:26:58,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {31514#true} call #t~ret6 := main(); {31514#true} is VALID [2022-04-28 03:26:58,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {31514#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {31519#(= main_~k~0 0)} is VALID [2022-04-28 03:26:58,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {31519#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {31520#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:26:58,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {31520#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {31521#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:26:58,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {31521#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} [163] L31-3-->L31-4_primed: Formula: (let ((.cse3 (= |v_main_#t~post5_778| |v_main_#t~post5_762|)) (.cse4 (= v_main_~k~0_1212 v_main_~k~0_1211)) (.cse5 (= |v_main_#t~post4_778| |v_main_#t~post4_762|)) (.cse6 (= |v_main_#t~post3_339| |v_main_#t~post3_337|)) (.cse7 (= v_main_~i~0_455 v_main_~i~0_454)) (.cse1 (< 1 v_main_~m~0_307)) (.cse2 (< 0 v_main_~m~0_307))) (or (let ((.cse0 (+ v_main_~k~0_1211 v_main_~i~0_455))) (and (< v_main_~k~0_1212 v_main_~k~0_1211) (< .cse0 (+ v_main_~k~0_1212 1 v_main_~n~0_153)) (= v_main_~j~0_1341 1) (not .cse1) .cse2 (= (+ v_main_~k~0_1212 v_main_~i~0_454) .cse0))) (and .cse3 .cse4 (= v_main_~n~0_153 v_main_~n~0_153) .cse5 (= v_main_~m~0_307 v_main_~m~0_307) (= v_main_~j~0_1359 v_main_~j~0_1341) .cse6 .cse7) (and (= v_main_~j~0_1341 v_main_~j~0_1359) .cse3 .cse4 .cse5 .cse6 .cse7 (or .cse1 (not .cse2) (not (< v_main_~i~0_455 v_main_~n~0_153)))))) InVars {main_~m~0=v_main_~m~0_307, main_~k~0=v_main_~k~0_1212, main_~j~0=v_main_~j~0_1359, main_~i~0=v_main_~i~0_455, main_#t~post4=|v_main_#t~post4_778|, main_#t~post5=|v_main_#t~post5_778|, main_~n~0=v_main_~n~0_153, main_#t~post3=|v_main_#t~post3_339|} OutVars{main_~m~0=v_main_~m~0_307, main_~k~0=v_main_~k~0_1211, main_~j~0=v_main_~j~0_1341, main_~i~0=v_main_~i~0_454, main_#t~post4=|v_main_#t~post4_762|, main_#t~post5=|v_main_#t~post5_762|, main_#t~post3=|v_main_#t~post3_337|, main_~n~0=v_main_~n~0_153} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {31522#(and (<= (+ (* main_~i~0 15) 150) (+ main_~k~0 (* main_~n~0 15))) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:26:58,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {31522#(and (<= (+ (* main_~i~0 15) 150) (+ main_~k~0 (* main_~n~0 15))) (<= (+ main_~i~0 10) main_~n~0))} [164] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31522#(and (<= (+ (* main_~i~0 15) 150) (+ main_~k~0 (* main_~n~0 15))) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:26:58,716 INFO L290 TraceCheckUtils]: 10: Hoare triple {31522#(and (<= (+ (* main_~i~0 15) 150) (+ main_~k~0 (* main_~n~0 15))) (<= (+ main_~i~0 10) main_~n~0))} [165] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_781| |v_main_#t~post5_763|)) (.cse1 (= v_main_~j~0_1362 v_main_~j~0_1343)) (.cse2 (= v_main_~i~0_457 v_main_~i~0_456)) (.cse3 (= |v_main_#t~post4_781| |v_main_#t~post4_763|)) (.cse4 (< 14 v_main_~m~0_308)) (.cse5 (<= v_main_~m~0_308 15))) (or (and .cse0 (= |v_main_#t~post3_342| |v_main_#t~post3_338|) .cse1 (= v_main_~k~0_1228 v_main_~k~0_1213) .cse2 (= v_main_~n~0_154 v_main_~n~0_154) .cse3 (= v_main_~m~0_308 v_main_~m~0_308)) (and .cse0 .cse1 .cse2 (or (not .cse4) (not (< v_main_~i~0_457 v_main_~n~0_154)) (not .cse5)) (= v_main_~k~0_1213 v_main_~k~0_1228) (= |v_main_#t~post3_338| |v_main_#t~post3_342|) .cse3) (and (< v_main_~i~0_457 v_main_~i~0_456) (= v_main_~j~0_1343 15) .cse4 (< v_main_~i~0_456 (+ 1 v_main_~n~0_154)) (= (+ (* 15 v_main_~i~0_456) v_main_~k~0_1228) (+ (* 15 v_main_~i~0_457) v_main_~k~0_1213)) .cse5))) InVars {main_~m~0=v_main_~m~0_308, main_~k~0=v_main_~k~0_1228, main_~j~0=v_main_~j~0_1362, main_~i~0=v_main_~i~0_457, main_#t~post4=|v_main_#t~post4_781|, main_#t~post5=|v_main_#t~post5_781|, main_~n~0=v_main_~n~0_154, main_#t~post3=|v_main_#t~post3_342|} OutVars{main_~m~0=v_main_~m~0_308, main_~k~0=v_main_~k~0_1213, main_~j~0=v_main_~j~0_1343, main_~i~0=v_main_~i~0_456, main_#t~post4=|v_main_#t~post4_763|, main_#t~post5=|v_main_#t~post5_763|, main_#t~post3=|v_main_#t~post3_338|, main_~n~0=v_main_~n~0_154} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {31523#(or (<= (+ (* main_~i~0 15) 150) (+ main_~k~0 (* main_~n~0 15))) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:26:58,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {31523#(or (<= (+ (* main_~i~0 15) 150) (+ main_~k~0 (* main_~n~0 15))) (<= (+ main_~i~0 10) main_~n~0))} [162] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {31524#(<= 150 main_~k~0)} is VALID [2022-04-28 03:26:58,717 INFO L272 TraceCheckUtils]: 12: Hoare triple {31524#(<= 150 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {31525#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:26:58,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {31525#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {31526#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:26:58,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {31526#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {31515#false} is VALID [2022-04-28 03:26:58,718 INFO L290 TraceCheckUtils]: 15: Hoare triple {31515#false} assume !false; {31515#false} is VALID [2022-04-28 03:26:58,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:26:58,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:26:58,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950368445] [2022-04-28 03:26:58,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950368445] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:26:58,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306063189] [2022-04-28 03:26:58,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:26:58,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:26:58,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:26:58,719 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:26:58,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 03:26:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:26:58,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:26:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:26:58,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:26:59,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {31514#true} call ULTIMATE.init(); {31514#true} is VALID [2022-04-28 03:26:59,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {31514#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); {31514#true} is VALID [2022-04-28 03:26:59,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {31514#true} assume true; {31514#true} is VALID [2022-04-28 03:26:59,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31514#true} {31514#true} #71#return; {31514#true} is VALID [2022-04-28 03:26:59,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {31514#true} call #t~ret6 := main(); {31514#true} is VALID [2022-04-28 03:26:59,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {31514#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {31546#(<= 0 main_~k~0)} is VALID [2022-04-28 03:26:59,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {31546#(<= 0 main_~k~0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {31550#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} is VALID [2022-04-28 03:26:59,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {31550#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {31554#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:26:59,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {31554#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [163] L31-3-->L31-4_primed: Formula: (let ((.cse3 (= |v_main_#t~post5_778| |v_main_#t~post5_762|)) (.cse4 (= v_main_~k~0_1212 v_main_~k~0_1211)) (.cse5 (= |v_main_#t~post4_778| |v_main_#t~post4_762|)) (.cse6 (= |v_main_#t~post3_339| |v_main_#t~post3_337|)) (.cse7 (= v_main_~i~0_455 v_main_~i~0_454)) (.cse1 (< 1 v_main_~m~0_307)) (.cse2 (< 0 v_main_~m~0_307))) (or (let ((.cse0 (+ v_main_~k~0_1211 v_main_~i~0_455))) (and (< v_main_~k~0_1212 v_main_~k~0_1211) (< .cse0 (+ v_main_~k~0_1212 1 v_main_~n~0_153)) (= v_main_~j~0_1341 1) (not .cse1) .cse2 (= (+ v_main_~k~0_1212 v_main_~i~0_454) .cse0))) (and .cse3 .cse4 (= v_main_~n~0_153 v_main_~n~0_153) .cse5 (= v_main_~m~0_307 v_main_~m~0_307) (= v_main_~j~0_1359 v_main_~j~0_1341) .cse6 .cse7) (and (= v_main_~j~0_1341 v_main_~j~0_1359) .cse3 .cse4 .cse5 .cse6 .cse7 (or .cse1 (not .cse2) (not (< v_main_~i~0_455 v_main_~n~0_153)))))) InVars {main_~m~0=v_main_~m~0_307, main_~k~0=v_main_~k~0_1212, main_~j~0=v_main_~j~0_1359, main_~i~0=v_main_~i~0_455, main_#t~post4=|v_main_#t~post4_778|, main_#t~post5=|v_main_#t~post5_778|, main_~n~0=v_main_~n~0_153, main_#t~post3=|v_main_#t~post3_339|} OutVars{main_~m~0=v_main_~m~0_307, main_~k~0=v_main_~k~0_1211, main_~j~0=v_main_~j~0_1341, main_~i~0=v_main_~i~0_454, main_#t~post4=|v_main_#t~post4_762|, main_#t~post5=|v_main_#t~post5_762|, main_#t~post3=|v_main_#t~post3_337|, main_~n~0=v_main_~n~0_153} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {31554#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:26:59,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {31554#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [164] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31554#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:26:59,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {31554#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [165] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_781| |v_main_#t~post5_763|)) (.cse1 (= v_main_~j~0_1362 v_main_~j~0_1343)) (.cse2 (= v_main_~i~0_457 v_main_~i~0_456)) (.cse3 (= |v_main_#t~post4_781| |v_main_#t~post4_763|)) (.cse4 (< 14 v_main_~m~0_308)) (.cse5 (<= v_main_~m~0_308 15))) (or (and .cse0 (= |v_main_#t~post3_342| |v_main_#t~post3_338|) .cse1 (= v_main_~k~0_1228 v_main_~k~0_1213) .cse2 (= v_main_~n~0_154 v_main_~n~0_154) .cse3 (= v_main_~m~0_308 v_main_~m~0_308)) (and .cse0 .cse1 .cse2 (or (not .cse4) (not (< v_main_~i~0_457 v_main_~n~0_154)) (not .cse5)) (= v_main_~k~0_1213 v_main_~k~0_1228) (= |v_main_#t~post3_338| |v_main_#t~post3_342|) .cse3) (and (< v_main_~i~0_457 v_main_~i~0_456) (= v_main_~j~0_1343 15) .cse4 (< v_main_~i~0_456 (+ 1 v_main_~n~0_154)) (= (+ (* 15 v_main_~i~0_456) v_main_~k~0_1228) (+ (* 15 v_main_~i~0_457) v_main_~k~0_1213)) .cse5))) InVars {main_~m~0=v_main_~m~0_308, main_~k~0=v_main_~k~0_1228, main_~j~0=v_main_~j~0_1362, main_~i~0=v_main_~i~0_457, main_#t~post4=|v_main_#t~post4_781|, main_#t~post5=|v_main_#t~post5_781|, main_~n~0=v_main_~n~0_154, main_#t~post3=|v_main_#t~post3_342|} OutVars{main_~m~0=v_main_~m~0_308, main_~k~0=v_main_~k~0_1213, main_~j~0=v_main_~j~0_1343, main_~i~0=v_main_~i~0_456, main_#t~post4=|v_main_#t~post4_763|, main_#t~post5=|v_main_#t~post5_763|, main_#t~post3=|v_main_#t~post3_338|, main_~n~0=v_main_~n~0_154} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {31564#(and (<= 10 main_~n~0) (or (and (<= (+ (div main_~k~0 (- 15)) main_~i~0) 0) (< (div main_~k~0 (- 15)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:26:59,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {31564#(and (<= 10 main_~n~0) (or (and (<= (+ (div main_~k~0 (- 15)) main_~i~0) 0) (< (div main_~k~0 (- 15)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [162] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {31524#(<= 150 main_~k~0)} is VALID [2022-04-28 03:26:59,282 INFO L272 TraceCheckUtils]: 12: Hoare triple {31524#(<= 150 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {31571#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:26:59,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {31571#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {31575#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:26:59,283 INFO L290 TraceCheckUtils]: 14: Hoare triple {31575#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {31515#false} is VALID [2022-04-28 03:26:59,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {31515#false} assume !false; {31515#false} is VALID [2022-04-28 03:26:59,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:26:59,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:27:00,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {31515#false} assume !false; {31515#false} is VALID [2022-04-28 03:27:00,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {31575#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {31515#false} is VALID [2022-04-28 03:27:00,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {31571#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {31575#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:27:00,144 INFO L272 TraceCheckUtils]: 12: Hoare triple {31591#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {31571#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:27:00,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {31595#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} [162] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {31591#(<= 100 main_~k~0)} is VALID [2022-04-28 03:27:00,145 INFO L290 TraceCheckUtils]: 10: Hoare triple {31599#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [165] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_781| |v_main_#t~post5_763|)) (.cse1 (= v_main_~j~0_1362 v_main_~j~0_1343)) (.cse2 (= v_main_~i~0_457 v_main_~i~0_456)) (.cse3 (= |v_main_#t~post4_781| |v_main_#t~post4_763|)) (.cse4 (< 14 v_main_~m~0_308)) (.cse5 (<= v_main_~m~0_308 15))) (or (and .cse0 (= |v_main_#t~post3_342| |v_main_#t~post3_338|) .cse1 (= v_main_~k~0_1228 v_main_~k~0_1213) .cse2 (= v_main_~n~0_154 v_main_~n~0_154) .cse3 (= v_main_~m~0_308 v_main_~m~0_308)) (and .cse0 .cse1 .cse2 (or (not .cse4) (not (< v_main_~i~0_457 v_main_~n~0_154)) (not .cse5)) (= v_main_~k~0_1213 v_main_~k~0_1228) (= |v_main_#t~post3_338| |v_main_#t~post3_342|) .cse3) (and (< v_main_~i~0_457 v_main_~i~0_456) (= v_main_~j~0_1343 15) .cse4 (< v_main_~i~0_456 (+ 1 v_main_~n~0_154)) (= (+ (* 15 v_main_~i~0_456) v_main_~k~0_1228) (+ (* 15 v_main_~i~0_457) v_main_~k~0_1213)) .cse5))) InVars {main_~m~0=v_main_~m~0_308, main_~k~0=v_main_~k~0_1228, main_~j~0=v_main_~j~0_1362, main_~i~0=v_main_~i~0_457, main_#t~post4=|v_main_#t~post4_781|, main_#t~post5=|v_main_#t~post5_781|, main_~n~0=v_main_~n~0_154, main_#t~post3=|v_main_#t~post3_342|} OutVars{main_~m~0=v_main_~m~0_308, main_~k~0=v_main_~k~0_1213, main_~j~0=v_main_~j~0_1343, main_~i~0=v_main_~i~0_456, main_#t~post4=|v_main_#t~post4_763|, main_#t~post5=|v_main_#t~post5_763|, main_#t~post3=|v_main_#t~post3_338|, main_~n~0=v_main_~n~0_154} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {31595#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} is VALID [2022-04-28 03:27:00,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {31599#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [164] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31599#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:27:00,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {31606#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (< 1 main_~m~0) (not (< 0 main_~m~0)) (<= (+ main_~i~0 100) (+ main_~n~0 main_~k~0)) (<= main_~n~0 main_~i~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [163] L31-3-->L31-4_primed: Formula: (let ((.cse3 (= |v_main_#t~post5_778| |v_main_#t~post5_762|)) (.cse4 (= v_main_~k~0_1212 v_main_~k~0_1211)) (.cse5 (= |v_main_#t~post4_778| |v_main_#t~post4_762|)) (.cse6 (= |v_main_#t~post3_339| |v_main_#t~post3_337|)) (.cse7 (= v_main_~i~0_455 v_main_~i~0_454)) (.cse1 (< 1 v_main_~m~0_307)) (.cse2 (< 0 v_main_~m~0_307))) (or (let ((.cse0 (+ v_main_~k~0_1211 v_main_~i~0_455))) (and (< v_main_~k~0_1212 v_main_~k~0_1211) (< .cse0 (+ v_main_~k~0_1212 1 v_main_~n~0_153)) (= v_main_~j~0_1341 1) (not .cse1) .cse2 (= (+ v_main_~k~0_1212 v_main_~i~0_454) .cse0))) (and .cse3 .cse4 (= v_main_~n~0_153 v_main_~n~0_153) .cse5 (= v_main_~m~0_307 v_main_~m~0_307) (= v_main_~j~0_1359 v_main_~j~0_1341) .cse6 .cse7) (and (= v_main_~j~0_1341 v_main_~j~0_1359) .cse3 .cse4 .cse5 .cse6 .cse7 (or .cse1 (not .cse2) (not (< v_main_~i~0_455 v_main_~n~0_153)))))) InVars {main_~m~0=v_main_~m~0_307, main_~k~0=v_main_~k~0_1212, main_~j~0=v_main_~j~0_1359, main_~i~0=v_main_~i~0_455, main_#t~post4=|v_main_#t~post4_778|, main_#t~post5=|v_main_#t~post5_778|, main_~n~0=v_main_~n~0_153, main_#t~post3=|v_main_#t~post3_339|} OutVars{main_~m~0=v_main_~m~0_307, main_~k~0=v_main_~k~0_1211, main_~j~0=v_main_~j~0_1341, main_~i~0=v_main_~i~0_454, main_#t~post4=|v_main_#t~post4_762|, main_#t~post5=|v_main_#t~post5_762|, main_#t~post3=|v_main_#t~post3_337|, main_~n~0=v_main_~n~0_153} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {31599#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:27:00,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {31610#(and (or (< 0 main_~n~0) (<= 100 main_~k~0)) (or (<= (div (+ (- 100) main_~k~0) (- 15)) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 15)) 1)))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {31606#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (< 1 main_~m~0) (not (< 0 main_~m~0)) (<= (+ main_~i~0 100) (+ main_~n~0 main_~k~0)) (<= main_~n~0 main_~i~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:27:00,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {31614#(<= (div (+ (- 100) main_~k~0) (- 15)) 10)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {31610#(and (or (< 0 main_~n~0) (<= 100 main_~k~0)) (or (<= (div (+ (- 100) main_~k~0) (- 15)) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 15)) 1)))} is VALID [2022-04-28 03:27:00,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {31514#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {31614#(<= (div (+ (- 100) main_~k~0) (- 15)) 10)} is VALID [2022-04-28 03:27:00,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {31514#true} call #t~ret6 := main(); {31514#true} is VALID [2022-04-28 03:27:00,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31514#true} {31514#true} #71#return; {31514#true} is VALID [2022-04-28 03:27:00,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {31514#true} assume true; {31514#true} is VALID [2022-04-28 03:27:00,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {31514#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); {31514#true} is VALID [2022-04-28 03:27:00,149 INFO L272 TraceCheckUtils]: 0: Hoare triple {31514#true} call ULTIMATE.init(); {31514#true} is VALID [2022-04-28 03:27:00,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:27:00,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306063189] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:27:00,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:27:00,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 23 [2022-04-28 03:27:01,387 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:27:01,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [529592353] [2022-04-28 03:27:01,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [529592353] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:27:01,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:27:01,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-28 03:27:01,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210885638] [2022-04-28 03:27:01,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:27:01,388 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 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 51 [2022-04-28 03:27:01,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:27:01,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 45 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:27:01,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:27:01,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-28 03:27:01,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:27:01,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-28 03:27:01,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=2852, Unknown=0, NotChecked=0, Total=3422 [2022-04-28 03:27:01,422 INFO L87 Difference]: Start difference. First operand 294 states and 368 transitions. Second operand has 45 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:27:06,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:27:06,759 INFO L93 Difference]: Finished difference Result 310 states and 386 transitions. [2022-04-28 03:27:06,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-28 03:27:06,760 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 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 51 [2022-04-28 03:27:06,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:27:06,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:27:06,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 77 transitions. [2022-04-28 03:27:06,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:27:06,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 77 transitions. [2022-04-28 03:27:06,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 77 transitions. [2022-04-28 03:27:06,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:27:06,825 INFO L225 Difference]: With dead ends: 310 [2022-04-28 03:27:06,825 INFO L226 Difference]: Without dead ends: 301 [2022-04-28 03:27:06,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2311 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1145, Invalid=8361, Unknown=0, NotChecked=0, Total=9506 [2022-04-28 03:27:06,825 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 29 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 2246 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 2278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:27:06,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 215 Invalid, 2278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2246 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 03:27:06,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-04-28 03:27:08,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 296. [2022-04-28 03:27:08,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:27:08,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 301 states. Second operand has 296 states, 291 states have (on average 1.2577319587628866) internal successors, (366), 291 states have internal predecessors, (366), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:27:08,121 INFO L74 IsIncluded]: Start isIncluded. First operand 301 states. Second operand has 296 states, 291 states have (on average 1.2577319587628866) internal successors, (366), 291 states have internal predecessors, (366), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:27:08,121 INFO L87 Difference]: Start difference. First operand 301 states. Second operand has 296 states, 291 states have (on average 1.2577319587628866) internal successors, (366), 291 states have internal predecessors, (366), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:27:08,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:27:08,124 INFO L93 Difference]: Finished difference Result 301 states and 375 transitions. [2022-04-28 03:27:08,124 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 375 transitions. [2022-04-28 03:27:08,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:27:08,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:27:08,125 INFO L74 IsIncluded]: Start isIncluded. First operand has 296 states, 291 states have (on average 1.2577319587628866) internal successors, (366), 291 states have internal predecessors, (366), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 301 states. [2022-04-28 03:27:08,125 INFO L87 Difference]: Start difference. First operand has 296 states, 291 states have (on average 1.2577319587628866) internal successors, (366), 291 states have internal predecessors, (366), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 301 states. [2022-04-28 03:27:08,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:27:08,128 INFO L93 Difference]: Finished difference Result 301 states and 375 transitions. [2022-04-28 03:27:08,128 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 375 transitions. [2022-04-28 03:27:08,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:27:08,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:27:08,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:27:08,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:27:08,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 291 states have (on average 1.2577319587628866) internal successors, (366), 291 states have internal predecessors, (366), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:27:08,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 370 transitions. [2022-04-28 03:27:08,133 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 370 transitions. Word has length 51 [2022-04-28 03:27:08,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:27:08,133 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 370 transitions. [2022-04-28 03:27:08,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:27:08,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 296 states and 370 transitions. [2022-04-28 03:27:09,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 370 edges. 370 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:27:09,275 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 370 transitions. [2022-04-28 03:27:09,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 03:27:09,275 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:27:09,275 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:27:09,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 03:27:09,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:27:09,476 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:27:09,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:27:09,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1523739656, now seen corresponding path program 32 times [2022-04-28 03:27:09,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:27:09,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [903821105] [2022-04-28 03:27:09,644 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:27:09,925 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:27:12,990 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:27:12,992 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:27:12,994 INFO L85 PathProgramCache]: Analyzing trace with hash 603402689, now seen corresponding path program 1 times [2022-04-28 03:27:12,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:27:12,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595483147] [2022-04-28 03:27:12,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:27:12,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:27:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:27:13,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:27:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:27:13,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {33576#(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); {33563#true} is VALID [2022-04-28 03:27:13,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {33563#true} assume true; {33563#true} is VALID [2022-04-28 03:27:13,111 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33563#true} {33563#true} #71#return; {33563#true} is VALID [2022-04-28 03:27:13,112 INFO L272 TraceCheckUtils]: 0: Hoare triple {33563#true} call ULTIMATE.init(); {33576#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:27:13,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {33576#(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); {33563#true} is VALID [2022-04-28 03:27:13,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {33563#true} assume true; {33563#true} is VALID [2022-04-28 03:27:13,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33563#true} {33563#true} #71#return; {33563#true} is VALID [2022-04-28 03:27:13,112 INFO L272 TraceCheckUtils]: 4: Hoare triple {33563#true} call #t~ret6 := main(); {33563#true} is VALID [2022-04-28 03:27:13,112 INFO L290 TraceCheckUtils]: 5: Hoare triple {33563#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {33568#(= main_~k~0 0)} is VALID [2022-04-28 03:27:13,113 INFO L290 TraceCheckUtils]: 6: Hoare triple {33568#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {33569#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:27:13,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {33569#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {33570#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:27:13,114 INFO L290 TraceCheckUtils]: 8: Hoare triple {33570#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} [167] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post3_354| |v_main_#t~post3_352|)) (.cse1 (= v_main_~i~0_476 v_main_~i~0_475)) (.cse2 (<= v_main_~m~0_318 0))) (or (and (= v_main_~m~0_318 v_main_~m~0_318) (= v_main_~j~0_1418 v_main_~j~0_1400) (= v_main_~n~0_159 v_main_~n~0_159) .cse0 .cse1) (and (= v_main_~j~0_1400 v_main_~j~0_1418) .cse0 .cse1 (or (not (< v_main_~i~0_476 v_main_~n~0_159)) (not .cse2))) (and (= v_main_~j~0_1400 0) .cse2 (< v_main_~i~0_475 (+ 1 v_main_~n~0_159)) (< v_main_~i~0_476 v_main_~i~0_475)))) InVars {main_~i~0=v_main_~i~0_476, main_~n~0=v_main_~n~0_159, main_#t~post3=|v_main_#t~post3_354|, main_~m~0=v_main_~m~0_318, main_~j~0=v_main_~j~0_1418} OutVars{main_~i~0=v_main_~i~0_475, main_#t~post3=|v_main_#t~post3_352|, main_~n~0=v_main_~n~0_159, main_~m~0=v_main_~m~0_318, main_~j~0=v_main_~j~0_1400} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post3] {33571#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:27:13,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {33571#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [168] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33571#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:27:13,115 INFO L290 TraceCheckUtils]: 10: Hoare triple {33571#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [169] L31-3-->L31-4_primed: Formula: (let ((.cse3 (<= v_main_~m~0_319 16)) (.cse2 (< 15 v_main_~m~0_319)) (.cse0 (= v_main_~k~0_1283 v_main_~k~0_1267)) (.cse1 (= |v_main_#t~post5_813| |v_main_#t~post5_797|)) (.cse4 (= |v_main_#t~post3_357| |v_main_#t~post3_353|)) (.cse5 (= |v_main_#t~post4_813| |v_main_#t~post4_797|)) (.cse6 (= v_main_~j~0_1421 v_main_~j~0_1401))) (or (and (= v_main_~i~0_477 v_main_~i~0_478) .cse0 .cse1 (or (not .cse2) (not .cse3) (not (< v_main_~i~0_478 v_main_~n~0_160))) .cse4 .cse5 .cse6) (and (= 16 v_main_~j~0_1401) (< v_main_~i~0_478 v_main_~i~0_477) .cse3 .cse2 (< v_main_~i~0_477 (+ 1 v_main_~n~0_160)) (= (+ (* 16 v_main_~i~0_477) v_main_~k~0_1283) (+ (* 16 v_main_~i~0_478) v_main_~k~0_1267))) (and .cse0 (= v_main_~m~0_319 v_main_~m~0_319) (= v_main_~n~0_160 v_main_~n~0_160) .cse1 .cse4 .cse5 .cse6 (= v_main_~i~0_478 v_main_~i~0_477)))) InVars {main_~m~0=v_main_~m~0_319, main_~k~0=v_main_~k~0_1283, main_~j~0=v_main_~j~0_1421, main_~i~0=v_main_~i~0_478, main_#t~post4=|v_main_#t~post4_813|, main_#t~post5=|v_main_#t~post5_813|, main_~n~0=v_main_~n~0_160, main_#t~post3=|v_main_#t~post3_357|} OutVars{main_~m~0=v_main_~m~0_319, main_~k~0=v_main_~k~0_1267, main_~j~0=v_main_~j~0_1401, main_~i~0=v_main_~i~0_477, main_#t~post4=|v_main_#t~post4_797|, main_#t~post5=|v_main_#t~post5_797|, main_#t~post3=|v_main_#t~post3_353|, main_~n~0=v_main_~n~0_160} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {33572#(or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ 160 (* main_~i~0 16)) (+ main_~k~0 (* main_~n~0 16))))} is VALID [2022-04-28 03:27:13,115 INFO L290 TraceCheckUtils]: 11: Hoare triple {33572#(or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ 160 (* main_~i~0 16)) (+ main_~k~0 (* main_~n~0 16))))} [166] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {33573#(<= 160 main_~k~0)} is VALID [2022-04-28 03:27:13,116 INFO L272 TraceCheckUtils]: 12: Hoare triple {33573#(<= 160 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {33574#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:27:13,116 INFO L290 TraceCheckUtils]: 13: Hoare triple {33574#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {33575#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:27:13,116 INFO L290 TraceCheckUtils]: 14: Hoare triple {33575#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {33564#false} is VALID [2022-04-28 03:27:13,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {33564#false} assume !false; {33564#false} is VALID [2022-04-28 03:27:13,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:27:13,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:27:13,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595483147] [2022-04-28 03:27:13,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595483147] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:27:13,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046344810] [2022-04-28 03:27:13,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:27:13,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:27:13,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:27:13,118 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:27:13,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 03:27:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:27:13,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:27:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:27:13,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:27:13,615 INFO L272 TraceCheckUtils]: 0: Hoare triple {33563#true} call ULTIMATE.init(); {33563#true} is VALID [2022-04-28 03:27:13,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {33563#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); {33563#true} is VALID [2022-04-28 03:27:13,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {33563#true} assume true; {33563#true} is VALID [2022-04-28 03:27:13,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33563#true} {33563#true} #71#return; {33563#true} is VALID [2022-04-28 03:27:13,616 INFO L272 TraceCheckUtils]: 4: Hoare triple {33563#true} call #t~ret6 := main(); {33563#true} is VALID [2022-04-28 03:27:13,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {33563#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {33595#(<= 0 main_~k~0)} is VALID [2022-04-28 03:27:13,616 INFO L290 TraceCheckUtils]: 6: Hoare triple {33595#(<= 0 main_~k~0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {33599#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} is VALID [2022-04-28 03:27:13,617 INFO L290 TraceCheckUtils]: 7: Hoare triple {33599#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {33603#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:27:13,617 INFO L290 TraceCheckUtils]: 8: Hoare triple {33603#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [167] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post3_354| |v_main_#t~post3_352|)) (.cse1 (= v_main_~i~0_476 v_main_~i~0_475)) (.cse2 (<= v_main_~m~0_318 0))) (or (and (= v_main_~m~0_318 v_main_~m~0_318) (= v_main_~j~0_1418 v_main_~j~0_1400) (= v_main_~n~0_159 v_main_~n~0_159) .cse0 .cse1) (and (= v_main_~j~0_1400 v_main_~j~0_1418) .cse0 .cse1 (or (not (< v_main_~i~0_476 v_main_~n~0_159)) (not .cse2))) (and (= v_main_~j~0_1400 0) .cse2 (< v_main_~i~0_475 (+ 1 v_main_~n~0_159)) (< v_main_~i~0_476 v_main_~i~0_475)))) InVars {main_~i~0=v_main_~i~0_476, main_~n~0=v_main_~n~0_159, main_#t~post3=|v_main_#t~post3_354|, main_~m~0=v_main_~m~0_318, main_~j~0=v_main_~j~0_1418} OutVars{main_~i~0=v_main_~i~0_475, main_#t~post3=|v_main_#t~post3_352|, main_~n~0=v_main_~n~0_159, main_~m~0=v_main_~m~0_318, main_~j~0=v_main_~j~0_1400} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post3] {33603#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:27:13,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {33603#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [168] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33603#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:27:13,624 INFO L290 TraceCheckUtils]: 10: Hoare triple {33603#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [169] L31-3-->L31-4_primed: Formula: (let ((.cse3 (<= v_main_~m~0_319 16)) (.cse2 (< 15 v_main_~m~0_319)) (.cse0 (= v_main_~k~0_1283 v_main_~k~0_1267)) (.cse1 (= |v_main_#t~post5_813| |v_main_#t~post5_797|)) (.cse4 (= |v_main_#t~post3_357| |v_main_#t~post3_353|)) (.cse5 (= |v_main_#t~post4_813| |v_main_#t~post4_797|)) (.cse6 (= v_main_~j~0_1421 v_main_~j~0_1401))) (or (and (= v_main_~i~0_477 v_main_~i~0_478) .cse0 .cse1 (or (not .cse2) (not .cse3) (not (< v_main_~i~0_478 v_main_~n~0_160))) .cse4 .cse5 .cse6) (and (= 16 v_main_~j~0_1401) (< v_main_~i~0_478 v_main_~i~0_477) .cse3 .cse2 (< v_main_~i~0_477 (+ 1 v_main_~n~0_160)) (= (+ (* 16 v_main_~i~0_477) v_main_~k~0_1283) (+ (* 16 v_main_~i~0_478) v_main_~k~0_1267))) (and .cse0 (= v_main_~m~0_319 v_main_~m~0_319) (= v_main_~n~0_160 v_main_~n~0_160) .cse1 .cse4 .cse5 .cse6 (= v_main_~i~0_478 v_main_~i~0_477)))) InVars {main_~m~0=v_main_~m~0_319, main_~k~0=v_main_~k~0_1283, main_~j~0=v_main_~j~0_1421, main_~i~0=v_main_~i~0_478, main_#t~post4=|v_main_#t~post4_813|, main_#t~post5=|v_main_#t~post5_813|, main_~n~0=v_main_~n~0_160, main_#t~post3=|v_main_#t~post3_357|} OutVars{main_~m~0=v_main_~m~0_319, main_~k~0=v_main_~k~0_1267, main_~j~0=v_main_~j~0_1401, main_~i~0=v_main_~i~0_477, main_#t~post4=|v_main_#t~post4_797|, main_#t~post5=|v_main_#t~post5_797|, main_#t~post3=|v_main_#t~post3_353|, main_~n~0=v_main_~n~0_160} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {33613#(and (<= 10 main_~n~0) (or (and (<= (+ (div main_~k~0 (- 16)) main_~i~0) 0) (< (div main_~k~0 (- 16)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:27:13,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {33613#(and (<= 10 main_~n~0) (or (and (<= (+ (div main_~k~0 (- 16)) main_~i~0) 0) (< (div main_~k~0 (- 16)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [166] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {33573#(<= 160 main_~k~0)} is VALID [2022-04-28 03:27:13,627 INFO L272 TraceCheckUtils]: 12: Hoare triple {33573#(<= 160 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {33620#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:27:13,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {33620#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {33624#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:27:13,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {33624#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {33564#false} is VALID [2022-04-28 03:27:13,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {33564#false} assume !false; {33564#false} is VALID [2022-04-28 03:27:13,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:27:13,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:27:14,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {33564#false} assume !false; {33564#false} is VALID [2022-04-28 03:27:14,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {33624#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {33564#false} is VALID [2022-04-28 03:27:14,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {33620#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {33624#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:27:14,309 INFO L272 TraceCheckUtils]: 12: Hoare triple {33640#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {33620#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:27:14,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {33644#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} [166] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {33640#(<= 100 main_~k~0)} is VALID [2022-04-28 03:27:14,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {33648#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 16))) main_~n~0) (<= main_~n~0 main_~i~0) (not (< 15 main_~m~0)) (not (<= main_~m~0 16))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [169] L31-3-->L31-4_primed: Formula: (let ((.cse3 (<= v_main_~m~0_319 16)) (.cse2 (< 15 v_main_~m~0_319)) (.cse0 (= v_main_~k~0_1283 v_main_~k~0_1267)) (.cse1 (= |v_main_#t~post5_813| |v_main_#t~post5_797|)) (.cse4 (= |v_main_#t~post3_357| |v_main_#t~post3_353|)) (.cse5 (= |v_main_#t~post4_813| |v_main_#t~post4_797|)) (.cse6 (= v_main_~j~0_1421 v_main_~j~0_1401))) (or (and (= v_main_~i~0_477 v_main_~i~0_478) .cse0 .cse1 (or (not .cse2) (not .cse3) (not (< v_main_~i~0_478 v_main_~n~0_160))) .cse4 .cse5 .cse6) (and (= 16 v_main_~j~0_1401) (< v_main_~i~0_478 v_main_~i~0_477) .cse3 .cse2 (< v_main_~i~0_477 (+ 1 v_main_~n~0_160)) (= (+ (* 16 v_main_~i~0_477) v_main_~k~0_1283) (+ (* 16 v_main_~i~0_478) v_main_~k~0_1267))) (and .cse0 (= v_main_~m~0_319 v_main_~m~0_319) (= v_main_~n~0_160 v_main_~n~0_160) .cse1 .cse4 .cse5 .cse6 (= v_main_~i~0_478 v_main_~i~0_477)))) InVars {main_~m~0=v_main_~m~0_319, main_~k~0=v_main_~k~0_1283, main_~j~0=v_main_~j~0_1421, main_~i~0=v_main_~i~0_478, main_#t~post4=|v_main_#t~post4_813|, main_#t~post5=|v_main_#t~post5_813|, main_~n~0=v_main_~n~0_160, main_#t~post3=|v_main_#t~post3_357|} OutVars{main_~m~0=v_main_~m~0_319, main_~k~0=v_main_~k~0_1267, main_~j~0=v_main_~j~0_1401, main_~i~0=v_main_~i~0_477, main_#t~post4=|v_main_#t~post4_797|, main_#t~post5=|v_main_#t~post5_797|, main_#t~post3=|v_main_#t~post3_353|, main_~n~0=v_main_~n~0_160} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {33644#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} is VALID [2022-04-28 03:27:14,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {33648#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 16))) main_~n~0) (<= main_~n~0 main_~i~0) (not (< 15 main_~m~0)) (not (<= main_~m~0 16))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [168] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33648#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 16))) main_~n~0) (<= main_~n~0 main_~i~0) (not (< 15 main_~m~0)) (not (<= main_~m~0 16))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:27:14,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {33655#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 16))) main_~n~0) (<= main_~n~0 main_~i~0) (not (< 15 main_~m~0)) (not (<= main_~m~0 16))) (or (<= 100 main_~k~0) (and (< 0 main_~m~0) (< main_~i~0 main_~n~0))))} [167] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post3_354| |v_main_#t~post3_352|)) (.cse1 (= v_main_~i~0_476 v_main_~i~0_475)) (.cse2 (<= v_main_~m~0_318 0))) (or (and (= v_main_~m~0_318 v_main_~m~0_318) (= v_main_~j~0_1418 v_main_~j~0_1400) (= v_main_~n~0_159 v_main_~n~0_159) .cse0 .cse1) (and (= v_main_~j~0_1400 v_main_~j~0_1418) .cse0 .cse1 (or (not (< v_main_~i~0_476 v_main_~n~0_159)) (not .cse2))) (and (= v_main_~j~0_1400 0) .cse2 (< v_main_~i~0_475 (+ 1 v_main_~n~0_159)) (< v_main_~i~0_476 v_main_~i~0_475)))) InVars {main_~i~0=v_main_~i~0_476, main_~n~0=v_main_~n~0_159, main_#t~post3=|v_main_#t~post3_354|, main_~m~0=v_main_~m~0_318, main_~j~0=v_main_~j~0_1418} OutVars{main_~i~0=v_main_~i~0_475, main_#t~post3=|v_main_#t~post3_352|, main_~n~0=v_main_~n~0_159, main_~m~0=v_main_~m~0_318, main_~j~0=v_main_~j~0_1400} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post3] {33648#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 16))) main_~n~0) (<= main_~n~0 main_~i~0) (not (< 15 main_~m~0)) (not (<= main_~m~0 16))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:27:14,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {33659#(and (or (<= (div (+ (- 100) main_~k~0) (- 16)) 1) (<= (div (+ (- 100) main_~k~0) (- 16)) main_~n~0)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {33655#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 16))) main_~n~0) (<= main_~n~0 main_~i~0) (not (< 15 main_~m~0)) (not (<= main_~m~0 16))) (or (<= 100 main_~k~0) (and (< 0 main_~m~0) (< main_~i~0 main_~n~0))))} is VALID [2022-04-28 03:27:14,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {33663#(<= (div (+ (- 100) main_~k~0) (- 16)) 10)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {33659#(and (or (<= (div (+ (- 100) main_~k~0) (- 16)) 1) (<= (div (+ (- 100) main_~k~0) (- 16)) main_~n~0)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} is VALID [2022-04-28 03:27:14,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {33563#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {33663#(<= (div (+ (- 100) main_~k~0) (- 16)) 10)} is VALID [2022-04-28 03:27:14,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {33563#true} call #t~ret6 := main(); {33563#true} is VALID [2022-04-28 03:27:14,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33563#true} {33563#true} #71#return; {33563#true} is VALID [2022-04-28 03:27:14,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {33563#true} assume true; {33563#true} is VALID [2022-04-28 03:27:14,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {33563#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); {33563#true} is VALID [2022-04-28 03:27:14,314 INFO L272 TraceCheckUtils]: 0: Hoare triple {33563#true} call ULTIMATE.init(); {33563#true} is VALID [2022-04-28 03:27:14,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:27:14,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046344810] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:27:14,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:27:14,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 23 [2022-04-28 03:27:15,688 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:27:15,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [903821105] [2022-04-28 03:27:15,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [903821105] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:27:15,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:27:15,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-28 03:27:15,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409533690] [2022-04-28 03:27:15,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:27:15,688 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 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 51 [2022-04-28 03:27:15,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:27:15,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 45 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:27:15,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:27:15,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-28 03:27:15,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:27:15,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-28 03:27:15,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=547, Invalid=2875, Unknown=0, NotChecked=0, Total=3422 [2022-04-28 03:27:15,727 INFO L87 Difference]: Start difference. First operand 296 states and 370 transitions. Second operand has 45 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:27:21,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:27:21,218 INFO L93 Difference]: Finished difference Result 313 states and 389 transitions. [2022-04-28 03:27:21,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-28 03:27:21,219 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 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 51 [2022-04-28 03:27:21,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:27:21,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:27:21,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 79 transitions. [2022-04-28 03:27:21,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:27:21,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 79 transitions. [2022-04-28 03:27:21,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 79 transitions. [2022-04-28 03:27:21,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:27:21,286 INFO L225 Difference]: With dead ends: 313 [2022-04-28 03:27:21,286 INFO L226 Difference]: Without dead ends: 304 [2022-04-28 03:27:21,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2260 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1093, Invalid=8413, Unknown=0, NotChecked=0, Total=9506 [2022-04-28 03:27:21,287 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 31 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 2326 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 2359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:27:21,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 215 Invalid, 2359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2326 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-28 03:27:21,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-04-28 03:27:22,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 299. [2022-04-28 03:27:22,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:27:22,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 304 states. Second operand has 299 states, 294 states have (on average 1.2551020408163265) internal successors, (369), 294 states have internal predecessors, (369), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:27:22,628 INFO L74 IsIncluded]: Start isIncluded. First operand 304 states. Second operand has 299 states, 294 states have (on average 1.2551020408163265) internal successors, (369), 294 states have internal predecessors, (369), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:27:22,628 INFO L87 Difference]: Start difference. First operand 304 states. Second operand has 299 states, 294 states have (on average 1.2551020408163265) internal successors, (369), 294 states have internal predecessors, (369), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:27:22,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:27:22,634 INFO L93 Difference]: Finished difference Result 304 states and 378 transitions. [2022-04-28 03:27:22,634 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 378 transitions. [2022-04-28 03:27:22,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:27:22,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:27:22,635 INFO L74 IsIncluded]: Start isIncluded. First operand has 299 states, 294 states have (on average 1.2551020408163265) internal successors, (369), 294 states have internal predecessors, (369), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 304 states. [2022-04-28 03:27:22,635 INFO L87 Difference]: Start difference. First operand has 299 states, 294 states have (on average 1.2551020408163265) internal successors, (369), 294 states have internal predecessors, (369), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 304 states. [2022-04-28 03:27:22,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:27:22,638 INFO L93 Difference]: Finished difference Result 304 states and 378 transitions. [2022-04-28 03:27:22,638 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 378 transitions. [2022-04-28 03:27:22,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:27:22,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:27:22,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:27:22,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:27:22,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.2551020408163265) internal successors, (369), 294 states have internal predecessors, (369), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:27:22,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 373 transitions. [2022-04-28 03:27:22,642 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 373 transitions. Word has length 51 [2022-04-28 03:27:22,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:27:22,643 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 373 transitions. [2022-04-28 03:27:22,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:27:22,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 299 states and 373 transitions. [2022-04-28 03:27:23,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 373 edges. 373 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:27:23,755 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 373 transitions. [2022-04-28 03:27:23,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-28 03:27:23,756 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:27:23,756 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:27:23,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 03:27:23,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:27:23,959 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:27:23,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:27:23,960 INFO L85 PathProgramCache]: Analyzing trace with hash 197259669, now seen corresponding path program 33 times [2022-04-28 03:27:23,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:27:23,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1149731177] [2022-04-28 03:27:28,059 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:27:28,120 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:27:28,573 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:27:28,574 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:27:28,576 INFO L85 PathProgramCache]: Analyzing trace with hash 2058009570, now seen corresponding path program 1 times [2022-04-28 03:27:28,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:27:28,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158455041] [2022-04-28 03:27:28,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:27:28,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:27:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:27:28,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:27:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:27:28,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {35642#(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); {35630#true} is VALID [2022-04-28 03:27:28,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {35630#true} assume true; {35630#true} is VALID [2022-04-28 03:27:28,659 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35630#true} {35630#true} #71#return; {35630#true} is VALID [2022-04-28 03:27:28,659 INFO L272 TraceCheckUtils]: 0: Hoare triple {35630#true} call ULTIMATE.init(); {35642#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:27:28,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {35642#(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); {35630#true} is VALID [2022-04-28 03:27:28,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {35630#true} assume true; {35630#true} is VALID [2022-04-28 03:27:28,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35630#true} {35630#true} #71#return; {35630#true} is VALID [2022-04-28 03:27:28,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {35630#true} call #t~ret6 := main(); {35630#true} is VALID [2022-04-28 03:27:28,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {35630#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {35635#(= main_~k~0 0)} is VALID [2022-04-28 03:27:28,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {35635#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {35636#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:27:28,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {35636#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {35637#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:27:28,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {35637#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [171] L31-3-->L31-4_primed: Formula: (let ((.cse2 (= |v_main_#t~post3_367| |v_main_#t~post3_366|)) (.cse3 (= v_main_~j~0_1476 v_main_~j~0_1457)) (.cse4 (= v_main_~i~0_495 v_main_~i~0_494)) (.cse5 (= v_main_~k~0_1334 v_main_~k~0_1316)) (.cse0 (<= v_main_~m~0_328 18)) (.cse1 (< 17 v_main_~m~0_328))) (or (and (or (not .cse0) (not .cse1) (not (< v_main_~i~0_495 v_main_~n~0_164))) .cse2 (= |v_main_#t~post4_826| |v_main_#t~post4_844|) .cse3 .cse4 .cse5 (= |v_main_#t~post5_826| |v_main_#t~post5_844|)) (and (= v_main_~m~0_328 v_main_~m~0_328) (= |v_main_#t~post4_844| |v_main_#t~post4_826|) .cse2 .cse3 .cse4 (= |v_main_#t~post5_844| |v_main_#t~post5_826|) .cse5 (= v_main_~n~0_164 v_main_~n~0_164)) (and (= v_main_~j~0_1457 18) (< v_main_~i~0_495 v_main_~i~0_494) (< v_main_~i~0_494 (+ 1 v_main_~n~0_164)) (= (+ (* 18 v_main_~i~0_494) v_main_~k~0_1334) (+ (* 18 v_main_~i~0_495) v_main_~k~0_1316)) .cse0 .cse1))) InVars {main_~m~0=v_main_~m~0_328, main_~k~0=v_main_~k~0_1334, main_~j~0=v_main_~j~0_1476, main_~i~0=v_main_~i~0_495, main_#t~post4=|v_main_#t~post4_844|, main_#t~post5=|v_main_#t~post5_844|, main_~n~0=v_main_~n~0_164, main_#t~post3=|v_main_#t~post3_367|} OutVars{main_~m~0=v_main_~m~0_328, main_~k~0=v_main_~k~0_1316, main_~j~0=v_main_~j~0_1457, main_~i~0=v_main_~i~0_494, main_#t~post4=|v_main_#t~post4_826|, main_#t~post5=|v_main_#t~post5_826|, main_#t~post3=|v_main_#t~post3_366|, main_~n~0=v_main_~n~0_164} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {35638#(or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ (* main_~i~0 18) 180) (+ main_~k~0 (* main_~n~0 18))))} is VALID [2022-04-28 03:27:28,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {35638#(or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ (* main_~i~0 18) 180) (+ main_~k~0 (* main_~n~0 18))))} [170] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {35639#(<= 180 main_~k~0)} is VALID [2022-04-28 03:27:28,662 INFO L272 TraceCheckUtils]: 10: Hoare triple {35639#(<= 180 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {35640#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:27:28,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {35640#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {35641#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:27:28,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {35641#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {35631#false} is VALID [2022-04-28 03:27:28,663 INFO L290 TraceCheckUtils]: 13: Hoare triple {35631#false} assume !false; {35631#false} is VALID [2022-04-28 03:27:28,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:27:28,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:27:28,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158455041] [2022-04-28 03:27:28,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158455041] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:27:28,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:27:28,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:27:31,074 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:27:31,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1149731177] [2022-04-28 03:27:31,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1149731177] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:27:31,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:27:31,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-28 03:27:31,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485717209] [2022-04-28 03:27:31,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:27:31,075 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 46 states have internal predecessors, (48), 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 52 [2022-04-28 03:27:31,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:27:31,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 46 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:27:31,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:27:31,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-28 03:27:31,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:27:31,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-28 03:27:31,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 03:27:31,121 INFO L87 Difference]: Start difference. First operand 299 states and 373 transitions. Second operand has 48 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 46 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:27:41,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:27:41,962 INFO L93 Difference]: Finished difference Result 373 states and 469 transitions. [2022-04-28 03:27:41,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-28 03:27:41,962 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 46 states have internal predecessors, (48), 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 52 [2022-04-28 03:27:41,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:27:41,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 46 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:27:41,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 107 transitions. [2022-04-28 03:27:41,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 46 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:27:41,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 107 transitions. [2022-04-28 03:27:41,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 107 transitions. [2022-04-28 03:27:42,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:27:42,066 INFO L225 Difference]: With dead ends: 373 [2022-04-28 03:27:42,066 INFO L226 Difference]: Without dead ends: 368 [2022-04-28 03:27:42,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1522 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=393, Invalid=8727, Unknown=0, NotChecked=0, Total=9120 [2022-04-28 03:27:42,067 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 59 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 3803 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 3845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 3803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:27:42,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 230 Invalid, 3845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 3803 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-04-28 03:27:42,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-04-28 03:27:43,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 340. [2022-04-28 03:27:43,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:27:43,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 368 states. Second operand has 340 states, 335 states have (on average 1.2835820895522387) internal successors, (430), 335 states have internal predecessors, (430), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:27:43,583 INFO L74 IsIncluded]: Start isIncluded. First operand 368 states. Second operand has 340 states, 335 states have (on average 1.2835820895522387) internal successors, (430), 335 states have internal predecessors, (430), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:27:43,583 INFO L87 Difference]: Start difference. First operand 368 states. Second operand has 340 states, 335 states have (on average 1.2835820895522387) internal successors, (430), 335 states have internal predecessors, (430), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:27:43,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:27:43,588 INFO L93 Difference]: Finished difference Result 368 states and 464 transitions. [2022-04-28 03:27:43,588 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 464 transitions. [2022-04-28 03:27:43,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:27:43,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:27:43,588 INFO L74 IsIncluded]: Start isIncluded. First operand has 340 states, 335 states have (on average 1.2835820895522387) internal successors, (430), 335 states have internal predecessors, (430), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 368 states. [2022-04-28 03:27:43,588 INFO L87 Difference]: Start difference. First operand has 340 states, 335 states have (on average 1.2835820895522387) internal successors, (430), 335 states have internal predecessors, (430), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 368 states. [2022-04-28 03:27:43,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:27:43,596 INFO L93 Difference]: Finished difference Result 368 states and 464 transitions. [2022-04-28 03:27:43,596 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 464 transitions. [2022-04-28 03:27:43,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:27:43,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:27:43,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:27:43,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:27:43,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 335 states have (on average 1.2835820895522387) internal successors, (430), 335 states have internal predecessors, (430), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:27:43,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 434 transitions. [2022-04-28 03:27:43,601 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 434 transitions. Word has length 52 [2022-04-28 03:27:43,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:27:43,602 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 434 transitions. [2022-04-28 03:27:43,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 46 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:27:43,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 340 states and 434 transitions. [2022-04-28 03:27:44,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 434 edges. 434 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:27:44,963 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 434 transitions. [2022-04-28 03:27:44,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-28 03:27:44,963 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:27:44,963 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:27:44,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-04-28 03:27:44,963 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:27:44,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:27:44,964 INFO L85 PathProgramCache]: Analyzing trace with hash -855638238, now seen corresponding path program 34 times [2022-04-28 03:27:44,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:27:44,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [105487978] [2022-04-28 03:27:45,342 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:27:45,518 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:27:49,778 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:27:49,877 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:27:52,055 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:27:52,169 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:27:52,170 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:27:52,173 INFO L85 PathProgramCache]: Analyzing trace with hash -617266367, now seen corresponding path program 1 times [2022-04-28 03:27:52,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:27:52,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351276053] [2022-04-28 03:27:52,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:27:52,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:27:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:27:52,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:27:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:27:52,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {37952#(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); {37939#true} is VALID [2022-04-28 03:27:52,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {37939#true} assume true; {37939#true} is VALID [2022-04-28 03:27:52,283 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37939#true} {37939#true} #71#return; {37939#true} is VALID [2022-04-28 03:27:52,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {37939#true} call ULTIMATE.init(); {37952#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:27:52,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {37952#(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); {37939#true} is VALID [2022-04-28 03:27:52,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {37939#true} assume true; {37939#true} is VALID [2022-04-28 03:27:52,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37939#true} {37939#true} #71#return; {37939#true} is VALID [2022-04-28 03:27:52,283 INFO L272 TraceCheckUtils]: 4: Hoare triple {37939#true} call #t~ret6 := main(); {37939#true} is VALID [2022-04-28 03:27:52,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {37939#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {37944#(= main_~k~0 0)} is VALID [2022-04-28 03:27:52,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {37944#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {37945#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:27:52,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {37945#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {37946#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:27:52,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {37946#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} [173] L31-3-->L31-4_primed: Formula: (let ((.cse2 (= |v_main_#t~post4_878| |v_main_#t~post4_861|)) (.cse3 (= |v_main_#t~post5_878| |v_main_#t~post5_861|)) (.cse4 (= v_main_~k~0_1375 v_main_~k~0_1373)) (.cse0 (< 1 v_main_~m~0_340)) (.cse1 (<= v_main_~m~0_340 2)) (.cse5 (= v_main_~j~0_1537 v_main_~j~0_1518))) (or (and (= 2 v_main_~j~0_1518) .cse0 .cse1 (< v_main_~i~0_511 v_main_~i~0_510) (= (+ (* 2 v_main_~i~0_511) v_main_~k~0_1373) (+ v_main_~k~0_1375 (* 2 v_main_~i~0_510))) (< v_main_~i~0_510 (+ 1 v_main_~n~0_171))) (and (= |v_main_#t~post3_380| |v_main_#t~post3_378|) (= v_main_~i~0_511 v_main_~i~0_510) .cse2 (= v_main_~n~0_171 v_main_~n~0_171) .cse3 (= v_main_~m~0_340 v_main_~m~0_340) .cse4 .cse5) (and .cse2 (= v_main_~i~0_510 v_main_~i~0_511) .cse3 .cse4 (= |v_main_#t~post3_378| |v_main_#t~post3_380|) (or (not .cse0) (not .cse1) (not (< v_main_~i~0_511 v_main_~n~0_171))) .cse5))) InVars {main_~m~0=v_main_~m~0_340, main_~k~0=v_main_~k~0_1375, main_~j~0=v_main_~j~0_1537, main_~i~0=v_main_~i~0_511, main_#t~post4=|v_main_#t~post4_878|, main_#t~post5=|v_main_#t~post5_878|, main_~n~0=v_main_~n~0_171, main_#t~post3=|v_main_#t~post3_380|} OutVars{main_~m~0=v_main_~m~0_340, main_~k~0=v_main_~k~0_1373, main_~j~0=v_main_~j~0_1518, main_~i~0=v_main_~i~0_510, main_#t~post4=|v_main_#t~post4_861|, main_#t~post5=|v_main_#t~post5_861|, main_#t~post3=|v_main_#t~post3_378|, main_~n~0=v_main_~n~0_171} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {37947#(and (<= (+ (* main_~i~0 15) 150) (+ main_~k~0 (* main_~n~0 15))) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:27:52,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {37947#(and (<= (+ (* main_~i~0 15) 150) (+ main_~k~0 (* main_~n~0 15))) (<= (+ main_~i~0 10) main_~n~0))} [174] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37947#(and (<= (+ (* main_~i~0 15) 150) (+ main_~k~0 (* main_~n~0 15))) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:27:52,287 INFO L290 TraceCheckUtils]: 10: Hoare triple {37947#(and (<= (+ (* main_~i~0 15) 150) (+ main_~k~0 (* main_~n~0 15))) (<= (+ main_~i~0 10) main_~n~0))} [175] L31-3-->L31-4_primed: Formula: (let ((.cse4 (< 14 v_main_~m~0_341)) (.cse3 (<= v_main_~m~0_341 15)) (.cse0 (= v_main_~i~0_513 v_main_~i~0_512)) (.cse1 (= |v_main_#t~post4_881| |v_main_#t~post4_863|)) (.cse2 (= |v_main_#t~post5_881| |v_main_#t~post5_863|)) (.cse5 (= v_main_~j~0_1540 v_main_~j~0_1521))) (or (and .cse0 (= |v_main_#t~post3_379| |v_main_#t~post3_383|) (= v_main_~k~0_1376 v_main_~k~0_1391) .cse1 .cse2 (or (not .cse3) (not .cse4) (not (< v_main_~i~0_513 v_main_~n~0_172))) .cse5) (and (= (+ (* 15 v_main_~i~0_512) v_main_~k~0_1391) (+ (* 15 v_main_~i~0_513) v_main_~k~0_1376)) (< v_main_~i~0_512 (+ 1 v_main_~n~0_172)) (= v_main_~j~0_1521 15) .cse4 (< v_main_~i~0_513 v_main_~i~0_512) .cse3) (and (= v_main_~n~0_172 v_main_~n~0_172) .cse0 (= v_main_~m~0_341 v_main_~m~0_341) (= |v_main_#t~post3_383| |v_main_#t~post3_379|) (= v_main_~k~0_1391 v_main_~k~0_1376) .cse1 .cse2 .cse5))) InVars {main_~m~0=v_main_~m~0_341, main_~k~0=v_main_~k~0_1391, main_~j~0=v_main_~j~0_1540, main_~i~0=v_main_~i~0_513, main_#t~post4=|v_main_#t~post4_881|, main_#t~post5=|v_main_#t~post5_881|, main_~n~0=v_main_~n~0_172, main_#t~post3=|v_main_#t~post3_383|} OutVars{main_~m~0=v_main_~m~0_341, main_~k~0=v_main_~k~0_1376, main_~j~0=v_main_~j~0_1521, main_~i~0=v_main_~i~0_512, main_#t~post4=|v_main_#t~post4_863|, main_#t~post5=|v_main_#t~post5_863|, main_#t~post3=|v_main_#t~post3_379|, main_~n~0=v_main_~n~0_172} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {37948#(or (<= (+ (* main_~i~0 15) 150) (+ main_~k~0 (* main_~n~0 15))) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:27:52,287 INFO L290 TraceCheckUtils]: 11: Hoare triple {37948#(or (<= (+ (* main_~i~0 15) 150) (+ main_~k~0 (* main_~n~0 15))) (<= (+ main_~i~0 10) main_~n~0))} [172] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {37949#(<= 150 main_~k~0)} is VALID [2022-04-28 03:27:52,288 INFO L272 TraceCheckUtils]: 12: Hoare triple {37949#(<= 150 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {37950#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:27:52,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {37950#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {37951#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:27:52,288 INFO L290 TraceCheckUtils]: 14: Hoare triple {37951#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {37940#false} is VALID [2022-04-28 03:27:52,288 INFO L290 TraceCheckUtils]: 15: Hoare triple {37940#false} assume !false; {37940#false} is VALID [2022-04-28 03:27:52,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:27:52,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:27:52,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351276053] [2022-04-28 03:27:52,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351276053] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:27:52,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743442792] [2022-04-28 03:27:52,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:27:52,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:27:52,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:27:52,291 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:27:52,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 03:27:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:27:52,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:27:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:27:52,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:27:52,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {37939#true} call ULTIMATE.init(); {37939#true} is VALID [2022-04-28 03:27:52,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {37939#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); {37939#true} is VALID [2022-04-28 03:27:52,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {37939#true} assume true; {37939#true} is VALID [2022-04-28 03:27:52,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37939#true} {37939#true} #71#return; {37939#true} is VALID [2022-04-28 03:27:52,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {37939#true} call #t~ret6 := main(); {37939#true} is VALID [2022-04-28 03:27:52,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {37939#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {37971#(<= 0 main_~k~0)} is VALID [2022-04-28 03:27:52,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {37971#(<= 0 main_~k~0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {37975#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} is VALID [2022-04-28 03:27:52,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {37975#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {37979#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:27:52,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {37979#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [173] L31-3-->L31-4_primed: Formula: (let ((.cse2 (= |v_main_#t~post4_878| |v_main_#t~post4_861|)) (.cse3 (= |v_main_#t~post5_878| |v_main_#t~post5_861|)) (.cse4 (= v_main_~k~0_1375 v_main_~k~0_1373)) (.cse0 (< 1 v_main_~m~0_340)) (.cse1 (<= v_main_~m~0_340 2)) (.cse5 (= v_main_~j~0_1537 v_main_~j~0_1518))) (or (and (= 2 v_main_~j~0_1518) .cse0 .cse1 (< v_main_~i~0_511 v_main_~i~0_510) (= (+ (* 2 v_main_~i~0_511) v_main_~k~0_1373) (+ v_main_~k~0_1375 (* 2 v_main_~i~0_510))) (< v_main_~i~0_510 (+ 1 v_main_~n~0_171))) (and (= |v_main_#t~post3_380| |v_main_#t~post3_378|) (= v_main_~i~0_511 v_main_~i~0_510) .cse2 (= v_main_~n~0_171 v_main_~n~0_171) .cse3 (= v_main_~m~0_340 v_main_~m~0_340) .cse4 .cse5) (and .cse2 (= v_main_~i~0_510 v_main_~i~0_511) .cse3 .cse4 (= |v_main_#t~post3_378| |v_main_#t~post3_380|) (or (not .cse0) (not .cse1) (not (< v_main_~i~0_511 v_main_~n~0_171))) .cse5))) InVars {main_~m~0=v_main_~m~0_340, main_~k~0=v_main_~k~0_1375, main_~j~0=v_main_~j~0_1537, main_~i~0=v_main_~i~0_511, main_#t~post4=|v_main_#t~post4_878|, main_#t~post5=|v_main_#t~post5_878|, main_~n~0=v_main_~n~0_171, main_#t~post3=|v_main_#t~post3_380|} OutVars{main_~m~0=v_main_~m~0_340, main_~k~0=v_main_~k~0_1373, main_~j~0=v_main_~j~0_1518, main_~i~0=v_main_~i~0_510, main_#t~post4=|v_main_#t~post4_861|, main_#t~post5=|v_main_#t~post5_861|, main_#t~post3=|v_main_#t~post3_378|, main_~n~0=v_main_~n~0_171} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {37979#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:27:52,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {37979#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [174] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37979#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:27:52,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {37979#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [175] L31-3-->L31-4_primed: Formula: (let ((.cse4 (< 14 v_main_~m~0_341)) (.cse3 (<= v_main_~m~0_341 15)) (.cse0 (= v_main_~i~0_513 v_main_~i~0_512)) (.cse1 (= |v_main_#t~post4_881| |v_main_#t~post4_863|)) (.cse2 (= |v_main_#t~post5_881| |v_main_#t~post5_863|)) (.cse5 (= v_main_~j~0_1540 v_main_~j~0_1521))) (or (and .cse0 (= |v_main_#t~post3_379| |v_main_#t~post3_383|) (= v_main_~k~0_1376 v_main_~k~0_1391) .cse1 .cse2 (or (not .cse3) (not .cse4) (not (< v_main_~i~0_513 v_main_~n~0_172))) .cse5) (and (= (+ (* 15 v_main_~i~0_512) v_main_~k~0_1391) (+ (* 15 v_main_~i~0_513) v_main_~k~0_1376)) (< v_main_~i~0_512 (+ 1 v_main_~n~0_172)) (= v_main_~j~0_1521 15) .cse4 (< v_main_~i~0_513 v_main_~i~0_512) .cse3) (and (= v_main_~n~0_172 v_main_~n~0_172) .cse0 (= v_main_~m~0_341 v_main_~m~0_341) (= |v_main_#t~post3_383| |v_main_#t~post3_379|) (= v_main_~k~0_1391 v_main_~k~0_1376) .cse1 .cse2 .cse5))) InVars {main_~m~0=v_main_~m~0_341, main_~k~0=v_main_~k~0_1391, main_~j~0=v_main_~j~0_1540, main_~i~0=v_main_~i~0_513, main_#t~post4=|v_main_#t~post4_881|, main_#t~post5=|v_main_#t~post5_881|, main_~n~0=v_main_~n~0_172, main_#t~post3=|v_main_#t~post3_383|} OutVars{main_~m~0=v_main_~m~0_341, main_~k~0=v_main_~k~0_1376, main_~j~0=v_main_~j~0_1521, main_~i~0=v_main_~i~0_512, main_#t~post4=|v_main_#t~post4_863|, main_#t~post5=|v_main_#t~post5_863|, main_#t~post3=|v_main_#t~post3_379|, main_~n~0=v_main_~n~0_172} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {37989#(and (<= 10 main_~n~0) (or (and (<= (+ (div main_~k~0 (- 15)) main_~i~0) 0) (< (div main_~k~0 (- 15)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:27:52,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {37989#(and (<= 10 main_~n~0) (or (and (<= (+ (div main_~k~0 (- 15)) main_~i~0) 0) (< (div main_~k~0 (- 15)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [172] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {37949#(<= 150 main_~k~0)} is VALID [2022-04-28 03:27:52,799 INFO L272 TraceCheckUtils]: 12: Hoare triple {37949#(<= 150 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {37996#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:27:52,800 INFO L290 TraceCheckUtils]: 13: Hoare triple {37996#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {38000#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:27:52,800 INFO L290 TraceCheckUtils]: 14: Hoare triple {38000#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {37940#false} is VALID [2022-04-28 03:27:52,800 INFO L290 TraceCheckUtils]: 15: Hoare triple {37940#false} assume !false; {37940#false} is VALID [2022-04-28 03:27:52,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:27:52,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:27:53,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {37940#false} assume !false; {37940#false} is VALID [2022-04-28 03:27:53,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {38000#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {37940#false} is VALID [2022-04-28 03:27:53,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {37996#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {38000#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:27:53,519 INFO L272 TraceCheckUtils]: 12: Hoare triple {38016#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {37996#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:27:53,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {38020#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} [172] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {38016#(<= 100 main_~k~0)} is VALID [2022-04-28 03:27:53,521 INFO L290 TraceCheckUtils]: 10: Hoare triple {38024#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [175] L31-3-->L31-4_primed: Formula: (let ((.cse4 (< 14 v_main_~m~0_341)) (.cse3 (<= v_main_~m~0_341 15)) (.cse0 (= v_main_~i~0_513 v_main_~i~0_512)) (.cse1 (= |v_main_#t~post4_881| |v_main_#t~post4_863|)) (.cse2 (= |v_main_#t~post5_881| |v_main_#t~post5_863|)) (.cse5 (= v_main_~j~0_1540 v_main_~j~0_1521))) (or (and .cse0 (= |v_main_#t~post3_379| |v_main_#t~post3_383|) (= v_main_~k~0_1376 v_main_~k~0_1391) .cse1 .cse2 (or (not .cse3) (not .cse4) (not (< v_main_~i~0_513 v_main_~n~0_172))) .cse5) (and (= (+ (* 15 v_main_~i~0_512) v_main_~k~0_1391) (+ (* 15 v_main_~i~0_513) v_main_~k~0_1376)) (< v_main_~i~0_512 (+ 1 v_main_~n~0_172)) (= v_main_~j~0_1521 15) .cse4 (< v_main_~i~0_513 v_main_~i~0_512) .cse3) (and (= v_main_~n~0_172 v_main_~n~0_172) .cse0 (= v_main_~m~0_341 v_main_~m~0_341) (= |v_main_#t~post3_383| |v_main_#t~post3_379|) (= v_main_~k~0_1391 v_main_~k~0_1376) .cse1 .cse2 .cse5))) InVars {main_~m~0=v_main_~m~0_341, main_~k~0=v_main_~k~0_1391, main_~j~0=v_main_~j~0_1540, main_~i~0=v_main_~i~0_513, main_#t~post4=|v_main_#t~post4_881|, main_#t~post5=|v_main_#t~post5_881|, main_~n~0=v_main_~n~0_172, main_#t~post3=|v_main_#t~post3_383|} OutVars{main_~m~0=v_main_~m~0_341, main_~k~0=v_main_~k~0_1376, main_~j~0=v_main_~j~0_1521, main_~i~0=v_main_~i~0_512, main_#t~post4=|v_main_#t~post4_863|, main_#t~post5=|v_main_#t~post5_863|, main_#t~post3=|v_main_#t~post3_379|, main_~n~0=v_main_~n~0_172} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {38020#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} is VALID [2022-04-28 03:27:53,521 INFO L290 TraceCheckUtils]: 9: Hoare triple {38024#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [174] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38024#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:27:53,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {38031#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 2))) main_~n~0) (not (< 1 main_~m~0)) (<= (div (+ (- 100) main_~k~0) (- 2)) 1) (not (<= main_~m~0 2))) (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [173] L31-3-->L31-4_primed: Formula: (let ((.cse2 (= |v_main_#t~post4_878| |v_main_#t~post4_861|)) (.cse3 (= |v_main_#t~post5_878| |v_main_#t~post5_861|)) (.cse4 (= v_main_~k~0_1375 v_main_~k~0_1373)) (.cse0 (< 1 v_main_~m~0_340)) (.cse1 (<= v_main_~m~0_340 2)) (.cse5 (= v_main_~j~0_1537 v_main_~j~0_1518))) (or (and (= 2 v_main_~j~0_1518) .cse0 .cse1 (< v_main_~i~0_511 v_main_~i~0_510) (= (+ (* 2 v_main_~i~0_511) v_main_~k~0_1373) (+ v_main_~k~0_1375 (* 2 v_main_~i~0_510))) (< v_main_~i~0_510 (+ 1 v_main_~n~0_171))) (and (= |v_main_#t~post3_380| |v_main_#t~post3_378|) (= v_main_~i~0_511 v_main_~i~0_510) .cse2 (= v_main_~n~0_171 v_main_~n~0_171) .cse3 (= v_main_~m~0_340 v_main_~m~0_340) .cse4 .cse5) (and .cse2 (= v_main_~i~0_510 v_main_~i~0_511) .cse3 .cse4 (= |v_main_#t~post3_378| |v_main_#t~post3_380|) (or (not .cse0) (not .cse1) (not (< v_main_~i~0_511 v_main_~n~0_171))) .cse5))) InVars {main_~m~0=v_main_~m~0_340, main_~k~0=v_main_~k~0_1375, main_~j~0=v_main_~j~0_1537, main_~i~0=v_main_~i~0_511, main_#t~post4=|v_main_#t~post4_878|, main_#t~post5=|v_main_#t~post5_878|, main_~n~0=v_main_~n~0_171, main_#t~post3=|v_main_#t~post3_380|} OutVars{main_~m~0=v_main_~m~0_340, main_~k~0=v_main_~k~0_1373, main_~j~0=v_main_~j~0_1518, main_~i~0=v_main_~i~0_510, main_#t~post4=|v_main_#t~post4_861|, main_#t~post5=|v_main_#t~post5_861|, main_#t~post3=|v_main_#t~post3_378|, main_~n~0=v_main_~n~0_171} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {38024#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:27:53,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {38035#(and (or (< 0 main_~n~0) (<= 100 main_~k~0)) (or (<= (div (+ (- 100) main_~k~0) (- 15)) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 15)) 1)))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {38031#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 2))) main_~n~0) (not (< 1 main_~m~0)) (<= (div (+ (- 100) main_~k~0) (- 2)) 1) (not (<= main_~m~0 2))) (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:27:53,524 INFO L290 TraceCheckUtils]: 6: Hoare triple {38039#(<= (div (+ (- 100) main_~k~0) (- 15)) 10)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {38035#(and (or (< 0 main_~n~0) (<= 100 main_~k~0)) (or (<= (div (+ (- 100) main_~k~0) (- 15)) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 15)) 1)))} is VALID [2022-04-28 03:27:53,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {37939#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {38039#(<= (div (+ (- 100) main_~k~0) (- 15)) 10)} is VALID [2022-04-28 03:27:53,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {37939#true} call #t~ret6 := main(); {37939#true} is VALID [2022-04-28 03:27:53,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37939#true} {37939#true} #71#return; {37939#true} is VALID [2022-04-28 03:27:53,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {37939#true} assume true; {37939#true} is VALID [2022-04-28 03:27:53,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {37939#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); {37939#true} is VALID [2022-04-28 03:27:53,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {37939#true} call ULTIMATE.init(); {37939#true} is VALID [2022-04-28 03:27:53,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:27:53,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743442792] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:27:53,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:27:53,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 23 [2022-04-28 03:27:54,898 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:27:54,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [105487978] [2022-04-28 03:27:54,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [105487978] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:27:54,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:27:54,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-04-28 03:27:54,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957468728] [2022-04-28 03:27:54,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:27:54,899 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 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 53 [2022-04-28 03:27:54,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:27:54,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:27:54,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:27:54,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-28 03:27:54,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:27:54,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-28 03:27:54,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=592, Invalid=3068, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 03:27:54,936 INFO L87 Difference]: Start difference. First operand 340 states and 434 transitions. Second operand has 47 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:00,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:28:00,903 INFO L93 Difference]: Finished difference Result 356 states and 452 transitions. [2022-04-28 03:28:00,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-28 03:28:00,903 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 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 53 [2022-04-28 03:28:00,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:28:00,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:00,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 79 transitions. [2022-04-28 03:28:00,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:00,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 79 transitions. [2022-04-28 03:28:00,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 79 transitions. [2022-04-28 03:28:00,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:28:00,968 INFO L225 Difference]: With dead ends: 356 [2022-04-28 03:28:00,968 INFO L226 Difference]: Without dead ends: 347 [2022-04-28 03:28:00,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2574 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1193, Invalid=9109, Unknown=0, NotChecked=0, Total=10302 [2022-04-28 03:28:00,971 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 29 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 2442 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 2474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:28:00,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 225 Invalid, 2474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2442 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-28 03:28:00,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-04-28 03:28:02,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 342. [2022-04-28 03:28:02,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:28:02,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 347 states. Second operand has 342 states, 337 states have (on average 1.281899109792285) internal successors, (432), 337 states have internal predecessors, (432), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:02,530 INFO L74 IsIncluded]: Start isIncluded. First operand 347 states. Second operand has 342 states, 337 states have (on average 1.281899109792285) internal successors, (432), 337 states have internal predecessors, (432), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:02,530 INFO L87 Difference]: Start difference. First operand 347 states. Second operand has 342 states, 337 states have (on average 1.281899109792285) internal successors, (432), 337 states have internal predecessors, (432), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:02,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:28:02,546 INFO L93 Difference]: Finished difference Result 347 states and 441 transitions. [2022-04-28 03:28:02,546 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 441 transitions. [2022-04-28 03:28:02,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:28:02,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:28:02,546 INFO L74 IsIncluded]: Start isIncluded. First operand has 342 states, 337 states have (on average 1.281899109792285) internal successors, (432), 337 states have internal predecessors, (432), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 347 states. [2022-04-28 03:28:02,547 INFO L87 Difference]: Start difference. First operand has 342 states, 337 states have (on average 1.281899109792285) internal successors, (432), 337 states have internal predecessors, (432), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 347 states. [2022-04-28 03:28:02,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:28:02,551 INFO L93 Difference]: Finished difference Result 347 states and 441 transitions. [2022-04-28 03:28:02,551 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 441 transitions. [2022-04-28 03:28:02,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:28:02,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:28:02,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:28:02,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:28:02,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 337 states have (on average 1.281899109792285) internal successors, (432), 337 states have internal predecessors, (432), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:02,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 436 transitions. [2022-04-28 03:28:02,556 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 436 transitions. Word has length 53 [2022-04-28 03:28:02,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:28:02,556 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 436 transitions. [2022-04-28 03:28:02,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:02,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 342 states and 436 transitions. [2022-04-28 03:28:03,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 436 edges. 436 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:28:03,913 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 436 transitions. [2022-04-28 03:28:03,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-28 03:28:03,913 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:28:03,913 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:28:03,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 03:28:04,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-04-28 03:28:04,114 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:28:04,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:28:04,114 INFO L85 PathProgramCache]: Analyzing trace with hash -145285658, now seen corresponding path program 35 times [2022-04-28 03:28:04,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:28:04,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [170033725] [2022-04-28 03:28:04,328 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:28:08,468 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:28:08,566 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:28:08,906 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:28:09,287 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:28:09,288 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:28:09,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1432265793, now seen corresponding path program 1 times [2022-04-28 03:28:09,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:28:09,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244808016] [2022-04-28 03:28:09,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:28:09,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:28:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:28:09,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:28:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:28:09,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {40283#(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); {40270#true} is VALID [2022-04-28 03:28:09,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {40270#true} assume true; {40270#true} is VALID [2022-04-28 03:28:09,380 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40270#true} {40270#true} #71#return; {40270#true} is VALID [2022-04-28 03:28:09,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {40270#true} call ULTIMATE.init(); {40283#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:28:09,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {40283#(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); {40270#true} is VALID [2022-04-28 03:28:09,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {40270#true} assume true; {40270#true} is VALID [2022-04-28 03:28:09,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40270#true} {40270#true} #71#return; {40270#true} is VALID [2022-04-28 03:28:09,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {40270#true} call #t~ret6 := main(); {40270#true} is VALID [2022-04-28 03:28:09,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {40270#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {40275#(= main_~k~0 0)} is VALID [2022-04-28 03:28:09,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {40275#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {40276#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:28:09,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {40276#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {40277#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:28:09,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {40277#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} [177] L31-3-->L31-4_primed: Formula: (let ((.cse1 (<= v_main_~m~0_355 1)) (.cse2 (< 0 v_main_~m~0_355)) (.cse3 (= v_main_~i~0_539 v_main_~i~0_538)) (.cse4 (= v_main_~j~0_1606 v_main_~j~0_1587)) (.cse5 (= |v_main_#t~post4_915| |v_main_#t~post4_898|)) (.cse6 (= |v_main_#t~post3_401| |v_main_#t~post3_399|)) (.cse7 (= v_main_~k~0_1434 v_main_~k~0_1433)) (.cse8 (= |v_main_#t~post5_915| |v_main_#t~post5_898|))) (or (let ((.cse0 (+ v_main_~k~0_1433 v_main_~i~0_539))) (and (< .cse0 (+ v_main_~k~0_1434 1 v_main_~n~0_181)) .cse1 (= (+ v_main_~k~0_1434 v_main_~i~0_538) .cse0) (= v_main_~j~0_1587 1) (< v_main_~k~0_1434 v_main_~k~0_1433) .cse2)) (and .cse3 .cse4 .cse5 (or (not (< v_main_~i~0_539 v_main_~n~0_181)) (not .cse1) (not .cse2)) .cse6 .cse7 .cse8) (and .cse3 .cse4 .cse5 .cse6 .cse7 (= v_main_~m~0_355 v_main_~m~0_355) (= v_main_~n~0_181 v_main_~n~0_181) .cse8))) InVars {main_~m~0=v_main_~m~0_355, main_~k~0=v_main_~k~0_1434, main_~j~0=v_main_~j~0_1606, main_~i~0=v_main_~i~0_539, main_#t~post4=|v_main_#t~post4_915|, main_#t~post5=|v_main_#t~post5_915|, main_~n~0=v_main_~n~0_181, main_#t~post3=|v_main_#t~post3_401|} OutVars{main_~m~0=v_main_~m~0_355, main_~k~0=v_main_~k~0_1433, main_~j~0=v_main_~j~0_1587, main_~i~0=v_main_~i~0_538, main_#t~post4=|v_main_#t~post4_898|, main_#t~post5=|v_main_#t~post5_898|, main_#t~post3=|v_main_#t~post3_399|, main_~n~0=v_main_~n~0_181} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {40278#(and (<= (+ 160 (* main_~i~0 16)) (+ main_~k~0 (* main_~n~0 16))) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:28:09,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {40278#(and (<= (+ 160 (* main_~i~0 16)) (+ main_~k~0 (* main_~n~0 16))) (<= (+ main_~i~0 10) main_~n~0))} [178] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40278#(and (<= (+ 160 (* main_~i~0 16)) (+ main_~k~0 (* main_~n~0 16))) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:28:09,384 INFO L290 TraceCheckUtils]: 10: Hoare triple {40278#(and (<= (+ 160 (* main_~i~0 16)) (+ main_~k~0 (* main_~n~0 16))) (<= (+ main_~i~0 10) main_~n~0))} [179] L31-3-->L31-4_primed: Formula: (let ((.cse5 (<= v_main_~m~0_356 16)) (.cse4 (< 15 v_main_~m~0_356)) (.cse0 (= |v_main_#t~post3_404| |v_main_#t~post3_400|)) (.cse1 (= v_main_~i~0_541 v_main_~i~0_540)) (.cse2 (= v_main_~j~0_1609 v_main_~j~0_1589)) (.cse3 (= |v_main_#t~post4_918| |v_main_#t~post4_899|)) (.cse6 (= |v_main_#t~post5_918| |v_main_#t~post5_899|)) (.cse7 (= v_main_~k~0_1451 v_main_~k~0_1435))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~i~0_541 v_main_~n~0_182)) (not .cse5)) .cse6 .cse7) (and .cse5 (< v_main_~i~0_541 v_main_~i~0_540) .cse4 (= (+ (* 16 v_main_~i~0_540) v_main_~k~0_1451) (+ (* 16 v_main_~i~0_541) v_main_~k~0_1435)) (= 16 v_main_~j~0_1589) (< v_main_~i~0_540 (+ 1 v_main_~n~0_182))) (and (= v_main_~n~0_182 v_main_~n~0_182) .cse0 .cse1 .cse2 .cse3 (= v_main_~m~0_356 v_main_~m~0_356) .cse6 .cse7))) InVars {main_~m~0=v_main_~m~0_356, main_~k~0=v_main_~k~0_1451, main_~j~0=v_main_~j~0_1609, main_~i~0=v_main_~i~0_541, main_#t~post4=|v_main_#t~post4_918|, main_#t~post5=|v_main_#t~post5_918|, main_~n~0=v_main_~n~0_182, main_#t~post3=|v_main_#t~post3_404|} OutVars{main_~m~0=v_main_~m~0_356, main_~k~0=v_main_~k~0_1435, main_~j~0=v_main_~j~0_1589, main_~i~0=v_main_~i~0_540, main_#t~post4=|v_main_#t~post4_899|, main_#t~post5=|v_main_#t~post5_899|, main_#t~post3=|v_main_#t~post3_400|, main_~n~0=v_main_~n~0_182} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {40279#(or (<= (+ 160 (* main_~i~0 16)) (+ main_~k~0 (* main_~n~0 16))) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:28:09,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {40279#(or (<= (+ 160 (* main_~i~0 16)) (+ main_~k~0 (* main_~n~0 16))) (<= (+ main_~i~0 10) main_~n~0))} [176] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {40280#(<= 160 main_~k~0)} is VALID [2022-04-28 03:28:09,385 INFO L272 TraceCheckUtils]: 12: Hoare triple {40280#(<= 160 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {40281#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:28:09,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {40281#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {40282#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:28:09,385 INFO L290 TraceCheckUtils]: 14: Hoare triple {40282#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {40271#false} is VALID [2022-04-28 03:28:09,385 INFO L290 TraceCheckUtils]: 15: Hoare triple {40271#false} assume !false; {40271#false} is VALID [2022-04-28 03:28:09,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:28:09,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:28:09,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244808016] [2022-04-28 03:28:09,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244808016] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:28:09,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755342291] [2022-04-28 03:28:09,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:28:09,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:28:09,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:28:09,387 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:28:09,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 03:28:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:28:09,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:28:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:28:09,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:28:09,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {40270#true} call ULTIMATE.init(); {40270#true} is VALID [2022-04-28 03:28:09,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {40270#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); {40270#true} is VALID [2022-04-28 03:28:09,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {40270#true} assume true; {40270#true} is VALID [2022-04-28 03:28:09,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40270#true} {40270#true} #71#return; {40270#true} is VALID [2022-04-28 03:28:09,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {40270#true} call #t~ret6 := main(); {40270#true} is VALID [2022-04-28 03:28:09,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {40270#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {40302#(<= 0 main_~k~0)} is VALID [2022-04-28 03:28:09,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {40302#(<= 0 main_~k~0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {40306#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} is VALID [2022-04-28 03:28:09,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {40306#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {40310#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:28:09,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {40310#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [177] L31-3-->L31-4_primed: Formula: (let ((.cse1 (<= v_main_~m~0_355 1)) (.cse2 (< 0 v_main_~m~0_355)) (.cse3 (= v_main_~i~0_539 v_main_~i~0_538)) (.cse4 (= v_main_~j~0_1606 v_main_~j~0_1587)) (.cse5 (= |v_main_#t~post4_915| |v_main_#t~post4_898|)) (.cse6 (= |v_main_#t~post3_401| |v_main_#t~post3_399|)) (.cse7 (= v_main_~k~0_1434 v_main_~k~0_1433)) (.cse8 (= |v_main_#t~post5_915| |v_main_#t~post5_898|))) (or (let ((.cse0 (+ v_main_~k~0_1433 v_main_~i~0_539))) (and (< .cse0 (+ v_main_~k~0_1434 1 v_main_~n~0_181)) .cse1 (= (+ v_main_~k~0_1434 v_main_~i~0_538) .cse0) (= v_main_~j~0_1587 1) (< v_main_~k~0_1434 v_main_~k~0_1433) .cse2)) (and .cse3 .cse4 .cse5 (or (not (< v_main_~i~0_539 v_main_~n~0_181)) (not .cse1) (not .cse2)) .cse6 .cse7 .cse8) (and .cse3 .cse4 .cse5 .cse6 .cse7 (= v_main_~m~0_355 v_main_~m~0_355) (= v_main_~n~0_181 v_main_~n~0_181) .cse8))) InVars {main_~m~0=v_main_~m~0_355, main_~k~0=v_main_~k~0_1434, main_~j~0=v_main_~j~0_1606, main_~i~0=v_main_~i~0_539, main_#t~post4=|v_main_#t~post4_915|, main_#t~post5=|v_main_#t~post5_915|, main_~n~0=v_main_~n~0_181, main_#t~post3=|v_main_#t~post3_401|} OutVars{main_~m~0=v_main_~m~0_355, main_~k~0=v_main_~k~0_1433, main_~j~0=v_main_~j~0_1587, main_~i~0=v_main_~i~0_538, main_#t~post4=|v_main_#t~post4_898|, main_#t~post5=|v_main_#t~post5_898|, main_#t~post3=|v_main_#t~post3_399|, main_~n~0=v_main_~n~0_181} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {40310#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:28:09,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {40310#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [178] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40310#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:28:09,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {40310#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [179] L31-3-->L31-4_primed: Formula: (let ((.cse5 (<= v_main_~m~0_356 16)) (.cse4 (< 15 v_main_~m~0_356)) (.cse0 (= |v_main_#t~post3_404| |v_main_#t~post3_400|)) (.cse1 (= v_main_~i~0_541 v_main_~i~0_540)) (.cse2 (= v_main_~j~0_1609 v_main_~j~0_1589)) (.cse3 (= |v_main_#t~post4_918| |v_main_#t~post4_899|)) (.cse6 (= |v_main_#t~post5_918| |v_main_#t~post5_899|)) (.cse7 (= v_main_~k~0_1451 v_main_~k~0_1435))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~i~0_541 v_main_~n~0_182)) (not .cse5)) .cse6 .cse7) (and .cse5 (< v_main_~i~0_541 v_main_~i~0_540) .cse4 (= (+ (* 16 v_main_~i~0_540) v_main_~k~0_1451) (+ (* 16 v_main_~i~0_541) v_main_~k~0_1435)) (= 16 v_main_~j~0_1589) (< v_main_~i~0_540 (+ 1 v_main_~n~0_182))) (and (= v_main_~n~0_182 v_main_~n~0_182) .cse0 .cse1 .cse2 .cse3 (= v_main_~m~0_356 v_main_~m~0_356) .cse6 .cse7))) InVars {main_~m~0=v_main_~m~0_356, main_~k~0=v_main_~k~0_1451, main_~j~0=v_main_~j~0_1609, main_~i~0=v_main_~i~0_541, main_#t~post4=|v_main_#t~post4_918|, main_#t~post5=|v_main_#t~post5_918|, main_~n~0=v_main_~n~0_182, main_#t~post3=|v_main_#t~post3_404|} OutVars{main_~m~0=v_main_~m~0_356, main_~k~0=v_main_~k~0_1435, main_~j~0=v_main_~j~0_1589, main_~i~0=v_main_~i~0_540, main_#t~post4=|v_main_#t~post4_899|, main_#t~post5=|v_main_#t~post5_899|, main_#t~post3=|v_main_#t~post3_400|, main_~n~0=v_main_~n~0_182} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {40320#(and (<= 10 main_~n~0) (or (and (<= (+ (div main_~k~0 (- 16)) main_~i~0) 0) (< (div main_~k~0 (- 16)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:28:09,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {40320#(and (<= 10 main_~n~0) (or (and (<= (+ (div main_~k~0 (- 16)) main_~i~0) 0) (< (div main_~k~0 (- 16)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [176] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {40280#(<= 160 main_~k~0)} is VALID [2022-04-28 03:28:09,895 INFO L272 TraceCheckUtils]: 12: Hoare triple {40280#(<= 160 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {40327#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:28:09,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {40327#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {40331#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:28:09,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {40331#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {40271#false} is VALID [2022-04-28 03:28:09,896 INFO L290 TraceCheckUtils]: 15: Hoare triple {40271#false} assume !false; {40271#false} is VALID [2022-04-28 03:28:09,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:28:09,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:28:10,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {40271#false} assume !false; {40271#false} is VALID [2022-04-28 03:28:10,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {40331#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {40271#false} is VALID [2022-04-28 03:28:10,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {40327#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {40331#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:28:10,606 INFO L272 TraceCheckUtils]: 12: Hoare triple {40347#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {40327#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:28:10,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {40351#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} [176] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {40347#(<= 100 main_~k~0)} is VALID [2022-04-28 03:28:10,607 INFO L290 TraceCheckUtils]: 10: Hoare triple {40355#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 16))) main_~n~0) (<= main_~n~0 main_~i~0) (not (< 15 main_~m~0)) (not (<= main_~m~0 16))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [179] L31-3-->L31-4_primed: Formula: (let ((.cse5 (<= v_main_~m~0_356 16)) (.cse4 (< 15 v_main_~m~0_356)) (.cse0 (= |v_main_#t~post3_404| |v_main_#t~post3_400|)) (.cse1 (= v_main_~i~0_541 v_main_~i~0_540)) (.cse2 (= v_main_~j~0_1609 v_main_~j~0_1589)) (.cse3 (= |v_main_#t~post4_918| |v_main_#t~post4_899|)) (.cse6 (= |v_main_#t~post5_918| |v_main_#t~post5_899|)) (.cse7 (= v_main_~k~0_1451 v_main_~k~0_1435))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~i~0_541 v_main_~n~0_182)) (not .cse5)) .cse6 .cse7) (and .cse5 (< v_main_~i~0_541 v_main_~i~0_540) .cse4 (= (+ (* 16 v_main_~i~0_540) v_main_~k~0_1451) (+ (* 16 v_main_~i~0_541) v_main_~k~0_1435)) (= 16 v_main_~j~0_1589) (< v_main_~i~0_540 (+ 1 v_main_~n~0_182))) (and (= v_main_~n~0_182 v_main_~n~0_182) .cse0 .cse1 .cse2 .cse3 (= v_main_~m~0_356 v_main_~m~0_356) .cse6 .cse7))) InVars {main_~m~0=v_main_~m~0_356, main_~k~0=v_main_~k~0_1451, main_~j~0=v_main_~j~0_1609, main_~i~0=v_main_~i~0_541, main_#t~post4=|v_main_#t~post4_918|, main_#t~post5=|v_main_#t~post5_918|, main_~n~0=v_main_~n~0_182, main_#t~post3=|v_main_#t~post3_404|} OutVars{main_~m~0=v_main_~m~0_356, main_~k~0=v_main_~k~0_1435, main_~j~0=v_main_~j~0_1589, main_~i~0=v_main_~i~0_540, main_#t~post4=|v_main_#t~post4_899|, main_#t~post5=|v_main_#t~post5_899|, main_#t~post3=|v_main_#t~post3_400|, main_~n~0=v_main_~n~0_182} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {40351#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} is VALID [2022-04-28 03:28:10,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {40355#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 16))) main_~n~0) (<= main_~n~0 main_~i~0) (not (< 15 main_~m~0)) (not (<= main_~m~0 16))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [178] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40355#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 16))) main_~n~0) (<= main_~n~0 main_~i~0) (not (< 15 main_~m~0)) (not (<= main_~m~0 16))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:28:10,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {40362#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 16))) main_~n~0) (<= main_~n~0 main_~i~0) (not (< 15 main_~m~0)) (not (<= main_~m~0 16))) (or (not (< 0 main_~m~0)) (<= (+ main_~i~0 100) (+ main_~n~0 main_~k~0)) (<= 99 main_~k~0) (not (<= main_~m~0 1))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [177] L31-3-->L31-4_primed: Formula: (let ((.cse1 (<= v_main_~m~0_355 1)) (.cse2 (< 0 v_main_~m~0_355)) (.cse3 (= v_main_~i~0_539 v_main_~i~0_538)) (.cse4 (= v_main_~j~0_1606 v_main_~j~0_1587)) (.cse5 (= |v_main_#t~post4_915| |v_main_#t~post4_898|)) (.cse6 (= |v_main_#t~post3_401| |v_main_#t~post3_399|)) (.cse7 (= v_main_~k~0_1434 v_main_~k~0_1433)) (.cse8 (= |v_main_#t~post5_915| |v_main_#t~post5_898|))) (or (let ((.cse0 (+ v_main_~k~0_1433 v_main_~i~0_539))) (and (< .cse0 (+ v_main_~k~0_1434 1 v_main_~n~0_181)) .cse1 (= (+ v_main_~k~0_1434 v_main_~i~0_538) .cse0) (= v_main_~j~0_1587 1) (< v_main_~k~0_1434 v_main_~k~0_1433) .cse2)) (and .cse3 .cse4 .cse5 (or (not (< v_main_~i~0_539 v_main_~n~0_181)) (not .cse1) (not .cse2)) .cse6 .cse7 .cse8) (and .cse3 .cse4 .cse5 .cse6 .cse7 (= v_main_~m~0_355 v_main_~m~0_355) (= v_main_~n~0_181 v_main_~n~0_181) .cse8))) InVars {main_~m~0=v_main_~m~0_355, main_~k~0=v_main_~k~0_1434, main_~j~0=v_main_~j~0_1606, main_~i~0=v_main_~i~0_539, main_#t~post4=|v_main_#t~post4_915|, main_#t~post5=|v_main_#t~post5_915|, main_~n~0=v_main_~n~0_181, main_#t~post3=|v_main_#t~post3_401|} OutVars{main_~m~0=v_main_~m~0_355, main_~k~0=v_main_~k~0_1433, main_~j~0=v_main_~j~0_1587, main_~i~0=v_main_~i~0_538, main_#t~post4=|v_main_#t~post4_898|, main_#t~post5=|v_main_#t~post5_898|, main_#t~post3=|v_main_#t~post3_399|, main_~n~0=v_main_~n~0_181} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {40355#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 16))) main_~n~0) (<= main_~n~0 main_~i~0) (not (< 15 main_~m~0)) (not (<= main_~m~0 16))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:28:10,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {40366#(and (or (<= (div (+ (- 100) main_~k~0) (- 16)) 1) (<= (div (+ (- 100) main_~k~0) (- 16)) main_~n~0)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {40362#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 16))) main_~n~0) (<= main_~n~0 main_~i~0) (not (< 15 main_~m~0)) (not (<= main_~m~0 16))) (or (not (< 0 main_~m~0)) (<= (+ main_~i~0 100) (+ main_~n~0 main_~k~0)) (<= 99 main_~k~0) (not (<= main_~m~0 1))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:28:10,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {40370#(<= (div (+ (- 100) main_~k~0) (- 16)) 10)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {40366#(and (or (<= (div (+ (- 100) main_~k~0) (- 16)) 1) (<= (div (+ (- 100) main_~k~0) (- 16)) main_~n~0)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} is VALID [2022-04-28 03:28:10,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {40270#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {40370#(<= (div (+ (- 100) main_~k~0) (- 16)) 10)} is VALID [2022-04-28 03:28:10,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {40270#true} call #t~ret6 := main(); {40270#true} is VALID [2022-04-28 03:28:10,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40270#true} {40270#true} #71#return; {40270#true} is VALID [2022-04-28 03:28:10,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {40270#true} assume true; {40270#true} is VALID [2022-04-28 03:28:10,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {40270#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); {40270#true} is VALID [2022-04-28 03:28:10,611 INFO L272 TraceCheckUtils]: 0: Hoare triple {40270#true} call ULTIMATE.init(); {40270#true} is VALID [2022-04-28 03:28:10,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:28:10,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755342291] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:28:10,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:28:10,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 23 [2022-04-28 03:28:11,996 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:28:11,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [170033725] [2022-04-28 03:28:11,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [170033725] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:28:11,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:28:11,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-04-28 03:28:11,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158594095] [2022-04-28 03:28:11,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:28:11,996 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 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 53 [2022-04-28 03:28:11,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:28:11,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:12,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:28:12,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-28 03:28:12,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:28:12,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-28 03:28:12,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=596, Invalid=3064, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 03:28:12,031 INFO L87 Difference]: Start difference. First operand 342 states and 436 transitions. Second operand has 47 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:18,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:28:18,091 INFO L93 Difference]: Finished difference Result 358 states and 454 transitions. [2022-04-28 03:28:18,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-28 03:28:18,092 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 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 53 [2022-04-28 03:28:18,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:28:18,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:18,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 81 transitions. [2022-04-28 03:28:18,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:18,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 81 transitions. [2022-04-28 03:28:18,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 81 transitions. [2022-04-28 03:28:18,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:28:18,159 INFO L225 Difference]: With dead ends: 358 [2022-04-28 03:28:18,159 INFO L226 Difference]: Without dead ends: 349 [2022-04-28 03:28:18,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2470 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1201, Invalid=9101, Unknown=0, NotChecked=0, Total=10302 [2022-04-28 03:28:18,160 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 30 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 2584 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 2617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:28:18,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 230 Invalid, 2617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2584 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-28 03:28:18,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-04-28 03:28:19,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 344. [2022-04-28 03:28:19,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:28:19,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 349 states. Second operand has 344 states, 339 states have (on average 1.28023598820059) internal successors, (434), 339 states have internal predecessors, (434), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:19,670 INFO L74 IsIncluded]: Start isIncluded. First operand 349 states. Second operand has 344 states, 339 states have (on average 1.28023598820059) internal successors, (434), 339 states have internal predecessors, (434), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:19,671 INFO L87 Difference]: Start difference. First operand 349 states. Second operand has 344 states, 339 states have (on average 1.28023598820059) internal successors, (434), 339 states have internal predecessors, (434), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:19,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:28:19,675 INFO L93 Difference]: Finished difference Result 349 states and 443 transitions. [2022-04-28 03:28:19,675 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 443 transitions. [2022-04-28 03:28:19,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:28:19,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:28:19,675 INFO L74 IsIncluded]: Start isIncluded. First operand has 344 states, 339 states have (on average 1.28023598820059) internal successors, (434), 339 states have internal predecessors, (434), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 349 states. [2022-04-28 03:28:19,675 INFO L87 Difference]: Start difference. First operand has 344 states, 339 states have (on average 1.28023598820059) internal successors, (434), 339 states have internal predecessors, (434), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 349 states. [2022-04-28 03:28:19,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:28:19,679 INFO L93 Difference]: Finished difference Result 349 states and 443 transitions. [2022-04-28 03:28:19,679 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 443 transitions. [2022-04-28 03:28:19,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:28:19,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:28:19,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:28:19,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:28:19,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 339 states have (on average 1.28023598820059) internal successors, (434), 339 states have internal predecessors, (434), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:19,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 438 transitions. [2022-04-28 03:28:19,685 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 438 transitions. Word has length 53 [2022-04-28 03:28:19,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:28:19,685 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 438 transitions. [2022-04-28 03:28:19,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:19,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 344 states and 438 transitions. [2022-04-28 03:28:21,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 438 edges. 438 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:28:21,068 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 438 transitions. [2022-04-28 03:28:21,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-28 03:28:21,068 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:28:21,069 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:28:21,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 03:28:21,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-04-28 03:28:21,271 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:28:21,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:28:21,271 INFO L85 PathProgramCache]: Analyzing trace with hash -676389462, now seen corresponding path program 36 times [2022-04-28 03:28:21,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:28:21,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [629600264] [2022-04-28 03:28:21,446 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:28:24,148 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:28:24,321 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:28:24,322 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:28:24,325 INFO L85 PathProgramCache]: Analyzing trace with hash -813169343, now seen corresponding path program 1 times [2022-04-28 03:28:24,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:28:24,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434891923] [2022-04-28 03:28:24,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:28:24,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:28:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:28:24,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:28:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:28:24,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {42626#(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); {42613#true} is VALID [2022-04-28 03:28:24,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {42613#true} assume true; {42613#true} is VALID [2022-04-28 03:28:24,428 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42613#true} {42613#true} #71#return; {42613#true} is VALID [2022-04-28 03:28:24,428 INFO L272 TraceCheckUtils]: 0: Hoare triple {42613#true} call ULTIMATE.init(); {42626#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:28:24,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {42626#(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); {42613#true} is VALID [2022-04-28 03:28:24,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {42613#true} assume true; {42613#true} is VALID [2022-04-28 03:28:24,428 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42613#true} {42613#true} #71#return; {42613#true} is VALID [2022-04-28 03:28:24,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {42613#true} call #t~ret6 := main(); {42613#true} is VALID [2022-04-28 03:28:24,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {42613#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {42618#(= main_~k~0 0)} is VALID [2022-04-28 03:28:24,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {42618#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {42619#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:28:24,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {42619#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {42620#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:28:24,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {42620#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} [181] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_951| |v_main_#t~post5_934|)) (.cse3 (= v_main_~j~0_1667 v_main_~j~0_1648)) (.cse4 (= |v_main_#t~post4_951| |v_main_#t~post4_934|)) (.cse5 (= v_main_~i~0_560 v_main_~i~0_559)) (.cse6 (= |v_main_#t~post3_416| |v_main_#t~post3_414|)) (.cse7 (= v_main_~k~0_1508 v_main_~k~0_1491)) (.cse1 (< 16 v_main_~m~0_366)) (.cse2 (<= v_main_~m~0_366 17))) (or (and .cse0 (or (not .cse1) (not (< v_main_~i~0_560 v_main_~n~0_187)) (not .cse2)) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 (= v_main_~m~0_366 v_main_~m~0_366) .cse3 .cse4 (= v_main_~n~0_187 v_main_~n~0_187) .cse5 .cse6 .cse7) (and (= (+ (* 17 v_main_~i~0_560) v_main_~k~0_1491) (+ (* 17 v_main_~i~0_559) v_main_~k~0_1508)) (< v_main_~i~0_559 (+ 1 v_main_~n~0_187)) (< v_main_~i~0_560 v_main_~i~0_559) .cse1 (= v_main_~j~0_1648 17) .cse2))) InVars {main_~m~0=v_main_~m~0_366, main_~k~0=v_main_~k~0_1508, main_~j~0=v_main_~j~0_1667, main_~i~0=v_main_~i~0_560, main_#t~post4=|v_main_#t~post4_951|, main_#t~post5=|v_main_#t~post5_951|, main_~n~0=v_main_~n~0_187, main_#t~post3=|v_main_#t~post3_416|} OutVars{main_~m~0=v_main_~m~0_366, main_~k~0=v_main_~k~0_1491, main_~j~0=v_main_~j~0_1648, main_~i~0=v_main_~i~0_559, main_#t~post4=|v_main_#t~post4_934|, main_#t~post5=|v_main_#t~post5_934|, main_#t~post3=|v_main_#t~post3_414|, main_~n~0=v_main_~n~0_187} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {42621#(and (<= 10 main_~m~0) (or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ 170 (* main_~i~0 17)) (+ main_~k~0 (* main_~n~0 17)))))} is VALID [2022-04-28 03:28:24,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {42621#(and (<= 10 main_~m~0) (or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ 170 (* main_~i~0 17)) (+ main_~k~0 (* main_~n~0 17)))))} [182] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42621#(and (<= 10 main_~m~0) (or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ 170 (* main_~i~0 17)) (+ main_~k~0 (* main_~n~0 17)))))} is VALID [2022-04-28 03:28:24,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {42621#(and (<= 10 main_~m~0) (or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ 170 (* main_~i~0 17)) (+ main_~k~0 (* main_~n~0 17)))))} [183] L31-3-->L31-4_primed: Formula: (let ((.cse0 (<= v_main_~m~0_367 0)) (.cse1 (= v_main_~i~0_562 v_main_~i~0_561))) (or (and (< v_main_~i~0_561 (+ 1 v_main_~n~0_188)) (= v_main_~j~0_1666 0) (< v_main_~i~0_562 v_main_~i~0_561) .cse0) (and .cse1 (or (not (< v_main_~i~0_562 v_main_~n~0_188)) (not .cse0)) (= v_main_~j~0_1666 v_main_~j~0_1670) (= |v_main_#t~post3_415| |v_main_#t~post3_419|)) (and .cse1 (= v_main_~j~0_1670 v_main_~j~0_1666) (= v_main_~n~0_188 v_main_~n~0_188) (= v_main_~m~0_367 v_main_~m~0_367) (= |v_main_#t~post3_419| |v_main_#t~post3_415|)))) InVars {main_~i~0=v_main_~i~0_562, main_~n~0=v_main_~n~0_188, main_#t~post3=|v_main_#t~post3_419|, main_~m~0=v_main_~m~0_367, main_~j~0=v_main_~j~0_1670} OutVars{main_~i~0=v_main_~i~0_561, main_#t~post3=|v_main_#t~post3_415|, main_~n~0=v_main_~n~0_188, main_~m~0=v_main_~m~0_367, main_~j~0=v_main_~j~0_1666} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post3] {42622#(or (<= (+ 170 (* main_~i~0 17)) (+ main_~k~0 (* main_~n~0 17))) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:28:24,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {42622#(or (<= (+ 170 (* main_~i~0 17)) (+ main_~k~0 (* main_~n~0 17))) (<= (+ main_~i~0 10) main_~n~0))} [180] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {42623#(<= 170 main_~k~0)} is VALID [2022-04-28 03:28:24,433 INFO L272 TraceCheckUtils]: 12: Hoare triple {42623#(<= 170 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {42624#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:28:24,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {42624#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {42625#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:28:24,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {42625#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {42614#false} is VALID [2022-04-28 03:28:24,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {42614#false} assume !false; {42614#false} is VALID [2022-04-28 03:28:24,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:28:24,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:28:24,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434891923] [2022-04-28 03:28:24,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434891923] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:28:24,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345794780] [2022-04-28 03:28:24,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:28:24,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:28:24,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:28:24,435 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:28:24,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 03:28:24,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:28:24,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:28:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:28:24,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:28:25,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {42613#true} call ULTIMATE.init(); {42613#true} is VALID [2022-04-28 03:28:25,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {42613#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); {42613#true} is VALID [2022-04-28 03:28:25,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {42613#true} assume true; {42613#true} is VALID [2022-04-28 03:28:25,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42613#true} {42613#true} #71#return; {42613#true} is VALID [2022-04-28 03:28:25,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {42613#true} call #t~ret6 := main(); {42613#true} is VALID [2022-04-28 03:28:25,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {42613#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {42645#(<= 0 main_~k~0)} is VALID [2022-04-28 03:28:25,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {42645#(<= 0 main_~k~0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {42649#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} is VALID [2022-04-28 03:28:25,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {42649#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {42653#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:28:25,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {42653#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [181] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_951| |v_main_#t~post5_934|)) (.cse3 (= v_main_~j~0_1667 v_main_~j~0_1648)) (.cse4 (= |v_main_#t~post4_951| |v_main_#t~post4_934|)) (.cse5 (= v_main_~i~0_560 v_main_~i~0_559)) (.cse6 (= |v_main_#t~post3_416| |v_main_#t~post3_414|)) (.cse7 (= v_main_~k~0_1508 v_main_~k~0_1491)) (.cse1 (< 16 v_main_~m~0_366)) (.cse2 (<= v_main_~m~0_366 17))) (or (and .cse0 (or (not .cse1) (not (< v_main_~i~0_560 v_main_~n~0_187)) (not .cse2)) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 (= v_main_~m~0_366 v_main_~m~0_366) .cse3 .cse4 (= v_main_~n~0_187 v_main_~n~0_187) .cse5 .cse6 .cse7) (and (= (+ (* 17 v_main_~i~0_560) v_main_~k~0_1491) (+ (* 17 v_main_~i~0_559) v_main_~k~0_1508)) (< v_main_~i~0_559 (+ 1 v_main_~n~0_187)) (< v_main_~i~0_560 v_main_~i~0_559) .cse1 (= v_main_~j~0_1648 17) .cse2))) InVars {main_~m~0=v_main_~m~0_366, main_~k~0=v_main_~k~0_1508, main_~j~0=v_main_~j~0_1667, main_~i~0=v_main_~i~0_560, main_#t~post4=|v_main_#t~post4_951|, main_#t~post5=|v_main_#t~post5_951|, main_~n~0=v_main_~n~0_187, main_#t~post3=|v_main_#t~post3_416|} OutVars{main_~m~0=v_main_~m~0_366, main_~k~0=v_main_~k~0_1491, main_~j~0=v_main_~j~0_1648, main_~i~0=v_main_~i~0_559, main_#t~post4=|v_main_#t~post4_934|, main_#t~post5=|v_main_#t~post5_934|, main_#t~post3=|v_main_#t~post3_414|, main_~n~0=v_main_~n~0_187} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {42657#(and (or (and (< (div main_~k~0 (- 17)) 0) (= main_~j~0 17) (<= (+ main_~i~0 (div main_~k~0 (- 17))) 0) (<= main_~m~0 17) (< main_~i~0 (+ main_~n~0 1)) (< 16 main_~m~0)) (and (<= 0 main_~k~0) (<= main_~i~0 0))) (<= 10 main_~n~0) (<= 10 main_~m~0))} is VALID [2022-04-28 03:28:25,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {42657#(and (or (and (< (div main_~k~0 (- 17)) 0) (= main_~j~0 17) (<= (+ main_~i~0 (div main_~k~0 (- 17))) 0) (<= main_~m~0 17) (< main_~i~0 (+ main_~n~0 1)) (< 16 main_~m~0)) (and (<= 0 main_~k~0) (<= main_~i~0 0))) (<= 10 main_~n~0) (<= 10 main_~m~0))} [182] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42657#(and (or (and (< (div main_~k~0 (- 17)) 0) (= main_~j~0 17) (<= (+ main_~i~0 (div main_~k~0 (- 17))) 0) (<= main_~m~0 17) (< main_~i~0 (+ main_~n~0 1)) (< 16 main_~m~0)) (and (<= 0 main_~k~0) (<= main_~i~0 0))) (<= 10 main_~n~0) (<= 10 main_~m~0))} is VALID [2022-04-28 03:28:25,007 INFO L290 TraceCheckUtils]: 10: Hoare triple {42657#(and (or (and (< (div main_~k~0 (- 17)) 0) (= main_~j~0 17) (<= (+ main_~i~0 (div main_~k~0 (- 17))) 0) (<= main_~m~0 17) (< main_~i~0 (+ main_~n~0 1)) (< 16 main_~m~0)) (and (<= 0 main_~k~0) (<= main_~i~0 0))) (<= 10 main_~n~0) (<= 10 main_~m~0))} [183] L31-3-->L31-4_primed: Formula: (let ((.cse0 (<= v_main_~m~0_367 0)) (.cse1 (= v_main_~i~0_562 v_main_~i~0_561))) (or (and (< v_main_~i~0_561 (+ 1 v_main_~n~0_188)) (= v_main_~j~0_1666 0) (< v_main_~i~0_562 v_main_~i~0_561) .cse0) (and .cse1 (or (not (< v_main_~i~0_562 v_main_~n~0_188)) (not .cse0)) (= v_main_~j~0_1666 v_main_~j~0_1670) (= |v_main_#t~post3_415| |v_main_#t~post3_419|)) (and .cse1 (= v_main_~j~0_1670 v_main_~j~0_1666) (= v_main_~n~0_188 v_main_~n~0_188) (= v_main_~m~0_367 v_main_~m~0_367) (= |v_main_#t~post3_419| |v_main_#t~post3_415|)))) InVars {main_~i~0=v_main_~i~0_562, main_~n~0=v_main_~n~0_188, main_#t~post3=|v_main_#t~post3_419|, main_~m~0=v_main_~m~0_367, main_~j~0=v_main_~j~0_1670} OutVars{main_~i~0=v_main_~i~0_561, main_#t~post3=|v_main_#t~post3_415|, main_~n~0=v_main_~n~0_188, main_~m~0=v_main_~m~0_367, main_~j~0=v_main_~j~0_1666} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post3] {42664#(and (or (and (< (div main_~k~0 (- 17)) 0) (<= (+ main_~i~0 (div main_~k~0 (- 17))) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))) (<= 10 main_~n~0))} is VALID [2022-04-28 03:28:25,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {42664#(and (or (and (< (div main_~k~0 (- 17)) 0) (<= (+ main_~i~0 (div main_~k~0 (- 17))) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))) (<= 10 main_~n~0))} [180] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {42623#(<= 170 main_~k~0)} is VALID [2022-04-28 03:28:25,009 INFO L272 TraceCheckUtils]: 12: Hoare triple {42623#(<= 170 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {42671#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:28:25,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {42671#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {42675#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:28:25,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {42675#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {42614#false} is VALID [2022-04-28 03:28:25,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {42614#false} assume !false; {42614#false} is VALID [2022-04-28 03:28:25,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:28:25,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:28:25,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {42614#false} assume !false; {42614#false} is VALID [2022-04-28 03:28:25,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {42675#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {42614#false} is VALID [2022-04-28 03:28:25,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {42671#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {42675#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:28:25,609 INFO L272 TraceCheckUtils]: 12: Hoare triple {42691#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {42671#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:28:25,609 INFO L290 TraceCheckUtils]: 11: Hoare triple {42695#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} [180] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {42691#(<= 100 main_~k~0)} is VALID [2022-04-28 03:28:25,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {42699#(or (<= 100 main_~k~0) (and (< 0 main_~m~0) (< main_~i~0 main_~n~0)))} [183] L31-3-->L31-4_primed: Formula: (let ((.cse0 (<= v_main_~m~0_367 0)) (.cse1 (= v_main_~i~0_562 v_main_~i~0_561))) (or (and (< v_main_~i~0_561 (+ 1 v_main_~n~0_188)) (= v_main_~j~0_1666 0) (< v_main_~i~0_562 v_main_~i~0_561) .cse0) (and .cse1 (or (not (< v_main_~i~0_562 v_main_~n~0_188)) (not .cse0)) (= v_main_~j~0_1666 v_main_~j~0_1670) (= |v_main_#t~post3_415| |v_main_#t~post3_419|)) (and .cse1 (= v_main_~j~0_1670 v_main_~j~0_1666) (= v_main_~n~0_188 v_main_~n~0_188) (= v_main_~m~0_367 v_main_~m~0_367) (= |v_main_#t~post3_419| |v_main_#t~post3_415|)))) InVars {main_~i~0=v_main_~i~0_562, main_~n~0=v_main_~n~0_188, main_#t~post3=|v_main_#t~post3_419|, main_~m~0=v_main_~m~0_367, main_~j~0=v_main_~j~0_1670} OutVars{main_~i~0=v_main_~i~0_561, main_#t~post3=|v_main_#t~post3_415|, main_~n~0=v_main_~n~0_188, main_~m~0=v_main_~m~0_367, main_~j~0=v_main_~j~0_1666} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post3] {42695#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} is VALID [2022-04-28 03:28:25,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {42699#(or (<= 100 main_~k~0) (and (< 0 main_~m~0) (< main_~i~0 main_~n~0)))} [182] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42699#(or (<= 100 main_~k~0) (and (< 0 main_~m~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:28:25,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {42706#(and (or (not (< 16 main_~m~0)) (<= (+ (div (+ (- 100) main_~k~0) (- 17)) main_~i~0) main_~n~0) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 17))) (or (<= 100 main_~k~0) (and (< 0 main_~m~0) (< main_~i~0 main_~n~0))))} [181] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_951| |v_main_#t~post5_934|)) (.cse3 (= v_main_~j~0_1667 v_main_~j~0_1648)) (.cse4 (= |v_main_#t~post4_951| |v_main_#t~post4_934|)) (.cse5 (= v_main_~i~0_560 v_main_~i~0_559)) (.cse6 (= |v_main_#t~post3_416| |v_main_#t~post3_414|)) (.cse7 (= v_main_~k~0_1508 v_main_~k~0_1491)) (.cse1 (< 16 v_main_~m~0_366)) (.cse2 (<= v_main_~m~0_366 17))) (or (and .cse0 (or (not .cse1) (not (< v_main_~i~0_560 v_main_~n~0_187)) (not .cse2)) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 (= v_main_~m~0_366 v_main_~m~0_366) .cse3 .cse4 (= v_main_~n~0_187 v_main_~n~0_187) .cse5 .cse6 .cse7) (and (= (+ (* 17 v_main_~i~0_560) v_main_~k~0_1491) (+ (* 17 v_main_~i~0_559) v_main_~k~0_1508)) (< v_main_~i~0_559 (+ 1 v_main_~n~0_187)) (< v_main_~i~0_560 v_main_~i~0_559) .cse1 (= v_main_~j~0_1648 17) .cse2))) InVars {main_~m~0=v_main_~m~0_366, main_~k~0=v_main_~k~0_1508, main_~j~0=v_main_~j~0_1667, main_~i~0=v_main_~i~0_560, main_#t~post4=|v_main_#t~post4_951|, main_#t~post5=|v_main_#t~post5_951|, main_~n~0=v_main_~n~0_187, main_#t~post3=|v_main_#t~post3_416|} OutVars{main_~m~0=v_main_~m~0_366, main_~k~0=v_main_~k~0_1491, main_~j~0=v_main_~j~0_1648, main_~i~0=v_main_~i~0_559, main_#t~post4=|v_main_#t~post4_934|, main_#t~post5=|v_main_#t~post5_934|, main_#t~post3=|v_main_#t~post3_414|, main_~n~0=v_main_~n~0_187} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {42699#(or (<= 100 main_~k~0) (and (< 0 main_~m~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:28:25,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {42710#(and (or (< 0 main_~n~0) (<= 100 main_~k~0)) (or (<= (div (+ (- 100) main_~k~0) (- 17)) 1) (<= (div (+ (- 100) main_~k~0) (- 17)) main_~n~0)))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {42706#(and (or (not (< 16 main_~m~0)) (<= (+ (div (+ (- 100) main_~k~0) (- 17)) main_~i~0) main_~n~0) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 17))) (or (<= 100 main_~k~0) (and (< 0 main_~m~0) (< main_~i~0 main_~n~0))))} is VALID [2022-04-28 03:28:25,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {42714#(<= (div (+ (- 100) main_~k~0) (- 17)) 10)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {42710#(and (or (< 0 main_~n~0) (<= 100 main_~k~0)) (or (<= (div (+ (- 100) main_~k~0) (- 17)) 1) (<= (div (+ (- 100) main_~k~0) (- 17)) main_~n~0)))} is VALID [2022-04-28 03:28:25,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {42613#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {42714#(<= (div (+ (- 100) main_~k~0) (- 17)) 10)} is VALID [2022-04-28 03:28:25,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {42613#true} call #t~ret6 := main(); {42613#true} is VALID [2022-04-28 03:28:25,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42613#true} {42613#true} #71#return; {42613#true} is VALID [2022-04-28 03:28:25,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {42613#true} assume true; {42613#true} is VALID [2022-04-28 03:28:25,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {42613#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); {42613#true} is VALID [2022-04-28 03:28:25,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {42613#true} call ULTIMATE.init(); {42613#true} is VALID [2022-04-28 03:28:25,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:28:25,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345794780] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:28:25,613 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:28:25,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2022-04-28 03:28:28,540 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:28:28,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [629600264] [2022-04-28 03:28:28,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [629600264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:28:28,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:28:28,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-04-28 03:28:28,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493511272] [2022-04-28 03:28:28,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:28:28,541 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 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 53 [2022-04-28 03:28:28,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:28:28,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:28,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:28:28,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-28 03:28:28,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:28:28,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-28 03:28:28,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=3311, Unknown=0, NotChecked=0, Total=3906 [2022-04-28 03:28:28,596 INFO L87 Difference]: Start difference. First operand 344 states and 438 transitions. Second operand has 47 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:37,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:28:37,126 INFO L93 Difference]: Finished difference Result 366 states and 462 transitions. [2022-04-28 03:28:37,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-28 03:28:37,126 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 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 53 [2022-04-28 03:28:37,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:28:37,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:37,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 94 transitions. [2022-04-28 03:28:37,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:37,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 94 transitions. [2022-04-28 03:28:37,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 94 transitions. [2022-04-28 03:28:37,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:28:37,234 INFO L225 Difference]: With dead ends: 366 [2022-04-28 03:28:37,234 INFO L226 Difference]: Without dead ends: 357 [2022-04-28 03:28:37,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2290 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1142, Invalid=9160, Unknown=0, NotChecked=0, Total=10302 [2022-04-28 03:28:37,235 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 28 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 2467 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 2572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:28:37,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 225 Invalid, 2572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2467 Invalid, 0 Unknown, 60 Unchecked, 2.5s Time] [2022-04-28 03:28:37,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-04-28 03:28:38,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 344. [2022-04-28 03:28:38,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:28:38,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 357 states. Second operand has 344 states, 339 states have (on average 1.2507374631268438) internal successors, (424), 339 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:38,779 INFO L74 IsIncluded]: Start isIncluded. First operand 357 states. Second operand has 344 states, 339 states have (on average 1.2507374631268438) internal successors, (424), 339 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:38,779 INFO L87 Difference]: Start difference. First operand 357 states. Second operand has 344 states, 339 states have (on average 1.2507374631268438) internal successors, (424), 339 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:38,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:28:38,783 INFO L93 Difference]: Finished difference Result 357 states and 442 transitions. [2022-04-28 03:28:38,783 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 442 transitions. [2022-04-28 03:28:38,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:28:38,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:28:38,783 INFO L74 IsIncluded]: Start isIncluded. First operand has 344 states, 339 states have (on average 1.2507374631268438) internal successors, (424), 339 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 357 states. [2022-04-28 03:28:38,784 INFO L87 Difference]: Start difference. First operand has 344 states, 339 states have (on average 1.2507374631268438) internal successors, (424), 339 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 357 states. [2022-04-28 03:28:38,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:28:38,788 INFO L93 Difference]: Finished difference Result 357 states and 442 transitions. [2022-04-28 03:28:38,788 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 442 transitions. [2022-04-28 03:28:38,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:28:38,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:28:38,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:28:38,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:28:38,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 339 states have (on average 1.2507374631268438) internal successors, (424), 339 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:38,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 428 transitions. [2022-04-28 03:28:38,793 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 428 transitions. Word has length 53 [2022-04-28 03:28:38,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:28:38,793 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 428 transitions. [2022-04-28 03:28:38,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:38,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 344 states and 428 transitions. [2022-04-28 03:28:40,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 428 edges. 428 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:28:40,131 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 428 transitions. [2022-04-28 03:28:40,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 03:28:40,132 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:28:40,132 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:28:40,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 03:28:40,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-28 03:28:40,332 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:28:40,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:28:40,333 INFO L85 PathProgramCache]: Analyzing trace with hash 712733747, now seen corresponding path program 37 times [2022-04-28 03:28:40,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:28:40,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [591679750] [2022-04-28 03:28:44,447 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:28:44,529 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:28:44,944 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:28:44,946 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:28:44,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1823220318, now seen corresponding path program 1 times [2022-04-28 03:28:44,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:28:44,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957940917] [2022-04-28 03:28:44,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:28:44,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:28:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:28:45,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:28:45,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:28:45,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {44998#(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); {44986#true} is VALID [2022-04-28 03:28:45,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {44986#true} assume true; {44986#true} is VALID [2022-04-28 03:28:45,025 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44986#true} {44986#true} #71#return; {44986#true} is VALID [2022-04-28 03:28:45,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {44986#true} call ULTIMATE.init(); {44998#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:28:45,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {44998#(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); {44986#true} is VALID [2022-04-28 03:28:45,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {44986#true} assume true; {44986#true} is VALID [2022-04-28 03:28:45,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44986#true} {44986#true} #71#return; {44986#true} is VALID [2022-04-28 03:28:45,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {44986#true} call #t~ret6 := main(); {44986#true} is VALID [2022-04-28 03:28:45,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {44986#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {44991#(= main_~k~0 0)} is VALID [2022-04-28 03:28:45,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {44991#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {44992#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:28:45,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {44992#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {44993#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:28:45,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {44993#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [185] L31-3-->L31-4_primed: Formula: (let ((.cse0 (< 18 v_main_~m~0_376)) (.cse1 (<= v_main_~m~0_376 19)) (.cse2 (= v_main_~k~0_1561 v_main_~k~0_1542)) (.cse3 (= |v_main_#t~post4_983| |v_main_#t~post4_964|)) (.cse4 (= v_main_~j~0_1728 v_main_~j~0_1708)) (.cse5 (= v_main_~i~0_579 v_main_~i~0_578)) (.cse6 (= |v_main_#t~post5_983| |v_main_#t~post5_964|)) (.cse7 (= |v_main_#t~post3_429| |v_main_#t~post3_428|))) (or (and (< v_main_~i~0_579 v_main_~i~0_578) (= (+ (* 19 v_main_~i~0_578) v_main_~k~0_1561) (+ (* 19 v_main_~i~0_579) v_main_~k~0_1542)) .cse0 (< v_main_~i~0_578 (+ 1 v_main_~n~0_192)) (= 19 v_main_~j~0_1708) .cse1) (and .cse2 (or (not (< v_main_~i~0_579 v_main_~n~0_192)) (not .cse0) (not .cse1)) .cse3 .cse4 .cse5 .cse6 .cse7) (and (= v_main_~m~0_376 v_main_~m~0_376) .cse2 .cse3 (= v_main_~n~0_192 v_main_~n~0_192) .cse4 .cse5 .cse6 .cse7))) InVars {main_~m~0=v_main_~m~0_376, main_~k~0=v_main_~k~0_1561, main_~j~0=v_main_~j~0_1728, main_~i~0=v_main_~i~0_579, main_#t~post4=|v_main_#t~post4_983|, main_#t~post5=|v_main_#t~post5_983|, main_~n~0=v_main_~n~0_192, main_#t~post3=|v_main_#t~post3_429|} OutVars{main_~m~0=v_main_~m~0_376, main_~k~0=v_main_~k~0_1542, main_~j~0=v_main_~j~0_1708, main_~i~0=v_main_~i~0_578, main_#t~post4=|v_main_#t~post4_964|, main_#t~post5=|v_main_#t~post5_964|, main_#t~post3=|v_main_#t~post3_428|, main_~n~0=v_main_~n~0_192} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {44994#(or (<= (+ 190 (* 19 main_~i~0)) (+ (* 19 main_~n~0) main_~k~0)) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:28:45,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {44994#(or (<= (+ 190 (* 19 main_~i~0)) (+ (* 19 main_~n~0) main_~k~0)) (<= (+ main_~i~0 10) main_~n~0))} [184] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {44995#(<= 190 main_~k~0)} is VALID [2022-04-28 03:28:45,030 INFO L272 TraceCheckUtils]: 10: Hoare triple {44995#(<= 190 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {44996#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:28:45,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {44996#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {44997#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:28:45,031 INFO L290 TraceCheckUtils]: 12: Hoare triple {44997#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {44987#false} is VALID [2022-04-28 03:28:45,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {44987#false} assume !false; {44987#false} is VALID [2022-04-28 03:28:45,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:28:45,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:28:45,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957940917] [2022-04-28 03:28:45,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957940917] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:28:45,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:28:45,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:28:47,668 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:28:47,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [591679750] [2022-04-28 03:28:47,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [591679750] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:28:47,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:28:47,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-04-28 03:28:47,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779113198] [2022-04-28 03:28:47,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:28:47,669 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 48 states have internal predecessors, (50), 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 54 [2022-04-28 03:28:47,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:28:47,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 48 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:47,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:28:47,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-28 03:28:47,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:28:47,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-28 03:28:47,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2502, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 03:28:47,717 INFO L87 Difference]: Start difference. First operand 344 states and 428 transitions. Second operand has 50 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 48 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:59,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:28:59,770 INFO L93 Difference]: Finished difference Result 422 states and 529 transitions. [2022-04-28 03:28:59,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-28 03:28:59,771 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 48 states have internal predecessors, (50), 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 54 [2022-04-28 03:28:59,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:28:59,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 48 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:59,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 111 transitions. [2022-04-28 03:28:59,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 48 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:59,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 111 transitions. [2022-04-28 03:28:59,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 111 transitions. [2022-04-28 03:28:59,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:28:59,882 INFO L225 Difference]: With dead ends: 422 [2022-04-28 03:28:59,882 INFO L226 Difference]: Without dead ends: 417 [2022-04-28 03:28:59,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1639 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=409, Invalid=9491, Unknown=0, NotChecked=0, Total=9900 [2022-04-28 03:28:59,883 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 62 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 4072 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 4115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 4072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:28:59,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 235 Invalid, 4115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 4072 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-04-28 03:28:59,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2022-04-28 03:29:01,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 387. [2022-04-28 03:29:01,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:29:01,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 417 states. Second operand has 387 states, 382 states have (on average 1.2774869109947644) internal successors, (488), 382 states have internal predecessors, (488), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:01,628 INFO L74 IsIncluded]: Start isIncluded. First operand 417 states. Second operand has 387 states, 382 states have (on average 1.2774869109947644) internal successors, (488), 382 states have internal predecessors, (488), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:01,629 INFO L87 Difference]: Start difference. First operand 417 states. Second operand has 387 states, 382 states have (on average 1.2774869109947644) internal successors, (488), 382 states have internal predecessors, (488), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:01,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:29:01,635 INFO L93 Difference]: Finished difference Result 417 states and 524 transitions. [2022-04-28 03:29:01,635 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 524 transitions. [2022-04-28 03:29:01,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:29:01,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:29:01,635 INFO L74 IsIncluded]: Start isIncluded. First operand has 387 states, 382 states have (on average 1.2774869109947644) internal successors, (488), 382 states have internal predecessors, (488), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 417 states. [2022-04-28 03:29:01,636 INFO L87 Difference]: Start difference. First operand has 387 states, 382 states have (on average 1.2774869109947644) internal successors, (488), 382 states have internal predecessors, (488), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 417 states. [2022-04-28 03:29:01,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:29:01,642 INFO L93 Difference]: Finished difference Result 417 states and 524 transitions. [2022-04-28 03:29:01,642 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 524 transitions. [2022-04-28 03:29:01,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:29:01,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:29:01,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:29:01,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:29:01,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 382 states have (on average 1.2774869109947644) internal successors, (488), 382 states have internal predecessors, (488), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:01,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 492 transitions. [2022-04-28 03:29:01,650 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 492 transitions. Word has length 54 [2022-04-28 03:29:01,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:29:01,650 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 492 transitions. [2022-04-28 03:29:01,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 48 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:01,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 387 states and 492 transitions. [2022-04-28 03:29:03,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 492 edges. 492 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:29:03,257 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 492 transitions. [2022-04-28 03:29:03,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 03:29:03,258 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:29:03,258 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:29:03,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-04-28 03:29:03,258 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:29:03,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:29:03,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1804840320, now seen corresponding path program 38 times [2022-04-28 03:29:03,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:29:03,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [358721394] [2022-04-28 03:29:03,631 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:29:03,826 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:29:04,219 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:29:06,440 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:29:06,441 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:29:06,444 INFO L85 PathProgramCache]: Analyzing trace with hash -2033838399, now seen corresponding path program 1 times [2022-04-28 03:29:06,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:29:06,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138702441] [2022-04-28 03:29:06,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:29:06,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:29:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:29:06,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:29:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:29:06,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {47604#(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); {47591#true} is VALID [2022-04-28 03:29:06,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {47591#true} assume true; {47591#true} is VALID [2022-04-28 03:29:06,542 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47591#true} {47591#true} #71#return; {47591#true} is VALID [2022-04-28 03:29:06,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {47591#true} call ULTIMATE.init(); {47604#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:29:06,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {47604#(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); {47591#true} is VALID [2022-04-28 03:29:06,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {47591#true} assume true; {47591#true} is VALID [2022-04-28 03:29:06,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47591#true} {47591#true} #71#return; {47591#true} is VALID [2022-04-28 03:29:06,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {47591#true} call #t~ret6 := main(); {47591#true} is VALID [2022-04-28 03:29:06,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {47591#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {47596#(= main_~k~0 0)} is VALID [2022-04-28 03:29:06,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {47596#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {47597#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:29:06,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {47597#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {47598#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:29:06,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {47598#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} [187] L31-3-->L31-4_primed: Formula: (let ((.cse0 (< 2 v_main_~m~0_388)) (.cse1 (<= v_main_~m~0_388 3)) (.cse2 (= v_main_~k~0_1604 v_main_~k~0_1601)) (.cse3 (= v_main_~i~0_595 v_main_~i~0_594)) (.cse4 (= v_main_~j~0_1791 v_main_~j~0_1771)) (.cse5 (= |v_main_#t~post3_442| |v_main_#t~post3_440|)) (.cse6 (= |v_main_#t~post5_1018| |v_main_#t~post5_1000|)) (.cse7 (= |v_main_#t~post4_1018| |v_main_#t~post4_1000|))) (or (and .cse0 (< v_main_~i~0_595 v_main_~i~0_594) (< v_main_~i~0_594 (+ 1 v_main_~n~0_199)) (= 3 v_main_~j~0_1771) .cse1 (= (+ (* 3 v_main_~i~0_595) v_main_~k~0_1601) (+ v_main_~k~0_1604 (* 3 v_main_~i~0_594)))) (and .cse2 (= v_main_~n~0_199 v_main_~n~0_199) .cse3 .cse4 .cse5 .cse6 (= v_main_~m~0_388 v_main_~m~0_388) .cse7) (and (or (not (< v_main_~i~0_595 v_main_~n~0_199)) (not .cse0) (not .cse1)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) InVars {main_~m~0=v_main_~m~0_388, main_~k~0=v_main_~k~0_1604, main_~j~0=v_main_~j~0_1791, main_~i~0=v_main_~i~0_595, main_#t~post4=|v_main_#t~post4_1018|, main_#t~post5=|v_main_#t~post5_1018|, main_~n~0=v_main_~n~0_199, main_#t~post3=|v_main_#t~post3_442|} OutVars{main_~m~0=v_main_~m~0_388, main_~k~0=v_main_~k~0_1601, main_~j~0=v_main_~j~0_1771, main_~i~0=v_main_~i~0_594, main_#t~post4=|v_main_#t~post4_1000|, main_#t~post5=|v_main_#t~post5_1000|, main_#t~post3=|v_main_#t~post3_440|, main_~n~0=v_main_~n~0_199} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {47599#(and (<= (+ (* main_~i~0 15) 150) (+ main_~k~0 (* main_~n~0 15))) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:29:06,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {47599#(and (<= (+ (* main_~i~0 15) 150) (+ main_~k~0 (* main_~n~0 15))) (<= (+ main_~i~0 10) main_~n~0))} [188] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {47599#(and (<= (+ (* main_~i~0 15) 150) (+ main_~k~0 (* main_~n~0 15))) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:29:06,546 INFO L290 TraceCheckUtils]: 10: Hoare triple {47599#(and (<= (+ (* main_~i~0 15) 150) (+ main_~k~0 (* main_~n~0 15))) (<= (+ main_~i~0 10) main_~n~0))} [189] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_1021| |v_main_#t~post4_1003|)) (.cse1 (= v_main_~i~0_597 v_main_~i~0_596)) (.cse2 (= v_main_~k~0_1620 v_main_~k~0_1605)) (.cse3 (= v_main_~j~0_1794 v_main_~j~0_1775)) (.cse4 (= |v_main_#t~post5_1021| |v_main_#t~post5_1003|)) (.cse5 (= |v_main_#t~post3_445| |v_main_#t~post3_441|)) (.cse7 (< 14 v_main_~m~0_389)) (.cse6 (<= v_main_~m~0_389 15))) (or (and .cse0 .cse1 .cse2 .cse3 (= v_main_~m~0_389 v_main_~m~0_389) .cse4 (= v_main_~n~0_200 v_main_~n~0_200) .cse5) (and .cse0 (or (not .cse6) (not .cse7) (not (< v_main_~i~0_597 v_main_~n~0_200))) .cse1 .cse2 .cse3 .cse4 .cse5) (and (< v_main_~i~0_597 v_main_~i~0_596) (= v_main_~j~0_1775 15) .cse7 .cse6 (= (+ (* 15 v_main_~i~0_596) v_main_~k~0_1620) (+ (* 15 v_main_~i~0_597) v_main_~k~0_1605)) (< v_main_~i~0_596 (+ 1 v_main_~n~0_200))))) InVars {main_~m~0=v_main_~m~0_389, main_~k~0=v_main_~k~0_1620, main_~j~0=v_main_~j~0_1794, main_~i~0=v_main_~i~0_597, main_#t~post4=|v_main_#t~post4_1021|, main_#t~post5=|v_main_#t~post5_1021|, main_~n~0=v_main_~n~0_200, main_#t~post3=|v_main_#t~post3_445|} OutVars{main_~m~0=v_main_~m~0_389, main_~k~0=v_main_~k~0_1605, main_~j~0=v_main_~j~0_1775, main_~i~0=v_main_~i~0_596, main_#t~post4=|v_main_#t~post4_1003|, main_#t~post5=|v_main_#t~post5_1003|, main_#t~post3=|v_main_#t~post3_441|, main_~n~0=v_main_~n~0_200} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {47600#(or (<= (+ (* main_~i~0 15) 150) (+ main_~k~0 (* main_~n~0 15))) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:29:06,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {47600#(or (<= (+ (* main_~i~0 15) 150) (+ main_~k~0 (* main_~n~0 15))) (<= (+ main_~i~0 10) main_~n~0))} [186] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {47601#(<= 150 main_~k~0)} is VALID [2022-04-28 03:29:06,547 INFO L272 TraceCheckUtils]: 12: Hoare triple {47601#(<= 150 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {47602#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:29:06,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {47602#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {47603#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:29:06,547 INFO L290 TraceCheckUtils]: 14: Hoare triple {47603#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {47592#false} is VALID [2022-04-28 03:29:06,547 INFO L290 TraceCheckUtils]: 15: Hoare triple {47592#false} assume !false; {47592#false} is VALID [2022-04-28 03:29:06,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:29:06,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:29:06,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138702441] [2022-04-28 03:29:06,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138702441] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:29:06,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452406047] [2022-04-28 03:29:06,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:29:06,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:29:06,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:29:06,549 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:29:06,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 03:29:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:29:06,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:29:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:29:06,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:29:07,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {47591#true} call ULTIMATE.init(); {47591#true} is VALID [2022-04-28 03:29:07,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {47591#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); {47591#true} is VALID [2022-04-28 03:29:07,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {47591#true} assume true; {47591#true} is VALID [2022-04-28 03:29:07,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47591#true} {47591#true} #71#return; {47591#true} is VALID [2022-04-28 03:29:07,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {47591#true} call #t~ret6 := main(); {47591#true} is VALID [2022-04-28 03:29:07,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {47591#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {47623#(<= 0 main_~k~0)} is VALID [2022-04-28 03:29:07,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {47623#(<= 0 main_~k~0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {47627#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} is VALID [2022-04-28 03:29:07,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {47627#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {47631#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:29:07,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {47631#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [187] L31-3-->L31-4_primed: Formula: (let ((.cse0 (< 2 v_main_~m~0_388)) (.cse1 (<= v_main_~m~0_388 3)) (.cse2 (= v_main_~k~0_1604 v_main_~k~0_1601)) (.cse3 (= v_main_~i~0_595 v_main_~i~0_594)) (.cse4 (= v_main_~j~0_1791 v_main_~j~0_1771)) (.cse5 (= |v_main_#t~post3_442| |v_main_#t~post3_440|)) (.cse6 (= |v_main_#t~post5_1018| |v_main_#t~post5_1000|)) (.cse7 (= |v_main_#t~post4_1018| |v_main_#t~post4_1000|))) (or (and .cse0 (< v_main_~i~0_595 v_main_~i~0_594) (< v_main_~i~0_594 (+ 1 v_main_~n~0_199)) (= 3 v_main_~j~0_1771) .cse1 (= (+ (* 3 v_main_~i~0_595) v_main_~k~0_1601) (+ v_main_~k~0_1604 (* 3 v_main_~i~0_594)))) (and .cse2 (= v_main_~n~0_199 v_main_~n~0_199) .cse3 .cse4 .cse5 .cse6 (= v_main_~m~0_388 v_main_~m~0_388) .cse7) (and (or (not (< v_main_~i~0_595 v_main_~n~0_199)) (not .cse0) (not .cse1)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) InVars {main_~m~0=v_main_~m~0_388, main_~k~0=v_main_~k~0_1604, main_~j~0=v_main_~j~0_1791, main_~i~0=v_main_~i~0_595, main_#t~post4=|v_main_#t~post4_1018|, main_#t~post5=|v_main_#t~post5_1018|, main_~n~0=v_main_~n~0_199, main_#t~post3=|v_main_#t~post3_442|} OutVars{main_~m~0=v_main_~m~0_388, main_~k~0=v_main_~k~0_1601, main_~j~0=v_main_~j~0_1771, main_~i~0=v_main_~i~0_594, main_#t~post4=|v_main_#t~post4_1000|, main_#t~post5=|v_main_#t~post5_1000|, main_#t~post3=|v_main_#t~post3_440|, main_~n~0=v_main_~n~0_199} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {47631#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:29:07,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {47631#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [188] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {47631#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:29:07,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {47631#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [189] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_1021| |v_main_#t~post4_1003|)) (.cse1 (= v_main_~i~0_597 v_main_~i~0_596)) (.cse2 (= v_main_~k~0_1620 v_main_~k~0_1605)) (.cse3 (= v_main_~j~0_1794 v_main_~j~0_1775)) (.cse4 (= |v_main_#t~post5_1021| |v_main_#t~post5_1003|)) (.cse5 (= |v_main_#t~post3_445| |v_main_#t~post3_441|)) (.cse7 (< 14 v_main_~m~0_389)) (.cse6 (<= v_main_~m~0_389 15))) (or (and .cse0 .cse1 .cse2 .cse3 (= v_main_~m~0_389 v_main_~m~0_389) .cse4 (= v_main_~n~0_200 v_main_~n~0_200) .cse5) (and .cse0 (or (not .cse6) (not .cse7) (not (< v_main_~i~0_597 v_main_~n~0_200))) .cse1 .cse2 .cse3 .cse4 .cse5) (and (< v_main_~i~0_597 v_main_~i~0_596) (= v_main_~j~0_1775 15) .cse7 .cse6 (= (+ (* 15 v_main_~i~0_596) v_main_~k~0_1620) (+ (* 15 v_main_~i~0_597) v_main_~k~0_1605)) (< v_main_~i~0_596 (+ 1 v_main_~n~0_200))))) InVars {main_~m~0=v_main_~m~0_389, main_~k~0=v_main_~k~0_1620, main_~j~0=v_main_~j~0_1794, main_~i~0=v_main_~i~0_597, main_#t~post4=|v_main_#t~post4_1021|, main_#t~post5=|v_main_#t~post5_1021|, main_~n~0=v_main_~n~0_200, main_#t~post3=|v_main_#t~post3_445|} OutVars{main_~m~0=v_main_~m~0_389, main_~k~0=v_main_~k~0_1605, main_~j~0=v_main_~j~0_1775, main_~i~0=v_main_~i~0_596, main_#t~post4=|v_main_#t~post4_1003|, main_#t~post5=|v_main_#t~post5_1003|, main_#t~post3=|v_main_#t~post3_441|, main_~n~0=v_main_~n~0_200} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {47641#(and (<= 10 main_~n~0) (or (and (<= (+ (div main_~k~0 (- 15)) main_~i~0) 0) (< (div main_~k~0 (- 15)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:29:07,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {47641#(and (<= 10 main_~n~0) (or (and (<= (+ (div main_~k~0 (- 15)) main_~i~0) 0) (< (div main_~k~0 (- 15)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [186] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {47601#(<= 150 main_~k~0)} is VALID [2022-04-28 03:29:07,040 INFO L272 TraceCheckUtils]: 12: Hoare triple {47601#(<= 150 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {47648#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:29:07,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {47648#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {47652#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:29:07,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {47652#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {47592#false} is VALID [2022-04-28 03:29:07,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {47592#false} assume !false; {47592#false} is VALID [2022-04-28 03:29:07,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:29:07,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:29:07,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {47592#false} assume !false; {47592#false} is VALID [2022-04-28 03:29:07,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {47652#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {47592#false} is VALID [2022-04-28 03:29:07,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {47648#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {47652#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:29:07,797 INFO L272 TraceCheckUtils]: 12: Hoare triple {47668#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {47648#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:29:07,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {47672#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} [186] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {47668#(<= 100 main_~k~0)} is VALID [2022-04-28 03:29:07,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {47676#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [189] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_1021| |v_main_#t~post4_1003|)) (.cse1 (= v_main_~i~0_597 v_main_~i~0_596)) (.cse2 (= v_main_~k~0_1620 v_main_~k~0_1605)) (.cse3 (= v_main_~j~0_1794 v_main_~j~0_1775)) (.cse4 (= |v_main_#t~post5_1021| |v_main_#t~post5_1003|)) (.cse5 (= |v_main_#t~post3_445| |v_main_#t~post3_441|)) (.cse7 (< 14 v_main_~m~0_389)) (.cse6 (<= v_main_~m~0_389 15))) (or (and .cse0 .cse1 .cse2 .cse3 (= v_main_~m~0_389 v_main_~m~0_389) .cse4 (= v_main_~n~0_200 v_main_~n~0_200) .cse5) (and .cse0 (or (not .cse6) (not .cse7) (not (< v_main_~i~0_597 v_main_~n~0_200))) .cse1 .cse2 .cse3 .cse4 .cse5) (and (< v_main_~i~0_597 v_main_~i~0_596) (= v_main_~j~0_1775 15) .cse7 .cse6 (= (+ (* 15 v_main_~i~0_596) v_main_~k~0_1620) (+ (* 15 v_main_~i~0_597) v_main_~k~0_1605)) (< v_main_~i~0_596 (+ 1 v_main_~n~0_200))))) InVars {main_~m~0=v_main_~m~0_389, main_~k~0=v_main_~k~0_1620, main_~j~0=v_main_~j~0_1794, main_~i~0=v_main_~i~0_597, main_#t~post4=|v_main_#t~post4_1021|, main_#t~post5=|v_main_#t~post5_1021|, main_~n~0=v_main_~n~0_200, main_#t~post3=|v_main_#t~post3_445|} OutVars{main_~m~0=v_main_~m~0_389, main_~k~0=v_main_~k~0_1605, main_~j~0=v_main_~j~0_1775, main_~i~0=v_main_~i~0_596, main_#t~post4=|v_main_#t~post4_1003|, main_#t~post5=|v_main_#t~post5_1003|, main_#t~post3=|v_main_#t~post3_441|, main_~n~0=v_main_~n~0_200} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {47672#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} is VALID [2022-04-28 03:29:07,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {47676#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [188] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {47676#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:29:07,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {47683#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (not (<= main_~m~0 3)) (<= (+ (div (+ (- 100) main_~k~0) (- 3)) main_~i~0) main_~n~0) (<= main_~n~0 main_~i~0) (not (< 2 main_~m~0))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [187] L31-3-->L31-4_primed: Formula: (let ((.cse0 (< 2 v_main_~m~0_388)) (.cse1 (<= v_main_~m~0_388 3)) (.cse2 (= v_main_~k~0_1604 v_main_~k~0_1601)) (.cse3 (= v_main_~i~0_595 v_main_~i~0_594)) (.cse4 (= v_main_~j~0_1791 v_main_~j~0_1771)) (.cse5 (= |v_main_#t~post3_442| |v_main_#t~post3_440|)) (.cse6 (= |v_main_#t~post5_1018| |v_main_#t~post5_1000|)) (.cse7 (= |v_main_#t~post4_1018| |v_main_#t~post4_1000|))) (or (and .cse0 (< v_main_~i~0_595 v_main_~i~0_594) (< v_main_~i~0_594 (+ 1 v_main_~n~0_199)) (= 3 v_main_~j~0_1771) .cse1 (= (+ (* 3 v_main_~i~0_595) v_main_~k~0_1601) (+ v_main_~k~0_1604 (* 3 v_main_~i~0_594)))) (and .cse2 (= v_main_~n~0_199 v_main_~n~0_199) .cse3 .cse4 .cse5 .cse6 (= v_main_~m~0_388 v_main_~m~0_388) .cse7) (and (or (not (< v_main_~i~0_595 v_main_~n~0_199)) (not .cse0) (not .cse1)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) InVars {main_~m~0=v_main_~m~0_388, main_~k~0=v_main_~k~0_1604, main_~j~0=v_main_~j~0_1791, main_~i~0=v_main_~i~0_595, main_#t~post4=|v_main_#t~post4_1018|, main_#t~post5=|v_main_#t~post5_1018|, main_~n~0=v_main_~n~0_199, main_#t~post3=|v_main_#t~post3_442|} OutVars{main_~m~0=v_main_~m~0_388, main_~k~0=v_main_~k~0_1601, main_~j~0=v_main_~j~0_1771, main_~i~0=v_main_~i~0_594, main_#t~post4=|v_main_#t~post4_1000|, main_#t~post5=|v_main_#t~post5_1000|, main_#t~post3=|v_main_#t~post3_440|, main_~n~0=v_main_~n~0_199} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {47676#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:29:07,801 INFO L290 TraceCheckUtils]: 7: Hoare triple {47687#(and (or (< 0 main_~n~0) (<= 100 main_~k~0)) (or (<= (div (+ (- 100) main_~k~0) (- 15)) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 15)) 1)))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {47683#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (not (<= main_~m~0 3)) (<= (+ (div (+ (- 100) main_~k~0) (- 3)) main_~i~0) main_~n~0) (<= main_~n~0 main_~i~0) (not (< 2 main_~m~0))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:29:07,801 INFO L290 TraceCheckUtils]: 6: Hoare triple {47691#(<= (div (+ (- 100) main_~k~0) (- 15)) 10)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {47687#(and (or (< 0 main_~n~0) (<= 100 main_~k~0)) (or (<= (div (+ (- 100) main_~k~0) (- 15)) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 15)) 1)))} is VALID [2022-04-28 03:29:07,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {47591#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {47691#(<= (div (+ (- 100) main_~k~0) (- 15)) 10)} is VALID [2022-04-28 03:29:07,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {47591#true} call #t~ret6 := main(); {47591#true} is VALID [2022-04-28 03:29:07,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47591#true} {47591#true} #71#return; {47591#true} is VALID [2022-04-28 03:29:07,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {47591#true} assume true; {47591#true} is VALID [2022-04-28 03:29:07,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {47591#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); {47591#true} is VALID [2022-04-28 03:29:07,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {47591#true} call ULTIMATE.init(); {47591#true} is VALID [2022-04-28 03:29:07,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:29:07,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452406047] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:29:07,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:29:07,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 23 [2022-04-28 03:29:09,229 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:29:09,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [358721394] [2022-04-28 03:29:09,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [358721394] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:29:09,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:29:09,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-28 03:29:09,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384587983] [2022-04-28 03:29:09,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:29:09,230 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 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 55 [2022-04-28 03:29:09,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:29:09,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 49 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:09,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:29:09,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-28 03:29:09,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:29:09,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-28 03:29:09,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=614, Invalid=3292, Unknown=0, NotChecked=0, Total=3906 [2022-04-28 03:29:09,266 INFO L87 Difference]: Start difference. First operand 387 states and 492 transitions. Second operand has 49 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:15,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:29:15,588 INFO L93 Difference]: Finished difference Result 403 states and 510 transitions. [2022-04-28 03:29:15,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-28 03:29:15,588 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 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 55 [2022-04-28 03:29:15,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:29:15,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:15,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 81 transitions. [2022-04-28 03:29:15,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:15,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 81 transitions. [2022-04-28 03:29:15,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 81 transitions. [2022-04-28 03:29:15,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:29:15,654 INFO L225 Difference]: With dead ends: 403 [2022-04-28 03:29:15,654 INFO L226 Difference]: Without dead ends: 394 [2022-04-28 03:29:15,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2841 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1241, Invalid=9889, Unknown=0, NotChecked=0, Total=11130 [2022-04-28 03:29:15,655 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 29 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 2646 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 2678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:29:15,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 235 Invalid, 2678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2646 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-28 03:29:15,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-04-28 03:29:17,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 389. [2022-04-28 03:29:17,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:29:17,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 394 states. Second operand has 389 states, 384 states have (on average 1.2760416666666667) internal successors, (490), 384 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:17,387 INFO L74 IsIncluded]: Start isIncluded. First operand 394 states. Second operand has 389 states, 384 states have (on average 1.2760416666666667) internal successors, (490), 384 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:17,387 INFO L87 Difference]: Start difference. First operand 394 states. Second operand has 389 states, 384 states have (on average 1.2760416666666667) internal successors, (490), 384 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:17,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:29:17,392 INFO L93 Difference]: Finished difference Result 394 states and 499 transitions. [2022-04-28 03:29:17,392 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 499 transitions. [2022-04-28 03:29:17,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:29:17,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:29:17,393 INFO L74 IsIncluded]: Start isIncluded. First operand has 389 states, 384 states have (on average 1.2760416666666667) internal successors, (490), 384 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 394 states. [2022-04-28 03:29:17,393 INFO L87 Difference]: Start difference. First operand has 389 states, 384 states have (on average 1.2760416666666667) internal successors, (490), 384 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 394 states. [2022-04-28 03:29:17,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:29:17,399 INFO L93 Difference]: Finished difference Result 394 states and 499 transitions. [2022-04-28 03:29:17,399 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 499 transitions. [2022-04-28 03:29:17,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:29:17,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:29:17,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:29:17,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:29:17,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 384 states have (on average 1.2760416666666667) internal successors, (490), 384 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:17,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 494 transitions. [2022-04-28 03:29:17,406 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 494 transitions. Word has length 55 [2022-04-28 03:29:17,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:29:17,406 INFO L495 AbstractCegarLoop]: Abstraction has 389 states and 494 transitions. [2022-04-28 03:29:17,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:17,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 389 states and 494 transitions. [2022-04-28 03:29:19,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 494 edges. 494 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:29:19,009 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 494 transitions. [2022-04-28 03:29:19,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 03:29:19,009 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:29:19,009 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:29:19,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 03:29:19,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-28 03:29:19,210 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:29:19,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:29:19,210 INFO L85 PathProgramCache]: Analyzing trace with hash -2055811004, now seen corresponding path program 39 times [2022-04-28 03:29:19,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:29:19,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1150884009] [2022-04-28 03:29:19,580 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:29:23,708 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:29:23,775 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:29:26,110 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:29:26,211 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:29:26,424 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:29:26,425 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:29:26,428 INFO L85 PathProgramCache]: Analyzing trace with hash 15693761, now seen corresponding path program 1 times [2022-04-28 03:29:26,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:29:26,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825839434] [2022-04-28 03:29:26,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:29:26,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:29:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:29:26,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:29:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:29:26,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {50223#(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); {50210#true} is VALID [2022-04-28 03:29:26,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {50210#true} assume true; {50210#true} is VALID [2022-04-28 03:29:26,528 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50210#true} {50210#true} #71#return; {50210#true} is VALID [2022-04-28 03:29:26,528 INFO L272 TraceCheckUtils]: 0: Hoare triple {50210#true} call ULTIMATE.init(); {50223#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:29:26,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {50223#(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); {50210#true} is VALID [2022-04-28 03:29:26,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {50210#true} assume true; {50210#true} is VALID [2022-04-28 03:29:26,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50210#true} {50210#true} #71#return; {50210#true} is VALID [2022-04-28 03:29:26,528 INFO L272 TraceCheckUtils]: 4: Hoare triple {50210#true} call #t~ret6 := main(); {50210#true} is VALID [2022-04-28 03:29:26,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {50210#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {50215#(= main_~k~0 0)} is VALID [2022-04-28 03:29:26,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {50215#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {50216#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:29:26,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {50216#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {50217#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:29:26,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {50217#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} [191] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= v_main_~k~0_1670 v_main_~k~0_1668)) (.cse1 (= |v_main_#t~post5_1061| |v_main_#t~post5_1043|)) (.cse2 (= |v_main_#t~post4_1061| |v_main_#t~post4_1043|)) (.cse3 (= v_main_~j~0_1862 v_main_~j~0_1842)) (.cse6 (< 1 v_main_~m~0_403)) (.cse7 (<= v_main_~m~0_403 2)) (.cse4 (= v_main_~i~0_623 v_main_~i~0_622)) (.cse5 (= |v_main_#t~post3_463| |v_main_#t~post3_461|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~m~0_403 v_main_~m~0_403) .cse5 (= v_main_~n~0_209 v_main_~n~0_209)) (and (< v_main_~i~0_623 v_main_~i~0_622) .cse6 (= (+ v_main_~k~0_1668 (* 2 v_main_~i~0_623)) (+ v_main_~k~0_1670 (* 2 v_main_~i~0_622))) (< v_main_~i~0_622 (+ 1 v_main_~n~0_209)) (= 2 v_main_~j~0_1842) .cse7) (and .cse0 .cse1 .cse2 .cse3 (or (not .cse6) (not (< v_main_~i~0_623 v_main_~n~0_209)) (not .cse7)) .cse4 .cse5))) InVars {main_~m~0=v_main_~m~0_403, main_~k~0=v_main_~k~0_1670, main_~j~0=v_main_~j~0_1862, main_~i~0=v_main_~i~0_623, main_#t~post4=|v_main_#t~post4_1061|, main_#t~post5=|v_main_#t~post5_1061|, main_~n~0=v_main_~n~0_209, main_#t~post3=|v_main_#t~post3_463|} OutVars{main_~m~0=v_main_~m~0_403, main_~k~0=v_main_~k~0_1668, main_~j~0=v_main_~j~0_1842, main_~i~0=v_main_~i~0_622, main_#t~post4=|v_main_#t~post4_1043|, main_#t~post5=|v_main_#t~post5_1043|, main_#t~post3=|v_main_#t~post3_461|, main_~n~0=v_main_~n~0_209} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {50218#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:29:26,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {50218#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [192] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50218#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:29:26,531 INFO L290 TraceCheckUtils]: 10: Hoare triple {50218#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [193] L31-3-->L31-4_primed: Formula: (let ((.cse0 (< 15 v_main_~m~0_404)) (.cse1 (<= v_main_~m~0_404 16)) (.cse2 (= |v_main_#t~post3_466| |v_main_#t~post3_462|)) (.cse3 (= |v_main_#t~post5_1064| |v_main_#t~post5_1045|)) (.cse4 (= |v_main_#t~post4_1064| |v_main_#t~post4_1045|)) (.cse5 (= v_main_~j~0_1865 v_main_~j~0_1845)) (.cse6 (= v_main_~i~0_625 v_main_~i~0_624))) (or (and (= 16 v_main_~j~0_1845) (< v_main_~i~0_625 v_main_~i~0_624) .cse0 (= (+ (* 16 v_main_~i~0_625) v_main_~k~0_1671) (+ (* 16 v_main_~i~0_624) v_main_~k~0_1687)) (< v_main_~i~0_624 (+ 1 v_main_~n~0_210)) .cse1) (and (= v_main_~k~0_1671 v_main_~k~0_1687) .cse2 .cse3 (or (not .cse0) (not .cse1) (not (< v_main_~i~0_625 v_main_~n~0_210))) .cse4 .cse5 .cse6) (and (= v_main_~n~0_210 v_main_~n~0_210) (= v_main_~m~0_404 v_main_~m~0_404) (= v_main_~k~0_1687 v_main_~k~0_1671) .cse2 .cse3 .cse4 .cse5 .cse6))) InVars {main_~m~0=v_main_~m~0_404, main_~k~0=v_main_~k~0_1687, main_~j~0=v_main_~j~0_1865, main_~i~0=v_main_~i~0_625, main_#t~post4=|v_main_#t~post4_1064|, main_#t~post5=|v_main_#t~post5_1064|, main_~n~0=v_main_~n~0_210, main_#t~post3=|v_main_#t~post3_466|} OutVars{main_~m~0=v_main_~m~0_404, main_~k~0=v_main_~k~0_1671, main_~j~0=v_main_~j~0_1845, main_~i~0=v_main_~i~0_624, main_#t~post4=|v_main_#t~post4_1045|, main_#t~post5=|v_main_#t~post5_1045|, main_#t~post3=|v_main_#t~post3_462|, main_~n~0=v_main_~n~0_210} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {50219#(or (<= (+ 160 (* main_~i~0 16)) (+ main_~k~0 (* main_~n~0 16))) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:29:26,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {50219#(or (<= (+ 160 (* main_~i~0 16)) (+ main_~k~0 (* main_~n~0 16))) (<= (+ main_~i~0 10) main_~n~0))} [190] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {50220#(<= 160 main_~k~0)} is VALID [2022-04-28 03:29:26,532 INFO L272 TraceCheckUtils]: 12: Hoare triple {50220#(<= 160 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {50221#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:29:26,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {50221#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {50222#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:29:26,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {50222#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {50211#false} is VALID [2022-04-28 03:29:26,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {50211#false} assume !false; {50211#false} is VALID [2022-04-28 03:29:26,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:29:26,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:29:26,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825839434] [2022-04-28 03:29:26,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825839434] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:29:26,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60488868] [2022-04-28 03:29:26,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:29:26,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:29:26,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:29:26,543 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:29:26,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 03:29:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:29:26,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:29:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:29:26,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:29:27,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {50210#true} call ULTIMATE.init(); {50210#true} is VALID [2022-04-28 03:29:27,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {50210#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); {50210#true} is VALID [2022-04-28 03:29:27,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {50210#true} assume true; {50210#true} is VALID [2022-04-28 03:29:27,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50210#true} {50210#true} #71#return; {50210#true} is VALID [2022-04-28 03:29:27,022 INFO L272 TraceCheckUtils]: 4: Hoare triple {50210#true} call #t~ret6 := main(); {50210#true} is VALID [2022-04-28 03:29:27,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {50210#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {50242#(<= 0 main_~k~0)} is VALID [2022-04-28 03:29:27,023 INFO L290 TraceCheckUtils]: 6: Hoare triple {50242#(<= 0 main_~k~0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {50246#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} is VALID [2022-04-28 03:29:27,023 INFO L290 TraceCheckUtils]: 7: Hoare triple {50246#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {50250#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:29:27,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {50250#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [191] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= v_main_~k~0_1670 v_main_~k~0_1668)) (.cse1 (= |v_main_#t~post5_1061| |v_main_#t~post5_1043|)) (.cse2 (= |v_main_#t~post4_1061| |v_main_#t~post4_1043|)) (.cse3 (= v_main_~j~0_1862 v_main_~j~0_1842)) (.cse6 (< 1 v_main_~m~0_403)) (.cse7 (<= v_main_~m~0_403 2)) (.cse4 (= v_main_~i~0_623 v_main_~i~0_622)) (.cse5 (= |v_main_#t~post3_463| |v_main_#t~post3_461|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~m~0_403 v_main_~m~0_403) .cse5 (= v_main_~n~0_209 v_main_~n~0_209)) (and (< v_main_~i~0_623 v_main_~i~0_622) .cse6 (= (+ v_main_~k~0_1668 (* 2 v_main_~i~0_623)) (+ v_main_~k~0_1670 (* 2 v_main_~i~0_622))) (< v_main_~i~0_622 (+ 1 v_main_~n~0_209)) (= 2 v_main_~j~0_1842) .cse7) (and .cse0 .cse1 .cse2 .cse3 (or (not .cse6) (not (< v_main_~i~0_623 v_main_~n~0_209)) (not .cse7)) .cse4 .cse5))) InVars {main_~m~0=v_main_~m~0_403, main_~k~0=v_main_~k~0_1670, main_~j~0=v_main_~j~0_1862, main_~i~0=v_main_~i~0_623, main_#t~post4=|v_main_#t~post4_1061|, main_#t~post5=|v_main_#t~post5_1061|, main_~n~0=v_main_~n~0_209, main_#t~post3=|v_main_#t~post3_463|} OutVars{main_~m~0=v_main_~m~0_403, main_~k~0=v_main_~k~0_1668, main_~j~0=v_main_~j~0_1842, main_~i~0=v_main_~i~0_622, main_#t~post4=|v_main_#t~post4_1043|, main_#t~post5=|v_main_#t~post5_1043|, main_#t~post3=|v_main_#t~post3_461|, main_~n~0=v_main_~n~0_209} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {50250#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:29:27,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {50250#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [192] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50250#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:29:27,025 INFO L290 TraceCheckUtils]: 10: Hoare triple {50250#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [193] L31-3-->L31-4_primed: Formula: (let ((.cse0 (< 15 v_main_~m~0_404)) (.cse1 (<= v_main_~m~0_404 16)) (.cse2 (= |v_main_#t~post3_466| |v_main_#t~post3_462|)) (.cse3 (= |v_main_#t~post5_1064| |v_main_#t~post5_1045|)) (.cse4 (= |v_main_#t~post4_1064| |v_main_#t~post4_1045|)) (.cse5 (= v_main_~j~0_1865 v_main_~j~0_1845)) (.cse6 (= v_main_~i~0_625 v_main_~i~0_624))) (or (and (= 16 v_main_~j~0_1845) (< v_main_~i~0_625 v_main_~i~0_624) .cse0 (= (+ (* 16 v_main_~i~0_625) v_main_~k~0_1671) (+ (* 16 v_main_~i~0_624) v_main_~k~0_1687)) (< v_main_~i~0_624 (+ 1 v_main_~n~0_210)) .cse1) (and (= v_main_~k~0_1671 v_main_~k~0_1687) .cse2 .cse3 (or (not .cse0) (not .cse1) (not (< v_main_~i~0_625 v_main_~n~0_210))) .cse4 .cse5 .cse6) (and (= v_main_~n~0_210 v_main_~n~0_210) (= v_main_~m~0_404 v_main_~m~0_404) (= v_main_~k~0_1687 v_main_~k~0_1671) .cse2 .cse3 .cse4 .cse5 .cse6))) InVars {main_~m~0=v_main_~m~0_404, main_~k~0=v_main_~k~0_1687, main_~j~0=v_main_~j~0_1865, main_~i~0=v_main_~i~0_625, main_#t~post4=|v_main_#t~post4_1064|, main_#t~post5=|v_main_#t~post5_1064|, main_~n~0=v_main_~n~0_210, main_#t~post3=|v_main_#t~post3_466|} OutVars{main_~m~0=v_main_~m~0_404, main_~k~0=v_main_~k~0_1671, main_~j~0=v_main_~j~0_1845, main_~i~0=v_main_~i~0_624, main_#t~post4=|v_main_#t~post4_1045|, main_#t~post5=|v_main_#t~post5_1045|, main_#t~post3=|v_main_#t~post3_462|, main_~n~0=v_main_~n~0_210} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {50260#(and (<= 10 main_~n~0) (or (and (<= (+ (div main_~k~0 (- 16)) main_~i~0) 0) (< (div main_~k~0 (- 16)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:29:27,026 INFO L290 TraceCheckUtils]: 11: Hoare triple {50260#(and (<= 10 main_~n~0) (or (and (<= (+ (div main_~k~0 (- 16)) main_~i~0) 0) (< (div main_~k~0 (- 16)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [190] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {50220#(<= 160 main_~k~0)} is VALID [2022-04-28 03:29:27,026 INFO L272 TraceCheckUtils]: 12: Hoare triple {50220#(<= 160 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {50267#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:29:27,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {50267#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {50271#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:29:27,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {50271#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {50211#false} is VALID [2022-04-28 03:29:27,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {50211#false} assume !false; {50211#false} is VALID [2022-04-28 03:29:27,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:29:27,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:29:27,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {50211#false} assume !false; {50211#false} is VALID [2022-04-28 03:29:27,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {50271#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {50211#false} is VALID [2022-04-28 03:29:27,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {50267#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {50271#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:29:27,755 INFO L272 TraceCheckUtils]: 12: Hoare triple {50287#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {50267#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:29:27,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {50291#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} [190] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {50287#(<= 100 main_~k~0)} is VALID [2022-04-28 03:29:27,756 INFO L290 TraceCheckUtils]: 10: Hoare triple {50295#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 16))) main_~n~0) (<= main_~n~0 main_~i~0) (not (< 15 main_~m~0)) (not (<= main_~m~0 16))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [193] L31-3-->L31-4_primed: Formula: (let ((.cse0 (< 15 v_main_~m~0_404)) (.cse1 (<= v_main_~m~0_404 16)) (.cse2 (= |v_main_#t~post3_466| |v_main_#t~post3_462|)) (.cse3 (= |v_main_#t~post5_1064| |v_main_#t~post5_1045|)) (.cse4 (= |v_main_#t~post4_1064| |v_main_#t~post4_1045|)) (.cse5 (= v_main_~j~0_1865 v_main_~j~0_1845)) (.cse6 (= v_main_~i~0_625 v_main_~i~0_624))) (or (and (= 16 v_main_~j~0_1845) (< v_main_~i~0_625 v_main_~i~0_624) .cse0 (= (+ (* 16 v_main_~i~0_625) v_main_~k~0_1671) (+ (* 16 v_main_~i~0_624) v_main_~k~0_1687)) (< v_main_~i~0_624 (+ 1 v_main_~n~0_210)) .cse1) (and (= v_main_~k~0_1671 v_main_~k~0_1687) .cse2 .cse3 (or (not .cse0) (not .cse1) (not (< v_main_~i~0_625 v_main_~n~0_210))) .cse4 .cse5 .cse6) (and (= v_main_~n~0_210 v_main_~n~0_210) (= v_main_~m~0_404 v_main_~m~0_404) (= v_main_~k~0_1687 v_main_~k~0_1671) .cse2 .cse3 .cse4 .cse5 .cse6))) InVars {main_~m~0=v_main_~m~0_404, main_~k~0=v_main_~k~0_1687, main_~j~0=v_main_~j~0_1865, main_~i~0=v_main_~i~0_625, main_#t~post4=|v_main_#t~post4_1064|, main_#t~post5=|v_main_#t~post5_1064|, main_~n~0=v_main_~n~0_210, main_#t~post3=|v_main_#t~post3_466|} OutVars{main_~m~0=v_main_~m~0_404, main_~k~0=v_main_~k~0_1671, main_~j~0=v_main_~j~0_1845, main_~i~0=v_main_~i~0_624, main_#t~post4=|v_main_#t~post4_1045|, main_#t~post5=|v_main_#t~post5_1045|, main_#t~post3=|v_main_#t~post3_462|, main_~n~0=v_main_~n~0_210} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {50291#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} is VALID [2022-04-28 03:29:27,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {50295#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 16))) main_~n~0) (<= main_~n~0 main_~i~0) (not (< 15 main_~m~0)) (not (<= main_~m~0 16))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [192] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50295#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 16))) main_~n~0) (<= main_~n~0 main_~i~0) (not (< 15 main_~m~0)) (not (<= main_~m~0 16))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:29:27,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {50302#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 16))) main_~n~0) (<= main_~n~0 main_~i~0) (not (< 15 main_~m~0)) (not (<= main_~m~0 16))) (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 2))) main_~n~0) (not (< 1 main_~m~0)) (<= (div (+ (- 100) main_~k~0) (- 2)) 1) (not (<= main_~m~0 2))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [191] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= v_main_~k~0_1670 v_main_~k~0_1668)) (.cse1 (= |v_main_#t~post5_1061| |v_main_#t~post5_1043|)) (.cse2 (= |v_main_#t~post4_1061| |v_main_#t~post4_1043|)) (.cse3 (= v_main_~j~0_1862 v_main_~j~0_1842)) (.cse6 (< 1 v_main_~m~0_403)) (.cse7 (<= v_main_~m~0_403 2)) (.cse4 (= v_main_~i~0_623 v_main_~i~0_622)) (.cse5 (= |v_main_#t~post3_463| |v_main_#t~post3_461|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~m~0_403 v_main_~m~0_403) .cse5 (= v_main_~n~0_209 v_main_~n~0_209)) (and (< v_main_~i~0_623 v_main_~i~0_622) .cse6 (= (+ v_main_~k~0_1668 (* 2 v_main_~i~0_623)) (+ v_main_~k~0_1670 (* 2 v_main_~i~0_622))) (< v_main_~i~0_622 (+ 1 v_main_~n~0_209)) (= 2 v_main_~j~0_1842) .cse7) (and .cse0 .cse1 .cse2 .cse3 (or (not .cse6) (not (< v_main_~i~0_623 v_main_~n~0_209)) (not .cse7)) .cse4 .cse5))) InVars {main_~m~0=v_main_~m~0_403, main_~k~0=v_main_~k~0_1670, main_~j~0=v_main_~j~0_1862, main_~i~0=v_main_~i~0_623, main_#t~post4=|v_main_#t~post4_1061|, main_#t~post5=|v_main_#t~post5_1061|, main_~n~0=v_main_~n~0_209, main_#t~post3=|v_main_#t~post3_463|} OutVars{main_~m~0=v_main_~m~0_403, main_~k~0=v_main_~k~0_1668, main_~j~0=v_main_~j~0_1842, main_~i~0=v_main_~i~0_622, main_#t~post4=|v_main_#t~post4_1043|, main_#t~post5=|v_main_#t~post5_1043|, main_#t~post3=|v_main_#t~post3_461|, main_~n~0=v_main_~n~0_209} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {50295#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 16))) main_~n~0) (<= main_~n~0 main_~i~0) (not (< 15 main_~m~0)) (not (<= main_~m~0 16))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:29:27,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {50306#(and (or (<= (div (+ (- 100) main_~k~0) (- 16)) 1) (<= (div (+ (- 100) main_~k~0) (- 16)) main_~n~0)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {50302#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 16))) main_~n~0) (<= main_~n~0 main_~i~0) (not (< 15 main_~m~0)) (not (<= main_~m~0 16))) (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 2))) main_~n~0) (not (< 1 main_~m~0)) (<= (div (+ (- 100) main_~k~0) (- 2)) 1) (not (<= main_~m~0 2))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:29:27,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {50310#(<= (div (+ (- 100) main_~k~0) (- 16)) 10)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {50306#(and (or (<= (div (+ (- 100) main_~k~0) (- 16)) 1) (<= (div (+ (- 100) main_~k~0) (- 16)) main_~n~0)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} is VALID [2022-04-28 03:29:27,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {50210#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {50310#(<= (div (+ (- 100) main_~k~0) (- 16)) 10)} is VALID [2022-04-28 03:29:27,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {50210#true} call #t~ret6 := main(); {50210#true} is VALID [2022-04-28 03:29:27,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50210#true} {50210#true} #71#return; {50210#true} is VALID [2022-04-28 03:29:27,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {50210#true} assume true; {50210#true} is VALID [2022-04-28 03:29:27,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {50210#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); {50210#true} is VALID [2022-04-28 03:29:27,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {50210#true} call ULTIMATE.init(); {50210#true} is VALID [2022-04-28 03:29:27,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:29:27,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60488868] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:29:27,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:29:27,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 23 [2022-04-28 03:29:29,235 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:29:29,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1150884009] [2022-04-28 03:29:29,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1150884009] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:29:29,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:29:29,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-28 03:29:29,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952111613] [2022-04-28 03:29:29,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:29:29,236 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 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 55 [2022-04-28 03:29:29,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:29:29,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 49 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:29,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:29:29,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-28 03:29:29,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:29:29,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-28 03:29:29,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=591, Invalid=3315, Unknown=0, NotChecked=0, Total=3906 [2022-04-28 03:29:29,273 INFO L87 Difference]: Start difference. First operand 389 states and 494 transitions. Second operand has 49 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:35,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:29:35,690 INFO L93 Difference]: Finished difference Result 405 states and 512 transitions. [2022-04-28 03:29:35,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-28 03:29:35,690 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 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 55 [2022-04-28 03:29:35,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:29:35,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:35,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 83 transitions. [2022-04-28 03:29:35,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:35,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 83 transitions. [2022-04-28 03:29:35,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 83 transitions. [2022-04-28 03:29:35,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:29:35,757 INFO L225 Difference]: With dead ends: 405 [2022-04-28 03:29:35,757 INFO L226 Difference]: Without dead ends: 396 [2022-04-28 03:29:35,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2791 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1189, Invalid=9941, Unknown=0, NotChecked=0, Total=11130 [2022-04-28 03:29:35,758 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 31 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 2675 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 2708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:29:35,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 230 Invalid, 2708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2675 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-28 03:29:35,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-04-28 03:29:37,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 391. [2022-04-28 03:29:37,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:29:37,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 396 states. Second operand has 391 states, 386 states have (on average 1.2746113989637307) internal successors, (492), 386 states have internal predecessors, (492), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:37,522 INFO L74 IsIncluded]: Start isIncluded. First operand 396 states. Second operand has 391 states, 386 states have (on average 1.2746113989637307) internal successors, (492), 386 states have internal predecessors, (492), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:37,522 INFO L87 Difference]: Start difference. First operand 396 states. Second operand has 391 states, 386 states have (on average 1.2746113989637307) internal successors, (492), 386 states have internal predecessors, (492), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:37,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:29:37,528 INFO L93 Difference]: Finished difference Result 396 states and 501 transitions. [2022-04-28 03:29:37,528 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 501 transitions. [2022-04-28 03:29:37,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:29:37,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:29:37,528 INFO L74 IsIncluded]: Start isIncluded. First operand has 391 states, 386 states have (on average 1.2746113989637307) internal successors, (492), 386 states have internal predecessors, (492), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 396 states. [2022-04-28 03:29:37,528 INFO L87 Difference]: Start difference. First operand has 391 states, 386 states have (on average 1.2746113989637307) internal successors, (492), 386 states have internal predecessors, (492), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 396 states. [2022-04-28 03:29:37,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:29:37,534 INFO L93 Difference]: Finished difference Result 396 states and 501 transitions. [2022-04-28 03:29:37,534 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 501 transitions. [2022-04-28 03:29:37,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:29:37,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:29:37,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:29:37,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:29:37,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 386 states have (on average 1.2746113989637307) internal successors, (492), 386 states have internal predecessors, (492), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:37,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 496 transitions. [2022-04-28 03:29:37,541 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 496 transitions. Word has length 55 [2022-04-28 03:29:37,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:29:37,541 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 496 transitions. [2022-04-28 03:29:37,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:37,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 391 states and 496 transitions. [2022-04-28 03:29:39,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 496 edges. 496 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:29:39,171 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 496 transitions. [2022-04-28 03:29:39,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 03:29:39,171 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:29:39,172 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:29:39,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-28 03:29:39,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-04-28 03:29:39,374 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:29:39,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:29:39,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1876562228, now seen corresponding path program 40 times [2022-04-28 03:29:39,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:29:39,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1822274195] [2022-04-28 03:29:39,546 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:29:42,194 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:29:43,044 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:29:43,108 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:29:43,109 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:29:43,111 INFO L85 PathProgramCache]: Analyzing trace with hash 2065225921, now seen corresponding path program 1 times [2022-04-28 03:29:43,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:29:43,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886945939] [2022-04-28 03:29:43,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:29:43,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:29:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:29:43,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:29:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:29:43,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {52854#(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); {52841#true} is VALID [2022-04-28 03:29:43,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {52841#true} assume true; {52841#true} is VALID [2022-04-28 03:29:43,212 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52841#true} {52841#true} #71#return; {52841#true} is VALID [2022-04-28 03:29:43,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {52841#true} call ULTIMATE.init(); {52854#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:29:43,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {52854#(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); {52841#true} is VALID [2022-04-28 03:29:43,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {52841#true} assume true; {52841#true} is VALID [2022-04-28 03:29:43,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52841#true} {52841#true} #71#return; {52841#true} is VALID [2022-04-28 03:29:43,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {52841#true} call #t~ret6 := main(); {52841#true} is VALID [2022-04-28 03:29:43,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {52841#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {52846#(= main_~k~0 0)} is VALID [2022-04-28 03:29:43,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {52846#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {52847#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:29:43,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {52847#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {52848#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:29:43,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {52848#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} [195] L31-3-->L31-4_primed: Formula: (let ((.cse1 (< 17 v_main_~m~0_414)) (.cse0 (<= v_main_~m~0_414 18)) (.cse2 (= |v_main_#t~post3_478| |v_main_#t~post3_476|)) (.cse3 (= v_main_~j~0_1925 v_main_~j~0_1905)) (.cse4 (= v_main_~i~0_644 v_main_~i~0_643)) (.cse5 (= v_main_~k~0_1746 v_main_~k~0_1728)) (.cse6 (= |v_main_#t~post4_1098| |v_main_#t~post4_1080|))) (or (and (= v_main_~j~0_1905 18) (= (+ (* 18 v_main_~i~0_643) v_main_~k~0_1746) (+ (* 18 v_main_~i~0_644) v_main_~k~0_1728)) (< v_main_~i~0_643 (+ 1 v_main_~n~0_215)) .cse0 .cse1 (< v_main_~i~0_644 v_main_~i~0_643)) (and .cse2 (= v_main_~m~0_414 v_main_~m~0_414) (= |v_main_#t~post5_1098| |v_main_#t~post5_1080|) .cse3 .cse4 .cse5 .cse6 (= v_main_~n~0_215 v_main_~n~0_215)) (and (or (not (< v_main_~i~0_644 v_main_~n~0_215)) (not .cse1) (not .cse0)) .cse2 (= |v_main_#t~post5_1080| |v_main_#t~post5_1098|) .cse3 .cse4 .cse5 .cse6))) InVars {main_~m~0=v_main_~m~0_414, main_~k~0=v_main_~k~0_1746, main_~j~0=v_main_~j~0_1925, main_~i~0=v_main_~i~0_644, main_#t~post4=|v_main_#t~post4_1098|, main_#t~post5=|v_main_#t~post5_1098|, main_~n~0=v_main_~n~0_215, main_#t~post3=|v_main_#t~post3_478|} OutVars{main_~m~0=v_main_~m~0_414, main_~k~0=v_main_~k~0_1728, main_~j~0=v_main_~j~0_1905, main_~i~0=v_main_~i~0_643, main_#t~post4=|v_main_#t~post4_1080|, main_#t~post5=|v_main_#t~post5_1080|, main_#t~post3=|v_main_#t~post3_476|, main_~n~0=v_main_~n~0_215} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {52849#(and (<= 10 main_~m~0) (or (<= (+ (* main_~i~0 18) 180) (+ main_~k~0 (* main_~n~0 18))) (<= (+ main_~i~0 10) main_~n~0)))} is VALID [2022-04-28 03:29:43,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {52849#(and (<= 10 main_~m~0) (or (<= (+ (* main_~i~0 18) 180) (+ main_~k~0 (* main_~n~0 18))) (<= (+ main_~i~0 10) main_~n~0)))} [196] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52849#(and (<= 10 main_~m~0) (or (<= (+ (* main_~i~0 18) 180) (+ main_~k~0 (* main_~n~0 18))) (<= (+ main_~i~0 10) main_~n~0)))} is VALID [2022-04-28 03:29:43,216 INFO L290 TraceCheckUtils]: 10: Hoare triple {52849#(and (<= 10 main_~m~0) (or (<= (+ (* main_~i~0 18) 180) (+ main_~k~0 (* main_~n~0 18))) (<= (+ main_~i~0 10) main_~n~0)))} [197] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_646 v_main_~i~0_645)) (.cse1 (<= v_main_~m~0_415 0))) (or (and .cse0 (= |v_main_#t~post3_481| |v_main_#t~post3_477|) (= v_main_~m~0_415 v_main_~m~0_415) (= v_main_~n~0_216 v_main_~n~0_216) (= v_main_~j~0_1928 v_main_~j~0_1924)) (and (= v_main_~j~0_1924 0) (< v_main_~i~0_645 (+ 1 v_main_~n~0_216)) (< v_main_~i~0_646 v_main_~i~0_645) .cse1) (and (= |v_main_#t~post3_477| |v_main_#t~post3_481|) .cse0 (or (not (< v_main_~i~0_646 v_main_~n~0_216)) (not .cse1)) (= v_main_~j~0_1924 v_main_~j~0_1928)))) InVars {main_~i~0=v_main_~i~0_646, main_~n~0=v_main_~n~0_216, main_#t~post3=|v_main_#t~post3_481|, main_~m~0=v_main_~m~0_415, main_~j~0=v_main_~j~0_1928} OutVars{main_~i~0=v_main_~i~0_645, main_#t~post3=|v_main_#t~post3_477|, main_~n~0=v_main_~n~0_216, main_~m~0=v_main_~m~0_415, main_~j~0=v_main_~j~0_1924} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post3] {52850#(or (<= (+ (* main_~i~0 18) 180) (+ main_~k~0 (* main_~n~0 18))) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:29:43,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {52850#(or (<= (+ (* main_~i~0 18) 180) (+ main_~k~0 (* main_~n~0 18))) (<= (+ main_~i~0 10) main_~n~0))} [194] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {52851#(<= 180 main_~k~0)} is VALID [2022-04-28 03:29:43,217 INFO L272 TraceCheckUtils]: 12: Hoare triple {52851#(<= 180 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {52852#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:29:43,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {52852#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {52853#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:29:43,217 INFO L290 TraceCheckUtils]: 14: Hoare triple {52853#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {52842#false} is VALID [2022-04-28 03:29:43,217 INFO L290 TraceCheckUtils]: 15: Hoare triple {52842#false} assume !false; {52842#false} is VALID [2022-04-28 03:29:43,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:29:43,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:29:43,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886945939] [2022-04-28 03:29:43,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886945939] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:29:43,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908794240] [2022-04-28 03:29:43,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:29:43,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:29:43,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:29:43,219 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:29:43,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 03:29:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:29:43,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:29:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:29:43,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:29:43,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {52841#true} call ULTIMATE.init(); {52841#true} is VALID [2022-04-28 03:29:43,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {52841#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); {52841#true} is VALID [2022-04-28 03:29:43,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {52841#true} assume true; {52841#true} is VALID [2022-04-28 03:29:43,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52841#true} {52841#true} #71#return; {52841#true} is VALID [2022-04-28 03:29:43,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {52841#true} call #t~ret6 := main(); {52841#true} is VALID [2022-04-28 03:29:43,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {52841#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {52873#(<= 0 main_~k~0)} is VALID [2022-04-28 03:29:43,784 INFO L290 TraceCheckUtils]: 6: Hoare triple {52873#(<= 0 main_~k~0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {52877#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} is VALID [2022-04-28 03:29:43,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {52877#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {52881#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:29:43,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {52881#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [195] L31-3-->L31-4_primed: Formula: (let ((.cse1 (< 17 v_main_~m~0_414)) (.cse0 (<= v_main_~m~0_414 18)) (.cse2 (= |v_main_#t~post3_478| |v_main_#t~post3_476|)) (.cse3 (= v_main_~j~0_1925 v_main_~j~0_1905)) (.cse4 (= v_main_~i~0_644 v_main_~i~0_643)) (.cse5 (= v_main_~k~0_1746 v_main_~k~0_1728)) (.cse6 (= |v_main_#t~post4_1098| |v_main_#t~post4_1080|))) (or (and (= v_main_~j~0_1905 18) (= (+ (* 18 v_main_~i~0_643) v_main_~k~0_1746) (+ (* 18 v_main_~i~0_644) v_main_~k~0_1728)) (< v_main_~i~0_643 (+ 1 v_main_~n~0_215)) .cse0 .cse1 (< v_main_~i~0_644 v_main_~i~0_643)) (and .cse2 (= v_main_~m~0_414 v_main_~m~0_414) (= |v_main_#t~post5_1098| |v_main_#t~post5_1080|) .cse3 .cse4 .cse5 .cse6 (= v_main_~n~0_215 v_main_~n~0_215)) (and (or (not (< v_main_~i~0_644 v_main_~n~0_215)) (not .cse1) (not .cse0)) .cse2 (= |v_main_#t~post5_1080| |v_main_#t~post5_1098|) .cse3 .cse4 .cse5 .cse6))) InVars {main_~m~0=v_main_~m~0_414, main_~k~0=v_main_~k~0_1746, main_~j~0=v_main_~j~0_1925, main_~i~0=v_main_~i~0_644, main_#t~post4=|v_main_#t~post4_1098|, main_#t~post5=|v_main_#t~post5_1098|, main_~n~0=v_main_~n~0_215, main_#t~post3=|v_main_#t~post3_478|} OutVars{main_~m~0=v_main_~m~0_414, main_~k~0=v_main_~k~0_1728, main_~j~0=v_main_~j~0_1905, main_~i~0=v_main_~i~0_643, main_#t~post4=|v_main_#t~post4_1080|, main_#t~post5=|v_main_#t~post5_1080|, main_#t~post3=|v_main_#t~post3_476|, main_~n~0=v_main_~n~0_215} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {52885#(and (or (and (<= main_~m~0 18) (< (div main_~k~0 (- 18)) 0) (= main_~j~0 18) (< 17 main_~m~0) (<= (+ (div main_~k~0 (- 18)) main_~i~0) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))) (<= 10 main_~n~0) (<= 10 main_~m~0))} is VALID [2022-04-28 03:29:43,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {52885#(and (or (and (<= main_~m~0 18) (< (div main_~k~0 (- 18)) 0) (= main_~j~0 18) (< 17 main_~m~0) (<= (+ (div main_~k~0 (- 18)) main_~i~0) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))) (<= 10 main_~n~0) (<= 10 main_~m~0))} [196] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52885#(and (or (and (<= main_~m~0 18) (< (div main_~k~0 (- 18)) 0) (= main_~j~0 18) (< 17 main_~m~0) (<= (+ (div main_~k~0 (- 18)) main_~i~0) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))) (<= 10 main_~n~0) (<= 10 main_~m~0))} is VALID [2022-04-28 03:29:43,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {52885#(and (or (and (<= main_~m~0 18) (< (div main_~k~0 (- 18)) 0) (= main_~j~0 18) (< 17 main_~m~0) (<= (+ (div main_~k~0 (- 18)) main_~i~0) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))) (<= 10 main_~n~0) (<= 10 main_~m~0))} [197] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_646 v_main_~i~0_645)) (.cse1 (<= v_main_~m~0_415 0))) (or (and .cse0 (= |v_main_#t~post3_481| |v_main_#t~post3_477|) (= v_main_~m~0_415 v_main_~m~0_415) (= v_main_~n~0_216 v_main_~n~0_216) (= v_main_~j~0_1928 v_main_~j~0_1924)) (and (= v_main_~j~0_1924 0) (< v_main_~i~0_645 (+ 1 v_main_~n~0_216)) (< v_main_~i~0_646 v_main_~i~0_645) .cse1) (and (= |v_main_#t~post3_477| |v_main_#t~post3_481|) .cse0 (or (not (< v_main_~i~0_646 v_main_~n~0_216)) (not .cse1)) (= v_main_~j~0_1924 v_main_~j~0_1928)))) InVars {main_~i~0=v_main_~i~0_646, main_~n~0=v_main_~n~0_216, main_#t~post3=|v_main_#t~post3_481|, main_~m~0=v_main_~m~0_415, main_~j~0=v_main_~j~0_1928} OutVars{main_~i~0=v_main_~i~0_645, main_#t~post3=|v_main_#t~post3_477|, main_~n~0=v_main_~n~0_216, main_~m~0=v_main_~m~0_415, main_~j~0=v_main_~j~0_1924} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post3] {52892#(and (<= 10 main_~n~0) (or (and (< (div main_~k~0 (- 18)) 0) (<= (+ (div main_~k~0 (- 18)) main_~i~0) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:29:43,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {52892#(and (<= 10 main_~n~0) (or (and (< (div main_~k~0 (- 18)) 0) (<= (+ (div main_~k~0 (- 18)) main_~i~0) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [194] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {52851#(<= 180 main_~k~0)} is VALID [2022-04-28 03:29:43,788 INFO L272 TraceCheckUtils]: 12: Hoare triple {52851#(<= 180 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {52899#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:29:43,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {52899#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {52903#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:29:43,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {52903#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {52842#false} is VALID [2022-04-28 03:29:43,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {52842#false} assume !false; {52842#false} is VALID [2022-04-28 03:29:43,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:29:43,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:29:44,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {52842#false} assume !false; {52842#false} is VALID [2022-04-28 03:29:44,395 INFO L290 TraceCheckUtils]: 14: Hoare triple {52903#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {52842#false} is VALID [2022-04-28 03:29:44,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {52899#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {52903#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:29:44,395 INFO L272 TraceCheckUtils]: 12: Hoare triple {52919#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {52899#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:29:44,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {52923#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} [194] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {52919#(<= 100 main_~k~0)} is VALID [2022-04-28 03:29:44,397 INFO L290 TraceCheckUtils]: 10: Hoare triple {52927#(or (<= 100 main_~k~0) (and (< main_~i~0 main_~n~0) (not (<= main_~m~0 0))))} [197] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_646 v_main_~i~0_645)) (.cse1 (<= v_main_~m~0_415 0))) (or (and .cse0 (= |v_main_#t~post3_481| |v_main_#t~post3_477|) (= v_main_~m~0_415 v_main_~m~0_415) (= v_main_~n~0_216 v_main_~n~0_216) (= v_main_~j~0_1928 v_main_~j~0_1924)) (and (= v_main_~j~0_1924 0) (< v_main_~i~0_645 (+ 1 v_main_~n~0_216)) (< v_main_~i~0_646 v_main_~i~0_645) .cse1) (and (= |v_main_#t~post3_477| |v_main_#t~post3_481|) .cse0 (or (not (< v_main_~i~0_646 v_main_~n~0_216)) (not .cse1)) (= v_main_~j~0_1924 v_main_~j~0_1928)))) InVars {main_~i~0=v_main_~i~0_646, main_~n~0=v_main_~n~0_216, main_#t~post3=|v_main_#t~post3_481|, main_~m~0=v_main_~m~0_415, main_~j~0=v_main_~j~0_1928} OutVars{main_~i~0=v_main_~i~0_645, main_#t~post3=|v_main_#t~post3_477|, main_~n~0=v_main_~n~0_216, main_~m~0=v_main_~m~0_415, main_~j~0=v_main_~j~0_1924} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post3] {52923#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} is VALID [2022-04-28 03:29:44,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {52927#(or (<= 100 main_~k~0) (and (< main_~i~0 main_~n~0) (not (<= main_~m~0 0))))} [196] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52927#(or (<= 100 main_~k~0) (and (< main_~i~0 main_~n~0) (not (<= main_~m~0 0))))} is VALID [2022-04-28 03:29:44,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {52934#(and (or (not (<= main_~m~0 18)) (<= (div (+ (- 100) main_~k~0) (- 18)) 1) (not (< 17 main_~m~0)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 18))) main_~n~0)) (or (<= 100 main_~k~0) (and (< main_~i~0 main_~n~0) (not (<= main_~m~0 0)))))} [195] L31-3-->L31-4_primed: Formula: (let ((.cse1 (< 17 v_main_~m~0_414)) (.cse0 (<= v_main_~m~0_414 18)) (.cse2 (= |v_main_#t~post3_478| |v_main_#t~post3_476|)) (.cse3 (= v_main_~j~0_1925 v_main_~j~0_1905)) (.cse4 (= v_main_~i~0_644 v_main_~i~0_643)) (.cse5 (= v_main_~k~0_1746 v_main_~k~0_1728)) (.cse6 (= |v_main_#t~post4_1098| |v_main_#t~post4_1080|))) (or (and (= v_main_~j~0_1905 18) (= (+ (* 18 v_main_~i~0_643) v_main_~k~0_1746) (+ (* 18 v_main_~i~0_644) v_main_~k~0_1728)) (< v_main_~i~0_643 (+ 1 v_main_~n~0_215)) .cse0 .cse1 (< v_main_~i~0_644 v_main_~i~0_643)) (and .cse2 (= v_main_~m~0_414 v_main_~m~0_414) (= |v_main_#t~post5_1098| |v_main_#t~post5_1080|) .cse3 .cse4 .cse5 .cse6 (= v_main_~n~0_215 v_main_~n~0_215)) (and (or (not (< v_main_~i~0_644 v_main_~n~0_215)) (not .cse1) (not .cse0)) .cse2 (= |v_main_#t~post5_1080| |v_main_#t~post5_1098|) .cse3 .cse4 .cse5 .cse6))) InVars {main_~m~0=v_main_~m~0_414, main_~k~0=v_main_~k~0_1746, main_~j~0=v_main_~j~0_1925, main_~i~0=v_main_~i~0_644, main_#t~post4=|v_main_#t~post4_1098|, main_#t~post5=|v_main_#t~post5_1098|, main_~n~0=v_main_~n~0_215, main_#t~post3=|v_main_#t~post3_478|} OutVars{main_~m~0=v_main_~m~0_414, main_~k~0=v_main_~k~0_1728, main_~j~0=v_main_~j~0_1905, main_~i~0=v_main_~i~0_643, main_#t~post4=|v_main_#t~post4_1080|, main_#t~post5=|v_main_#t~post5_1080|, main_#t~post3=|v_main_#t~post3_476|, main_~n~0=v_main_~n~0_215} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {52927#(or (<= 100 main_~k~0) (and (< main_~i~0 main_~n~0) (not (<= main_~m~0 0))))} is VALID [2022-04-28 03:29:44,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {52938#(and (or (<= (div (+ (- 100) main_~k~0) (- 18)) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 18)) 1)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {52934#(and (or (not (<= main_~m~0 18)) (<= (div (+ (- 100) main_~k~0) (- 18)) 1) (not (< 17 main_~m~0)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 18))) main_~n~0)) (or (<= 100 main_~k~0) (and (< main_~i~0 main_~n~0) (not (<= main_~m~0 0)))))} is VALID [2022-04-28 03:29:44,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {52942#(<= (div (+ (- 100) main_~k~0) (- 18)) 10)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {52938#(and (or (<= (div (+ (- 100) main_~k~0) (- 18)) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 18)) 1)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} is VALID [2022-04-28 03:29:44,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {52841#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {52942#(<= (div (+ (- 100) main_~k~0) (- 18)) 10)} is VALID [2022-04-28 03:29:44,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {52841#true} call #t~ret6 := main(); {52841#true} is VALID [2022-04-28 03:29:44,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52841#true} {52841#true} #71#return; {52841#true} is VALID [2022-04-28 03:29:44,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {52841#true} assume true; {52841#true} is VALID [2022-04-28 03:29:44,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {52841#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); {52841#true} is VALID [2022-04-28 03:29:44,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {52841#true} call ULTIMATE.init(); {52841#true} is VALID [2022-04-28 03:29:44,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:29:44,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908794240] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:29:44,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:29:44,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2022-04-28 03:29:47,366 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:29:47,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1822274195] [2022-04-28 03:29:47,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1822274195] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:29:47,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:29:47,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-28 03:29:47,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564314362] [2022-04-28 03:29:47,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:29:47,367 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 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 55 [2022-04-28 03:29:47,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:29:47,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 49 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:47,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:29:47,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-28 03:29:47,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:29:47,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-28 03:29:47,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=3541, Unknown=0, NotChecked=0, Total=4160 [2022-04-28 03:29:47,419 INFO L87 Difference]: Start difference. First operand 391 states and 496 transitions. Second operand has 49 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:56,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:29:56,757 INFO L93 Difference]: Finished difference Result 415 states and 522 transitions. [2022-04-28 03:29:56,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-28 03:29:56,758 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 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 55 [2022-04-28 03:29:56,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:29:56,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:56,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 98 transitions. [2022-04-28 03:29:56,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:56,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 98 transitions. [2022-04-28 03:29:56,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 98 transitions. [2022-04-28 03:29:56,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:29:56,857 INFO L225 Difference]: With dead ends: 415 [2022-04-28 03:29:56,857 INFO L226 Difference]: Without dead ends: 406 [2022-04-28 03:29:56,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2439 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1194, Invalid=9936, Unknown=0, NotChecked=0, Total=11130 [2022-04-28 03:29:56,858 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 31 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 2759 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 2860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:29:56,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 235 Invalid, 2860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2759 Invalid, 0 Unknown, 55 Unchecked, 2.8s Time] [2022-04-28 03:29:56,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2022-04-28 03:29:58,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 391. [2022-04-28 03:29:58,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:29:58,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 406 states. Second operand has 391 states, 386 states have (on average 1.2487046632124352) internal successors, (482), 386 states have internal predecessors, (482), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:58,667 INFO L74 IsIncluded]: Start isIncluded. First operand 406 states. Second operand has 391 states, 386 states have (on average 1.2487046632124352) internal successors, (482), 386 states have internal predecessors, (482), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:58,667 INFO L87 Difference]: Start difference. First operand 406 states. Second operand has 391 states, 386 states have (on average 1.2487046632124352) internal successors, (482), 386 states have internal predecessors, (482), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:58,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:29:58,673 INFO L93 Difference]: Finished difference Result 406 states and 502 transitions. [2022-04-28 03:29:58,673 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 502 transitions. [2022-04-28 03:29:58,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:29:58,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:29:58,673 INFO L74 IsIncluded]: Start isIncluded. First operand has 391 states, 386 states have (on average 1.2487046632124352) internal successors, (482), 386 states have internal predecessors, (482), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 406 states. [2022-04-28 03:29:58,673 INFO L87 Difference]: Start difference. First operand has 391 states, 386 states have (on average 1.2487046632124352) internal successors, (482), 386 states have internal predecessors, (482), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 406 states. [2022-04-28 03:29:58,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:29:58,679 INFO L93 Difference]: Finished difference Result 406 states and 502 transitions. [2022-04-28 03:29:58,679 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 502 transitions. [2022-04-28 03:29:58,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:29:58,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:29:58,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:29:58,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:29:58,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 386 states have (on average 1.2487046632124352) internal successors, (482), 386 states have internal predecessors, (482), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:58,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 486 transitions. [2022-04-28 03:29:58,686 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 486 transitions. Word has length 55 [2022-04-28 03:29:58,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:29:58,686 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 486 transitions. [2022-04-28 03:29:58,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:29:58,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 391 states and 486 transitions. [2022-04-28 03:30:00,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 486 edges. 486 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:30:00,273 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 486 transitions. [2022-04-28 03:30:00,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-28 03:30:00,273 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:30:00,273 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:30:00,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-28 03:30:00,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:30:00,474 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:30:00,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:30:00,474 INFO L85 PathProgramCache]: Analyzing trace with hash -2132883631, now seen corresponding path program 41 times [2022-04-28 03:30:00,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:30:00,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [428487209] [2022-04-28 03:30:00,609 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:30:01,342 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:30:01,343 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:30:01,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1409482910, now seen corresponding path program 1 times [2022-04-28 03:30:01,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:30:01,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49742228] [2022-04-28 03:30:01,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:30:01,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:30:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:30:01,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:30:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:30:01,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {55522#(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); {55510#true} is VALID [2022-04-28 03:30:01,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {55510#true} assume true; {55510#true} is VALID [2022-04-28 03:30:01,433 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55510#true} {55510#true} #71#return; {55510#true} is VALID [2022-04-28 03:30:01,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {55510#true} call ULTIMATE.init(); {55522#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:30:01,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {55522#(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); {55510#true} is VALID [2022-04-28 03:30:01,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {55510#true} assume true; {55510#true} is VALID [2022-04-28 03:30:01,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55510#true} {55510#true} #71#return; {55510#true} is VALID [2022-04-28 03:30:01,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {55510#true} call #t~ret6 := main(); {55510#true} is VALID [2022-04-28 03:30:01,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {55510#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {55515#(= main_~k~0 0)} is VALID [2022-04-28 03:30:01,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {55515#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {55516#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:30:01,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {55516#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {55517#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:30:01,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {55517#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [199] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_1131| |v_main_#t~post5_1111|)) (.cse3 (= |v_main_#t~post4_1131| |v_main_#t~post4_1111|)) (.cse4 (= v_main_~i~0_663 v_main_~i~0_662)) (.cse5 (= v_main_~j~0_1988 v_main_~j~0_1967)) (.cse1 (< 19 v_main_~m~0_424)) (.cse2 (<= v_main_~m~0_424 20))) (or (and .cse0 (or (not (< v_main_~i~0_663 v_main_~n~0_220)) (not .cse1) (not .cse2)) .cse3 .cse4 .cse5 (= v_main_~k~0_1781 v_main_~k~0_1801) (= |v_main_#t~post3_490| |v_main_#t~post3_491|)) (and .cse0 .cse3 (= v_main_~m~0_424 v_main_~m~0_424) .cse4 (= v_main_~k~0_1801 v_main_~k~0_1781) .cse5 (= v_main_~n~0_220 v_main_~n~0_220) (= |v_main_#t~post3_491| |v_main_#t~post3_490|)) (and (= (+ (* 20 v_main_~i~0_663) v_main_~k~0_1781) (+ (* 20 v_main_~i~0_662) v_main_~k~0_1801)) (< v_main_~i~0_662 (+ 1 v_main_~n~0_220)) (= v_main_~j~0_1967 20) (< v_main_~i~0_663 v_main_~i~0_662) .cse1 .cse2))) InVars {main_~m~0=v_main_~m~0_424, main_~k~0=v_main_~k~0_1801, main_~j~0=v_main_~j~0_1988, main_~i~0=v_main_~i~0_663, main_#t~post4=|v_main_#t~post4_1131|, main_#t~post5=|v_main_#t~post5_1131|, main_~n~0=v_main_~n~0_220, main_#t~post3=|v_main_#t~post3_491|} OutVars{main_~m~0=v_main_~m~0_424, main_~k~0=v_main_~k~0_1781, main_~j~0=v_main_~j~0_1967, main_~i~0=v_main_~i~0_662, main_#t~post4=|v_main_#t~post4_1111|, main_#t~post5=|v_main_#t~post5_1111|, main_#t~post3=|v_main_#t~post3_490|, main_~n~0=v_main_~n~0_220} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {55518#(or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ (* main_~i~0 20) 200) (+ main_~k~0 (* main_~n~0 20))))} is VALID [2022-04-28 03:30:01,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {55518#(or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ (* main_~i~0 20) 200) (+ main_~k~0 (* main_~n~0 20))))} [198] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {55519#(<= 200 main_~k~0)} is VALID [2022-04-28 03:30:01,436 INFO L272 TraceCheckUtils]: 10: Hoare triple {55519#(<= 200 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {55520#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:30:01,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {55520#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {55521#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:30:01,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {55521#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {55511#false} is VALID [2022-04-28 03:30:01,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {55511#false} assume !false; {55511#false} is VALID [2022-04-28 03:30:01,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:30:01,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:30:01,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49742228] [2022-04-28 03:30:01,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49742228] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:30:01,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:30:01,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:30:04,262 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:30:04,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [428487209] [2022-04-28 03:30:04,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [428487209] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:30:04,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:30:04,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-04-28 03:30:04,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94843780] [2022-04-28 03:30:04,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:30:04,263 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 50 states have internal predecessors, (52), 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 56 [2022-04-28 03:30:04,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:30:04,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 52 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 50 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:30:04,314 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 03:30:04,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-28 03:30:04,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:30:04,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-28 03:30:04,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2706, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 03:30:04,315 INFO L87 Difference]: Start difference. First operand 391 states and 486 transitions. Second operand has 52 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 50 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:30:17,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:30:17,405 INFO L93 Difference]: Finished difference Result 473 states and 592 transitions. [2022-04-28 03:30:17,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-28 03:30:17,405 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 50 states have internal predecessors, (52), 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 56 [2022-04-28 03:30:17,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:30:17,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 50 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:30:17,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 115 transitions. [2022-04-28 03:30:17,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 50 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:30:17,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 115 transitions. [2022-04-28 03:30:17,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 115 transitions. [2022-04-28 03:30:17,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:30:17,521 INFO L225 Difference]: With dead ends: 473 [2022-04-28 03:30:17,521 INFO L226 Difference]: Without dead ends: 468 [2022-04-28 03:30:17,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1760 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=425, Invalid=10287, Unknown=0, NotChecked=0, Total=10712 [2022-04-28 03:30:17,522 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 64 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 4535 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 4579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 4535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:30:17,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 250 Invalid, 4579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 4535 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-04-28 03:30:17,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-04-28 03:30:19,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 436. [2022-04-28 03:30:19,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:30:19,511 INFO L82 GeneralOperation]: Start isEquivalent. First operand 468 states. Second operand has 436 states, 431 states have (on average 1.2737819025522041) internal successors, (549), 431 states have internal predecessors, (549), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:30:19,511 INFO L74 IsIncluded]: Start isIncluded. First operand 468 states. Second operand has 436 states, 431 states have (on average 1.2737819025522041) internal successors, (549), 431 states have internal predecessors, (549), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:30:19,511 INFO L87 Difference]: Start difference. First operand 468 states. Second operand has 436 states, 431 states have (on average 1.2737819025522041) internal successors, (549), 431 states have internal predecessors, (549), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:30:19,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:30:19,518 INFO L93 Difference]: Finished difference Result 468 states and 587 transitions. [2022-04-28 03:30:19,518 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 587 transitions. [2022-04-28 03:30:19,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:30:19,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:30:19,519 INFO L74 IsIncluded]: Start isIncluded. First operand has 436 states, 431 states have (on average 1.2737819025522041) internal successors, (549), 431 states have internal predecessors, (549), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 468 states. [2022-04-28 03:30:19,519 INFO L87 Difference]: Start difference. First operand has 436 states, 431 states have (on average 1.2737819025522041) internal successors, (549), 431 states have internal predecessors, (549), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 468 states. [2022-04-28 03:30:19,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:30:19,526 INFO L93 Difference]: Finished difference Result 468 states and 587 transitions. [2022-04-28 03:30:19,526 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 587 transitions. [2022-04-28 03:30:19,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:30:19,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:30:19,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:30:19,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:30:19,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 431 states have (on average 1.2737819025522041) internal successors, (549), 431 states have internal predecessors, (549), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:30:19,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 553 transitions. [2022-04-28 03:30:19,537 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 553 transitions. Word has length 56 [2022-04-28 03:30:19,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:30:19,538 INFO L495 AbstractCegarLoop]: Abstraction has 436 states and 553 transitions. [2022-04-28 03:30:19,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 50 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:30:19,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 436 states and 553 transitions. [2022-04-28 03:30:21,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 553 edges. 553 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:30:21,498 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 553 transitions. [2022-04-28 03:30:21,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-28 03:30:21,498 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:30:21,498 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:30:21,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-04-28 03:30:21,498 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:30:21,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:30:21,499 INFO L85 PathProgramCache]: Analyzing trace with hash 839992926, now seen corresponding path program 42 times [2022-04-28 03:30:21,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:30:21,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [138281488] [2022-04-28 03:30:25,733 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:30:25,889 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:30:26,059 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:30:26,410 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:30:28,789 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:30:28,791 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:30:28,795 INFO L85 PathProgramCache]: Analyzing trace with hash 844556865, now seen corresponding path program 1 times [2022-04-28 03:30:28,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:30:28,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049864201] [2022-04-28 03:30:28,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:30:28,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:30:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:30:28,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:30:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:30:28,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {58436#(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); {58423#true} is VALID [2022-04-28 03:30:28,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {58423#true} assume true; {58423#true} is VALID [2022-04-28 03:30:28,886 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58423#true} {58423#true} #71#return; {58423#true} is VALID [2022-04-28 03:30:28,886 INFO L272 TraceCheckUtils]: 0: Hoare triple {58423#true} call ULTIMATE.init(); {58436#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:30:28,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {58436#(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); {58423#true} is VALID [2022-04-28 03:30:28,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {58423#true} assume true; {58423#true} is VALID [2022-04-28 03:30:28,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58423#true} {58423#true} #71#return; {58423#true} is VALID [2022-04-28 03:30:28,887 INFO L272 TraceCheckUtils]: 4: Hoare triple {58423#true} call #t~ret6 := main(); {58423#true} is VALID [2022-04-28 03:30:28,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {58423#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {58428#(= main_~k~0 0)} is VALID [2022-04-28 03:30:28,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {58428#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {58429#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:30:28,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {58429#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {58430#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:30:28,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {58430#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} [201] L31-3-->L31-4_primed: Formula: (let ((.cse2 (= |v_main_#t~post3_504| |v_main_#t~post3_502|)) (.cse3 (= v_main_~j~0_2053 v_main_~j~0_2032)) (.cse4 (= v_main_~k~0_1846 v_main_~k~0_1842)) (.cse0 (< 3 v_main_~m~0_436)) (.cse1 (<= v_main_~m~0_436 4)) (.cse5 (= v_main_~i~0_679 v_main_~i~0_678)) (.cse6 (= |v_main_#t~post5_1167| |v_main_#t~post5_1148|)) (.cse7 (= |v_main_#t~post4_1167| |v_main_#t~post4_1148|))) (or (and (= v_main_~j~0_2032 4) (= (+ (* 4 v_main_~i~0_679) v_main_~k~0_1842) (+ (* 4 v_main_~i~0_678) v_main_~k~0_1846)) .cse0 .cse1 (< v_main_~i~0_679 v_main_~i~0_678) (< v_main_~i~0_678 (+ 1 v_main_~n~0_227))) (and (= v_main_~m~0_436 v_main_~m~0_436) .cse2 .cse3 (= v_main_~n~0_227 v_main_~n~0_227) .cse4 .cse5 .cse6 .cse7) (and .cse2 .cse3 .cse4 (or (not (< v_main_~i~0_679 v_main_~n~0_227)) (not .cse0) (not .cse1)) .cse5 .cse6 .cse7))) InVars {main_~m~0=v_main_~m~0_436, main_~k~0=v_main_~k~0_1846, main_~j~0=v_main_~j~0_2053, main_~i~0=v_main_~i~0_679, main_#t~post4=|v_main_#t~post4_1167|, main_#t~post5=|v_main_#t~post5_1167|, main_~n~0=v_main_~n~0_227, main_#t~post3=|v_main_#t~post3_504|} OutVars{main_~m~0=v_main_~m~0_436, main_~k~0=v_main_~k~0_1842, main_~j~0=v_main_~j~0_2032, main_~i~0=v_main_~i~0_678, main_#t~post4=|v_main_#t~post4_1148|, main_#t~post5=|v_main_#t~post5_1148|, main_#t~post3=|v_main_#t~post3_502|, main_~n~0=v_main_~n~0_227} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {58431#(and (<= (+ (* main_~i~0 15) 150) (+ main_~k~0 (* main_~n~0 15))) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:30:28,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {58431#(and (<= (+ (* main_~i~0 15) 150) (+ main_~k~0 (* main_~n~0 15))) (<= (+ main_~i~0 10) main_~n~0))} [202] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {58431#(and (<= (+ (* main_~i~0 15) 150) (+ main_~k~0 (* main_~n~0 15))) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:30:28,890 INFO L290 TraceCheckUtils]: 10: Hoare triple {58431#(and (<= (+ (* main_~i~0 15) 150) (+ main_~k~0 (* main_~n~0 15))) (<= (+ main_~i~0 10) main_~n~0))} [203] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= v_main_~j~0_2056 v_main_~j~0_2037)) (.cse1 (= v_main_~k~0_1862 v_main_~k~0_1847)) (.cse2 (= |v_main_#t~post4_1170| |v_main_#t~post4_1152|)) (.cse3 (= |v_main_#t~post5_1170| |v_main_#t~post5_1152|)) (.cse4 (= |v_main_#t~post3_507| |v_main_#t~post3_503|)) (.cse5 (= v_main_~i~0_681 v_main_~i~0_680)) (.cse7 (< 14 v_main_~m~0_437)) (.cse6 (<= v_main_~m~0_437 15))) (or (and .cse0 .cse1 .cse2 (= v_main_~m~0_437 v_main_~m~0_437) .cse3 .cse4 .cse5 (= v_main_~n~0_228 v_main_~n~0_228)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (or (not .cse6) (not (< v_main_~i~0_681 v_main_~n~0_228)) (not .cse7))) (and (< v_main_~i~0_681 v_main_~i~0_680) .cse7 (= v_main_~j~0_2037 15) (= (+ v_main_~k~0_1862 (* 15 v_main_~i~0_680)) (+ (* 15 v_main_~i~0_681) v_main_~k~0_1847)) .cse6 (< v_main_~i~0_680 (+ 1 v_main_~n~0_228))))) InVars {main_~m~0=v_main_~m~0_437, main_~k~0=v_main_~k~0_1862, main_~j~0=v_main_~j~0_2056, main_~i~0=v_main_~i~0_681, main_#t~post4=|v_main_#t~post4_1170|, main_#t~post5=|v_main_#t~post5_1170|, main_~n~0=v_main_~n~0_228, main_#t~post3=|v_main_#t~post3_507|} OutVars{main_~m~0=v_main_~m~0_437, main_~k~0=v_main_~k~0_1847, main_~j~0=v_main_~j~0_2037, main_~i~0=v_main_~i~0_680, main_#t~post4=|v_main_#t~post4_1152|, main_#t~post5=|v_main_#t~post5_1152|, main_#t~post3=|v_main_#t~post3_503|, main_~n~0=v_main_~n~0_228} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {58432#(or (<= (+ (* main_~i~0 15) 150) (+ main_~k~0 (* main_~n~0 15))) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:30:28,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {58432#(or (<= (+ (* main_~i~0 15) 150) (+ main_~k~0 (* main_~n~0 15))) (<= (+ main_~i~0 10) main_~n~0))} [200] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {58433#(<= 150 main_~k~0)} is VALID [2022-04-28 03:30:28,891 INFO L272 TraceCheckUtils]: 12: Hoare triple {58433#(<= 150 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {58434#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:30:28,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {58434#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {58435#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:30:28,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {58435#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {58424#false} is VALID [2022-04-28 03:30:28,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {58424#false} assume !false; {58424#false} is VALID [2022-04-28 03:30:28,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:30:28,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:30:28,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049864201] [2022-04-28 03:30:28,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049864201] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:30:28,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873037457] [2022-04-28 03:30:28,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:30:28,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:30:28,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:30:28,895 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:30:28,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 03:30:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:30:28,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:30:28,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:30:28,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:30:29,407 INFO L272 TraceCheckUtils]: 0: Hoare triple {58423#true} call ULTIMATE.init(); {58423#true} is VALID [2022-04-28 03:30:29,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {58423#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); {58423#true} is VALID [2022-04-28 03:30:29,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {58423#true} assume true; {58423#true} is VALID [2022-04-28 03:30:29,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58423#true} {58423#true} #71#return; {58423#true} is VALID [2022-04-28 03:30:29,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {58423#true} call #t~ret6 := main(); {58423#true} is VALID [2022-04-28 03:30:29,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {58423#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {58455#(<= 0 main_~k~0)} is VALID [2022-04-28 03:30:29,408 INFO L290 TraceCheckUtils]: 6: Hoare triple {58455#(<= 0 main_~k~0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {58459#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} is VALID [2022-04-28 03:30:29,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {58459#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {58463#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:30:29,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {58463#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [201] L31-3-->L31-4_primed: Formula: (let ((.cse2 (= |v_main_#t~post3_504| |v_main_#t~post3_502|)) (.cse3 (= v_main_~j~0_2053 v_main_~j~0_2032)) (.cse4 (= v_main_~k~0_1846 v_main_~k~0_1842)) (.cse0 (< 3 v_main_~m~0_436)) (.cse1 (<= v_main_~m~0_436 4)) (.cse5 (= v_main_~i~0_679 v_main_~i~0_678)) (.cse6 (= |v_main_#t~post5_1167| |v_main_#t~post5_1148|)) (.cse7 (= |v_main_#t~post4_1167| |v_main_#t~post4_1148|))) (or (and (= v_main_~j~0_2032 4) (= (+ (* 4 v_main_~i~0_679) v_main_~k~0_1842) (+ (* 4 v_main_~i~0_678) v_main_~k~0_1846)) .cse0 .cse1 (< v_main_~i~0_679 v_main_~i~0_678) (< v_main_~i~0_678 (+ 1 v_main_~n~0_227))) (and (= v_main_~m~0_436 v_main_~m~0_436) .cse2 .cse3 (= v_main_~n~0_227 v_main_~n~0_227) .cse4 .cse5 .cse6 .cse7) (and .cse2 .cse3 .cse4 (or (not (< v_main_~i~0_679 v_main_~n~0_227)) (not .cse0) (not .cse1)) .cse5 .cse6 .cse7))) InVars {main_~m~0=v_main_~m~0_436, main_~k~0=v_main_~k~0_1846, main_~j~0=v_main_~j~0_2053, main_~i~0=v_main_~i~0_679, main_#t~post4=|v_main_#t~post4_1167|, main_#t~post5=|v_main_#t~post5_1167|, main_~n~0=v_main_~n~0_227, main_#t~post3=|v_main_#t~post3_504|} OutVars{main_~m~0=v_main_~m~0_436, main_~k~0=v_main_~k~0_1842, main_~j~0=v_main_~j~0_2032, main_~i~0=v_main_~i~0_678, main_#t~post4=|v_main_#t~post4_1148|, main_#t~post5=|v_main_#t~post5_1148|, main_#t~post3=|v_main_#t~post3_502|, main_~n~0=v_main_~n~0_227} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {58463#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:30:29,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {58463#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [202] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {58463#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:30:29,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {58463#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [203] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= v_main_~j~0_2056 v_main_~j~0_2037)) (.cse1 (= v_main_~k~0_1862 v_main_~k~0_1847)) (.cse2 (= |v_main_#t~post4_1170| |v_main_#t~post4_1152|)) (.cse3 (= |v_main_#t~post5_1170| |v_main_#t~post5_1152|)) (.cse4 (= |v_main_#t~post3_507| |v_main_#t~post3_503|)) (.cse5 (= v_main_~i~0_681 v_main_~i~0_680)) (.cse7 (< 14 v_main_~m~0_437)) (.cse6 (<= v_main_~m~0_437 15))) (or (and .cse0 .cse1 .cse2 (= v_main_~m~0_437 v_main_~m~0_437) .cse3 .cse4 .cse5 (= v_main_~n~0_228 v_main_~n~0_228)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (or (not .cse6) (not (< v_main_~i~0_681 v_main_~n~0_228)) (not .cse7))) (and (< v_main_~i~0_681 v_main_~i~0_680) .cse7 (= v_main_~j~0_2037 15) (= (+ v_main_~k~0_1862 (* 15 v_main_~i~0_680)) (+ (* 15 v_main_~i~0_681) v_main_~k~0_1847)) .cse6 (< v_main_~i~0_680 (+ 1 v_main_~n~0_228))))) InVars {main_~m~0=v_main_~m~0_437, main_~k~0=v_main_~k~0_1862, main_~j~0=v_main_~j~0_2056, main_~i~0=v_main_~i~0_681, main_#t~post4=|v_main_#t~post4_1170|, main_#t~post5=|v_main_#t~post5_1170|, main_~n~0=v_main_~n~0_228, main_#t~post3=|v_main_#t~post3_507|} OutVars{main_~m~0=v_main_~m~0_437, main_~k~0=v_main_~k~0_1847, main_~j~0=v_main_~j~0_2037, main_~i~0=v_main_~i~0_680, main_#t~post4=|v_main_#t~post4_1152|, main_#t~post5=|v_main_#t~post5_1152|, main_#t~post3=|v_main_#t~post3_503|, main_~n~0=v_main_~n~0_228} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {58473#(and (<= 10 main_~n~0) (or (and (<= (+ (div main_~k~0 (- 15)) main_~i~0) 0) (< (div main_~k~0 (- 15)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:30:29,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {58473#(and (<= 10 main_~n~0) (or (and (<= (+ (div main_~k~0 (- 15)) main_~i~0) 0) (< (div main_~k~0 (- 15)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [200] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {58433#(<= 150 main_~k~0)} is VALID [2022-04-28 03:30:29,412 INFO L272 TraceCheckUtils]: 12: Hoare triple {58433#(<= 150 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {58480#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:30:29,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {58480#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {58484#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:30:29,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {58484#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {58424#false} is VALID [2022-04-28 03:30:29,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {58424#false} assume !false; {58424#false} is VALID [2022-04-28 03:30:29,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:30:29,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:30:30,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {58424#false} assume !false; {58424#false} is VALID [2022-04-28 03:30:30,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {58484#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {58424#false} is VALID [2022-04-28 03:30:30,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {58480#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {58484#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:30:30,132 INFO L272 TraceCheckUtils]: 12: Hoare triple {58500#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {58480#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:30:30,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {58504#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} [200] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {58500#(<= 100 main_~k~0)} is VALID [2022-04-28 03:30:30,134 INFO L290 TraceCheckUtils]: 10: Hoare triple {58508#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [203] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= v_main_~j~0_2056 v_main_~j~0_2037)) (.cse1 (= v_main_~k~0_1862 v_main_~k~0_1847)) (.cse2 (= |v_main_#t~post4_1170| |v_main_#t~post4_1152|)) (.cse3 (= |v_main_#t~post5_1170| |v_main_#t~post5_1152|)) (.cse4 (= |v_main_#t~post3_507| |v_main_#t~post3_503|)) (.cse5 (= v_main_~i~0_681 v_main_~i~0_680)) (.cse7 (< 14 v_main_~m~0_437)) (.cse6 (<= v_main_~m~0_437 15))) (or (and .cse0 .cse1 .cse2 (= v_main_~m~0_437 v_main_~m~0_437) .cse3 .cse4 .cse5 (= v_main_~n~0_228 v_main_~n~0_228)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (or (not .cse6) (not (< v_main_~i~0_681 v_main_~n~0_228)) (not .cse7))) (and (< v_main_~i~0_681 v_main_~i~0_680) .cse7 (= v_main_~j~0_2037 15) (= (+ v_main_~k~0_1862 (* 15 v_main_~i~0_680)) (+ (* 15 v_main_~i~0_681) v_main_~k~0_1847)) .cse6 (< v_main_~i~0_680 (+ 1 v_main_~n~0_228))))) InVars {main_~m~0=v_main_~m~0_437, main_~k~0=v_main_~k~0_1862, main_~j~0=v_main_~j~0_2056, main_~i~0=v_main_~i~0_681, main_#t~post4=|v_main_#t~post4_1170|, main_#t~post5=|v_main_#t~post5_1170|, main_~n~0=v_main_~n~0_228, main_#t~post3=|v_main_#t~post3_507|} OutVars{main_~m~0=v_main_~m~0_437, main_~k~0=v_main_~k~0_1847, main_~j~0=v_main_~j~0_2037, main_~i~0=v_main_~i~0_680, main_#t~post4=|v_main_#t~post4_1152|, main_#t~post5=|v_main_#t~post5_1152|, main_#t~post3=|v_main_#t~post3_503|, main_~n~0=v_main_~n~0_228} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {58504#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} is VALID [2022-04-28 03:30:30,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {58508#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [202] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {58508#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:30:30,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {58515#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (not (<= main_~m~0 4)) (<= main_~n~0 main_~i~0) (not (< 3 main_~m~0)) (<= (+ (div (+ (- 100) main_~k~0) (- 4)) main_~i~0) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [201] L31-3-->L31-4_primed: Formula: (let ((.cse2 (= |v_main_#t~post3_504| |v_main_#t~post3_502|)) (.cse3 (= v_main_~j~0_2053 v_main_~j~0_2032)) (.cse4 (= v_main_~k~0_1846 v_main_~k~0_1842)) (.cse0 (< 3 v_main_~m~0_436)) (.cse1 (<= v_main_~m~0_436 4)) (.cse5 (= v_main_~i~0_679 v_main_~i~0_678)) (.cse6 (= |v_main_#t~post5_1167| |v_main_#t~post5_1148|)) (.cse7 (= |v_main_#t~post4_1167| |v_main_#t~post4_1148|))) (or (and (= v_main_~j~0_2032 4) (= (+ (* 4 v_main_~i~0_679) v_main_~k~0_1842) (+ (* 4 v_main_~i~0_678) v_main_~k~0_1846)) .cse0 .cse1 (< v_main_~i~0_679 v_main_~i~0_678) (< v_main_~i~0_678 (+ 1 v_main_~n~0_227))) (and (= v_main_~m~0_436 v_main_~m~0_436) .cse2 .cse3 (= v_main_~n~0_227 v_main_~n~0_227) .cse4 .cse5 .cse6 .cse7) (and .cse2 .cse3 .cse4 (or (not (< v_main_~i~0_679 v_main_~n~0_227)) (not .cse0) (not .cse1)) .cse5 .cse6 .cse7))) InVars {main_~m~0=v_main_~m~0_436, main_~k~0=v_main_~k~0_1846, main_~j~0=v_main_~j~0_2053, main_~i~0=v_main_~i~0_679, main_#t~post4=|v_main_#t~post4_1167|, main_#t~post5=|v_main_#t~post5_1167|, main_~n~0=v_main_~n~0_227, main_#t~post3=|v_main_#t~post3_504|} OutVars{main_~m~0=v_main_~m~0_436, main_~k~0=v_main_~k~0_1842, main_~j~0=v_main_~j~0_2032, main_~i~0=v_main_~i~0_678, main_#t~post4=|v_main_#t~post4_1148|, main_#t~post5=|v_main_#t~post5_1148|, main_#t~post3=|v_main_#t~post3_502|, main_~n~0=v_main_~n~0_227} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {58508#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:30:30,136 INFO L290 TraceCheckUtils]: 7: Hoare triple {58519#(and (or (< 0 main_~n~0) (<= 100 main_~k~0)) (or (<= (div (+ (- 100) main_~k~0) (- 15)) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 15)) 1)))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {58515#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (not (<= main_~m~0 4)) (<= main_~n~0 main_~i~0) (not (< 3 main_~m~0)) (<= (+ (div (+ (- 100) main_~k~0) (- 4)) main_~i~0) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:30:30,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {58523#(<= (div (+ (- 100) main_~k~0) (- 15)) 10)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {58519#(and (or (< 0 main_~n~0) (<= 100 main_~k~0)) (or (<= (div (+ (- 100) main_~k~0) (- 15)) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 15)) 1)))} is VALID [2022-04-28 03:30:30,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {58423#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {58523#(<= (div (+ (- 100) main_~k~0) (- 15)) 10)} is VALID [2022-04-28 03:30:30,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {58423#true} call #t~ret6 := main(); {58423#true} is VALID [2022-04-28 03:30:30,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58423#true} {58423#true} #71#return; {58423#true} is VALID [2022-04-28 03:30:30,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {58423#true} assume true; {58423#true} is VALID [2022-04-28 03:30:30,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {58423#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); {58423#true} is VALID [2022-04-28 03:30:30,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {58423#true} call ULTIMATE.init(); {58423#true} is VALID [2022-04-28 03:30:30,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:30:30,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873037457] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:30:30,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:30:30,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 23 [2022-04-28 03:30:31,673 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:30:31,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [138281488] [2022-04-28 03:30:31,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [138281488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:30:31,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:30:31,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-04-28 03:30:31,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527827627] [2022-04-28 03:30:31,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:30:31,673 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 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 57 [2022-04-28 03:30:31,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:30:31,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 51 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:30:31,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:30:31,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-04-28 03:30:31,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:30:31,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-04-28 03:30:31,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=636, Invalid=3524, Unknown=0, NotChecked=0, Total=4160 [2022-04-28 03:30:31,711 INFO L87 Difference]: Start difference. First operand 436 states and 553 transitions. Second operand has 51 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:30:38,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:30:38,711 INFO L93 Difference]: Finished difference Result 452 states and 571 transitions. [2022-04-28 03:30:38,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-28 03:30:38,711 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 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 57 [2022-04-28 03:30:38,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:30:38,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:30:38,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 83 transitions. [2022-04-28 03:30:38,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:30:38,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 83 transitions. [2022-04-28 03:30:38,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 83 transitions. [2022-04-28 03:30:38,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:30:38,781 INFO L225 Difference]: With dead ends: 452 [2022-04-28 03:30:38,781 INFO L226 Difference]: Without dead ends: 443 [2022-04-28 03:30:38,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3112 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1289, Invalid=10701, Unknown=0, NotChecked=0, Total=11990 [2022-04-28 03:30:38,782 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 28 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 2857 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 2889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:30:38,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 245 Invalid, 2889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2857 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-28 03:30:38,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-04-28 03:30:40,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 438. [2022-04-28 03:30:40,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:30:40,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 443 states. Second operand has 438 states, 433 states have (on average 1.2725173210161662) internal successors, (551), 433 states have internal predecessors, (551), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:30:40,819 INFO L74 IsIncluded]: Start isIncluded. First operand 443 states. Second operand has 438 states, 433 states have (on average 1.2725173210161662) internal successors, (551), 433 states have internal predecessors, (551), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:30:40,819 INFO L87 Difference]: Start difference. First operand 443 states. Second operand has 438 states, 433 states have (on average 1.2725173210161662) internal successors, (551), 433 states have internal predecessors, (551), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:30:40,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:30:40,826 INFO L93 Difference]: Finished difference Result 443 states and 560 transitions. [2022-04-28 03:30:40,826 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 560 transitions. [2022-04-28 03:30:40,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:30:40,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:30:40,827 INFO L74 IsIncluded]: Start isIncluded. First operand has 438 states, 433 states have (on average 1.2725173210161662) internal successors, (551), 433 states have internal predecessors, (551), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 443 states. [2022-04-28 03:30:40,827 INFO L87 Difference]: Start difference. First operand has 438 states, 433 states have (on average 1.2725173210161662) internal successors, (551), 433 states have internal predecessors, (551), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 443 states. [2022-04-28 03:30:40,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:30:40,833 INFO L93 Difference]: Finished difference Result 443 states and 560 transitions. [2022-04-28 03:30:40,833 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 560 transitions. [2022-04-28 03:30:40,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:30:40,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:30:40,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:30:40,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:30:40,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 433 states have (on average 1.2725173210161662) internal successors, (551), 433 states have internal predecessors, (551), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:30:40,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 555 transitions. [2022-04-28 03:30:40,842 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 555 transitions. Word has length 57 [2022-04-28 03:30:40,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:30:40,842 INFO L495 AbstractCegarLoop]: Abstraction has 438 states and 555 transitions. [2022-04-28 03:30:40,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:30:40,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 438 states and 555 transitions. [2022-04-28 03:30:42,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 555 edges. 555 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:30:42,819 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 555 transitions. [2022-04-28 03:30:42,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-28 03:30:42,820 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:30:42,820 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:30:42,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 03:30:43,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:30:43,022 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:30:43,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:30:43,023 INFO L85 PathProgramCache]: Analyzing trace with hash 175334178, now seen corresponding path program 43 times [2022-04-28 03:30:43,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:30:43,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1296812524] [2022-04-28 03:30:43,376 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:30:43,525 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:30:44,921 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:30:45,143 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:30:45,144 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:30:45,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1400878271, now seen corresponding path program 1 times [2022-04-28 03:30:45,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:30:45,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217354118] [2022-04-28 03:30:45,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:30:45,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:30:45,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:30:45,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:30:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:30:45,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {61355#(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); {61342#true} is VALID [2022-04-28 03:30:45,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {61342#true} assume true; {61342#true} is VALID [2022-04-28 03:30:45,272 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61342#true} {61342#true} #71#return; {61342#true} is VALID [2022-04-28 03:30:45,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {61342#true} call ULTIMATE.init(); {61355#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:30:45,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {61355#(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); {61342#true} is VALID [2022-04-28 03:30:45,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {61342#true} assume true; {61342#true} is VALID [2022-04-28 03:30:45,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61342#true} {61342#true} #71#return; {61342#true} is VALID [2022-04-28 03:30:45,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {61342#true} call #t~ret6 := main(); {61342#true} is VALID [2022-04-28 03:30:45,273 INFO L290 TraceCheckUtils]: 5: Hoare triple {61342#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {61347#(= main_~k~0 0)} is VALID [2022-04-28 03:30:45,273 INFO L290 TraceCheckUtils]: 6: Hoare triple {61347#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {61348#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:30:45,274 INFO L290 TraceCheckUtils]: 7: Hoare triple {61348#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {61349#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:30:45,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {61349#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} [205] L31-3-->L31-4_primed: Formula: (let ((.cse1 (< 15 v_main_~m~0_451)) (.cse0 (<= v_main_~m~0_451 16)) (.cse2 (= v_main_~j~0_2126 v_main_~j~0_2105)) (.cse3 (= |v_main_#t~post4_1211| |v_main_#t~post4_1192|)) (.cse4 (= |v_main_#t~post3_525| |v_main_#t~post3_523|)) (.cse5 (= |v_main_#t~post5_1211| |v_main_#t~post5_1192|)) (.cse6 (= v_main_~i~0_707 v_main_~i~0_706))) (or (and .cse0 (< v_main_~i~0_706 (+ 1 v_main_~n~0_237)) (< v_main_~i~0_707 v_main_~i~0_706) .cse1 (= (+ (* 16 v_main_~i~0_706) v_main_~k~0_1927) (+ (* 16 v_main_~i~0_707) v_main_~k~0_1911)) (= 16 v_main_~j~0_2105)) (and .cse2 (= v_main_~k~0_1911 v_main_~k~0_1927) (or (not (< v_main_~i~0_707 v_main_~n~0_237)) (not .cse1) (not .cse0)) .cse3 .cse4 .cse5 .cse6) (and .cse2 (= v_main_~n~0_237 v_main_~n~0_237) (= v_main_~k~0_1927 v_main_~k~0_1911) .cse3 .cse4 (= v_main_~m~0_451 v_main_~m~0_451) .cse5 .cse6))) InVars {main_~m~0=v_main_~m~0_451, main_~k~0=v_main_~k~0_1927, main_~j~0=v_main_~j~0_2126, main_~i~0=v_main_~i~0_707, main_#t~post4=|v_main_#t~post4_1211|, main_#t~post5=|v_main_#t~post5_1211|, main_~n~0=v_main_~n~0_237, main_#t~post3=|v_main_#t~post3_525|} OutVars{main_~m~0=v_main_~m~0_451, main_~k~0=v_main_~k~0_1911, main_~j~0=v_main_~j~0_2105, main_~i~0=v_main_~i~0_706, main_#t~post4=|v_main_#t~post4_1192|, main_#t~post5=|v_main_#t~post5_1192|, main_#t~post3=|v_main_#t~post3_523|, main_~n~0=v_main_~n~0_237} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {61350#(and (<= 10 main_~m~0) (or (<= (+ 160 (* main_~i~0 16)) (+ main_~k~0 (* main_~n~0 16))) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:30:45,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {61350#(and (<= 10 main_~m~0) (or (<= (+ 160 (* main_~i~0 16)) (+ main_~k~0 (* main_~n~0 16))) (< main_~i~0 main_~n~0)))} [206] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {61350#(and (<= 10 main_~m~0) (or (<= (+ 160 (* main_~i~0 16)) (+ main_~k~0 (* main_~n~0 16))) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:30:45,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {61350#(and (<= 10 main_~m~0) (or (<= (+ 160 (* main_~i~0 16)) (+ main_~k~0 (* main_~n~0 16))) (< main_~i~0 main_~n~0)))} [207] L31-3-->L31-4_primed: Formula: (let ((.cse5 (<= v_main_~m~0_452 3)) (.cse4 (< 2 v_main_~m~0_452)) (.cse0 (= v_main_~j~0_2129 v_main_~j~0_2122)) (.cse1 (= |v_main_#t~post3_528| |v_main_#t~post3_524|)) (.cse2 (= v_main_~i~0_709 v_main_~i~0_708)) (.cse3 (= v_main_~k~0_1931 v_main_~k~0_1928))) (or (and .cse0 (= |v_main_#t~post4_1208| |v_main_#t~post4_1214|) .cse1 .cse2 (= |v_main_#t~post5_1208| |v_main_#t~post5_1214|) .cse3 (or (not .cse4) (not .cse5) (not (< v_main_~i~0_709 v_main_~n~0_238)))) (and .cse5 .cse4 (< v_main_~i~0_708 (+ 1 v_main_~n~0_238)) (= (+ (* 3 v_main_~i~0_708) v_main_~k~0_1931) (+ v_main_~k~0_1928 (* 3 v_main_~i~0_709))) (< v_main_~i~0_709 v_main_~i~0_708) (= 3 v_main_~j~0_2122)) (and .cse0 (= v_main_~m~0_452 v_main_~m~0_452) (= v_main_~n~0_238 v_main_~n~0_238) .cse1 (= |v_main_#t~post5_1214| |v_main_#t~post5_1208|) .cse2 .cse3 (= |v_main_#t~post4_1214| |v_main_#t~post4_1208|)))) InVars {main_~m~0=v_main_~m~0_452, main_~k~0=v_main_~k~0_1931, main_~j~0=v_main_~j~0_2129, main_~i~0=v_main_~i~0_709, main_#t~post4=|v_main_#t~post4_1214|, main_#t~post5=|v_main_#t~post5_1214|, main_~n~0=v_main_~n~0_238, main_#t~post3=|v_main_#t~post3_528|} OutVars{main_~m~0=v_main_~m~0_452, main_~k~0=v_main_~k~0_1928, main_~j~0=v_main_~j~0_2122, main_~i~0=v_main_~i~0_708, main_#t~post4=|v_main_#t~post4_1208|, main_#t~post5=|v_main_#t~post5_1208|, main_#t~post3=|v_main_#t~post3_524|, main_~n~0=v_main_~n~0_238} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {61351#(or (<= (+ main_~i~0 1) main_~n~0) (<= 160 main_~k~0))} is VALID [2022-04-28 03:30:45,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {61351#(or (<= (+ main_~i~0 1) main_~n~0) (<= 160 main_~k~0))} [204] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {61352#(<= 160 main_~k~0)} is VALID [2022-04-28 03:30:45,277 INFO L272 TraceCheckUtils]: 12: Hoare triple {61352#(<= 160 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {61353#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:30:45,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {61353#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {61354#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:30:45,277 INFO L290 TraceCheckUtils]: 14: Hoare triple {61354#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {61343#false} is VALID [2022-04-28 03:30:45,277 INFO L290 TraceCheckUtils]: 15: Hoare triple {61343#false} assume !false; {61343#false} is VALID [2022-04-28 03:30:45,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:30:45,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:30:45,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217354118] [2022-04-28 03:30:45,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217354118] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:30:45,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984553680] [2022-04-28 03:30:45,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:30:45,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:30:45,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:30:45,279 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:30:45,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-28 03:30:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:30:45,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:30:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:30:45,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:30:45,844 INFO L272 TraceCheckUtils]: 0: Hoare triple {61342#true} call ULTIMATE.init(); {61342#true} is VALID [2022-04-28 03:30:45,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {61342#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); {61342#true} is VALID [2022-04-28 03:30:45,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {61342#true} assume true; {61342#true} is VALID [2022-04-28 03:30:45,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61342#true} {61342#true} #71#return; {61342#true} is VALID [2022-04-28 03:30:45,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {61342#true} call #t~ret6 := main(); {61342#true} is VALID [2022-04-28 03:30:45,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {61342#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {61374#(<= 0 main_~k~0)} is VALID [2022-04-28 03:30:45,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {61374#(<= 0 main_~k~0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {61378#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} is VALID [2022-04-28 03:30:45,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {61378#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {61382#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:30:45,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {61382#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [205] L31-3-->L31-4_primed: Formula: (let ((.cse1 (< 15 v_main_~m~0_451)) (.cse0 (<= v_main_~m~0_451 16)) (.cse2 (= v_main_~j~0_2126 v_main_~j~0_2105)) (.cse3 (= |v_main_#t~post4_1211| |v_main_#t~post4_1192|)) (.cse4 (= |v_main_#t~post3_525| |v_main_#t~post3_523|)) (.cse5 (= |v_main_#t~post5_1211| |v_main_#t~post5_1192|)) (.cse6 (= v_main_~i~0_707 v_main_~i~0_706))) (or (and .cse0 (< v_main_~i~0_706 (+ 1 v_main_~n~0_237)) (< v_main_~i~0_707 v_main_~i~0_706) .cse1 (= (+ (* 16 v_main_~i~0_706) v_main_~k~0_1927) (+ (* 16 v_main_~i~0_707) v_main_~k~0_1911)) (= 16 v_main_~j~0_2105)) (and .cse2 (= v_main_~k~0_1911 v_main_~k~0_1927) (or (not (< v_main_~i~0_707 v_main_~n~0_237)) (not .cse1) (not .cse0)) .cse3 .cse4 .cse5 .cse6) (and .cse2 (= v_main_~n~0_237 v_main_~n~0_237) (= v_main_~k~0_1927 v_main_~k~0_1911) .cse3 .cse4 (= v_main_~m~0_451 v_main_~m~0_451) .cse5 .cse6))) InVars {main_~m~0=v_main_~m~0_451, main_~k~0=v_main_~k~0_1927, main_~j~0=v_main_~j~0_2126, main_~i~0=v_main_~i~0_707, main_#t~post4=|v_main_#t~post4_1211|, main_#t~post5=|v_main_#t~post5_1211|, main_~n~0=v_main_~n~0_237, main_#t~post3=|v_main_#t~post3_525|} OutVars{main_~m~0=v_main_~m~0_451, main_~k~0=v_main_~k~0_1911, main_~j~0=v_main_~j~0_2105, main_~i~0=v_main_~i~0_706, main_#t~post4=|v_main_#t~post4_1192|, main_#t~post5=|v_main_#t~post5_1192|, main_#t~post3=|v_main_#t~post3_523|, main_~n~0=v_main_~n~0_237} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {61386#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (or (and (= main_~j~0 16) (< 15 main_~m~0) (<= main_~m~0 16) (<= (+ (div main_~k~0 (- 16)) main_~i~0) 0) (< (div main_~k~0 (- 16)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:30:45,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {61386#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (or (and (= main_~j~0 16) (< 15 main_~m~0) (<= main_~m~0 16) (<= (+ (div main_~k~0 (- 16)) main_~i~0) 0) (< (div main_~k~0 (- 16)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [206] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {61386#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (or (and (= main_~j~0 16) (< 15 main_~m~0) (<= main_~m~0 16) (<= (+ (div main_~k~0 (- 16)) main_~i~0) 0) (< (div main_~k~0 (- 16)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:30:45,849 INFO L290 TraceCheckUtils]: 10: Hoare triple {61386#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (or (and (= main_~j~0 16) (< 15 main_~m~0) (<= main_~m~0 16) (<= (+ (div main_~k~0 (- 16)) main_~i~0) 0) (< (div main_~k~0 (- 16)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [207] L31-3-->L31-4_primed: Formula: (let ((.cse5 (<= v_main_~m~0_452 3)) (.cse4 (< 2 v_main_~m~0_452)) (.cse0 (= v_main_~j~0_2129 v_main_~j~0_2122)) (.cse1 (= |v_main_#t~post3_528| |v_main_#t~post3_524|)) (.cse2 (= v_main_~i~0_709 v_main_~i~0_708)) (.cse3 (= v_main_~k~0_1931 v_main_~k~0_1928))) (or (and .cse0 (= |v_main_#t~post4_1208| |v_main_#t~post4_1214|) .cse1 .cse2 (= |v_main_#t~post5_1208| |v_main_#t~post5_1214|) .cse3 (or (not .cse4) (not .cse5) (not (< v_main_~i~0_709 v_main_~n~0_238)))) (and .cse5 .cse4 (< v_main_~i~0_708 (+ 1 v_main_~n~0_238)) (= (+ (* 3 v_main_~i~0_708) v_main_~k~0_1931) (+ v_main_~k~0_1928 (* 3 v_main_~i~0_709))) (< v_main_~i~0_709 v_main_~i~0_708) (= 3 v_main_~j~0_2122)) (and .cse0 (= v_main_~m~0_452 v_main_~m~0_452) (= v_main_~n~0_238 v_main_~n~0_238) .cse1 (= |v_main_#t~post5_1214| |v_main_#t~post5_1208|) .cse2 .cse3 (= |v_main_#t~post4_1214| |v_main_#t~post4_1208|)))) InVars {main_~m~0=v_main_~m~0_452, main_~k~0=v_main_~k~0_1931, main_~j~0=v_main_~j~0_2129, main_~i~0=v_main_~i~0_709, main_#t~post4=|v_main_#t~post4_1214|, main_#t~post5=|v_main_#t~post5_1214|, main_~n~0=v_main_~n~0_238, main_#t~post3=|v_main_#t~post3_528|} OutVars{main_~m~0=v_main_~m~0_452, main_~k~0=v_main_~k~0_1928, main_~j~0=v_main_~j~0_2122, main_~i~0=v_main_~i~0_708, main_#t~post4=|v_main_#t~post4_1208|, main_#t~post5=|v_main_#t~post5_1208|, main_#t~post3=|v_main_#t~post3_524|, main_~n~0=v_main_~n~0_238} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {61393#(and (<= 10 main_~n~0) (or (and (<= (+ (div main_~k~0 (- 16)) main_~i~0) 0) (< (div main_~k~0 (- 16)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:30:45,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {61393#(and (<= 10 main_~n~0) (or (and (<= (+ (div main_~k~0 (- 16)) main_~i~0) 0) (< (div main_~k~0 (- 16)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [204] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {61352#(<= 160 main_~k~0)} is VALID [2022-04-28 03:30:45,850 INFO L272 TraceCheckUtils]: 12: Hoare triple {61352#(<= 160 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {61400#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:30:45,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {61400#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {61404#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:30:45,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {61404#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {61343#false} is VALID [2022-04-28 03:30:45,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {61343#false} assume !false; {61343#false} is VALID [2022-04-28 03:30:45,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:30:45,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:30:46,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {61343#false} assume !false; {61343#false} is VALID [2022-04-28 03:30:46,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {61404#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {61343#false} is VALID [2022-04-28 03:30:46,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {61400#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {61404#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:30:46,588 INFO L272 TraceCheckUtils]: 12: Hoare triple {61420#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {61400#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:30:46,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {61424#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} [204] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {61420#(<= 100 main_~k~0)} is VALID [2022-04-28 03:30:46,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {61428#(and (or (not (<= main_~m~0 3)) (<= (+ (div (+ (- 100) main_~k~0) (- 3)) main_~i~0) main_~n~0) (not (< 2 main_~m~0)) (<= (div (+ (- 100) main_~k~0) (- 3)) 1)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [207] L31-3-->L31-4_primed: Formula: (let ((.cse5 (<= v_main_~m~0_452 3)) (.cse4 (< 2 v_main_~m~0_452)) (.cse0 (= v_main_~j~0_2129 v_main_~j~0_2122)) (.cse1 (= |v_main_#t~post3_528| |v_main_#t~post3_524|)) (.cse2 (= v_main_~i~0_709 v_main_~i~0_708)) (.cse3 (= v_main_~k~0_1931 v_main_~k~0_1928))) (or (and .cse0 (= |v_main_#t~post4_1208| |v_main_#t~post4_1214|) .cse1 .cse2 (= |v_main_#t~post5_1208| |v_main_#t~post5_1214|) .cse3 (or (not .cse4) (not .cse5) (not (< v_main_~i~0_709 v_main_~n~0_238)))) (and .cse5 .cse4 (< v_main_~i~0_708 (+ 1 v_main_~n~0_238)) (= (+ (* 3 v_main_~i~0_708) v_main_~k~0_1931) (+ v_main_~k~0_1928 (* 3 v_main_~i~0_709))) (< v_main_~i~0_709 v_main_~i~0_708) (= 3 v_main_~j~0_2122)) (and .cse0 (= v_main_~m~0_452 v_main_~m~0_452) (= v_main_~n~0_238 v_main_~n~0_238) .cse1 (= |v_main_#t~post5_1214| |v_main_#t~post5_1208|) .cse2 .cse3 (= |v_main_#t~post4_1214| |v_main_#t~post4_1208|)))) InVars {main_~m~0=v_main_~m~0_452, main_~k~0=v_main_~k~0_1931, main_~j~0=v_main_~j~0_2129, main_~i~0=v_main_~i~0_709, main_#t~post4=|v_main_#t~post4_1214|, main_#t~post5=|v_main_#t~post5_1214|, main_~n~0=v_main_~n~0_238, main_#t~post3=|v_main_#t~post3_528|} OutVars{main_~m~0=v_main_~m~0_452, main_~k~0=v_main_~k~0_1928, main_~j~0=v_main_~j~0_2122, main_~i~0=v_main_~i~0_708, main_#t~post4=|v_main_#t~post4_1208|, main_#t~post5=|v_main_#t~post5_1208|, main_#t~post3=|v_main_#t~post3_524|, main_~n~0=v_main_~n~0_238} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {61424#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} is VALID [2022-04-28 03:30:46,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {61428#(and (or (not (<= main_~m~0 3)) (<= (+ (div (+ (- 100) main_~k~0) (- 3)) main_~i~0) main_~n~0) (not (< 2 main_~m~0)) (<= (div (+ (- 100) main_~k~0) (- 3)) 1)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [206] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {61428#(and (or (not (<= main_~m~0 3)) (<= (+ (div (+ (- 100) main_~k~0) (- 3)) main_~i~0) main_~n~0) (not (< 2 main_~m~0)) (<= (div (+ (- 100) main_~k~0) (- 3)) 1)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:30:46,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {61435#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 16))) main_~n~0) (<= main_~n~0 main_~i~0) (not (< 15 main_~m~0)) (not (<= main_~m~0 16))) (or (not (<= main_~m~0 3)) (<= (+ (div (+ (- 100) main_~k~0) (- 3)) main_~i~0) main_~n~0) (not (< 2 main_~m~0)) (<= (div (+ (- 100) main_~k~0) (- 3)) 1)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [205] L31-3-->L31-4_primed: Formula: (let ((.cse1 (< 15 v_main_~m~0_451)) (.cse0 (<= v_main_~m~0_451 16)) (.cse2 (= v_main_~j~0_2126 v_main_~j~0_2105)) (.cse3 (= |v_main_#t~post4_1211| |v_main_#t~post4_1192|)) (.cse4 (= |v_main_#t~post3_525| |v_main_#t~post3_523|)) (.cse5 (= |v_main_#t~post5_1211| |v_main_#t~post5_1192|)) (.cse6 (= v_main_~i~0_707 v_main_~i~0_706))) (or (and .cse0 (< v_main_~i~0_706 (+ 1 v_main_~n~0_237)) (< v_main_~i~0_707 v_main_~i~0_706) .cse1 (= (+ (* 16 v_main_~i~0_706) v_main_~k~0_1927) (+ (* 16 v_main_~i~0_707) v_main_~k~0_1911)) (= 16 v_main_~j~0_2105)) (and .cse2 (= v_main_~k~0_1911 v_main_~k~0_1927) (or (not (< v_main_~i~0_707 v_main_~n~0_237)) (not .cse1) (not .cse0)) .cse3 .cse4 .cse5 .cse6) (and .cse2 (= v_main_~n~0_237 v_main_~n~0_237) (= v_main_~k~0_1927 v_main_~k~0_1911) .cse3 .cse4 (= v_main_~m~0_451 v_main_~m~0_451) .cse5 .cse6))) InVars {main_~m~0=v_main_~m~0_451, main_~k~0=v_main_~k~0_1927, main_~j~0=v_main_~j~0_2126, main_~i~0=v_main_~i~0_707, main_#t~post4=|v_main_#t~post4_1211|, main_#t~post5=|v_main_#t~post5_1211|, main_~n~0=v_main_~n~0_237, main_#t~post3=|v_main_#t~post3_525|} OutVars{main_~m~0=v_main_~m~0_451, main_~k~0=v_main_~k~0_1911, main_~j~0=v_main_~j~0_2105, main_~i~0=v_main_~i~0_706, main_#t~post4=|v_main_#t~post4_1192|, main_#t~post5=|v_main_#t~post5_1192|, main_#t~post3=|v_main_#t~post3_523|, main_~n~0=v_main_~n~0_237} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {61428#(and (or (not (<= main_~m~0 3)) (<= (+ (div (+ (- 100) main_~k~0) (- 3)) main_~i~0) main_~n~0) (not (< 2 main_~m~0)) (<= (div (+ (- 100) main_~k~0) (- 3)) 1)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:30:46,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {61439#(and (or (<= (div (+ (- 100) main_~k~0) (- 16)) 1) (<= (div (+ (- 100) main_~k~0) (- 16)) main_~n~0)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {61435#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 16))) main_~n~0) (<= main_~n~0 main_~i~0) (not (< 15 main_~m~0)) (not (<= main_~m~0 16))) (or (not (<= main_~m~0 3)) (<= (+ (div (+ (- 100) main_~k~0) (- 3)) main_~i~0) main_~n~0) (not (< 2 main_~m~0)) (<= (div (+ (- 100) main_~k~0) (- 3)) 1)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:30:46,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {61443#(<= (div (+ (- 100) main_~k~0) (- 16)) 10)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {61439#(and (or (<= (div (+ (- 100) main_~k~0) (- 16)) 1) (<= (div (+ (- 100) main_~k~0) (- 16)) main_~n~0)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} is VALID [2022-04-28 03:30:46,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {61342#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {61443#(<= (div (+ (- 100) main_~k~0) (- 16)) 10)} is VALID [2022-04-28 03:30:46,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {61342#true} call #t~ret6 := main(); {61342#true} is VALID [2022-04-28 03:30:46,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61342#true} {61342#true} #71#return; {61342#true} is VALID [2022-04-28 03:30:46,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {61342#true} assume true; {61342#true} is VALID [2022-04-28 03:30:46,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {61342#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); {61342#true} is VALID [2022-04-28 03:30:46,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {61342#true} call ULTIMATE.init(); {61342#true} is VALID [2022-04-28 03:30:46,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:30:46,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984553680] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:30:46,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:30:46,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2022-04-28 03:30:49,436 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:30:49,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1296812524] [2022-04-28 03:30:49,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1296812524] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:30:49,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:30:49,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-04-28 03:30:49,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196803908] [2022-04-28 03:30:49,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:30:49,436 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 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 57 [2022-04-28 03:30:49,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:30:49,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 51 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:30:49,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:30:49,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-04-28 03:30:49,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:30:49,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-04-28 03:30:49,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=650, Invalid=3772, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 03:30:49,497 INFO L87 Difference]: Start difference. First operand 438 states and 555 transitions. Second operand has 51 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:30:58,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:30:58,455 INFO L93 Difference]: Finished difference Result 458 states and 576 transitions. [2022-04-28 03:30:58,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-28 03:30:58,455 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 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 57 [2022-04-28 03:30:58,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:30:58,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:30:58,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 94 transitions. [2022-04-28 03:30:58,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:30:58,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 94 transitions. [2022-04-28 03:30:58,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 94 transitions. [2022-04-28 03:30:58,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:30:58,550 INFO L225 Difference]: With dead ends: 458 [2022-04-28 03:30:58,550 INFO L226 Difference]: Without dead ends: 449 [2022-04-28 03:30:58,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2983 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1303, Invalid=11129, Unknown=0, NotChecked=0, Total=12432 [2022-04-28 03:30:58,551 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 33 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 2696 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 2739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:30:58,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 225 Invalid, 2739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2696 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 03:30:58,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2022-04-28 03:31:00,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 431. [2022-04-28 03:31:00,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:31:00,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 449 states. Second operand has 431 states, 426 states have (on average 1.2535211267605635) internal successors, (534), 426 states have internal predecessors, (534), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:31:00,551 INFO L74 IsIncluded]: Start isIncluded. First operand 449 states. Second operand has 431 states, 426 states have (on average 1.2535211267605635) internal successors, (534), 426 states have internal predecessors, (534), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:31:00,551 INFO L87 Difference]: Start difference. First operand 449 states. Second operand has 431 states, 426 states have (on average 1.2535211267605635) internal successors, (534), 426 states have internal predecessors, (534), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:31:00,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:31:00,558 INFO L93 Difference]: Finished difference Result 449 states and 556 transitions. [2022-04-28 03:31:00,558 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 556 transitions. [2022-04-28 03:31:00,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:31:00,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:31:00,559 INFO L74 IsIncluded]: Start isIncluded. First operand has 431 states, 426 states have (on average 1.2535211267605635) internal successors, (534), 426 states have internal predecessors, (534), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 449 states. [2022-04-28 03:31:00,559 INFO L87 Difference]: Start difference. First operand has 431 states, 426 states have (on average 1.2535211267605635) internal successors, (534), 426 states have internal predecessors, (534), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 449 states. [2022-04-28 03:31:00,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:31:00,565 INFO L93 Difference]: Finished difference Result 449 states and 556 transitions. [2022-04-28 03:31:00,565 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 556 transitions. [2022-04-28 03:31:00,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:31:00,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:31:00,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:31:00,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:31:00,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 426 states have (on average 1.2535211267605635) internal successors, (534), 426 states have internal predecessors, (534), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:31:00,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 538 transitions. [2022-04-28 03:31:00,573 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 538 transitions. Word has length 57 [2022-04-28 03:31:00,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:31:00,574 INFO L495 AbstractCegarLoop]: Abstraction has 431 states and 538 transitions. [2022-04-28 03:31:00,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:31:00,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 431 states and 538 transitions. [2022-04-28 03:31:02,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 538 edges. 538 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:31:02,472 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 538 transitions. [2022-04-28 03:31:02,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-28 03:31:02,473 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:31:02,473 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:31:02,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-28 03:31:02,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:31:02,673 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:31:02,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:31:02,673 INFO L85 PathProgramCache]: Analyzing trace with hash 103612270, now seen corresponding path program 44 times [2022-04-28 03:31:02,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:31:02,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1664047327] [2022-04-28 03:31:02,827 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:31:03,136 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:31:03,438 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:31:03,439 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:31:03,441 INFO L85 PathProgramCache]: Analyzing trace with hash 648653889, now seen corresponding path program 1 times [2022-04-28 03:31:03,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:31:03,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353043222] [2022-04-28 03:31:03,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:31:03,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:31:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:31:03,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:31:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:31:03,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {64286#(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); {64273#true} is VALID [2022-04-28 03:31:03,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {64273#true} assume true; {64273#true} is VALID [2022-04-28 03:31:03,542 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {64273#true} {64273#true} #71#return; {64273#true} is VALID [2022-04-28 03:31:03,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {64273#true} call ULTIMATE.init(); {64286#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:31:03,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {64286#(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); {64273#true} is VALID [2022-04-28 03:31:03,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {64273#true} assume true; {64273#true} is VALID [2022-04-28 03:31:03,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64273#true} {64273#true} #71#return; {64273#true} is VALID [2022-04-28 03:31:03,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {64273#true} call #t~ret6 := main(); {64273#true} is VALID [2022-04-28 03:31:03,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {64273#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {64278#(= main_~k~0 0)} is VALID [2022-04-28 03:31:03,545 INFO L290 TraceCheckUtils]: 6: Hoare triple {64278#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {64279#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:31:03,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {64279#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {64280#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:31:03,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {64280#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} [209] L31-3-->L31-4_primed: Formula: (let ((.cse2 (<= v_main_~m~0_462 0)) (.cse0 (= v_main_~i~0_728 v_main_~i~0_727)) (.cse1 (= v_main_~j~0_2192 v_main_~j~0_2171))) (or (and (= v_main_~n~0_243 v_main_~n~0_243) .cse0 (= v_main_~m~0_462 v_main_~m~0_462) .cse1 (= |v_main_#t~post3_540| |v_main_#t~post3_538|)) (and (< v_main_~i~0_727 (+ 1 v_main_~n~0_243)) .cse2 (= v_main_~j~0_2171 0) (< v_main_~i~0_728 v_main_~i~0_727)) (and (or (not .cse2) (not (< v_main_~i~0_728 v_main_~n~0_243))) (= |v_main_#t~post3_538| |v_main_#t~post3_540|) .cse0 .cse1))) InVars {main_~i~0=v_main_~i~0_728, main_~n~0=v_main_~n~0_243, main_#t~post3=|v_main_#t~post3_540|, main_~m~0=v_main_~m~0_462, main_~j~0=v_main_~j~0_2192} OutVars{main_~i~0=v_main_~i~0_727, main_#t~post3=|v_main_#t~post3_538|, main_~n~0=v_main_~n~0_243, main_~m~0=v_main_~m~0_462, main_~j~0=v_main_~j~0_2171} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post3] {64281#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:31:03,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {64281#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [210] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {64281#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:31:03,547 INFO L290 TraceCheckUtils]: 10: Hoare triple {64281#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [211] L31-3-->L31-4_primed: Formula: (let ((.cse0 (< 18 v_main_~m~0_463)) (.cse1 (<= v_main_~m~0_463 19)) (.cse2 (= v_main_~k~0_1992 v_main_~k~0_1973)) (.cse3 (= v_main_~j~0_2195 v_main_~j~0_2172)) (.cse4 (= |v_main_#t~post4_1249| |v_main_#t~post4_1230|)) (.cse5 (= |v_main_#t~post5_1249| |v_main_#t~post5_1230|))) (or (and (= 19 v_main_~j~0_2172) (= (+ (* 19 v_main_~i~0_730) v_main_~k~0_1973) (+ (* 19 v_main_~i~0_729) v_main_~k~0_1992)) .cse0 (< v_main_~i~0_729 (+ 1 v_main_~n~0_244)) .cse1 (< v_main_~i~0_730 v_main_~i~0_729)) (and .cse2 (= |v_main_#t~post3_539| |v_main_#t~post3_543|) .cse3 .cse4 (or (not .cse0) (not .cse1) (not (< v_main_~i~0_730 v_main_~n~0_244))) (= v_main_~i~0_729 v_main_~i~0_730) .cse5) (and (= v_main_~i~0_730 v_main_~i~0_729) (= |v_main_#t~post3_543| |v_main_#t~post3_539|) .cse2 .cse3 (= v_main_~n~0_244 v_main_~n~0_244) (= v_main_~m~0_463 v_main_~m~0_463) .cse4 .cse5))) InVars {main_~m~0=v_main_~m~0_463, main_~k~0=v_main_~k~0_1992, main_~j~0=v_main_~j~0_2195, main_~i~0=v_main_~i~0_730, main_#t~post4=|v_main_#t~post4_1249|, main_#t~post5=|v_main_#t~post5_1249|, main_~n~0=v_main_~n~0_244, main_#t~post3=|v_main_#t~post3_543|} OutVars{main_~m~0=v_main_~m~0_463, main_~k~0=v_main_~k~0_1973, main_~j~0=v_main_~j~0_2172, main_~i~0=v_main_~i~0_729, main_#t~post4=|v_main_#t~post4_1230|, main_#t~post5=|v_main_#t~post5_1230|, main_#t~post3=|v_main_#t~post3_539|, main_~n~0=v_main_~n~0_244} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {64282#(or (<= (+ 190 (* 19 main_~i~0)) (+ (* 19 main_~n~0) main_~k~0)) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:31:03,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {64282#(or (<= (+ 190 (* 19 main_~i~0)) (+ (* 19 main_~n~0) main_~k~0)) (<= (+ main_~i~0 10) main_~n~0))} [208] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {64283#(<= 190 main_~k~0)} is VALID [2022-04-28 03:31:03,548 INFO L272 TraceCheckUtils]: 12: Hoare triple {64283#(<= 190 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {64284#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:31:03,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {64284#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {64285#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:31:03,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {64285#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {64274#false} is VALID [2022-04-28 03:31:03,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {64274#false} assume !false; {64274#false} is VALID [2022-04-28 03:31:03,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:31:03,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:31:03,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353043222] [2022-04-28 03:31:03,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353043222] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:31:03,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586544979] [2022-04-28 03:31:03,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:31:03,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:31:03,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:31:03,550 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:31:03,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-28 03:31:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:31:03,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:31:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:31:03,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:31:04,018 INFO L272 TraceCheckUtils]: 0: Hoare triple {64273#true} call ULTIMATE.init(); {64273#true} is VALID [2022-04-28 03:31:04,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {64273#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); {64273#true} is VALID [2022-04-28 03:31:04,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {64273#true} assume true; {64273#true} is VALID [2022-04-28 03:31:04,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64273#true} {64273#true} #71#return; {64273#true} is VALID [2022-04-28 03:31:04,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {64273#true} call #t~ret6 := main(); {64273#true} is VALID [2022-04-28 03:31:04,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {64273#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {64305#(<= 0 main_~k~0)} is VALID [2022-04-28 03:31:04,019 INFO L290 TraceCheckUtils]: 6: Hoare triple {64305#(<= 0 main_~k~0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {64309#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} is VALID [2022-04-28 03:31:04,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {64309#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {64313#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:31:04,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {64313#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [209] L31-3-->L31-4_primed: Formula: (let ((.cse2 (<= v_main_~m~0_462 0)) (.cse0 (= v_main_~i~0_728 v_main_~i~0_727)) (.cse1 (= v_main_~j~0_2192 v_main_~j~0_2171))) (or (and (= v_main_~n~0_243 v_main_~n~0_243) .cse0 (= v_main_~m~0_462 v_main_~m~0_462) .cse1 (= |v_main_#t~post3_540| |v_main_#t~post3_538|)) (and (< v_main_~i~0_727 (+ 1 v_main_~n~0_243)) .cse2 (= v_main_~j~0_2171 0) (< v_main_~i~0_728 v_main_~i~0_727)) (and (or (not .cse2) (not (< v_main_~i~0_728 v_main_~n~0_243))) (= |v_main_#t~post3_538| |v_main_#t~post3_540|) .cse0 .cse1))) InVars {main_~i~0=v_main_~i~0_728, main_~n~0=v_main_~n~0_243, main_#t~post3=|v_main_#t~post3_540|, main_~m~0=v_main_~m~0_462, main_~j~0=v_main_~j~0_2192} OutVars{main_~i~0=v_main_~i~0_727, main_#t~post3=|v_main_#t~post3_538|, main_~n~0=v_main_~n~0_243, main_~m~0=v_main_~m~0_462, main_~j~0=v_main_~j~0_2171} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post3] {64313#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:31:04,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {64313#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [210] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {64313#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:31:04,021 INFO L290 TraceCheckUtils]: 10: Hoare triple {64313#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [211] L31-3-->L31-4_primed: Formula: (let ((.cse0 (< 18 v_main_~m~0_463)) (.cse1 (<= v_main_~m~0_463 19)) (.cse2 (= v_main_~k~0_1992 v_main_~k~0_1973)) (.cse3 (= v_main_~j~0_2195 v_main_~j~0_2172)) (.cse4 (= |v_main_#t~post4_1249| |v_main_#t~post4_1230|)) (.cse5 (= |v_main_#t~post5_1249| |v_main_#t~post5_1230|))) (or (and (= 19 v_main_~j~0_2172) (= (+ (* 19 v_main_~i~0_730) v_main_~k~0_1973) (+ (* 19 v_main_~i~0_729) v_main_~k~0_1992)) .cse0 (< v_main_~i~0_729 (+ 1 v_main_~n~0_244)) .cse1 (< v_main_~i~0_730 v_main_~i~0_729)) (and .cse2 (= |v_main_#t~post3_539| |v_main_#t~post3_543|) .cse3 .cse4 (or (not .cse0) (not .cse1) (not (< v_main_~i~0_730 v_main_~n~0_244))) (= v_main_~i~0_729 v_main_~i~0_730) .cse5) (and (= v_main_~i~0_730 v_main_~i~0_729) (= |v_main_#t~post3_543| |v_main_#t~post3_539|) .cse2 .cse3 (= v_main_~n~0_244 v_main_~n~0_244) (= v_main_~m~0_463 v_main_~m~0_463) .cse4 .cse5))) InVars {main_~m~0=v_main_~m~0_463, main_~k~0=v_main_~k~0_1992, main_~j~0=v_main_~j~0_2195, main_~i~0=v_main_~i~0_730, main_#t~post4=|v_main_#t~post4_1249|, main_#t~post5=|v_main_#t~post5_1249|, main_~n~0=v_main_~n~0_244, main_#t~post3=|v_main_#t~post3_543|} OutVars{main_~m~0=v_main_~m~0_463, main_~k~0=v_main_~k~0_1973, main_~j~0=v_main_~j~0_2172, main_~i~0=v_main_~i~0_729, main_#t~post4=|v_main_#t~post4_1230|, main_#t~post5=|v_main_#t~post5_1230|, main_#t~post3=|v_main_#t~post3_539|, main_~n~0=v_main_~n~0_244} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {64323#(and (<= 10 main_~n~0) (or (and (< (div main_~k~0 (- 19)) 0) (<= (+ (div main_~k~0 (- 19)) main_~i~0) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:31:04,022 INFO L290 TraceCheckUtils]: 11: Hoare triple {64323#(and (<= 10 main_~n~0) (or (and (< (div main_~k~0 (- 19)) 0) (<= (+ (div main_~k~0 (- 19)) main_~i~0) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [208] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {64283#(<= 190 main_~k~0)} is VALID [2022-04-28 03:31:04,022 INFO L272 TraceCheckUtils]: 12: Hoare triple {64283#(<= 190 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {64330#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:31:04,022 INFO L290 TraceCheckUtils]: 13: Hoare triple {64330#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {64334#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:31:04,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {64334#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {64274#false} is VALID [2022-04-28 03:31:04,023 INFO L290 TraceCheckUtils]: 15: Hoare triple {64274#false} assume !false; {64274#false} is VALID [2022-04-28 03:31:04,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:31:04,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:31:04,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {64274#false} assume !false; {64274#false} is VALID [2022-04-28 03:31:04,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {64334#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {64274#false} is VALID [2022-04-28 03:31:04,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {64330#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {64334#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:31:04,687 INFO L272 TraceCheckUtils]: 12: Hoare triple {64350#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {64330#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:31:04,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {64354#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} [208] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {64350#(<= 100 main_~k~0)} is VALID [2022-04-28 03:31:04,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {64358#(and (or (<= main_~n~0 main_~i~0) (<= (+ (div (+ (- 100) main_~k~0) (- 19)) main_~i~0) main_~n~0) (not (< 18 main_~m~0)) (not (<= main_~m~0 19))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [211] L31-3-->L31-4_primed: Formula: (let ((.cse0 (< 18 v_main_~m~0_463)) (.cse1 (<= v_main_~m~0_463 19)) (.cse2 (= v_main_~k~0_1992 v_main_~k~0_1973)) (.cse3 (= v_main_~j~0_2195 v_main_~j~0_2172)) (.cse4 (= |v_main_#t~post4_1249| |v_main_#t~post4_1230|)) (.cse5 (= |v_main_#t~post5_1249| |v_main_#t~post5_1230|))) (or (and (= 19 v_main_~j~0_2172) (= (+ (* 19 v_main_~i~0_730) v_main_~k~0_1973) (+ (* 19 v_main_~i~0_729) v_main_~k~0_1992)) .cse0 (< v_main_~i~0_729 (+ 1 v_main_~n~0_244)) .cse1 (< v_main_~i~0_730 v_main_~i~0_729)) (and .cse2 (= |v_main_#t~post3_539| |v_main_#t~post3_543|) .cse3 .cse4 (or (not .cse0) (not .cse1) (not (< v_main_~i~0_730 v_main_~n~0_244))) (= v_main_~i~0_729 v_main_~i~0_730) .cse5) (and (= v_main_~i~0_730 v_main_~i~0_729) (= |v_main_#t~post3_543| |v_main_#t~post3_539|) .cse2 .cse3 (= v_main_~n~0_244 v_main_~n~0_244) (= v_main_~m~0_463 v_main_~m~0_463) .cse4 .cse5))) InVars {main_~m~0=v_main_~m~0_463, main_~k~0=v_main_~k~0_1992, main_~j~0=v_main_~j~0_2195, main_~i~0=v_main_~i~0_730, main_#t~post4=|v_main_#t~post4_1249|, main_#t~post5=|v_main_#t~post5_1249|, main_~n~0=v_main_~n~0_244, main_#t~post3=|v_main_#t~post3_543|} OutVars{main_~m~0=v_main_~m~0_463, main_~k~0=v_main_~k~0_1973, main_~j~0=v_main_~j~0_2172, main_~i~0=v_main_~i~0_729, main_#t~post4=|v_main_#t~post4_1230|, main_#t~post5=|v_main_#t~post5_1230|, main_#t~post3=|v_main_#t~post3_539|, main_~n~0=v_main_~n~0_244} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {64354#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} is VALID [2022-04-28 03:31:04,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {64358#(and (or (<= main_~n~0 main_~i~0) (<= (+ (div (+ (- 100) main_~k~0) (- 19)) main_~i~0) main_~n~0) (not (< 18 main_~m~0)) (not (<= main_~m~0 19))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [210] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {64358#(and (or (<= main_~n~0 main_~i~0) (<= (+ (div (+ (- 100) main_~k~0) (- 19)) main_~i~0) main_~n~0) (not (< 18 main_~m~0)) (not (<= main_~m~0 19))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:31:04,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {64365#(and (or (<= main_~n~0 main_~i~0) (<= (+ (div (+ (- 100) main_~k~0) (- 19)) main_~i~0) main_~n~0) (not (< 18 main_~m~0)) (not (<= main_~m~0 19))) (or (<= 100 main_~k~0) (and (< main_~i~0 main_~n~0) (not (<= main_~m~0 0)))))} [209] L31-3-->L31-4_primed: Formula: (let ((.cse2 (<= v_main_~m~0_462 0)) (.cse0 (= v_main_~i~0_728 v_main_~i~0_727)) (.cse1 (= v_main_~j~0_2192 v_main_~j~0_2171))) (or (and (= v_main_~n~0_243 v_main_~n~0_243) .cse0 (= v_main_~m~0_462 v_main_~m~0_462) .cse1 (= |v_main_#t~post3_540| |v_main_#t~post3_538|)) (and (< v_main_~i~0_727 (+ 1 v_main_~n~0_243)) .cse2 (= v_main_~j~0_2171 0) (< v_main_~i~0_728 v_main_~i~0_727)) (and (or (not .cse2) (not (< v_main_~i~0_728 v_main_~n~0_243))) (= |v_main_#t~post3_538| |v_main_#t~post3_540|) .cse0 .cse1))) InVars {main_~i~0=v_main_~i~0_728, main_~n~0=v_main_~n~0_243, main_#t~post3=|v_main_#t~post3_540|, main_~m~0=v_main_~m~0_462, main_~j~0=v_main_~j~0_2192} OutVars{main_~i~0=v_main_~i~0_727, main_#t~post3=|v_main_#t~post3_538|, main_~n~0=v_main_~n~0_243, main_~m~0=v_main_~m~0_462, main_~j~0=v_main_~j~0_2171} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post3] {64358#(and (or (<= main_~n~0 main_~i~0) (<= (+ (div (+ (- 100) main_~k~0) (- 19)) main_~i~0) main_~n~0) (not (< 18 main_~m~0)) (not (<= main_~m~0 19))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:31:04,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {64369#(and (or (<= (div (+ (- 100) main_~k~0) (- 19)) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 19)) 1)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {64365#(and (or (<= main_~n~0 main_~i~0) (<= (+ (div (+ (- 100) main_~k~0) (- 19)) main_~i~0) main_~n~0) (not (< 18 main_~m~0)) (not (<= main_~m~0 19))) (or (<= 100 main_~k~0) (and (< main_~i~0 main_~n~0) (not (<= main_~m~0 0)))))} is VALID [2022-04-28 03:31:04,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {64373#(<= (div (+ (- 100) main_~k~0) (- 19)) 10)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {64369#(and (or (<= (div (+ (- 100) main_~k~0) (- 19)) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 19)) 1)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} is VALID [2022-04-28 03:31:04,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {64273#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {64373#(<= (div (+ (- 100) main_~k~0) (- 19)) 10)} is VALID [2022-04-28 03:31:04,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {64273#true} call #t~ret6 := main(); {64273#true} is VALID [2022-04-28 03:31:04,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64273#true} {64273#true} #71#return; {64273#true} is VALID [2022-04-28 03:31:04,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {64273#true} assume true; {64273#true} is VALID [2022-04-28 03:31:04,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {64273#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); {64273#true} is VALID [2022-04-28 03:31:04,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {64273#true} call ULTIMATE.init(); {64273#true} is VALID [2022-04-28 03:31:04,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:31:04,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586544979] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:31:04,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:31:04,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 23 [2022-04-28 03:31:06,286 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:31:06,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1664047327] [2022-04-28 03:31:06,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1664047327] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:31:06,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:31:06,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-04-28 03:31:06,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862476738] [2022-04-28 03:31:06,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:31:06,287 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 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 57 [2022-04-28 03:31:06,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:31:06,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 51 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:31:06,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:31:06,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-04-28 03:31:06,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:31:06,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-04-28 03:31:06,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=3541, Unknown=0, NotChecked=0, Total=4160 [2022-04-28 03:31:06,325 INFO L87 Difference]: Start difference. First operand 431 states and 538 transitions. Second operand has 51 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:31:13,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:31:13,930 INFO L93 Difference]: Finished difference Result 451 states and 560 transitions. [2022-04-28 03:31:13,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-28 03:31:13,930 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 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 57 [2022-04-28 03:31:13,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:31:13,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:31:13,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 91 transitions. [2022-04-28 03:31:13,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:31:13,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 91 transitions. [2022-04-28 03:31:13,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 91 transitions. [2022-04-28 03:31:13,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:31:14,006 INFO L225 Difference]: With dead ends: 451 [2022-04-28 03:31:14,006 INFO L226 Difference]: Without dead ends: 442 [2022-04-28 03:31:14,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2716 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1249, Invalid=10741, Unknown=0, NotChecked=0, Total=11990 [2022-04-28 03:31:14,007 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 37 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 3230 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 3266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 3230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:31:14,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 245 Invalid, 3266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 3230 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 03:31:14,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2022-04-28 03:31:16,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 434. [2022-04-28 03:31:16,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:31:16,076 INFO L82 GeneralOperation]: Start isEquivalent. First operand 442 states. Second operand has 434 states, 429 states have (on average 1.2517482517482517) internal successors, (537), 429 states have internal predecessors, (537), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:31:16,077 INFO L74 IsIncluded]: Start isIncluded. First operand 442 states. Second operand has 434 states, 429 states have (on average 1.2517482517482517) internal successors, (537), 429 states have internal predecessors, (537), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:31:16,077 INFO L87 Difference]: Start difference. First operand 442 states. Second operand has 434 states, 429 states have (on average 1.2517482517482517) internal successors, (537), 429 states have internal predecessors, (537), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:31:16,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:31:16,084 INFO L93 Difference]: Finished difference Result 442 states and 549 transitions. [2022-04-28 03:31:16,084 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 549 transitions. [2022-04-28 03:31:16,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:31:16,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:31:16,084 INFO L74 IsIncluded]: Start isIncluded. First operand has 434 states, 429 states have (on average 1.2517482517482517) internal successors, (537), 429 states have internal predecessors, (537), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 442 states. [2022-04-28 03:31:16,085 INFO L87 Difference]: Start difference. First operand has 434 states, 429 states have (on average 1.2517482517482517) internal successors, (537), 429 states have internal predecessors, (537), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 442 states. [2022-04-28 03:31:16,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:31:16,091 INFO L93 Difference]: Finished difference Result 442 states and 549 transitions. [2022-04-28 03:31:16,091 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 549 transitions. [2022-04-28 03:31:16,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:31:16,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:31:16,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:31:16,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:31:16,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 429 states have (on average 1.2517482517482517) internal successors, (537), 429 states have internal predecessors, (537), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:31:16,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 541 transitions. [2022-04-28 03:31:16,100 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 541 transitions. Word has length 57 [2022-04-28 03:31:16,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:31:16,100 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 541 transitions. [2022-04-28 03:31:16,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:31:16,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 434 states and 541 transitions. [2022-04-28 03:31:18,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 541 edges. 541 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:31:18,002 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 541 transitions. [2022-04-28 03:31:18,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-28 03:31:18,003 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:31:18,003 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:31:18,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-28 03:31:18,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:31:18,203 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:31:18,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:31:18,203 INFO L85 PathProgramCache]: Analyzing trace with hash -877016337, now seen corresponding path program 45 times [2022-04-28 03:31:18,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:31:18,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [3679945] [2022-04-28 03:31:18,379 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:31:18,830 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:31:18,831 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:31:18,833 INFO L85 PathProgramCache]: Analyzing trace with hash -995745502, now seen corresponding path program 1 times [2022-04-28 03:31:18,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:31:18,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132297037] [2022-04-28 03:31:18,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:31:18,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:31:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:31:18,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:31:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:31:18,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {67192#(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); {67180#true} is VALID [2022-04-28 03:31:18,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {67180#true} assume true; {67180#true} is VALID [2022-04-28 03:31:18,912 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67180#true} {67180#true} #71#return; {67180#true} is VALID [2022-04-28 03:31:18,912 INFO L272 TraceCheckUtils]: 0: Hoare triple {67180#true} call ULTIMATE.init(); {67192#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:31:18,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {67192#(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); {67180#true} is VALID [2022-04-28 03:31:18,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {67180#true} assume true; {67180#true} is VALID [2022-04-28 03:31:18,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67180#true} {67180#true} #71#return; {67180#true} is VALID [2022-04-28 03:31:18,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {67180#true} call #t~ret6 := main(); {67180#true} is VALID [2022-04-28 03:31:18,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {67180#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {67185#(= main_~k~0 0)} is VALID [2022-04-28 03:31:18,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {67185#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {67186#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:31:18,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {67186#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {67187#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:31:18,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {67187#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [213] L31-3-->L31-4_primed: Formula: (let ((.cse1 (<= v_main_~m~0_472 21)) (.cse0 (< 20 v_main_~m~0_472)) (.cse2 (= |v_main_#t~post5_1283| |v_main_#t~post5_1262|)) (.cse3 (= |v_main_#t~post3_553| |v_main_#t~post3_552|)) (.cse4 (= |v_main_#t~post4_1283| |v_main_#t~post4_1262|)) (.cse5 (= v_main_~j~0_2256 v_main_~j~0_2234)) (.cse6 (= v_main_~k~0_2049 v_main_~k~0_2028)) (.cse7 (= v_main_~i~0_747 v_main_~i~0_746))) (or (and .cse0 (< v_main_~i~0_747 v_main_~i~0_746) (= 21 v_main_~j~0_2234) .cse1 (< v_main_~i~0_746 (+ 1 v_main_~n~0_248)) (= (+ (* 21 v_main_~i~0_746) v_main_~k~0_2049) (+ v_main_~k~0_2028 (* 21 v_main_~i~0_747)))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (or (not (< v_main_~i~0_747 v_main_~n~0_248)) (not .cse1) (not .cse0))) (and (= v_main_~n~0_248 v_main_~n~0_248) .cse2 .cse3 .cse4 (= v_main_~m~0_472 v_main_~m~0_472) .cse5 .cse6 .cse7))) InVars {main_~m~0=v_main_~m~0_472, main_~k~0=v_main_~k~0_2049, main_~j~0=v_main_~j~0_2256, main_~i~0=v_main_~i~0_747, main_#t~post4=|v_main_#t~post4_1283|, main_#t~post5=|v_main_#t~post5_1283|, main_~n~0=v_main_~n~0_248, main_#t~post3=|v_main_#t~post3_553|} OutVars{main_~m~0=v_main_~m~0_472, main_~k~0=v_main_~k~0_2028, main_~j~0=v_main_~j~0_2234, main_~i~0=v_main_~i~0_746, main_#t~post4=|v_main_#t~post4_1262|, main_#t~post5=|v_main_#t~post5_1262|, main_#t~post3=|v_main_#t~post3_552|, main_~n~0=v_main_~n~0_248} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {67188#(or (<= (+ (* main_~i~0 21) 210) (+ main_~k~0 (* main_~n~0 21))) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:31:18,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {67188#(or (<= (+ (* main_~i~0 21) 210) (+ main_~k~0 (* main_~n~0 21))) (<= (+ main_~i~0 10) main_~n~0))} [212] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {67189#(<= 210 main_~k~0)} is VALID [2022-04-28 03:31:18,915 INFO L272 TraceCheckUtils]: 10: Hoare triple {67189#(<= 210 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {67190#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:31:18,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {67190#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {67191#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:31:18,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {67191#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {67181#false} is VALID [2022-04-28 03:31:18,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {67181#false} assume !false; {67181#false} is VALID [2022-04-28 03:31:18,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:31:18,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:31:18,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132297037] [2022-04-28 03:31:18,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132297037] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:31:18,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:31:18,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:31:21,858 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:31:21,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [3679945] [2022-04-28 03:31:21,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [3679945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:31:21,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:31:21,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2022-04-28 03:31:21,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063268841] [2022-04-28 03:31:21,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:31:21,858 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 52 states have internal predecessors, (54), 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 58 [2022-04-28 03:31:21,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:31:21,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 54 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 52 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:31:21,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:31:21,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-28 03:31:21,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:31:21,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-28 03:31:21,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2918, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 03:31:21,910 INFO L87 Difference]: Start difference. First operand 434 states and 541 transitions. Second operand has 54 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 52 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:31:36,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:31:36,282 INFO L93 Difference]: Finished difference Result 520 states and 652 transitions. [2022-04-28 03:31:36,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-04-28 03:31:36,282 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 52 states have internal predecessors, (54), 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 58 [2022-04-28 03:31:36,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:31:36,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 52 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:31:36,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 119 transitions. [2022-04-28 03:31:36,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 52 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:31:36,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 119 transitions. [2022-04-28 03:31:36,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 119 transitions. [2022-04-28 03:31:36,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:31:36,436 INFO L225 Difference]: With dead ends: 520 [2022-04-28 03:31:36,436 INFO L226 Difference]: Without dead ends: 515 [2022-04-28 03:31:36,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1885 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=441, Invalid=11115, Unknown=0, NotChecked=0, Total=11556 [2022-04-28 03:31:36,437 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 60 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 5017 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 5060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 5017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:31:36,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 265 Invalid, 5060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 5017 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-04-28 03:31:36,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-04-28 03:31:38,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 481. [2022-04-28 03:31:38,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:31:38,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 515 states. Second operand has 481 states, 476 states have (on average 1.2752100840336134) internal successors, (607), 476 states have internal predecessors, (607), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:31:38,794 INFO L74 IsIncluded]: Start isIncluded. First operand 515 states. Second operand has 481 states, 476 states have (on average 1.2752100840336134) internal successors, (607), 476 states have internal predecessors, (607), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:31:38,794 INFO L87 Difference]: Start difference. First operand 515 states. Second operand has 481 states, 476 states have (on average 1.2752100840336134) internal successors, (607), 476 states have internal predecessors, (607), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:31:38,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:31:38,806 INFO L93 Difference]: Finished difference Result 515 states and 647 transitions. [2022-04-28 03:31:38,806 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 647 transitions. [2022-04-28 03:31:38,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:31:38,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:31:38,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 481 states, 476 states have (on average 1.2752100840336134) internal successors, (607), 476 states have internal predecessors, (607), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 515 states. [2022-04-28 03:31:38,807 INFO L87 Difference]: Start difference. First operand has 481 states, 476 states have (on average 1.2752100840336134) internal successors, (607), 476 states have internal predecessors, (607), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 515 states. [2022-04-28 03:31:38,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:31:38,818 INFO L93 Difference]: Finished difference Result 515 states and 647 transitions. [2022-04-28 03:31:38,818 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 647 transitions. [2022-04-28 03:31:38,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:31:38,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:31:38,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:31:38,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:31:38,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 476 states have (on average 1.2752100840336134) internal successors, (607), 476 states have internal predecessors, (607), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:31:38,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 611 transitions. [2022-04-28 03:31:38,830 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 611 transitions. Word has length 58 [2022-04-28 03:31:38,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:31:38,830 INFO L495 AbstractCegarLoop]: Abstraction has 481 states and 611 transitions. [2022-04-28 03:31:38,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 52 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:31:38,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 481 states and 611 transitions. [2022-04-28 03:31:41,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 611 edges. 611 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:31:41,137 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 611 transitions. [2022-04-28 03:31:41,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 03:31:41,137 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:31:41,137 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:31:41,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-04-28 03:31:41,138 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:31:41,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:31:41,138 INFO L85 PathProgramCache]: Analyzing trace with hash -95896900, now seen corresponding path program 46 times [2022-04-28 03:31:41,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:31:41,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2106613261] [2022-04-28 03:31:41,511 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:31:45,640 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:31:45,706 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:31:48,046 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:31:48,154 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:31:49,947 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:31:49,948 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:31:49,950 INFO L85 PathProgramCache]: Analyzing trace with hash -572015167, now seen corresponding path program 1 times [2022-04-28 03:31:49,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:31:49,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708719198] [2022-04-28 03:31:49,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:31:49,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:31:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:31:50,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:31:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:31:50,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {70390#(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); {70377#true} is VALID [2022-04-28 03:31:50,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {70377#true} assume true; {70377#true} is VALID [2022-04-28 03:31:50,050 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70377#true} {70377#true} #71#return; {70377#true} is VALID [2022-04-28 03:31:50,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {70377#true} call ULTIMATE.init(); {70390#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:31:50,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {70390#(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); {70377#true} is VALID [2022-04-28 03:31:50,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {70377#true} assume true; {70377#true} is VALID [2022-04-28 03:31:50,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70377#true} {70377#true} #71#return; {70377#true} is VALID [2022-04-28 03:31:50,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {70377#true} call #t~ret6 := main(); {70377#true} is VALID [2022-04-28 03:31:50,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {70377#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {70382#(= main_~k~0 0)} is VALID [2022-04-28 03:31:50,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {70382#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {70383#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:31:50,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {70383#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {70384#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:31:50,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {70384#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} [215] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_1320| |v_main_#t~post4_1300|)) (.cse1 (= v_main_~j~0_2323 v_main_~j~0_2301)) (.cse2 (= v_main_~k~0_2096 v_main_~k~0_2091)) (.cse3 (= |v_main_#t~post3_566| |v_main_#t~post3_564|)) (.cse4 (= v_main_~i~0_763 v_main_~i~0_762)) (.cse7 (<= v_main_~m~0_484 5)) (.cse6 (< 4 v_main_~m~0_484)) (.cse5 (= |v_main_#t~post5_1320| |v_main_#t~post5_1300|))) (or (and .cse0 .cse1 (= v_main_~n~0_255 v_main_~n~0_255) .cse2 .cse3 (= v_main_~m~0_484 v_main_~m~0_484) .cse4 .cse5) (and .cse6 (= 5 v_main_~j~0_2301) (< v_main_~i~0_763 v_main_~i~0_762) (= (+ (* 5 v_main_~i~0_762) v_main_~k~0_2096) (+ (* 5 v_main_~i~0_763) v_main_~k~0_2091)) (< v_main_~i~0_762 (+ 1 v_main_~n~0_255)) .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 (or (not .cse7) (not .cse6) (not (< v_main_~i~0_763 v_main_~n~0_255))) .cse5))) InVars {main_~m~0=v_main_~m~0_484, main_~k~0=v_main_~k~0_2096, main_~j~0=v_main_~j~0_2323, main_~i~0=v_main_~i~0_763, main_#t~post4=|v_main_#t~post4_1320|, main_#t~post5=|v_main_#t~post5_1320|, main_~n~0=v_main_~n~0_255, main_#t~post3=|v_main_#t~post3_566|} OutVars{main_~m~0=v_main_~m~0_484, main_~k~0=v_main_~k~0_2091, main_~j~0=v_main_~j~0_2301, main_~i~0=v_main_~i~0_762, main_#t~post4=|v_main_#t~post4_1300|, main_#t~post5=|v_main_#t~post5_1300|, main_#t~post3=|v_main_#t~post3_564|, main_~n~0=v_main_~n~0_255} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {70385#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:31:50,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {70385#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [216] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {70385#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:31:50,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {70385#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [217] L31-3-->L31-4_primed: Formula: (let ((.cse5 (< 14 v_main_~m~0_485)) (.cse6 (<= v_main_~m~0_485 15)) (.cse0 (= v_main_~i~0_765 v_main_~i~0_764)) (.cse1 (= v_main_~k~0_2112 v_main_~k~0_2097)) (.cse2 (= |v_main_#t~post3_569| |v_main_#t~post3_565|)) (.cse3 (= v_main_~j~0_2326 v_main_~j~0_2307)) (.cse4 (= |v_main_#t~post5_1323| |v_main_#t~post5_1305|))) (or (and (= v_main_~n~0_256 v_main_~n~0_256) .cse0 (= |v_main_#t~post4_1323| |v_main_#t~post4_1305|) .cse1 (= v_main_~m~0_485 v_main_~m~0_485) .cse2 .cse3 .cse4) (and (< v_main_~i~0_765 v_main_~i~0_764) .cse5 (= (+ (* 15 v_main_~i~0_765) v_main_~k~0_2097) (+ (* 15 v_main_~i~0_764) v_main_~k~0_2112)) .cse6 (= v_main_~j~0_2307 15) (< v_main_~i~0_764 (+ 1 v_main_~n~0_256))) (and (or (not (< v_main_~i~0_765 v_main_~n~0_256)) (not .cse5) (not .cse6)) .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~post4_1305| |v_main_#t~post4_1323|)))) InVars {main_~m~0=v_main_~m~0_485, main_~k~0=v_main_~k~0_2112, main_~j~0=v_main_~j~0_2326, main_~i~0=v_main_~i~0_765, main_#t~post4=|v_main_#t~post4_1323|, main_#t~post5=|v_main_#t~post5_1323|, main_~n~0=v_main_~n~0_256, main_#t~post3=|v_main_#t~post3_569|} OutVars{main_~m~0=v_main_~m~0_485, main_~k~0=v_main_~k~0_2097, main_~j~0=v_main_~j~0_2307, main_~i~0=v_main_~i~0_764, main_#t~post4=|v_main_#t~post4_1305|, main_#t~post5=|v_main_#t~post5_1305|, main_#t~post3=|v_main_#t~post3_565|, main_~n~0=v_main_~n~0_256} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {70386#(or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ (* main_~i~0 15) 150) (+ main_~k~0 (* main_~n~0 15))))} is VALID [2022-04-28 03:31:50,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {70386#(or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ (* main_~i~0 15) 150) (+ main_~k~0 (* main_~n~0 15))))} [214] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {70387#(<= 150 main_~k~0)} is VALID [2022-04-28 03:31:50,055 INFO L272 TraceCheckUtils]: 12: Hoare triple {70387#(<= 150 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {70388#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:31:50,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {70388#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {70389#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:31:50,055 INFO L290 TraceCheckUtils]: 14: Hoare triple {70389#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {70378#false} is VALID [2022-04-28 03:31:50,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {70378#false} assume !false; {70378#false} is VALID [2022-04-28 03:31:50,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:31:50,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:31:50,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708719198] [2022-04-28 03:31:50,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708719198] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:31:50,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403935004] [2022-04-28 03:31:50,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:31:50,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:31:50,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:31:50,057 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:31:50,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-28 03:31:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:31:50,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:31:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:31:50,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:31:50,527 INFO L272 TraceCheckUtils]: 0: Hoare triple {70377#true} call ULTIMATE.init(); {70377#true} is VALID [2022-04-28 03:31:50,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {70377#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); {70377#true} is VALID [2022-04-28 03:31:50,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {70377#true} assume true; {70377#true} is VALID [2022-04-28 03:31:50,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70377#true} {70377#true} #71#return; {70377#true} is VALID [2022-04-28 03:31:50,528 INFO L272 TraceCheckUtils]: 4: Hoare triple {70377#true} call #t~ret6 := main(); {70377#true} is VALID [2022-04-28 03:31:50,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {70377#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {70409#(<= 0 main_~k~0)} is VALID [2022-04-28 03:31:50,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {70409#(<= 0 main_~k~0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {70413#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} is VALID [2022-04-28 03:31:50,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {70413#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {70417#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:31:50,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {70417#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [215] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_1320| |v_main_#t~post4_1300|)) (.cse1 (= v_main_~j~0_2323 v_main_~j~0_2301)) (.cse2 (= v_main_~k~0_2096 v_main_~k~0_2091)) (.cse3 (= |v_main_#t~post3_566| |v_main_#t~post3_564|)) (.cse4 (= v_main_~i~0_763 v_main_~i~0_762)) (.cse7 (<= v_main_~m~0_484 5)) (.cse6 (< 4 v_main_~m~0_484)) (.cse5 (= |v_main_#t~post5_1320| |v_main_#t~post5_1300|))) (or (and .cse0 .cse1 (= v_main_~n~0_255 v_main_~n~0_255) .cse2 .cse3 (= v_main_~m~0_484 v_main_~m~0_484) .cse4 .cse5) (and .cse6 (= 5 v_main_~j~0_2301) (< v_main_~i~0_763 v_main_~i~0_762) (= (+ (* 5 v_main_~i~0_762) v_main_~k~0_2096) (+ (* 5 v_main_~i~0_763) v_main_~k~0_2091)) (< v_main_~i~0_762 (+ 1 v_main_~n~0_255)) .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 (or (not .cse7) (not .cse6) (not (< v_main_~i~0_763 v_main_~n~0_255))) .cse5))) InVars {main_~m~0=v_main_~m~0_484, main_~k~0=v_main_~k~0_2096, main_~j~0=v_main_~j~0_2323, main_~i~0=v_main_~i~0_763, main_#t~post4=|v_main_#t~post4_1320|, main_#t~post5=|v_main_#t~post5_1320|, main_~n~0=v_main_~n~0_255, main_#t~post3=|v_main_#t~post3_566|} OutVars{main_~m~0=v_main_~m~0_484, main_~k~0=v_main_~k~0_2091, main_~j~0=v_main_~j~0_2301, main_~i~0=v_main_~i~0_762, main_#t~post4=|v_main_#t~post4_1300|, main_#t~post5=|v_main_#t~post5_1300|, main_#t~post3=|v_main_#t~post3_564|, main_~n~0=v_main_~n~0_255} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {70417#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:31:50,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {70417#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [216] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {70417#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:31:50,531 INFO L290 TraceCheckUtils]: 10: Hoare triple {70417#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [217] L31-3-->L31-4_primed: Formula: (let ((.cse5 (< 14 v_main_~m~0_485)) (.cse6 (<= v_main_~m~0_485 15)) (.cse0 (= v_main_~i~0_765 v_main_~i~0_764)) (.cse1 (= v_main_~k~0_2112 v_main_~k~0_2097)) (.cse2 (= |v_main_#t~post3_569| |v_main_#t~post3_565|)) (.cse3 (= v_main_~j~0_2326 v_main_~j~0_2307)) (.cse4 (= |v_main_#t~post5_1323| |v_main_#t~post5_1305|))) (or (and (= v_main_~n~0_256 v_main_~n~0_256) .cse0 (= |v_main_#t~post4_1323| |v_main_#t~post4_1305|) .cse1 (= v_main_~m~0_485 v_main_~m~0_485) .cse2 .cse3 .cse4) (and (< v_main_~i~0_765 v_main_~i~0_764) .cse5 (= (+ (* 15 v_main_~i~0_765) v_main_~k~0_2097) (+ (* 15 v_main_~i~0_764) v_main_~k~0_2112)) .cse6 (= v_main_~j~0_2307 15) (< v_main_~i~0_764 (+ 1 v_main_~n~0_256))) (and (or (not (< v_main_~i~0_765 v_main_~n~0_256)) (not .cse5) (not .cse6)) .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~post4_1305| |v_main_#t~post4_1323|)))) InVars {main_~m~0=v_main_~m~0_485, main_~k~0=v_main_~k~0_2112, main_~j~0=v_main_~j~0_2326, main_~i~0=v_main_~i~0_765, main_#t~post4=|v_main_#t~post4_1323|, main_#t~post5=|v_main_#t~post5_1323|, main_~n~0=v_main_~n~0_256, main_#t~post3=|v_main_#t~post3_569|} OutVars{main_~m~0=v_main_~m~0_485, main_~k~0=v_main_~k~0_2097, main_~j~0=v_main_~j~0_2307, main_~i~0=v_main_~i~0_764, main_#t~post4=|v_main_#t~post4_1305|, main_#t~post5=|v_main_#t~post5_1305|, main_#t~post3=|v_main_#t~post3_565|, main_~n~0=v_main_~n~0_256} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {70427#(and (<= 10 main_~n~0) (or (and (<= (+ (div main_~k~0 (- 15)) main_~i~0) 0) (< (div main_~k~0 (- 15)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:31:50,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {70427#(and (<= 10 main_~n~0) (or (and (<= (+ (div main_~k~0 (- 15)) main_~i~0) 0) (< (div main_~k~0 (- 15)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [214] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {70387#(<= 150 main_~k~0)} is VALID [2022-04-28 03:31:50,532 INFO L272 TraceCheckUtils]: 12: Hoare triple {70387#(<= 150 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {70434#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:31:50,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {70434#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {70438#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:31:50,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {70438#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {70378#false} is VALID [2022-04-28 03:31:50,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {70378#false} assume !false; {70378#false} is VALID [2022-04-28 03:31:50,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:31:50,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:31:51,265 INFO L290 TraceCheckUtils]: 15: Hoare triple {70378#false} assume !false; {70378#false} is VALID [2022-04-28 03:31:51,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {70438#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {70378#false} is VALID [2022-04-28 03:31:51,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {70434#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {70438#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:31:51,266 INFO L272 TraceCheckUtils]: 12: Hoare triple {70454#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {70434#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:31:51,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {70458#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} [214] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {70454#(<= 100 main_~k~0)} is VALID [2022-04-28 03:31:51,268 INFO L290 TraceCheckUtils]: 10: Hoare triple {70462#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [217] L31-3-->L31-4_primed: Formula: (let ((.cse5 (< 14 v_main_~m~0_485)) (.cse6 (<= v_main_~m~0_485 15)) (.cse0 (= v_main_~i~0_765 v_main_~i~0_764)) (.cse1 (= v_main_~k~0_2112 v_main_~k~0_2097)) (.cse2 (= |v_main_#t~post3_569| |v_main_#t~post3_565|)) (.cse3 (= v_main_~j~0_2326 v_main_~j~0_2307)) (.cse4 (= |v_main_#t~post5_1323| |v_main_#t~post5_1305|))) (or (and (= v_main_~n~0_256 v_main_~n~0_256) .cse0 (= |v_main_#t~post4_1323| |v_main_#t~post4_1305|) .cse1 (= v_main_~m~0_485 v_main_~m~0_485) .cse2 .cse3 .cse4) (and (< v_main_~i~0_765 v_main_~i~0_764) .cse5 (= (+ (* 15 v_main_~i~0_765) v_main_~k~0_2097) (+ (* 15 v_main_~i~0_764) v_main_~k~0_2112)) .cse6 (= v_main_~j~0_2307 15) (< v_main_~i~0_764 (+ 1 v_main_~n~0_256))) (and (or (not (< v_main_~i~0_765 v_main_~n~0_256)) (not .cse5) (not .cse6)) .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~post4_1305| |v_main_#t~post4_1323|)))) InVars {main_~m~0=v_main_~m~0_485, main_~k~0=v_main_~k~0_2112, main_~j~0=v_main_~j~0_2326, main_~i~0=v_main_~i~0_765, main_#t~post4=|v_main_#t~post4_1323|, main_#t~post5=|v_main_#t~post5_1323|, main_~n~0=v_main_~n~0_256, main_#t~post3=|v_main_#t~post3_569|} OutVars{main_~m~0=v_main_~m~0_485, main_~k~0=v_main_~k~0_2097, main_~j~0=v_main_~j~0_2307, main_~i~0=v_main_~i~0_764, main_#t~post4=|v_main_#t~post4_1305|, main_#t~post5=|v_main_#t~post5_1305|, main_#t~post3=|v_main_#t~post3_565|, main_~n~0=v_main_~n~0_256} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {70458#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} is VALID [2022-04-28 03:31:51,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {70462#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [216] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {70462#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:31:51,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {70469#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 5))) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 5)) 1) (not (< 4 main_~m~0)) (not (<= main_~m~0 5))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [215] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_1320| |v_main_#t~post4_1300|)) (.cse1 (= v_main_~j~0_2323 v_main_~j~0_2301)) (.cse2 (= v_main_~k~0_2096 v_main_~k~0_2091)) (.cse3 (= |v_main_#t~post3_566| |v_main_#t~post3_564|)) (.cse4 (= v_main_~i~0_763 v_main_~i~0_762)) (.cse7 (<= v_main_~m~0_484 5)) (.cse6 (< 4 v_main_~m~0_484)) (.cse5 (= |v_main_#t~post5_1320| |v_main_#t~post5_1300|))) (or (and .cse0 .cse1 (= v_main_~n~0_255 v_main_~n~0_255) .cse2 .cse3 (= v_main_~m~0_484 v_main_~m~0_484) .cse4 .cse5) (and .cse6 (= 5 v_main_~j~0_2301) (< v_main_~i~0_763 v_main_~i~0_762) (= (+ (* 5 v_main_~i~0_762) v_main_~k~0_2096) (+ (* 5 v_main_~i~0_763) v_main_~k~0_2091)) (< v_main_~i~0_762 (+ 1 v_main_~n~0_255)) .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 (or (not .cse7) (not .cse6) (not (< v_main_~i~0_763 v_main_~n~0_255))) .cse5))) InVars {main_~m~0=v_main_~m~0_484, main_~k~0=v_main_~k~0_2096, main_~j~0=v_main_~j~0_2323, main_~i~0=v_main_~i~0_763, main_#t~post4=|v_main_#t~post4_1320|, main_#t~post5=|v_main_#t~post5_1320|, main_~n~0=v_main_~n~0_255, main_#t~post3=|v_main_#t~post3_566|} OutVars{main_~m~0=v_main_~m~0_484, main_~k~0=v_main_~k~0_2091, main_~j~0=v_main_~j~0_2301, main_~i~0=v_main_~i~0_762, main_#t~post4=|v_main_#t~post4_1300|, main_#t~post5=|v_main_#t~post5_1300|, main_#t~post3=|v_main_#t~post3_564|, main_~n~0=v_main_~n~0_255} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {70462#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:31:51,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {70473#(and (or (< 0 main_~n~0) (<= 100 main_~k~0)) (or (<= (div (+ (- 100) main_~k~0) (- 15)) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 15)) 1)))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {70469#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 5))) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 5)) 1) (not (< 4 main_~m~0)) (not (<= main_~m~0 5))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:31:51,271 INFO L290 TraceCheckUtils]: 6: Hoare triple {70477#(<= (div (+ (- 100) main_~k~0) (- 15)) 10)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {70473#(and (or (< 0 main_~n~0) (<= 100 main_~k~0)) (or (<= (div (+ (- 100) main_~k~0) (- 15)) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 15)) 1)))} is VALID [2022-04-28 03:31:51,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {70377#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {70477#(<= (div (+ (- 100) main_~k~0) (- 15)) 10)} is VALID [2022-04-28 03:31:51,272 INFO L272 TraceCheckUtils]: 4: Hoare triple {70377#true} call #t~ret6 := main(); {70377#true} is VALID [2022-04-28 03:31:51,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70377#true} {70377#true} #71#return; {70377#true} is VALID [2022-04-28 03:31:51,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {70377#true} assume true; {70377#true} is VALID [2022-04-28 03:31:51,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {70377#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); {70377#true} is VALID [2022-04-28 03:31:51,272 INFO L272 TraceCheckUtils]: 0: Hoare triple {70377#true} call ULTIMATE.init(); {70377#true} is VALID [2022-04-28 03:31:51,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:31:51,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403935004] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:31:51,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:31:51,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 23 [2022-04-28 03:31:52,914 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:31:52,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2106613261] [2022-04-28 03:31:52,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2106613261] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:31:52,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:31:52,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-04-28 03:31:52,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823670760] [2022-04-28 03:31:52,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:31:52,915 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 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 59 [2022-04-28 03:31:52,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:31:52,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 53 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:31:52,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:31:52,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-04-28 03:31:52,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:31:52,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-04-28 03:31:52,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=633, Invalid=3789, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 03:31:52,956 INFO L87 Difference]: Start difference. First operand 481 states and 611 transitions. Second operand has 53 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:32:00,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:32:00,492 INFO L93 Difference]: Finished difference Result 497 states and 629 transitions. [2022-04-28 03:32:00,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-28 03:32:00,492 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 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 59 [2022-04-28 03:32:00,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:32:00,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:32:00,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 85 transitions. [2022-04-28 03:32:00,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:32:00,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 85 transitions. [2022-04-28 03:32:00,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 85 transitions. [2022-04-28 03:32:00,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:32:00,571 INFO L225 Difference]: With dead ends: 497 [2022-04-28 03:32:00,571 INFO L226 Difference]: Without dead ends: 488 [2022-04-28 03:32:00,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3446 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1281, Invalid=11601, Unknown=0, NotChecked=0, Total=12882 [2022-04-28 03:32:00,572 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 30 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 3017 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 3049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 3017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:32:00,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 250 Invalid, 3049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 3017 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 03:32:00,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-04-28 03:32:02,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 483. [2022-04-28 03:32:02,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:32:02,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 488 states. Second operand has 483 states, 478 states have (on average 1.2740585774058577) internal successors, (609), 478 states have internal predecessors, (609), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:32:02,846 INFO L74 IsIncluded]: Start isIncluded. First operand 488 states. Second operand has 483 states, 478 states have (on average 1.2740585774058577) internal successors, (609), 478 states have internal predecessors, (609), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:32:02,847 INFO L87 Difference]: Start difference. First operand 488 states. Second operand has 483 states, 478 states have (on average 1.2740585774058577) internal successors, (609), 478 states have internal predecessors, (609), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:32:02,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:32:02,854 INFO L93 Difference]: Finished difference Result 488 states and 618 transitions. [2022-04-28 03:32:02,854 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 618 transitions. [2022-04-28 03:32:02,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:32:02,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:32:02,855 INFO L74 IsIncluded]: Start isIncluded. First operand has 483 states, 478 states have (on average 1.2740585774058577) internal successors, (609), 478 states have internal predecessors, (609), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 488 states. [2022-04-28 03:32:02,855 INFO L87 Difference]: Start difference. First operand has 483 states, 478 states have (on average 1.2740585774058577) internal successors, (609), 478 states have internal predecessors, (609), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 488 states. [2022-04-28 03:32:02,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:32:02,862 INFO L93 Difference]: Finished difference Result 488 states and 618 transitions. [2022-04-28 03:32:02,862 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 618 transitions. [2022-04-28 03:32:02,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:32:02,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:32:02,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:32:02,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:32:02,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 478 states have (on average 1.2740585774058577) internal successors, (609), 478 states have internal predecessors, (609), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:32:02,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 613 transitions. [2022-04-28 03:32:02,872 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 613 transitions. Word has length 59 [2022-04-28 03:32:02,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:32:02,872 INFO L495 AbstractCegarLoop]: Abstraction has 483 states and 613 transitions. [2022-04-28 03:32:02,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:32:02,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 483 states and 613 transitions. [2022-04-28 03:32:05,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 613 edges. 613 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:32:05,196 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 613 transitions. [2022-04-28 03:32:05,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 03:32:05,196 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:32:05,196 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:32:05,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-04-28 03:32:05,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-04-28 03:32:05,399 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:32:05,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:32:05,399 INFO L85 PathProgramCache]: Analyzing trace with hash 911896524, now seen corresponding path program 47 times [2022-04-28 03:32:05,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:32:05,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [13022578] [2022-04-28 03:32:05,595 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:32:09,714 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:32:09,809 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:32:10,240 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:32:12,528 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:32:12,529 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:32:12,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1477516993, now seen corresponding path program 1 times [2022-04-28 03:32:12,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:32:12,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417226575] [2022-04-28 03:32:12,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:32:12,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:32:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:32:12,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:32:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:32:12,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {73585#(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); {73572#true} is VALID [2022-04-28 03:32:12,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {73572#true} assume true; {73572#true} is VALID [2022-04-28 03:32:12,623 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73572#true} {73572#true} #71#return; {73572#true} is VALID [2022-04-28 03:32:12,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {73572#true} call ULTIMATE.init(); {73585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:32:12,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {73585#(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); {73572#true} is VALID [2022-04-28 03:32:12,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {73572#true} assume true; {73572#true} is VALID [2022-04-28 03:32:12,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73572#true} {73572#true} #71#return; {73572#true} is VALID [2022-04-28 03:32:12,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {73572#true} call #t~ret6 := main(); {73572#true} is VALID [2022-04-28 03:32:12,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {73572#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {73577#(= main_~k~0 0)} is VALID [2022-04-28 03:32:12,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {73577#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {73578#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:32:12,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {73578#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {73579#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:32:12,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {73579#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} [219] L31-3-->L31-4_primed: Formula: (let ((.cse1 (<= v_main_~m~0_499 1)) (.cse2 (< 0 v_main_~m~0_499)) (.cse3 (= |v_main_#t~post4_1360| |v_main_#t~post4_1340|)) (.cse4 (= v_main_~i~0_791 v_main_~i~0_790)) (.cse5 (= v_main_~k~0_2158 v_main_~k~0_2157)) (.cse6 (= v_main_~j~0_2398 v_main_~j~0_2376)) (.cse7 (= |v_main_#t~post3_587| |v_main_#t~post3_585|)) (.cse8 (= |v_main_#t~post5_1360| |v_main_#t~post5_1340|))) (or (let ((.cse0 (+ v_main_~k~0_2157 v_main_~i~0_791))) (and (= (+ v_main_~k~0_2158 v_main_~i~0_790) .cse0) (< .cse0 (+ v_main_~k~0_2158 1 v_main_~n~0_265)) (< v_main_~k~0_2158 v_main_~k~0_2157) (= v_main_~j~0_2376 1) .cse1 .cse2)) (and .cse3 (or (not .cse1) (not .cse2) (not (< v_main_~i~0_791 v_main_~n~0_265))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse3 (= v_main_~m~0_499 v_main_~m~0_499) (= v_main_~n~0_265 v_main_~n~0_265) .cse4 .cse5 .cse6 .cse7 .cse8))) InVars {main_~m~0=v_main_~m~0_499, main_~k~0=v_main_~k~0_2158, main_~j~0=v_main_~j~0_2398, main_~i~0=v_main_~i~0_791, main_#t~post4=|v_main_#t~post4_1360|, main_#t~post5=|v_main_#t~post5_1360|, main_~n~0=v_main_~n~0_265, main_#t~post3=|v_main_#t~post3_587|} OutVars{main_~m~0=v_main_~m~0_499, main_~k~0=v_main_~k~0_2157, main_~j~0=v_main_~j~0_2376, main_~i~0=v_main_~i~0_790, main_#t~post4=|v_main_#t~post4_1340|, main_#t~post5=|v_main_#t~post5_1340|, main_#t~post3=|v_main_#t~post3_585|, main_~n~0=v_main_~n~0_265} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {73580#(and (<= (+ 190 (* 19 main_~i~0)) (+ (* 19 main_~n~0) main_~k~0)) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:32:12,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {73580#(and (<= (+ 190 (* 19 main_~i~0)) (+ (* 19 main_~n~0) main_~k~0)) (<= (+ main_~i~0 10) main_~n~0))} [220] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {73580#(and (<= (+ 190 (* 19 main_~i~0)) (+ (* 19 main_~n~0) main_~k~0)) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:32:12,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {73580#(and (<= (+ 190 (* 19 main_~i~0)) (+ (* 19 main_~n~0) main_~k~0)) (<= (+ main_~i~0 10) main_~n~0))} [221] L31-3-->L31-4_primed: Formula: (let ((.cse0 (< 18 v_main_~m~0_500)) (.cse1 (<= v_main_~m~0_500 19)) (.cse2 (= v_main_~k~0_2178 v_main_~k~0_2159)) (.cse3 (= |v_main_#t~post5_1363| |v_main_#t~post5_1341|)) (.cse4 (= |v_main_#t~post4_1363| |v_main_#t~post4_1341|)) (.cse5 (= |v_main_#t~post3_590| |v_main_#t~post3_586|)) (.cse6 (= v_main_~j~0_2401 v_main_~j~0_2378)) (.cse7 (= v_main_~i~0_793 v_main_~i~0_792))) (or (and .cse0 (< v_main_~i~0_792 (+ 1 v_main_~n~0_266)) (= (+ (* 19 v_main_~i~0_793) v_main_~k~0_2159) (+ (* 19 v_main_~i~0_792) v_main_~k~0_2178)) (< v_main_~i~0_793 v_main_~i~0_792) (= 19 v_main_~j~0_2378) .cse1) (and .cse2 .cse3 .cse4 .cse5 (or (not (< v_main_~i~0_793 v_main_~n~0_266)) (not .cse0) (not .cse1)) .cse6 .cse7) (and (= v_main_~n~0_266 v_main_~n~0_266) .cse2 .cse3 .cse4 .cse5 (= v_main_~m~0_500 v_main_~m~0_500) .cse6 .cse7))) InVars {main_~m~0=v_main_~m~0_500, main_~k~0=v_main_~k~0_2178, main_~j~0=v_main_~j~0_2401, main_~i~0=v_main_~i~0_793, main_#t~post4=|v_main_#t~post4_1363|, main_#t~post5=|v_main_#t~post5_1363|, main_~n~0=v_main_~n~0_266, main_#t~post3=|v_main_#t~post3_590|} OutVars{main_~m~0=v_main_~m~0_500, main_~k~0=v_main_~k~0_2159, main_~j~0=v_main_~j~0_2378, main_~i~0=v_main_~i~0_792, main_#t~post4=|v_main_#t~post4_1341|, main_#t~post5=|v_main_#t~post5_1341|, main_#t~post3=|v_main_#t~post3_586|, main_~n~0=v_main_~n~0_266} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {73581#(or (<= (+ 190 (* 19 main_~i~0)) (+ (* 19 main_~n~0) main_~k~0)) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:32:12,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {73581#(or (<= (+ 190 (* 19 main_~i~0)) (+ (* 19 main_~n~0) main_~k~0)) (<= (+ main_~i~0 10) main_~n~0))} [218] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {73582#(<= 190 main_~k~0)} is VALID [2022-04-28 03:32:12,627 INFO L272 TraceCheckUtils]: 12: Hoare triple {73582#(<= 190 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {73583#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:32:12,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {73583#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {73584#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:32:12,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {73584#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {73573#false} is VALID [2022-04-28 03:32:12,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {73573#false} assume !false; {73573#false} is VALID [2022-04-28 03:32:12,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:32:12,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:32:12,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417226575] [2022-04-28 03:32:12,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417226575] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:32:12,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394522703] [2022-04-28 03:32:12,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:32:12,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:32:12,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:32:12,631 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:32:12,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-28 03:32:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:32:12,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 03:32:12,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:32:12,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:32:13,022 INFO L272 TraceCheckUtils]: 0: Hoare triple {73572#true} call ULTIMATE.init(); {73572#true} is VALID [2022-04-28 03:32:13,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {73572#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); {73572#true} is VALID [2022-04-28 03:32:13,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {73572#true} assume true; {73572#true} is VALID [2022-04-28 03:32:13,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73572#true} {73572#true} #71#return; {73572#true} is VALID [2022-04-28 03:32:13,023 INFO L272 TraceCheckUtils]: 4: Hoare triple {73572#true} call #t~ret6 := main(); {73572#true} is VALID [2022-04-28 03:32:13,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {73572#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {73604#(<= 0 main_~k~0)} is VALID [2022-04-28 03:32:13,023 INFO L290 TraceCheckUtils]: 6: Hoare triple {73604#(<= 0 main_~k~0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {73608#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} is VALID [2022-04-28 03:32:13,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {73608#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {73612#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (= main_~i~0 0))} is VALID [2022-04-28 03:32:13,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {73612#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (= main_~i~0 0))} [219] L31-3-->L31-4_primed: Formula: (let ((.cse1 (<= v_main_~m~0_499 1)) (.cse2 (< 0 v_main_~m~0_499)) (.cse3 (= |v_main_#t~post4_1360| |v_main_#t~post4_1340|)) (.cse4 (= v_main_~i~0_791 v_main_~i~0_790)) (.cse5 (= v_main_~k~0_2158 v_main_~k~0_2157)) (.cse6 (= v_main_~j~0_2398 v_main_~j~0_2376)) (.cse7 (= |v_main_#t~post3_587| |v_main_#t~post3_585|)) (.cse8 (= |v_main_#t~post5_1360| |v_main_#t~post5_1340|))) (or (let ((.cse0 (+ v_main_~k~0_2157 v_main_~i~0_791))) (and (= (+ v_main_~k~0_2158 v_main_~i~0_790) .cse0) (< .cse0 (+ v_main_~k~0_2158 1 v_main_~n~0_265)) (< v_main_~k~0_2158 v_main_~k~0_2157) (= v_main_~j~0_2376 1) .cse1 .cse2)) (and .cse3 (or (not .cse1) (not .cse2) (not (< v_main_~i~0_791 v_main_~n~0_265))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse3 (= v_main_~m~0_499 v_main_~m~0_499) (= v_main_~n~0_265 v_main_~n~0_265) .cse4 .cse5 .cse6 .cse7 .cse8))) InVars {main_~m~0=v_main_~m~0_499, main_~k~0=v_main_~k~0_2158, main_~j~0=v_main_~j~0_2398, main_~i~0=v_main_~i~0_791, main_#t~post4=|v_main_#t~post4_1360|, main_#t~post5=|v_main_#t~post5_1360|, main_~n~0=v_main_~n~0_265, main_#t~post3=|v_main_#t~post3_587|} OutVars{main_~m~0=v_main_~m~0_499, main_~k~0=v_main_~k~0_2157, main_~j~0=v_main_~j~0_2376, main_~i~0=v_main_~i~0_790, main_#t~post4=|v_main_#t~post4_1340|, main_#t~post5=|v_main_#t~post5_1340|, main_#t~post3=|v_main_#t~post3_585|, main_~n~0=v_main_~n~0_265} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {73612#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (= main_~i~0 0))} is VALID [2022-04-28 03:32:13,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {73612#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (= main_~i~0 0))} [220] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {73612#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (= main_~i~0 0))} is VALID [2022-04-28 03:32:13,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {73612#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (= main_~i~0 0))} [221] L31-3-->L31-4_primed: Formula: (let ((.cse0 (< 18 v_main_~m~0_500)) (.cse1 (<= v_main_~m~0_500 19)) (.cse2 (= v_main_~k~0_2178 v_main_~k~0_2159)) (.cse3 (= |v_main_#t~post5_1363| |v_main_#t~post5_1341|)) (.cse4 (= |v_main_#t~post4_1363| |v_main_#t~post4_1341|)) (.cse5 (= |v_main_#t~post3_590| |v_main_#t~post3_586|)) (.cse6 (= v_main_~j~0_2401 v_main_~j~0_2378)) (.cse7 (= v_main_~i~0_793 v_main_~i~0_792))) (or (and .cse0 (< v_main_~i~0_792 (+ 1 v_main_~n~0_266)) (= (+ (* 19 v_main_~i~0_793) v_main_~k~0_2159) (+ (* 19 v_main_~i~0_792) v_main_~k~0_2178)) (< v_main_~i~0_793 v_main_~i~0_792) (= 19 v_main_~j~0_2378) .cse1) (and .cse2 .cse3 .cse4 .cse5 (or (not (< v_main_~i~0_793 v_main_~n~0_266)) (not .cse0) (not .cse1)) .cse6 .cse7) (and (= v_main_~n~0_266 v_main_~n~0_266) .cse2 .cse3 .cse4 .cse5 (= v_main_~m~0_500 v_main_~m~0_500) .cse6 .cse7))) InVars {main_~m~0=v_main_~m~0_500, main_~k~0=v_main_~k~0_2178, main_~j~0=v_main_~j~0_2401, main_~i~0=v_main_~i~0_793, main_#t~post4=|v_main_#t~post4_1363|, main_#t~post5=|v_main_#t~post5_1363|, main_~n~0=v_main_~n~0_266, main_#t~post3=|v_main_#t~post3_590|} OutVars{main_~m~0=v_main_~m~0_500, main_~k~0=v_main_~k~0_2159, main_~j~0=v_main_~j~0_2378, main_~i~0=v_main_~i~0_792, main_#t~post4=|v_main_#t~post4_1341|, main_#t~post5=|v_main_#t~post5_1341|, main_#t~post3=|v_main_#t~post3_586|, main_~n~0=v_main_~n~0_266} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {73622#(and (<= 10 main_~n~0) (or (and (<= 0 main_~k~0) (= main_~i~0 0)) (and (< 0 main_~i~0) (<= (* 19 main_~i~0) main_~k~0) (< main_~i~0 (+ main_~n~0 1)))))} is VALID [2022-04-28 03:32:13,026 INFO L290 TraceCheckUtils]: 11: Hoare triple {73622#(and (<= 10 main_~n~0) (or (and (<= 0 main_~k~0) (= main_~i~0 0)) (and (< 0 main_~i~0) (<= (* 19 main_~i~0) main_~k~0) (< main_~i~0 (+ main_~n~0 1)))))} [218] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {73582#(<= 190 main_~k~0)} is VALID [2022-04-28 03:32:13,027 INFO L272 TraceCheckUtils]: 12: Hoare triple {73582#(<= 190 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {73629#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:32:13,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {73629#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {73633#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:32:13,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {73633#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {73573#false} is VALID [2022-04-28 03:32:13,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {73573#false} assume !false; {73573#false} is VALID [2022-04-28 03:32:13,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:32:13,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:32:13,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {73573#false} assume !false; {73573#false} is VALID [2022-04-28 03:32:13,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {73633#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {73573#false} is VALID [2022-04-28 03:32:13,686 INFO L290 TraceCheckUtils]: 13: Hoare triple {73629#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {73633#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:32:13,686 INFO L272 TraceCheckUtils]: 12: Hoare triple {73649#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {73629#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:32:13,687 INFO L290 TraceCheckUtils]: 11: Hoare triple {73653#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} [218] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {73649#(<= 100 main_~k~0)} is VALID [2022-04-28 03:32:13,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {73657#(and (or (<= main_~n~0 main_~i~0) (<= (+ (div (+ (- 100) main_~k~0) (- 19)) main_~i~0) main_~n~0) (not (< 18 main_~m~0)) (not (<= main_~m~0 19))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [221] L31-3-->L31-4_primed: Formula: (let ((.cse0 (< 18 v_main_~m~0_500)) (.cse1 (<= v_main_~m~0_500 19)) (.cse2 (= v_main_~k~0_2178 v_main_~k~0_2159)) (.cse3 (= |v_main_#t~post5_1363| |v_main_#t~post5_1341|)) (.cse4 (= |v_main_#t~post4_1363| |v_main_#t~post4_1341|)) (.cse5 (= |v_main_#t~post3_590| |v_main_#t~post3_586|)) (.cse6 (= v_main_~j~0_2401 v_main_~j~0_2378)) (.cse7 (= v_main_~i~0_793 v_main_~i~0_792))) (or (and .cse0 (< v_main_~i~0_792 (+ 1 v_main_~n~0_266)) (= (+ (* 19 v_main_~i~0_793) v_main_~k~0_2159) (+ (* 19 v_main_~i~0_792) v_main_~k~0_2178)) (< v_main_~i~0_793 v_main_~i~0_792) (= 19 v_main_~j~0_2378) .cse1) (and .cse2 .cse3 .cse4 .cse5 (or (not (< v_main_~i~0_793 v_main_~n~0_266)) (not .cse0) (not .cse1)) .cse6 .cse7) (and (= v_main_~n~0_266 v_main_~n~0_266) .cse2 .cse3 .cse4 .cse5 (= v_main_~m~0_500 v_main_~m~0_500) .cse6 .cse7))) InVars {main_~m~0=v_main_~m~0_500, main_~k~0=v_main_~k~0_2178, main_~j~0=v_main_~j~0_2401, main_~i~0=v_main_~i~0_793, main_#t~post4=|v_main_#t~post4_1363|, main_#t~post5=|v_main_#t~post5_1363|, main_~n~0=v_main_~n~0_266, main_#t~post3=|v_main_#t~post3_590|} OutVars{main_~m~0=v_main_~m~0_500, main_~k~0=v_main_~k~0_2159, main_~j~0=v_main_~j~0_2378, main_~i~0=v_main_~i~0_792, main_#t~post4=|v_main_#t~post4_1341|, main_#t~post5=|v_main_#t~post5_1341|, main_#t~post3=|v_main_#t~post3_586|, main_~n~0=v_main_~n~0_266} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {73653#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} is VALID [2022-04-28 03:32:13,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {73657#(and (or (<= main_~n~0 main_~i~0) (<= (+ (div (+ (- 100) main_~k~0) (- 19)) main_~i~0) main_~n~0) (not (< 18 main_~m~0)) (not (<= main_~m~0 19))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [220] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {73657#(and (or (<= main_~n~0 main_~i~0) (<= (+ (div (+ (- 100) main_~k~0) (- 19)) main_~i~0) main_~n~0) (not (< 18 main_~m~0)) (not (<= main_~m~0 19))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:32:13,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {73664#(and (or (<= main_~n~0 main_~i~0) (<= (+ (div (+ (- 100) main_~k~0) (- 19)) main_~i~0) main_~n~0) (not (< 18 main_~m~0)) (not (<= main_~m~0 19))) (or (not (< 0 main_~m~0)) (<= (+ main_~i~0 100) (+ main_~n~0 main_~k~0)) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 1))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [219] L31-3-->L31-4_primed: Formula: (let ((.cse1 (<= v_main_~m~0_499 1)) (.cse2 (< 0 v_main_~m~0_499)) (.cse3 (= |v_main_#t~post4_1360| |v_main_#t~post4_1340|)) (.cse4 (= v_main_~i~0_791 v_main_~i~0_790)) (.cse5 (= v_main_~k~0_2158 v_main_~k~0_2157)) (.cse6 (= v_main_~j~0_2398 v_main_~j~0_2376)) (.cse7 (= |v_main_#t~post3_587| |v_main_#t~post3_585|)) (.cse8 (= |v_main_#t~post5_1360| |v_main_#t~post5_1340|))) (or (let ((.cse0 (+ v_main_~k~0_2157 v_main_~i~0_791))) (and (= (+ v_main_~k~0_2158 v_main_~i~0_790) .cse0) (< .cse0 (+ v_main_~k~0_2158 1 v_main_~n~0_265)) (< v_main_~k~0_2158 v_main_~k~0_2157) (= v_main_~j~0_2376 1) .cse1 .cse2)) (and .cse3 (or (not .cse1) (not .cse2) (not (< v_main_~i~0_791 v_main_~n~0_265))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse3 (= v_main_~m~0_499 v_main_~m~0_499) (= v_main_~n~0_265 v_main_~n~0_265) .cse4 .cse5 .cse6 .cse7 .cse8))) InVars {main_~m~0=v_main_~m~0_499, main_~k~0=v_main_~k~0_2158, main_~j~0=v_main_~j~0_2398, main_~i~0=v_main_~i~0_791, main_#t~post4=|v_main_#t~post4_1360|, main_#t~post5=|v_main_#t~post5_1360|, main_~n~0=v_main_~n~0_265, main_#t~post3=|v_main_#t~post3_587|} OutVars{main_~m~0=v_main_~m~0_499, main_~k~0=v_main_~k~0_2157, main_~j~0=v_main_~j~0_2376, main_~i~0=v_main_~i~0_790, main_#t~post4=|v_main_#t~post4_1340|, main_#t~post5=|v_main_#t~post5_1340|, main_#t~post3=|v_main_#t~post3_585|, main_~n~0=v_main_~n~0_265} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {73657#(and (or (<= main_~n~0 main_~i~0) (<= (+ (div (+ (- 100) main_~k~0) (- 19)) main_~i~0) main_~n~0) (not (< 18 main_~m~0)) (not (<= main_~m~0 19))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:32:13,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {73668#(and (or (< 0 main_~n~0) (<= 100 main_~k~0)) (or (<= (div (+ (- 100) main_~k~0) (- 19)) main_~n~0) (<= main_~n~0 0)))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {73664#(and (or (<= main_~n~0 main_~i~0) (<= (+ (div (+ (- 100) main_~k~0) (- 19)) main_~i~0) main_~n~0) (not (< 18 main_~m~0)) (not (<= main_~m~0 19))) (or (not (< 0 main_~m~0)) (<= (+ main_~i~0 100) (+ main_~n~0 main_~k~0)) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 1))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:32:13,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {73672#(<= (div (+ (- 100) main_~k~0) (- 19)) 10)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {73668#(and (or (< 0 main_~n~0) (<= 100 main_~k~0)) (or (<= (div (+ (- 100) main_~k~0) (- 19)) main_~n~0) (<= main_~n~0 0)))} is VALID [2022-04-28 03:32:13,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {73572#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {73672#(<= (div (+ (- 100) main_~k~0) (- 19)) 10)} is VALID [2022-04-28 03:32:13,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {73572#true} call #t~ret6 := main(); {73572#true} is VALID [2022-04-28 03:32:13,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73572#true} {73572#true} #71#return; {73572#true} is VALID [2022-04-28 03:32:13,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {73572#true} assume true; {73572#true} is VALID [2022-04-28 03:32:13,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {73572#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); {73572#true} is VALID [2022-04-28 03:32:13,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {73572#true} call ULTIMATE.init(); {73572#true} is VALID [2022-04-28 03:32:13,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:32:13,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394522703] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:32:13,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:32:13,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 23 [2022-04-28 03:32:15,362 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:32:15,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [13022578] [2022-04-28 03:32:15,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [13022578] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:32:15,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:32:15,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-04-28 03:32:15,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701138655] [2022-04-28 03:32:15,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:32:15,362 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 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 59 [2022-04-28 03:32:15,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:32:15,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 53 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:32:15,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:32:15,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-04-28 03:32:15,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:32:15,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-04-28 03:32:15,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=674, Invalid=3748, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 03:32:15,404 INFO L87 Difference]: Start difference. First operand 483 states and 613 transitions. Second operand has 53 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:32:23,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:32:23,614 INFO L93 Difference]: Finished difference Result 502 states and 634 transitions. [2022-04-28 03:32:23,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-28 03:32:23,614 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 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 59 [2022-04-28 03:32:23,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:32:23,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:32:23,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 93 transitions. [2022-04-28 03:32:23,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:32:23,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 93 transitions. [2022-04-28 03:32:23,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 93 transitions. [2022-04-28 03:32:23,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:32:23,699 INFO L225 Difference]: With dead ends: 502 [2022-04-28 03:32:23,699 INFO L226 Difference]: Without dead ends: 493 [2022-04-28 03:32:23,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2971 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1369, Invalid=11513, Unknown=0, NotChecked=0, Total=12882 [2022-04-28 03:32:23,700 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 37 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 3395 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 3431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 3395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:32:23,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 250 Invalid, 3431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 3395 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 03:32:23,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2022-04-28 03:32:25,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 485. [2022-04-28 03:32:25,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:32:25,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 493 states. Second operand has 485 states, 480 states have (on average 1.2729166666666667) internal successors, (611), 480 states have internal predecessors, (611), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:32:25,967 INFO L74 IsIncluded]: Start isIncluded. First operand 493 states. Second operand has 485 states, 480 states have (on average 1.2729166666666667) internal successors, (611), 480 states have internal predecessors, (611), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:32:25,967 INFO L87 Difference]: Start difference. First operand 493 states. Second operand has 485 states, 480 states have (on average 1.2729166666666667) internal successors, (611), 480 states have internal predecessors, (611), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:32:25,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:32:25,975 INFO L93 Difference]: Finished difference Result 493 states and 623 transitions. [2022-04-28 03:32:25,975 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 623 transitions. [2022-04-28 03:32:25,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:32:25,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:32:25,975 INFO L74 IsIncluded]: Start isIncluded. First operand has 485 states, 480 states have (on average 1.2729166666666667) internal successors, (611), 480 states have internal predecessors, (611), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 493 states. [2022-04-28 03:32:25,976 INFO L87 Difference]: Start difference. First operand has 485 states, 480 states have (on average 1.2729166666666667) internal successors, (611), 480 states have internal predecessors, (611), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 493 states. [2022-04-28 03:32:25,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:32:25,983 INFO L93 Difference]: Finished difference Result 493 states and 623 transitions. [2022-04-28 03:32:25,983 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 623 transitions. [2022-04-28 03:32:25,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:32:25,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:32:25,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:32:25,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:32:25,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 480 states have (on average 1.2729166666666667) internal successors, (611), 480 states have internal predecessors, (611), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:32:25,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 615 transitions. [2022-04-28 03:32:25,993 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 615 transitions. Word has length 59 [2022-04-28 03:32:25,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:32:25,993 INFO L495 AbstractCegarLoop]: Abstraction has 485 states and 615 transitions. [2022-04-28 03:32:25,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:32:25,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 485 states and 615 transitions. [2022-04-28 03:32:28,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 615 edges. 615 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:32:28,322 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 615 transitions. [2022-04-28 03:32:28,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 03:32:28,323 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:32:28,323 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:32:28,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-28 03:32:28,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-04-28 03:32:28,523 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:32:28,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:32:28,524 INFO L85 PathProgramCache]: Analyzing trace with hash 380792720, now seen corresponding path program 48 times [2022-04-28 03:32:28,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:32:28,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [45884343] [2022-04-28 03:32:28,681 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:32:29,077 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:32:32,323 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:32:32,440 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:32:32,442 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:32:32,444 INFO L85 PathProgramCache]: Analyzing trace with hash -767918143, now seen corresponding path program 1 times [2022-04-28 03:32:32,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:32:32,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060082843] [2022-04-28 03:32:32,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:32:32,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:32:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:32:32,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:32:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:32:32,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {76804#(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); {76791#true} is VALID [2022-04-28 03:32:32,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {76791#true} assume true; {76791#true} is VALID [2022-04-28 03:32:32,535 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {76791#true} {76791#true} #71#return; {76791#true} is VALID [2022-04-28 03:32:32,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {76791#true} call ULTIMATE.init(); {76804#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:32:32,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {76804#(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); {76791#true} is VALID [2022-04-28 03:32:32,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {76791#true} assume true; {76791#true} is VALID [2022-04-28 03:32:32,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76791#true} {76791#true} #71#return; {76791#true} is VALID [2022-04-28 03:32:32,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {76791#true} call #t~ret6 := main(); {76791#true} is VALID [2022-04-28 03:32:32,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {76791#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {76796#(= main_~k~0 0)} is VALID [2022-04-28 03:32:32,536 INFO L290 TraceCheckUtils]: 6: Hoare triple {76796#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {76797#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:32:32,536 INFO L290 TraceCheckUtils]: 7: Hoare triple {76797#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {76798#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:32:32,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {76798#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} [223] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post3_602| |v_main_#t~post3_600|)) (.cse1 (= v_main_~i~0_812 v_main_~i~0_811)) (.cse3 (= v_main_~j~0_2465 v_main_~j~0_2443)) (.cse2 (<= v_main_~m~0_510 0))) (or (and .cse0 .cse1 (or (not (< v_main_~i~0_812 v_main_~n~0_271)) (not .cse2)) .cse3) (and .cse0 .cse1 (= v_main_~n~0_271 v_main_~n~0_271) (= v_main_~m~0_510 v_main_~m~0_510) .cse3) (and .cse2 (= v_main_~j~0_2443 0) (< v_main_~i~0_811 (+ 1 v_main_~n~0_271)) (< v_main_~i~0_812 v_main_~i~0_811)))) InVars {main_~i~0=v_main_~i~0_812, main_~n~0=v_main_~n~0_271, main_#t~post3=|v_main_#t~post3_602|, main_~m~0=v_main_~m~0_510, main_~j~0=v_main_~j~0_2465} OutVars{main_~i~0=v_main_~i~0_811, main_#t~post3=|v_main_#t~post3_600|, main_~n~0=v_main_~n~0_271, main_~m~0=v_main_~m~0_510, main_~j~0=v_main_~j~0_2443} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post3] {76799#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:32:32,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {76799#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [224] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {76799#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:32:32,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {76799#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [225] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= v_main_~k~0_2241 v_main_~k~0_2221)) (.cse1 (= v_main_~j~0_2468 v_main_~j~0_2444)) (.cse2 (= v_main_~i~0_814 v_main_~i~0_813)) (.cse5 (= |v_main_#t~post4_1399| |v_main_#t~post4_1379|)) (.cse6 (= |v_main_#t~post3_605| |v_main_#t~post3_601|)) (.cse7 (= |v_main_#t~post5_1399| |v_main_#t~post5_1379|)) (.cse4 (<= v_main_~m~0_511 20)) (.cse3 (< 19 v_main_~m~0_511))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not (< v_main_~i~0_814 v_main_~n~0_272)) (not .cse4)) .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse5 .cse6 (= v_main_~m~0_511 v_main_~m~0_511) (= v_main_~n~0_272 v_main_~n~0_272) .cse7) (and (= v_main_~j~0_2444 20) (= (+ (* 20 v_main_~i~0_814) v_main_~k~0_2221) (+ (* 20 v_main_~i~0_813) v_main_~k~0_2241)) (< v_main_~i~0_813 (+ 1 v_main_~n~0_272)) .cse4 .cse3 (< v_main_~i~0_814 v_main_~i~0_813)))) InVars {main_~m~0=v_main_~m~0_511, main_~k~0=v_main_~k~0_2241, main_~j~0=v_main_~j~0_2468, main_~i~0=v_main_~i~0_814, main_#t~post4=|v_main_#t~post4_1399|, main_#t~post5=|v_main_#t~post5_1399|, main_~n~0=v_main_~n~0_272, main_#t~post3=|v_main_#t~post3_605|} OutVars{main_~m~0=v_main_~m~0_511, main_~k~0=v_main_~k~0_2221, main_~j~0=v_main_~j~0_2444, main_~i~0=v_main_~i~0_813, main_#t~post4=|v_main_#t~post4_1379|, main_#t~post5=|v_main_#t~post5_1379|, main_#t~post3=|v_main_#t~post3_601|, main_~n~0=v_main_~n~0_272} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {76800#(or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ (* main_~i~0 20) 200) (+ main_~k~0 (* main_~n~0 20))))} is VALID [2022-04-28 03:32:32,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {76800#(or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ (* main_~i~0 20) 200) (+ main_~k~0 (* main_~n~0 20))))} [222] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {76801#(<= 200 main_~k~0)} is VALID [2022-04-28 03:32:32,539 INFO L272 TraceCheckUtils]: 12: Hoare triple {76801#(<= 200 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {76802#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:32:32,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {76802#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {76803#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:32:32,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {76803#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {76792#false} is VALID [2022-04-28 03:32:32,539 INFO L290 TraceCheckUtils]: 15: Hoare triple {76792#false} assume !false; {76792#false} is VALID [2022-04-28 03:32:32,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:32:32,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:32:32,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060082843] [2022-04-28 03:32:32,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060082843] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:32:32,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448708427] [2022-04-28 03:32:32,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:32:32,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:32:32,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:32:32,541 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:32:32,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-28 03:32:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:32:32,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:32:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:32:32,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:32:32,996 INFO L272 TraceCheckUtils]: 0: Hoare triple {76791#true} call ULTIMATE.init(); {76791#true} is VALID [2022-04-28 03:32:32,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {76791#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); {76791#true} is VALID [2022-04-28 03:32:32,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {76791#true} assume true; {76791#true} is VALID [2022-04-28 03:32:32,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76791#true} {76791#true} #71#return; {76791#true} is VALID [2022-04-28 03:32:32,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {76791#true} call #t~ret6 := main(); {76791#true} is VALID [2022-04-28 03:32:32,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {76791#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {76823#(<= 0 main_~k~0)} is VALID [2022-04-28 03:32:32,997 INFO L290 TraceCheckUtils]: 6: Hoare triple {76823#(<= 0 main_~k~0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {76827#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} is VALID [2022-04-28 03:32:32,997 INFO L290 TraceCheckUtils]: 7: Hoare triple {76827#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {76831#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:32:32,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {76831#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [223] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post3_602| |v_main_#t~post3_600|)) (.cse1 (= v_main_~i~0_812 v_main_~i~0_811)) (.cse3 (= v_main_~j~0_2465 v_main_~j~0_2443)) (.cse2 (<= v_main_~m~0_510 0))) (or (and .cse0 .cse1 (or (not (< v_main_~i~0_812 v_main_~n~0_271)) (not .cse2)) .cse3) (and .cse0 .cse1 (= v_main_~n~0_271 v_main_~n~0_271) (= v_main_~m~0_510 v_main_~m~0_510) .cse3) (and .cse2 (= v_main_~j~0_2443 0) (< v_main_~i~0_811 (+ 1 v_main_~n~0_271)) (< v_main_~i~0_812 v_main_~i~0_811)))) InVars {main_~i~0=v_main_~i~0_812, main_~n~0=v_main_~n~0_271, main_#t~post3=|v_main_#t~post3_602|, main_~m~0=v_main_~m~0_510, main_~j~0=v_main_~j~0_2465} OutVars{main_~i~0=v_main_~i~0_811, main_#t~post3=|v_main_#t~post3_600|, main_~n~0=v_main_~n~0_271, main_~m~0=v_main_~m~0_510, main_~j~0=v_main_~j~0_2443} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post3] {76831#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:32:32,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {76831#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [224] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {76831#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:32:33,000 INFO L290 TraceCheckUtils]: 10: Hoare triple {76831#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [225] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= v_main_~k~0_2241 v_main_~k~0_2221)) (.cse1 (= v_main_~j~0_2468 v_main_~j~0_2444)) (.cse2 (= v_main_~i~0_814 v_main_~i~0_813)) (.cse5 (= |v_main_#t~post4_1399| |v_main_#t~post4_1379|)) (.cse6 (= |v_main_#t~post3_605| |v_main_#t~post3_601|)) (.cse7 (= |v_main_#t~post5_1399| |v_main_#t~post5_1379|)) (.cse4 (<= v_main_~m~0_511 20)) (.cse3 (< 19 v_main_~m~0_511))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not (< v_main_~i~0_814 v_main_~n~0_272)) (not .cse4)) .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse5 .cse6 (= v_main_~m~0_511 v_main_~m~0_511) (= v_main_~n~0_272 v_main_~n~0_272) .cse7) (and (= v_main_~j~0_2444 20) (= (+ (* 20 v_main_~i~0_814) v_main_~k~0_2221) (+ (* 20 v_main_~i~0_813) v_main_~k~0_2241)) (< v_main_~i~0_813 (+ 1 v_main_~n~0_272)) .cse4 .cse3 (< v_main_~i~0_814 v_main_~i~0_813)))) InVars {main_~m~0=v_main_~m~0_511, main_~k~0=v_main_~k~0_2241, main_~j~0=v_main_~j~0_2468, main_~i~0=v_main_~i~0_814, main_#t~post4=|v_main_#t~post4_1399|, main_#t~post5=|v_main_#t~post5_1399|, main_~n~0=v_main_~n~0_272, main_#t~post3=|v_main_#t~post3_605|} OutVars{main_~m~0=v_main_~m~0_511, main_~k~0=v_main_~k~0_2221, main_~j~0=v_main_~j~0_2444, main_~i~0=v_main_~i~0_813, main_#t~post4=|v_main_#t~post4_1379|, main_#t~post5=|v_main_#t~post5_1379|, main_#t~post3=|v_main_#t~post3_601|, main_~n~0=v_main_~n~0_272} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {76841#(and (or (and (<= (+ main_~i~0 (div main_~k~0 (- 20))) 0) (< (div main_~k~0 (- 20)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))) (<= 10 main_~n~0))} is VALID [2022-04-28 03:32:33,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {76841#(and (or (and (<= (+ main_~i~0 (div main_~k~0 (- 20))) 0) (< (div main_~k~0 (- 20)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))) (<= 10 main_~n~0))} [222] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {76801#(<= 200 main_~k~0)} is VALID [2022-04-28 03:32:33,001 INFO L272 TraceCheckUtils]: 12: Hoare triple {76801#(<= 200 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {76848#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:32:33,001 INFO L290 TraceCheckUtils]: 13: Hoare triple {76848#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {76852#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:32:33,001 INFO L290 TraceCheckUtils]: 14: Hoare triple {76852#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {76792#false} is VALID [2022-04-28 03:32:33,001 INFO L290 TraceCheckUtils]: 15: Hoare triple {76792#false} assume !false; {76792#false} is VALID [2022-04-28 03:32:33,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:32:33,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:32:33,661 INFO L290 TraceCheckUtils]: 15: Hoare triple {76792#false} assume !false; {76792#false} is VALID [2022-04-28 03:32:33,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {76852#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {76792#false} is VALID [2022-04-28 03:32:33,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {76848#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {76852#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:32:33,662 INFO L272 TraceCheckUtils]: 12: Hoare triple {76868#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {76848#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:32:33,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {76872#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} [222] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {76868#(<= 100 main_~k~0)} is VALID [2022-04-28 03:32:33,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {76876#(and (or (not (<= main_~m~0 20)) (<= main_~n~0 main_~i~0) (not (< 19 main_~m~0)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 20))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [225] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= v_main_~k~0_2241 v_main_~k~0_2221)) (.cse1 (= v_main_~j~0_2468 v_main_~j~0_2444)) (.cse2 (= v_main_~i~0_814 v_main_~i~0_813)) (.cse5 (= |v_main_#t~post4_1399| |v_main_#t~post4_1379|)) (.cse6 (= |v_main_#t~post3_605| |v_main_#t~post3_601|)) (.cse7 (= |v_main_#t~post5_1399| |v_main_#t~post5_1379|)) (.cse4 (<= v_main_~m~0_511 20)) (.cse3 (< 19 v_main_~m~0_511))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not (< v_main_~i~0_814 v_main_~n~0_272)) (not .cse4)) .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse5 .cse6 (= v_main_~m~0_511 v_main_~m~0_511) (= v_main_~n~0_272 v_main_~n~0_272) .cse7) (and (= v_main_~j~0_2444 20) (= (+ (* 20 v_main_~i~0_814) v_main_~k~0_2221) (+ (* 20 v_main_~i~0_813) v_main_~k~0_2241)) (< v_main_~i~0_813 (+ 1 v_main_~n~0_272)) .cse4 .cse3 (< v_main_~i~0_814 v_main_~i~0_813)))) InVars {main_~m~0=v_main_~m~0_511, main_~k~0=v_main_~k~0_2241, main_~j~0=v_main_~j~0_2468, main_~i~0=v_main_~i~0_814, main_#t~post4=|v_main_#t~post4_1399|, main_#t~post5=|v_main_#t~post5_1399|, main_~n~0=v_main_~n~0_272, main_#t~post3=|v_main_#t~post3_605|} OutVars{main_~m~0=v_main_~m~0_511, main_~k~0=v_main_~k~0_2221, main_~j~0=v_main_~j~0_2444, main_~i~0=v_main_~i~0_813, main_#t~post4=|v_main_#t~post4_1379|, main_#t~post5=|v_main_#t~post5_1379|, main_#t~post3=|v_main_#t~post3_601|, main_~n~0=v_main_~n~0_272} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {76872#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} is VALID [2022-04-28 03:32:33,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {76876#(and (or (not (<= main_~m~0 20)) (<= main_~n~0 main_~i~0) (not (< 19 main_~m~0)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 20))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [224] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {76876#(and (or (not (<= main_~m~0 20)) (<= main_~n~0 main_~i~0) (not (< 19 main_~m~0)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 20))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:32:33,665 INFO L290 TraceCheckUtils]: 8: Hoare triple {76883#(and (or (<= 100 main_~k~0) (not (<= main_~m~0 0))) (or (not (<= main_~m~0 20)) (<= main_~n~0 main_~i~0) (not (< 19 main_~m~0)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 20))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [223] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post3_602| |v_main_#t~post3_600|)) (.cse1 (= v_main_~i~0_812 v_main_~i~0_811)) (.cse3 (= v_main_~j~0_2465 v_main_~j~0_2443)) (.cse2 (<= v_main_~m~0_510 0))) (or (and .cse0 .cse1 (or (not (< v_main_~i~0_812 v_main_~n~0_271)) (not .cse2)) .cse3) (and .cse0 .cse1 (= v_main_~n~0_271 v_main_~n~0_271) (= v_main_~m~0_510 v_main_~m~0_510) .cse3) (and .cse2 (= v_main_~j~0_2443 0) (< v_main_~i~0_811 (+ 1 v_main_~n~0_271)) (< v_main_~i~0_812 v_main_~i~0_811)))) InVars {main_~i~0=v_main_~i~0_812, main_~n~0=v_main_~n~0_271, main_#t~post3=|v_main_#t~post3_602|, main_~m~0=v_main_~m~0_510, main_~j~0=v_main_~j~0_2465} OutVars{main_~i~0=v_main_~i~0_811, main_#t~post3=|v_main_#t~post3_600|, main_~n~0=v_main_~n~0_271, main_~m~0=v_main_~m~0_510, main_~j~0=v_main_~j~0_2443} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post3] {76876#(and (or (not (<= main_~m~0 20)) (<= main_~n~0 main_~i~0) (not (< 19 main_~m~0)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 20))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:32:33,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {76887#(and (or (< 0 main_~n~0) (<= 100 main_~k~0)) (or (<= (div (+ (- 100) main_~k~0) (- 20)) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 20)) 1)))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {76883#(and (or (<= 100 main_~k~0) (not (<= main_~m~0 0))) (or (not (<= main_~m~0 20)) (<= main_~n~0 main_~i~0) (not (< 19 main_~m~0)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 20))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:32:33,666 INFO L290 TraceCheckUtils]: 6: Hoare triple {76891#(<= (div (+ (- 100) main_~k~0) (- 20)) 10)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {76887#(and (or (< 0 main_~n~0) (<= 100 main_~k~0)) (or (<= (div (+ (- 100) main_~k~0) (- 20)) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 20)) 1)))} is VALID [2022-04-28 03:32:33,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {76791#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {76891#(<= (div (+ (- 100) main_~k~0) (- 20)) 10)} is VALID [2022-04-28 03:32:33,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {76791#true} call #t~ret6 := main(); {76791#true} is VALID [2022-04-28 03:32:33,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76791#true} {76791#true} #71#return; {76791#true} is VALID [2022-04-28 03:32:33,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {76791#true} assume true; {76791#true} is VALID [2022-04-28 03:32:33,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {76791#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); {76791#true} is VALID [2022-04-28 03:32:33,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {76791#true} call ULTIMATE.init(); {76791#true} is VALID [2022-04-28 03:32:33,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:32:33,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448708427] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:32:33,667 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:32:33,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 23 [2022-04-28 03:32:35,374 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:32:35,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [45884343] [2022-04-28 03:32:35,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [45884343] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:32:35,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:32:35,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-04-28 03:32:35,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957424305] [2022-04-28 03:32:35,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:32:35,375 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 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 59 [2022-04-28 03:32:35,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:32:35,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 53 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:32:35,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:32:35,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-04-28 03:32:35,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:32:35,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-04-28 03:32:35,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=643, Invalid=3779, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 03:32:35,417 INFO L87 Difference]: Start difference. First operand 485 states and 615 transitions. Second operand has 53 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:32:43,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:32:43,811 INFO L93 Difference]: Finished difference Result 505 states and 637 transitions. [2022-04-28 03:32:43,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-28 03:32:43,811 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 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 59 [2022-04-28 03:32:43,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:32:43,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:32:43,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 95 transitions. [2022-04-28 03:32:43,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:32:43,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 95 transitions. [2022-04-28 03:32:43,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 95 transitions. [2022-04-28 03:32:43,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:32:43,891 INFO L225 Difference]: With dead ends: 505 [2022-04-28 03:32:43,891 INFO L226 Difference]: Without dead ends: 496 [2022-04-28 03:32:43,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2896 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1301, Invalid=11581, Unknown=0, NotChecked=0, Total=12882 [2022-04-28 03:32:43,892 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 41 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 3564 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 3601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 3564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:32:43,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 255 Invalid, 3601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 3564 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 03:32:43,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2022-04-28 03:32:46,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 488. [2022-04-28 03:32:46,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:32:46,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 496 states. Second operand has 488 states, 483 states have (on average 1.2712215320910973) internal successors, (614), 483 states have internal predecessors, (614), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:32:46,179 INFO L74 IsIncluded]: Start isIncluded. First operand 496 states. Second operand has 488 states, 483 states have (on average 1.2712215320910973) internal successors, (614), 483 states have internal predecessors, (614), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:32:46,180 INFO L87 Difference]: Start difference. First operand 496 states. Second operand has 488 states, 483 states have (on average 1.2712215320910973) internal successors, (614), 483 states have internal predecessors, (614), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:32:46,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:32:46,188 INFO L93 Difference]: Finished difference Result 496 states and 626 transitions. [2022-04-28 03:32:46,188 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 626 transitions. [2022-04-28 03:32:46,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:32:46,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:32:46,188 INFO L74 IsIncluded]: Start isIncluded. First operand has 488 states, 483 states have (on average 1.2712215320910973) internal successors, (614), 483 states have internal predecessors, (614), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 496 states. [2022-04-28 03:32:46,189 INFO L87 Difference]: Start difference. First operand has 488 states, 483 states have (on average 1.2712215320910973) internal successors, (614), 483 states have internal predecessors, (614), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 496 states. [2022-04-28 03:32:46,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:32:46,197 INFO L93 Difference]: Finished difference Result 496 states and 626 transitions. [2022-04-28 03:32:46,197 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 626 transitions. [2022-04-28 03:32:46,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:32:46,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:32:46,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:32:46,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:32:46,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 483 states have (on average 1.2712215320910973) internal successors, (614), 483 states have internal predecessors, (614), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:32:46,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 618 transitions. [2022-04-28 03:32:46,207 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 618 transitions. Word has length 59 [2022-04-28 03:32:46,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:32:46,207 INFO L495 AbstractCegarLoop]: Abstraction has 488 states and 618 transitions. [2022-04-28 03:32:46,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:32:46,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 488 states and 618 transitions. [2022-04-28 03:32:48,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 618 edges. 618 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:32:48,541 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 618 transitions. [2022-04-28 03:32:48,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-28 03:32:48,542 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:32:48,542 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:32:48,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-28 03:32:48,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-04-28 03:32:48,747 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:32:48,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:32:48,748 INFO L85 PathProgramCache]: Analyzing trace with hash -874356979, now seen corresponding path program 49 times [2022-04-28 03:32:48,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:32:48,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1806519945] [2022-04-28 03:32:48,881 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:32:49,293 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:32:49,294 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:32:49,296 INFO L85 PathProgramCache]: Analyzing trace with hash -582008094, now seen corresponding path program 1 times [2022-04-28 03:32:49,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:32:49,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893284487] [2022-04-28 03:32:49,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:32:49,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:32:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:32:49,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:32:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:32:49,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {80040#(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); {80028#true} is VALID [2022-04-28 03:32:49,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {80028#true} assume true; {80028#true} is VALID [2022-04-28 03:32:49,380 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {80028#true} {80028#true} #71#return; {80028#true} is VALID [2022-04-28 03:32:49,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {80028#true} call ULTIMATE.init(); {80040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:32:49,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {80040#(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); {80028#true} is VALID [2022-04-28 03:32:49,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {80028#true} assume true; {80028#true} is VALID [2022-04-28 03:32:49,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80028#true} {80028#true} #71#return; {80028#true} is VALID [2022-04-28 03:32:49,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {80028#true} call #t~ret6 := main(); {80028#true} is VALID [2022-04-28 03:32:49,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {80028#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {80033#(= main_~k~0 0)} is VALID [2022-04-28 03:32:49,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {80033#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {80034#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:32:49,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {80034#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {80035#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:32:49,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {80035#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [227] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_1434| |v_main_#t~post4_1412|)) (.cse1 (= |v_main_#t~post5_1434| |v_main_#t~post5_1412|)) (.cse2 (= v_main_~j~0_2531 v_main_~j~0_2508)) (.cse3 (= |v_main_#t~post3_615| |v_main_#t~post3_614|)) (.cse6 (< 21 v_main_~m~0_520)) (.cse7 (<= v_main_~m~0_520 22)) (.cse4 (= v_main_~i~0_831 v_main_~i~0_830)) (.cse5 (= v_main_~k~0_2300 v_main_~k~0_2278))) (or (and .cse0 .cse1 .cse2 .cse3 (= v_main_~m~0_520 v_main_~m~0_520) (= v_main_~n~0_276 v_main_~n~0_276) .cse4 .cse5) (and (= (+ (* 22 v_main_~i~0_830) v_main_~k~0_2300) (+ (* 22 v_main_~i~0_831) v_main_~k~0_2278)) .cse6 .cse7 (< v_main_~i~0_831 v_main_~i~0_830) (= 22 v_main_~j~0_2508) (< v_main_~i~0_830 (+ 1 v_main_~n~0_276))) (and .cse0 .cse1 .cse2 .cse3 (or (not .cse6) (not .cse7) (not (< v_main_~i~0_831 v_main_~n~0_276))) .cse4 .cse5))) InVars {main_~m~0=v_main_~m~0_520, main_~k~0=v_main_~k~0_2300, main_~j~0=v_main_~j~0_2531, main_~i~0=v_main_~i~0_831, main_#t~post4=|v_main_#t~post4_1434|, main_#t~post5=|v_main_#t~post5_1434|, main_~n~0=v_main_~n~0_276, main_#t~post3=|v_main_#t~post3_615|} OutVars{main_~m~0=v_main_~m~0_520, main_~k~0=v_main_~k~0_2278, main_~j~0=v_main_~j~0_2508, main_~i~0=v_main_~i~0_830, main_#t~post4=|v_main_#t~post4_1412|, main_#t~post5=|v_main_#t~post5_1412|, main_#t~post3=|v_main_#t~post3_614|, main_~n~0=v_main_~n~0_276} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {80036#(or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ (* main_~i~0 22) 220) (+ main_~k~0 (* main_~n~0 22))))} is VALID [2022-04-28 03:32:49,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {80036#(or (and (<= 10 main_~n~0) (= main_~i~0 0)) (<= (+ (* main_~i~0 22) 220) (+ main_~k~0 (* main_~n~0 22))))} [226] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {80037#(<= 220 main_~k~0)} is VALID [2022-04-28 03:32:49,384 INFO L272 TraceCheckUtils]: 10: Hoare triple {80037#(<= 220 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {80038#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:32:49,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {80038#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {80039#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:32:49,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {80039#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {80029#false} is VALID [2022-04-28 03:32:49,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {80029#false} assume !false; {80029#false} is VALID [2022-04-28 03:32:49,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:32:49,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:32:49,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893284487] [2022-04-28 03:32:49,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893284487] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:32:49,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:32:49,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:32:52,549 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:32:52,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1806519945] [2022-04-28 03:32:52,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1806519945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:32:52,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:32:52,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2022-04-28 03:32:52,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798028596] [2022-04-28 03:32:52,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:32:52,550 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.018181818181818) internal successors, (56), 54 states have internal predecessors, (56), 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 60 [2022-04-28 03:32:52,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:32:52,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 56 states, 55 states have (on average 1.018181818181818) internal successors, (56), 54 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:32:52,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:32:52,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-04-28 03:32:52,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:32:52,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-04-28 03:32:52,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=3138, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 03:32:52,604 INFO L87 Difference]: Start difference. First operand 488 states and 618 transitions. Second operand has 56 states, 55 states have (on average 1.018181818181818) internal successors, (56), 54 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:33:08,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:33:08,374 INFO L93 Difference]: Finished difference Result 577 states and 733 transitions. [2022-04-28 03:33:08,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-04-28 03:33:08,374 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.018181818181818) internal successors, (56), 54 states have internal predecessors, (56), 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 60 [2022-04-28 03:33:08,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:33:08,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.018181818181818) internal successors, (56), 54 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:33:08,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 123 transitions. [2022-04-28 03:33:08,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.018181818181818) internal successors, (56), 54 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:33:08,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 123 transitions. [2022-04-28 03:33:08,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 123 transitions. [2022-04-28 03:33:08,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:33:08,511 INFO L225 Difference]: With dead ends: 577 [2022-04-28 03:33:08,512 INFO L226 Difference]: Without dead ends: 572 [2022-04-28 03:33:08,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2014 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=457, Invalid=11975, Unknown=0, NotChecked=0, Total=12432 [2022-04-28 03:33:08,513 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 61 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 5426 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 5469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 5426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:33:08,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 275 Invalid, 5469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 5426 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-04-28 03:33:08,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2022-04-28 03:33:11,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 537. [2022-04-28 03:33:11,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:33:11,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 572 states. Second operand has 537 states, 532 states have (on average 1.2913533834586466) internal successors, (687), 532 states have internal predecessors, (687), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:33:11,032 INFO L74 IsIncluded]: Start isIncluded. First operand 572 states. Second operand has 537 states, 532 states have (on average 1.2913533834586466) internal successors, (687), 532 states have internal predecessors, (687), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:33:11,032 INFO L87 Difference]: Start difference. First operand 572 states. Second operand has 537 states, 532 states have (on average 1.2913533834586466) internal successors, (687), 532 states have internal predecessors, (687), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:33:11,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:33:11,043 INFO L93 Difference]: Finished difference Result 572 states and 728 transitions. [2022-04-28 03:33:11,043 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 728 transitions. [2022-04-28 03:33:11,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:33:11,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:33:11,043 INFO L74 IsIncluded]: Start isIncluded. First operand has 537 states, 532 states have (on average 1.2913533834586466) internal successors, (687), 532 states have internal predecessors, (687), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 572 states. [2022-04-28 03:33:11,044 INFO L87 Difference]: Start difference. First operand has 537 states, 532 states have (on average 1.2913533834586466) internal successors, (687), 532 states have internal predecessors, (687), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 572 states. [2022-04-28 03:33:11,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:33:11,054 INFO L93 Difference]: Finished difference Result 572 states and 728 transitions. [2022-04-28 03:33:11,054 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 728 transitions. [2022-04-28 03:33:11,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:33:11,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:33:11,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:33:11,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:33:11,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 532 states have (on average 1.2913533834586466) internal successors, (687), 532 states have internal predecessors, (687), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:33:11,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 691 transitions. [2022-04-28 03:33:11,071 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 691 transitions. Word has length 60 [2022-04-28 03:33:11,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:33:11,071 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 691 transitions. [2022-04-28 03:33:11,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.018181818181818) internal successors, (56), 54 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:33:11,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 537 states and 691 transitions. [2022-04-28 03:33:13,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 691 edges. 691 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:33:13,849 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 691 transitions. [2022-04-28 03:33:13,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 03:33:13,849 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:33:13,849 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:33:13,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-04-28 03:33:13,849 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:33:13,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:33:13,850 INFO L85 PathProgramCache]: Analyzing trace with hash 645363910, now seen corresponding path program 50 times [2022-04-28 03:33:13,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:33:13,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [515786112] [2022-04-28 03:33:14,244 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:33:14,407 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:33:14,817 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:33:15,067 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:33:15,068 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:33:15,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1988587199, now seen corresponding path program 1 times [2022-04-28 03:33:15,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:33:15,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313916061] [2022-04-28 03:33:15,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:33:15,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:33:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:33:15,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:33:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:33:15,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {83584#(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); {83571#true} is VALID [2022-04-28 03:33:15,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {83571#true} assume true; {83571#true} is VALID [2022-04-28 03:33:15,208 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {83571#true} {83571#true} #71#return; {83571#true} is VALID [2022-04-28 03:33:15,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {83571#true} call ULTIMATE.init(); {83584#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:33:15,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {83584#(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); {83571#true} is VALID [2022-04-28 03:33:15,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {83571#true} assume true; {83571#true} is VALID [2022-04-28 03:33:15,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83571#true} {83571#true} #71#return; {83571#true} is VALID [2022-04-28 03:33:15,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {83571#true} call #t~ret6 := main(); {83571#true} is VALID [2022-04-28 03:33:15,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {83571#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {83576#(= main_~k~0 0)} is VALID [2022-04-28 03:33:15,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {83576#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {83577#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:33:15,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {83577#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {83578#(and (not (<= main_~m~0 9)) (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:33:15,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {83578#(and (not (<= main_~m~0 9)) (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [229] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_847 v_main_~i~0_846)) (.cse1 (= |v_main_#t~post4_1472| |v_main_#t~post4_1451|)) (.cse4 (<= v_main_~m~0_532 10)) (.cse5 (< 9 v_main_~m~0_532)) (.cse2 (= |v_main_#t~post5_1472| |v_main_#t~post5_1451|)) (.cse3 (= |v_main_#t~post3_628| |v_main_#t~post3_626|))) (or (and (= v_main_~n~0_283 v_main_~n~0_283) .cse0 .cse1 (= v_main_~m~0_532 v_main_~m~0_532) (= v_main_~k~0_2353 v_main_~k~0_2343) .cse2 (= v_main_~j~0_2600 v_main_~j~0_2577) .cse3) (and (< v_main_~i~0_846 (+ 1 v_main_~n~0_283)) (= v_main_~j~0_2577 10) .cse4 .cse5 (= (+ (* 10 v_main_~i~0_847) v_main_~k~0_2343) (+ (* 10 v_main_~i~0_846) v_main_~k~0_2353)) (< v_main_~i~0_847 v_main_~i~0_846)) (and .cse0 (= v_main_~j~0_2577 v_main_~j~0_2600) .cse1 (or (not .cse4) (not (< v_main_~i~0_847 v_main_~n~0_283)) (not .cse5)) (= v_main_~k~0_2343 v_main_~k~0_2353) .cse2 .cse3))) InVars {main_~m~0=v_main_~m~0_532, main_~k~0=v_main_~k~0_2353, main_~j~0=v_main_~j~0_2600, main_~i~0=v_main_~i~0_847, main_#t~post4=|v_main_#t~post4_1472|, main_#t~post5=|v_main_#t~post5_1472|, main_~n~0=v_main_~n~0_283, main_#t~post3=|v_main_#t~post3_628|} OutVars{main_~m~0=v_main_~m~0_532, main_~k~0=v_main_~k~0_2343, main_~j~0=v_main_~j~0_2577, main_~i~0=v_main_~i~0_846, main_#t~post4=|v_main_#t~post4_1451|, main_#t~post5=|v_main_#t~post5_1451|, main_#t~post3=|v_main_#t~post3_626|, main_~n~0=v_main_~n~0_283} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {83579#(and (or (<= main_~m~0 10) (and (= main_~k~0 0) (= main_~i~0 0))) (or (= main_~i~0 0) (<= (+ (* main_~i~0 10) 100) (+ main_~k~0 (* main_~n~0 10)))) (or (<= 10 main_~n~0) (not (= main_~i~0 0))))} is VALID [2022-04-28 03:33:15,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {83579#(and (or (<= main_~m~0 10) (and (= main_~k~0 0) (= main_~i~0 0))) (or (= main_~i~0 0) (<= (+ (* main_~i~0 10) 100) (+ main_~k~0 (* main_~n~0 10)))) (or (<= 10 main_~n~0) (not (= main_~i~0 0))))} [230] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {83579#(and (or (<= main_~m~0 10) (and (= main_~k~0 0) (= main_~i~0 0))) (or (= main_~i~0 0) (<= (+ (* main_~i~0 10) 100) (+ main_~k~0 (* main_~n~0 10)))) (or (<= 10 main_~n~0) (not (= main_~i~0 0))))} is VALID [2022-04-28 03:33:15,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {83579#(and (or (<= main_~m~0 10) (and (= main_~k~0 0) (= main_~i~0 0))) (or (= main_~i~0 0) (<= (+ (* main_~i~0 10) 100) (+ main_~k~0 (* main_~n~0 10)))) (or (<= 10 main_~n~0) (not (= main_~i~0 0))))} [231] L31-3-->L31-4_primed: Formula: (let ((.cse1 (< 10 v_main_~m~0_533)) (.cse0 (<= v_main_~m~0_533 11)) (.cse2 (= |v_main_#t~post3_631| |v_main_#t~post3_627|)) (.cse3 (= v_main_~k~0_2365 v_main_~k~0_2354)) (.cse4 (= v_main_~i~0_849 v_main_~i~0_848)) (.cse5 (= |v_main_#t~post4_1475| |v_main_#t~post4_1461|))) (or (and (= (+ (* 11 v_main_~i~0_848) v_main_~k~0_2365) (+ (* 11 v_main_~i~0_849) v_main_~k~0_2354)) .cse0 (= v_main_~j~0_2588 11) (< v_main_~i~0_849 v_main_~i~0_848) (< v_main_~i~0_848 (+ 1 v_main_~n~0_284)) .cse1) (and .cse2 (or (not .cse1) (not .cse0) (not (< v_main_~i~0_849 v_main_~n~0_284))) .cse3 .cse4 (= |v_main_#t~post5_1461| |v_main_#t~post5_1475|) (= v_main_~j~0_2588 v_main_~j~0_2603) .cse5) (and .cse2 (= v_main_~j~0_2603 v_main_~j~0_2588) .cse3 (= v_main_~n~0_284 v_main_~n~0_284) (= |v_main_#t~post5_1475| |v_main_#t~post5_1461|) .cse4 (= v_main_~m~0_533 v_main_~m~0_533) .cse5))) InVars {main_~m~0=v_main_~m~0_533, main_~k~0=v_main_~k~0_2365, main_~j~0=v_main_~j~0_2603, main_~i~0=v_main_~i~0_849, main_#t~post4=|v_main_#t~post4_1475|, main_#t~post5=|v_main_#t~post5_1475|, main_~n~0=v_main_~n~0_284, main_#t~post3=|v_main_#t~post3_631|} OutVars{main_~m~0=v_main_~m~0_533, main_~k~0=v_main_~k~0_2354, main_~j~0=v_main_~j~0_2588, main_~i~0=v_main_~i~0_848, main_#t~post4=|v_main_#t~post4_1461|, main_#t~post5=|v_main_#t~post5_1461|, main_#t~post3=|v_main_#t~post3_627|, main_~n~0=v_main_~n~0_284} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {83580#(or (<= (+ main_~i~0 10) main_~n~0) (<= (+ (* main_~i~0 10) 100) (+ main_~k~0 (* main_~n~0 10))))} is VALID [2022-04-28 03:33:15,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {83580#(or (<= (+ main_~i~0 10) main_~n~0) (<= (+ (* main_~i~0 10) 100) (+ main_~k~0 (* main_~n~0 10))))} [228] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {83581#(<= 100 main_~k~0)} is VALID [2022-04-28 03:33:15,213 INFO L272 TraceCheckUtils]: 12: Hoare triple {83581#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {83582#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:33:15,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {83582#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {83583#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:33:15,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {83583#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {83572#false} is VALID [2022-04-28 03:33:15,214 INFO L290 TraceCheckUtils]: 15: Hoare triple {83572#false} assume !false; {83572#false} is VALID [2022-04-28 03:33:15,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:33:15,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:33:15,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313916061] [2022-04-28 03:33:15,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313916061] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:33:15,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857109053] [2022-04-28 03:33:15,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:33:15,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:33:15,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:33:15,215 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:33:15,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-28 03:33:15,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:33:15,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:33:15,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:33:15,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:33:15,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {83571#true} call ULTIMATE.init(); {83571#true} is VALID [2022-04-28 03:33:15,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {83571#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); {83571#true} is VALID [2022-04-28 03:33:15,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {83571#true} assume true; {83571#true} is VALID [2022-04-28 03:33:15,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83571#true} {83571#true} #71#return; {83571#true} is VALID [2022-04-28 03:33:15,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {83571#true} call #t~ret6 := main(); {83571#true} is VALID [2022-04-28 03:33:15,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {83571#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {83603#(<= 0 main_~k~0)} is VALID [2022-04-28 03:33:15,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {83603#(<= 0 main_~k~0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {83607#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} is VALID [2022-04-28 03:33:15,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {83607#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {83611#(and (<= 10 main_~n~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:33:15,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {83611#(and (<= 10 main_~n~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [229] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_847 v_main_~i~0_846)) (.cse1 (= |v_main_#t~post4_1472| |v_main_#t~post4_1451|)) (.cse4 (<= v_main_~m~0_532 10)) (.cse5 (< 9 v_main_~m~0_532)) (.cse2 (= |v_main_#t~post5_1472| |v_main_#t~post5_1451|)) (.cse3 (= |v_main_#t~post3_628| |v_main_#t~post3_626|))) (or (and (= v_main_~n~0_283 v_main_~n~0_283) .cse0 .cse1 (= v_main_~m~0_532 v_main_~m~0_532) (= v_main_~k~0_2353 v_main_~k~0_2343) .cse2 (= v_main_~j~0_2600 v_main_~j~0_2577) .cse3) (and (< v_main_~i~0_846 (+ 1 v_main_~n~0_283)) (= v_main_~j~0_2577 10) .cse4 .cse5 (= (+ (* 10 v_main_~i~0_847) v_main_~k~0_2343) (+ (* 10 v_main_~i~0_846) v_main_~k~0_2353)) (< v_main_~i~0_847 v_main_~i~0_846)) (and .cse0 (= v_main_~j~0_2577 v_main_~j~0_2600) .cse1 (or (not .cse4) (not (< v_main_~i~0_847 v_main_~n~0_283)) (not .cse5)) (= v_main_~k~0_2343 v_main_~k~0_2353) .cse2 .cse3))) InVars {main_~m~0=v_main_~m~0_532, main_~k~0=v_main_~k~0_2353, main_~j~0=v_main_~j~0_2600, main_~i~0=v_main_~i~0_847, main_#t~post4=|v_main_#t~post4_1472|, main_#t~post5=|v_main_#t~post5_1472|, main_~n~0=v_main_~n~0_283, main_#t~post3=|v_main_#t~post3_628|} OutVars{main_~m~0=v_main_~m~0_532, main_~k~0=v_main_~k~0_2343, main_~j~0=v_main_~j~0_2577, main_~i~0=v_main_~i~0_846, main_#t~post4=|v_main_#t~post4_1451|, main_#t~post5=|v_main_#t~post5_1451|, main_#t~post3=|v_main_#t~post3_626|, main_~n~0=v_main_~n~0_283} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {83615#(and (<= 10 main_~n~0) (or (and (<= main_~m~0 10) (<= (+ main_~i~0 (div main_~k~0 (- 10))) 0) (= main_~j~0 10) (< (div main_~k~0 (- 10)) 0) (< main_~i~0 (+ main_~n~0 1)) (< 9 main_~m~0)) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:33:15,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {83615#(and (<= 10 main_~n~0) (or (and (<= main_~m~0 10) (<= (+ main_~i~0 (div main_~k~0 (- 10))) 0) (= main_~j~0 10) (< (div main_~k~0 (- 10)) 0) (< main_~i~0 (+ main_~n~0 1)) (< 9 main_~m~0)) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [230] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {83615#(and (<= 10 main_~n~0) (or (and (<= main_~m~0 10) (<= (+ main_~i~0 (div main_~k~0 (- 10))) 0) (= main_~j~0 10) (< (div main_~k~0 (- 10)) 0) (< main_~i~0 (+ main_~n~0 1)) (< 9 main_~m~0)) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:33:15,893 INFO L290 TraceCheckUtils]: 10: Hoare triple {83615#(and (<= 10 main_~n~0) (or (and (<= main_~m~0 10) (<= (+ main_~i~0 (div main_~k~0 (- 10))) 0) (= main_~j~0 10) (< (div main_~k~0 (- 10)) 0) (< main_~i~0 (+ main_~n~0 1)) (< 9 main_~m~0)) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [231] L31-3-->L31-4_primed: Formula: (let ((.cse1 (< 10 v_main_~m~0_533)) (.cse0 (<= v_main_~m~0_533 11)) (.cse2 (= |v_main_#t~post3_631| |v_main_#t~post3_627|)) (.cse3 (= v_main_~k~0_2365 v_main_~k~0_2354)) (.cse4 (= v_main_~i~0_849 v_main_~i~0_848)) (.cse5 (= |v_main_#t~post4_1475| |v_main_#t~post4_1461|))) (or (and (= (+ (* 11 v_main_~i~0_848) v_main_~k~0_2365) (+ (* 11 v_main_~i~0_849) v_main_~k~0_2354)) .cse0 (= v_main_~j~0_2588 11) (< v_main_~i~0_849 v_main_~i~0_848) (< v_main_~i~0_848 (+ 1 v_main_~n~0_284)) .cse1) (and .cse2 (or (not .cse1) (not .cse0) (not (< v_main_~i~0_849 v_main_~n~0_284))) .cse3 .cse4 (= |v_main_#t~post5_1461| |v_main_#t~post5_1475|) (= v_main_~j~0_2588 v_main_~j~0_2603) .cse5) (and .cse2 (= v_main_~j~0_2603 v_main_~j~0_2588) .cse3 (= v_main_~n~0_284 v_main_~n~0_284) (= |v_main_#t~post5_1475| |v_main_#t~post5_1461|) .cse4 (= v_main_~m~0_533 v_main_~m~0_533) .cse5))) InVars {main_~m~0=v_main_~m~0_533, main_~k~0=v_main_~k~0_2365, main_~j~0=v_main_~j~0_2603, main_~i~0=v_main_~i~0_849, main_#t~post4=|v_main_#t~post4_1475|, main_#t~post5=|v_main_#t~post5_1475|, main_~n~0=v_main_~n~0_284, main_#t~post3=|v_main_#t~post3_631|} OutVars{main_~m~0=v_main_~m~0_533, main_~k~0=v_main_~k~0_2354, main_~j~0=v_main_~j~0_2588, main_~i~0=v_main_~i~0_848, main_#t~post4=|v_main_#t~post4_1461|, main_#t~post5=|v_main_#t~post5_1461|, main_#t~post3=|v_main_#t~post3_627|, main_~n~0=v_main_~n~0_284} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {83622#(and (<= 10 main_~n~0) (or (and (<= (+ main_~i~0 (div main_~k~0 (- 10))) 0) (< (div main_~k~0 (- 10)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:33:15,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {83622#(and (<= 10 main_~n~0) (or (and (<= (+ main_~i~0 (div main_~k~0 (- 10))) 0) (< (div main_~k~0 (- 10)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [228] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {83581#(<= 100 main_~k~0)} is VALID [2022-04-28 03:33:15,894 INFO L272 TraceCheckUtils]: 12: Hoare triple {83581#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {83629#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:33:15,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {83629#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {83633#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:33:15,895 INFO L290 TraceCheckUtils]: 14: Hoare triple {83633#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {83572#false} is VALID [2022-04-28 03:33:15,895 INFO L290 TraceCheckUtils]: 15: Hoare triple {83572#false} assume !false; {83572#false} is VALID [2022-04-28 03:33:15,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:33:15,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:33:16,497 INFO L290 TraceCheckUtils]: 15: Hoare triple {83572#false} assume !false; {83572#false} is VALID [2022-04-28 03:33:16,497 INFO L290 TraceCheckUtils]: 14: Hoare triple {83633#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {83572#false} is VALID [2022-04-28 03:33:16,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {83629#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {83633#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:33:16,498 INFO L272 TraceCheckUtils]: 12: Hoare triple {83581#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {83629#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:33:16,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {83652#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} [228] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {83581#(<= 100 main_~k~0)} is VALID [2022-04-28 03:33:16,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {83656#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 11))) main_~n~0) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 11)) (not (< 10 main_~m~0))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [231] L31-3-->L31-4_primed: Formula: (let ((.cse1 (< 10 v_main_~m~0_533)) (.cse0 (<= v_main_~m~0_533 11)) (.cse2 (= |v_main_#t~post3_631| |v_main_#t~post3_627|)) (.cse3 (= v_main_~k~0_2365 v_main_~k~0_2354)) (.cse4 (= v_main_~i~0_849 v_main_~i~0_848)) (.cse5 (= |v_main_#t~post4_1475| |v_main_#t~post4_1461|))) (or (and (= (+ (* 11 v_main_~i~0_848) v_main_~k~0_2365) (+ (* 11 v_main_~i~0_849) v_main_~k~0_2354)) .cse0 (= v_main_~j~0_2588 11) (< v_main_~i~0_849 v_main_~i~0_848) (< v_main_~i~0_848 (+ 1 v_main_~n~0_284)) .cse1) (and .cse2 (or (not .cse1) (not .cse0) (not (< v_main_~i~0_849 v_main_~n~0_284))) .cse3 .cse4 (= |v_main_#t~post5_1461| |v_main_#t~post5_1475|) (= v_main_~j~0_2588 v_main_~j~0_2603) .cse5) (and .cse2 (= v_main_~j~0_2603 v_main_~j~0_2588) .cse3 (= v_main_~n~0_284 v_main_~n~0_284) (= |v_main_#t~post5_1475| |v_main_#t~post5_1461|) .cse4 (= v_main_~m~0_533 v_main_~m~0_533) .cse5))) InVars {main_~m~0=v_main_~m~0_533, main_~k~0=v_main_~k~0_2365, main_~j~0=v_main_~j~0_2603, main_~i~0=v_main_~i~0_849, main_#t~post4=|v_main_#t~post4_1475|, main_#t~post5=|v_main_#t~post5_1475|, main_~n~0=v_main_~n~0_284, main_#t~post3=|v_main_#t~post3_631|} OutVars{main_~m~0=v_main_~m~0_533, main_~k~0=v_main_~k~0_2354, main_~j~0=v_main_~j~0_2588, main_~i~0=v_main_~i~0_848, main_#t~post4=|v_main_#t~post4_1461|, main_#t~post5=|v_main_#t~post5_1461|, main_#t~post3=|v_main_#t~post3_627|, main_~n~0=v_main_~n~0_284} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {83652#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} is VALID [2022-04-28 03:33:16,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {83656#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 11))) main_~n~0) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 11)) (not (< 10 main_~m~0))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [230] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {83656#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 11))) main_~n~0) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 11)) (not (< 10 main_~m~0))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:33:16,501 INFO L290 TraceCheckUtils]: 8: Hoare triple {83663#(and (or (<= (+ (div (+ (- 100) main_~k~0) (- 10)) main_~i~0) main_~n~0) (<= main_~n~0 main_~i~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [229] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_847 v_main_~i~0_846)) (.cse1 (= |v_main_#t~post4_1472| |v_main_#t~post4_1451|)) (.cse4 (<= v_main_~m~0_532 10)) (.cse5 (< 9 v_main_~m~0_532)) (.cse2 (= |v_main_#t~post5_1472| |v_main_#t~post5_1451|)) (.cse3 (= |v_main_#t~post3_628| |v_main_#t~post3_626|))) (or (and (= v_main_~n~0_283 v_main_~n~0_283) .cse0 .cse1 (= v_main_~m~0_532 v_main_~m~0_532) (= v_main_~k~0_2353 v_main_~k~0_2343) .cse2 (= v_main_~j~0_2600 v_main_~j~0_2577) .cse3) (and (< v_main_~i~0_846 (+ 1 v_main_~n~0_283)) (= v_main_~j~0_2577 10) .cse4 .cse5 (= (+ (* 10 v_main_~i~0_847) v_main_~k~0_2343) (+ (* 10 v_main_~i~0_846) v_main_~k~0_2353)) (< v_main_~i~0_847 v_main_~i~0_846)) (and .cse0 (= v_main_~j~0_2577 v_main_~j~0_2600) .cse1 (or (not .cse4) (not (< v_main_~i~0_847 v_main_~n~0_283)) (not .cse5)) (= v_main_~k~0_2343 v_main_~k~0_2353) .cse2 .cse3))) InVars {main_~m~0=v_main_~m~0_532, main_~k~0=v_main_~k~0_2353, main_~j~0=v_main_~j~0_2600, main_~i~0=v_main_~i~0_847, main_#t~post4=|v_main_#t~post4_1472|, main_#t~post5=|v_main_#t~post5_1472|, main_~n~0=v_main_~n~0_283, main_#t~post3=|v_main_#t~post3_628|} OutVars{main_~m~0=v_main_~m~0_532, main_~k~0=v_main_~k~0_2343, main_~j~0=v_main_~j~0_2577, main_~i~0=v_main_~i~0_846, main_#t~post4=|v_main_#t~post4_1451|, main_#t~post5=|v_main_#t~post5_1451|, main_#t~post3=|v_main_#t~post3_626|, main_~n~0=v_main_~n~0_283} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {83656#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 11))) main_~n~0) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 11)) (not (< 10 main_~m~0))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:33:16,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {83667#(and (or (<= (div (+ (- 100) main_~k~0) (- 10)) 1) (<= (div (+ (- 100) main_~k~0) (- 10)) main_~n~0)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {83663#(and (or (<= (+ (div (+ (- 100) main_~k~0) (- 10)) main_~i~0) main_~n~0) (<= main_~n~0 main_~i~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:33:16,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {83603#(<= 0 main_~k~0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {83667#(and (or (<= (div (+ (- 100) main_~k~0) (- 10)) 1) (<= (div (+ (- 100) main_~k~0) (- 10)) main_~n~0)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} is VALID [2022-04-28 03:33:16,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {83571#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {83603#(<= 0 main_~k~0)} is VALID [2022-04-28 03:33:16,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {83571#true} call #t~ret6 := main(); {83571#true} is VALID [2022-04-28 03:33:16,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83571#true} {83571#true} #71#return; {83571#true} is VALID [2022-04-28 03:33:16,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {83571#true} assume true; {83571#true} is VALID [2022-04-28 03:33:16,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {83571#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); {83571#true} is VALID [2022-04-28 03:33:16,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {83571#true} call ULTIMATE.init(); {83571#true} is VALID [2022-04-28 03:33:16,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:33:16,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857109053] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:33:16,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:33:16,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 22 [2022-04-28 03:33:19,352 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:33:19,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [515786112] [2022-04-28 03:33:19,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [515786112] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:33:19,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:33:19,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-04-28 03:33:19,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633943178] [2022-04-28 03:33:19,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:33:19,353 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 51 states have internal predecessors, (57), 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 61 [2022-04-28 03:33:19,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:33:19,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 53 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 51 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:33:19,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:33:19,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-04-28 03:33:19,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:33:19,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-04-28 03:33:19,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=604, Invalid=3818, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 03:33:19,402 INFO L87 Difference]: Start difference. First operand 537 states and 691 transitions. Second operand has 53 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 51 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:33:27,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:33:27,330 INFO L93 Difference]: Finished difference Result 547 states and 702 transitions. [2022-04-28 03:33:27,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-28 03:33:27,330 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 51 states have internal predecessors, (57), 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 61 [2022-04-28 03:33:27,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:33:27,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 51 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:33:27,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 76 transitions. [2022-04-28 03:33:27,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 51 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:33:27,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 76 transitions. [2022-04-28 03:33:27,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 76 transitions. [2022-04-28 03:33:27,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:33:27,407 INFO L225 Difference]: With dead ends: 547 [2022-04-28 03:33:27,407 INFO L226 Difference]: Without dead ends: 514 [2022-04-28 03:33:27,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3872 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1249, Invalid=11633, Unknown=0, NotChecked=0, Total=12882 [2022-04-28 03:33:27,409 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 20 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 2193 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 2220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:33:27,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 215 Invalid, 2220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2193 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-28 03:33:27,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2022-04-28 03:33:29,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2022-04-28 03:33:29,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:33:29,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 514 states. Second operand has 514 states, 509 states have (on average 1.300589390962672) internal successors, (662), 509 states have internal predecessors, (662), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:33:29,855 INFO L74 IsIncluded]: Start isIncluded. First operand 514 states. Second operand has 514 states, 509 states have (on average 1.300589390962672) internal successors, (662), 509 states have internal predecessors, (662), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:33:29,856 INFO L87 Difference]: Start difference. First operand 514 states. Second operand has 514 states, 509 states have (on average 1.300589390962672) internal successors, (662), 509 states have internal predecessors, (662), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:33:29,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:33:29,864 INFO L93 Difference]: Finished difference Result 514 states and 666 transitions. [2022-04-28 03:33:29,864 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 666 transitions. [2022-04-28 03:33:29,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:33:29,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:33:29,864 INFO L74 IsIncluded]: Start isIncluded. First operand has 514 states, 509 states have (on average 1.300589390962672) internal successors, (662), 509 states have internal predecessors, (662), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 514 states. [2022-04-28 03:33:29,865 INFO L87 Difference]: Start difference. First operand has 514 states, 509 states have (on average 1.300589390962672) internal successors, (662), 509 states have internal predecessors, (662), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 514 states. [2022-04-28 03:33:29,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:33:29,872 INFO L93 Difference]: Finished difference Result 514 states and 666 transitions. [2022-04-28 03:33:29,872 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 666 transitions. [2022-04-28 03:33:29,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:33:29,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:33:29,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:33:29,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:33:29,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 509 states have (on average 1.300589390962672) internal successors, (662), 509 states have internal predecessors, (662), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:33:29,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 666 transitions. [2022-04-28 03:33:29,883 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 666 transitions. Word has length 61 [2022-04-28 03:33:29,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:33:29,883 INFO L495 AbstractCegarLoop]: Abstraction has 514 states and 666 transitions. [2022-04-28 03:33:29,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 51 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:33:29,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 514 states and 666 transitions. [2022-04-28 03:33:32,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 666 edges. 666 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:33:32,607 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 666 transitions. [2022-04-28 03:33:32,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 03:33:32,607 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:33:32,607 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:33:32,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-28 03:33:32,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:33:32,808 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:33:32,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:33:32,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1995828874, now seen corresponding path program 51 times [2022-04-28 03:33:32,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:33:32,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [986087505] [2022-04-28 03:33:33,136 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:33:33,290 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:33:35,867 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:33:36,230 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:33:36,231 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:33:36,234 INFO L85 PathProgramCache]: Analyzing trace with hash 60944961, now seen corresponding path program 1 times [2022-04-28 03:33:36,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:33:36,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636937596] [2022-04-28 03:33:36,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:33:36,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:33:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:33:36,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:33:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:33:36,346 INFO L290 TraceCheckUtils]: 0: Hoare triple {86993#(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); {86980#true} is VALID [2022-04-28 03:33:36,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {86980#true} assume true; {86980#true} is VALID [2022-04-28 03:33:36,346 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {86980#true} {86980#true} #71#return; {86980#true} is VALID [2022-04-28 03:33:36,347 INFO L272 TraceCheckUtils]: 0: Hoare triple {86980#true} call ULTIMATE.init(); {86993#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:33:36,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {86993#(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); {86980#true} is VALID [2022-04-28 03:33:36,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {86980#true} assume true; {86980#true} is VALID [2022-04-28 03:33:36,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86980#true} {86980#true} #71#return; {86980#true} is VALID [2022-04-28 03:33:36,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {86980#true} call #t~ret6 := main(); {86980#true} is VALID [2022-04-28 03:33:36,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {86980#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {86985#(= main_~k~0 0)} is VALID [2022-04-28 03:33:36,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {86985#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {86986#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:33:36,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {86986#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {86987#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:33:36,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {86987#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [233] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_1518| |v_main_#t~post4_1497|)) (.cse1 (= |v_main_#t~post5_1518| |v_main_#t~post5_1497|)) (.cse2 (= v_main_~k~0_2426 v_main_~k~0_2416)) (.cse6 (< 9 v_main_~m~0_547)) (.cse7 (<= v_main_~m~0_547 10)) (.cse3 (= v_main_~i~0_875 v_main_~i~0_874)) (.cse4 (= |v_main_#t~post3_649| |v_main_#t~post3_647|)) (.cse5 (= v_main_~j~0_2677 v_main_~j~0_2654))) (or (and (= v_main_~n~0_293 v_main_~n~0_293) .cse0 (= v_main_~m~0_547 v_main_~m~0_547) .cse1 .cse2 .cse3 .cse4 .cse5) (and (= v_main_~j~0_2654 10) .cse6 .cse7 (< v_main_~i~0_875 v_main_~i~0_874) (= (+ (* 10 v_main_~i~0_874) v_main_~k~0_2426) (+ (* 10 v_main_~i~0_875) v_main_~k~0_2416)) (< v_main_~i~0_874 (+ 1 v_main_~n~0_293))) (and .cse0 .cse1 .cse2 (or (not .cse6) (not .cse7) (not (< v_main_~i~0_875 v_main_~n~0_293))) .cse3 .cse4 .cse5))) InVars {main_~m~0=v_main_~m~0_547, main_~k~0=v_main_~k~0_2426, main_~j~0=v_main_~j~0_2677, main_~i~0=v_main_~i~0_875, main_#t~post4=|v_main_#t~post4_1518|, main_#t~post5=|v_main_#t~post5_1518|, main_~n~0=v_main_~n~0_293, main_#t~post3=|v_main_#t~post3_649|} OutVars{main_~m~0=v_main_~m~0_547, main_~k~0=v_main_~k~0_2416, main_~j~0=v_main_~j~0_2654, main_~i~0=v_main_~i~0_874, main_#t~post4=|v_main_#t~post4_1497|, main_#t~post5=|v_main_#t~post5_1497|, main_#t~post3=|v_main_#t~post3_647|, main_~n~0=v_main_~n~0_293} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {86988#(or (and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0)) (and (<= main_~m~0 10) (<= (+ (* main_~i~0 10) 100) (+ main_~k~0 (* main_~n~0 10)))))} is VALID [2022-04-28 03:33:36,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {86988#(or (and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0)) (and (<= main_~m~0 10) (<= (+ (* main_~i~0 10) 100) (+ main_~k~0 (* main_~n~0 10)))))} [234] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {86988#(or (and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0)) (and (<= main_~m~0 10) (<= (+ (* main_~i~0 10) 100) (+ main_~k~0 (* main_~n~0 10)))))} is VALID [2022-04-28 03:33:36,351 INFO L290 TraceCheckUtils]: 10: Hoare triple {86988#(or (and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0)) (and (<= main_~m~0 10) (<= (+ (* main_~i~0 10) 100) (+ main_~k~0 (* main_~n~0 10)))))} [235] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_877 v_main_~i~0_876)) (.cse1 (= |v_main_#t~post3_652| |v_main_#t~post3_648|)) (.cse2 (= |v_main_#t~post5_1521| |v_main_#t~post5_1507|)) (.cse3 (= v_main_~j~0_2680 v_main_~j~0_2665)) (.cse4 (<= v_main_~m~0_548 11)) (.cse5 (< 10 v_main_~m~0_548))) (or (and .cse0 .cse1 (= v_main_~k~0_2438 v_main_~k~0_2427) (= |v_main_#t~post4_1521| |v_main_#t~post4_1507|) .cse2 .cse3 (= v_main_~n~0_294 v_main_~n~0_294) (= v_main_~m~0_548 v_main_~m~0_548)) (and (or (not .cse4) (not .cse5) (not (< v_main_~i~0_877 v_main_~n~0_294))) .cse0 .cse1 .cse2 .cse3 (= |v_main_#t~post4_1507| |v_main_#t~post4_1521|) (= v_main_~k~0_2427 v_main_~k~0_2438)) (and (= (+ (* 11 v_main_~i~0_877) v_main_~k~0_2427) (+ (* 11 v_main_~i~0_876) v_main_~k~0_2438)) (< v_main_~i~0_876 (+ 1 v_main_~n~0_294)) (= v_main_~j~0_2665 11) .cse4 (< v_main_~i~0_877 v_main_~i~0_876) .cse5))) InVars {main_~m~0=v_main_~m~0_548, main_~k~0=v_main_~k~0_2438, main_~j~0=v_main_~j~0_2680, main_~i~0=v_main_~i~0_877, main_#t~post4=|v_main_#t~post4_1521|, main_#t~post5=|v_main_#t~post5_1521|, main_~n~0=v_main_~n~0_294, main_#t~post3=|v_main_#t~post3_652|} OutVars{main_~m~0=v_main_~m~0_548, main_~k~0=v_main_~k~0_2427, main_~j~0=v_main_~j~0_2665, main_~i~0=v_main_~i~0_876, main_#t~post4=|v_main_#t~post4_1507|, main_#t~post5=|v_main_#t~post5_1507|, main_#t~post3=|v_main_#t~post3_648|, main_~n~0=v_main_~n~0_294} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {86989#(or (and (or (<= (+ 110 (* main_~i~0 11)) (+ (* main_~n~0 11) main_~k~0)) (= main_~i~0 0)) (or (<= 10 main_~n~0) (not (= main_~i~0 0)))) (<= (+ (* main_~i~0 10) 100) (+ main_~k~0 (* main_~n~0 10))))} is VALID [2022-04-28 03:33:36,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {86989#(or (and (or (<= (+ 110 (* main_~i~0 11)) (+ (* main_~n~0 11) main_~k~0)) (= main_~i~0 0)) (or (<= 10 main_~n~0) (not (= main_~i~0 0)))) (<= (+ (* main_~i~0 10) 100) (+ main_~k~0 (* main_~n~0 10))))} [232] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {86990#(<= 100 main_~k~0)} is VALID [2022-04-28 03:33:36,352 INFO L272 TraceCheckUtils]: 12: Hoare triple {86990#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {86991#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:33:36,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {86991#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {86992#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:33:36,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {86992#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {86981#false} is VALID [2022-04-28 03:33:36,353 INFO L290 TraceCheckUtils]: 15: Hoare triple {86981#false} assume !false; {86981#false} is VALID [2022-04-28 03:33:36,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:33:36,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:33:36,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636937596] [2022-04-28 03:33:36,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636937596] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:33:36,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635911017] [2022-04-28 03:33:36,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:33:36,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:33:36,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:33:36,354 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:33:36,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-28 03:33:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:33:36,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:33:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:33:36,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:33:37,084 INFO L272 TraceCheckUtils]: 0: Hoare triple {86980#true} call ULTIMATE.init(); {86980#true} is VALID [2022-04-28 03:33:37,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {86980#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); {86980#true} is VALID [2022-04-28 03:33:37,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {86980#true} assume true; {86980#true} is VALID [2022-04-28 03:33:37,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86980#true} {86980#true} #71#return; {86980#true} is VALID [2022-04-28 03:33:37,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {86980#true} call #t~ret6 := main(); {86980#true} is VALID [2022-04-28 03:33:37,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {86980#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {87012#(<= 0 main_~k~0)} is VALID [2022-04-28 03:33:37,085 INFO L290 TraceCheckUtils]: 6: Hoare triple {87012#(<= 0 main_~k~0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {87016#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} is VALID [2022-04-28 03:33:37,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {87016#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {87020#(and (<= 10 main_~n~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:33:37,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {87020#(and (<= 10 main_~n~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [233] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_1518| |v_main_#t~post4_1497|)) (.cse1 (= |v_main_#t~post5_1518| |v_main_#t~post5_1497|)) (.cse2 (= v_main_~k~0_2426 v_main_~k~0_2416)) (.cse6 (< 9 v_main_~m~0_547)) (.cse7 (<= v_main_~m~0_547 10)) (.cse3 (= v_main_~i~0_875 v_main_~i~0_874)) (.cse4 (= |v_main_#t~post3_649| |v_main_#t~post3_647|)) (.cse5 (= v_main_~j~0_2677 v_main_~j~0_2654))) (or (and (= v_main_~n~0_293 v_main_~n~0_293) .cse0 (= v_main_~m~0_547 v_main_~m~0_547) .cse1 .cse2 .cse3 .cse4 .cse5) (and (= v_main_~j~0_2654 10) .cse6 .cse7 (< v_main_~i~0_875 v_main_~i~0_874) (= (+ (* 10 v_main_~i~0_874) v_main_~k~0_2426) (+ (* 10 v_main_~i~0_875) v_main_~k~0_2416)) (< v_main_~i~0_874 (+ 1 v_main_~n~0_293))) (and .cse0 .cse1 .cse2 (or (not .cse6) (not .cse7) (not (< v_main_~i~0_875 v_main_~n~0_293))) .cse3 .cse4 .cse5))) InVars {main_~m~0=v_main_~m~0_547, main_~k~0=v_main_~k~0_2426, main_~j~0=v_main_~j~0_2677, main_~i~0=v_main_~i~0_875, main_#t~post4=|v_main_#t~post4_1518|, main_#t~post5=|v_main_#t~post5_1518|, main_~n~0=v_main_~n~0_293, main_#t~post3=|v_main_#t~post3_649|} OutVars{main_~m~0=v_main_~m~0_547, main_~k~0=v_main_~k~0_2416, main_~j~0=v_main_~j~0_2654, main_~i~0=v_main_~i~0_874, main_#t~post4=|v_main_#t~post4_1497|, main_#t~post5=|v_main_#t~post5_1497|, main_#t~post3=|v_main_#t~post3_647|, main_~n~0=v_main_~n~0_293} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {87024#(and (<= 10 main_~n~0) (or (and (<= main_~m~0 10) (<= (+ main_~i~0 (div main_~k~0 (- 10))) 0) (= main_~j~0 10) (< (div main_~k~0 (- 10)) 0) (< main_~i~0 (+ main_~n~0 1)) (< 9 main_~m~0)) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:33:37,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {87024#(and (<= 10 main_~n~0) (or (and (<= main_~m~0 10) (<= (+ main_~i~0 (div main_~k~0 (- 10))) 0) (= main_~j~0 10) (< (div main_~k~0 (- 10)) 0) (< main_~i~0 (+ main_~n~0 1)) (< 9 main_~m~0)) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [234] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {87024#(and (<= 10 main_~n~0) (or (and (<= main_~m~0 10) (<= (+ main_~i~0 (div main_~k~0 (- 10))) 0) (= main_~j~0 10) (< (div main_~k~0 (- 10)) 0) (< main_~i~0 (+ main_~n~0 1)) (< 9 main_~m~0)) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:33:37,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {87024#(and (<= 10 main_~n~0) (or (and (<= main_~m~0 10) (<= (+ main_~i~0 (div main_~k~0 (- 10))) 0) (= main_~j~0 10) (< (div main_~k~0 (- 10)) 0) (< main_~i~0 (+ main_~n~0 1)) (< 9 main_~m~0)) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [235] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_877 v_main_~i~0_876)) (.cse1 (= |v_main_#t~post3_652| |v_main_#t~post3_648|)) (.cse2 (= |v_main_#t~post5_1521| |v_main_#t~post5_1507|)) (.cse3 (= v_main_~j~0_2680 v_main_~j~0_2665)) (.cse4 (<= v_main_~m~0_548 11)) (.cse5 (< 10 v_main_~m~0_548))) (or (and .cse0 .cse1 (= v_main_~k~0_2438 v_main_~k~0_2427) (= |v_main_#t~post4_1521| |v_main_#t~post4_1507|) .cse2 .cse3 (= v_main_~n~0_294 v_main_~n~0_294) (= v_main_~m~0_548 v_main_~m~0_548)) (and (or (not .cse4) (not .cse5) (not (< v_main_~i~0_877 v_main_~n~0_294))) .cse0 .cse1 .cse2 .cse3 (= |v_main_#t~post4_1507| |v_main_#t~post4_1521|) (= v_main_~k~0_2427 v_main_~k~0_2438)) (and (= (+ (* 11 v_main_~i~0_877) v_main_~k~0_2427) (+ (* 11 v_main_~i~0_876) v_main_~k~0_2438)) (< v_main_~i~0_876 (+ 1 v_main_~n~0_294)) (= v_main_~j~0_2665 11) .cse4 (< v_main_~i~0_877 v_main_~i~0_876) .cse5))) InVars {main_~m~0=v_main_~m~0_548, main_~k~0=v_main_~k~0_2438, main_~j~0=v_main_~j~0_2680, main_~i~0=v_main_~i~0_877, main_#t~post4=|v_main_#t~post4_1521|, main_#t~post5=|v_main_#t~post5_1521|, main_~n~0=v_main_~n~0_294, main_#t~post3=|v_main_#t~post3_652|} OutVars{main_~m~0=v_main_~m~0_548, main_~k~0=v_main_~k~0_2427, main_~j~0=v_main_~j~0_2665, main_~i~0=v_main_~i~0_876, main_#t~post4=|v_main_#t~post4_1507|, main_#t~post5=|v_main_#t~post5_1507|, main_#t~post3=|v_main_#t~post3_648|, main_~n~0=v_main_~n~0_294} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {87031#(and (<= 10 main_~n~0) (or (and (<= (+ main_~i~0 (div main_~k~0 (- 10))) 0) (< (div main_~k~0 (- 10)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:33:37,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {87031#(and (<= 10 main_~n~0) (or (and (<= (+ main_~i~0 (div main_~k~0 (- 10))) 0) (< (div main_~k~0 (- 10)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [232] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {86990#(<= 100 main_~k~0)} is VALID [2022-04-28 03:33:37,089 INFO L272 TraceCheckUtils]: 12: Hoare triple {86990#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {87038#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:33:37,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {87038#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {87042#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:33:37,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {87042#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {86981#false} is VALID [2022-04-28 03:33:37,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {86981#false} assume !false; {86981#false} is VALID [2022-04-28 03:33:37,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:33:37,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:33:37,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {86981#false} assume !false; {86981#false} is VALID [2022-04-28 03:33:37,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {87042#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {86981#false} is VALID [2022-04-28 03:33:37,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {87038#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {87042#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:33:37,705 INFO L272 TraceCheckUtils]: 12: Hoare triple {86990#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {87038#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:33:37,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {87061#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} [232] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {86990#(<= 100 main_~k~0)} is VALID [2022-04-28 03:33:37,706 INFO L290 TraceCheckUtils]: 10: Hoare triple {87065#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 11))) main_~n~0) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 11)) (not (< 10 main_~m~0))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [235] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_877 v_main_~i~0_876)) (.cse1 (= |v_main_#t~post3_652| |v_main_#t~post3_648|)) (.cse2 (= |v_main_#t~post5_1521| |v_main_#t~post5_1507|)) (.cse3 (= v_main_~j~0_2680 v_main_~j~0_2665)) (.cse4 (<= v_main_~m~0_548 11)) (.cse5 (< 10 v_main_~m~0_548))) (or (and .cse0 .cse1 (= v_main_~k~0_2438 v_main_~k~0_2427) (= |v_main_#t~post4_1521| |v_main_#t~post4_1507|) .cse2 .cse3 (= v_main_~n~0_294 v_main_~n~0_294) (= v_main_~m~0_548 v_main_~m~0_548)) (and (or (not .cse4) (not .cse5) (not (< v_main_~i~0_877 v_main_~n~0_294))) .cse0 .cse1 .cse2 .cse3 (= |v_main_#t~post4_1507| |v_main_#t~post4_1521|) (= v_main_~k~0_2427 v_main_~k~0_2438)) (and (= (+ (* 11 v_main_~i~0_877) v_main_~k~0_2427) (+ (* 11 v_main_~i~0_876) v_main_~k~0_2438)) (< v_main_~i~0_876 (+ 1 v_main_~n~0_294)) (= v_main_~j~0_2665 11) .cse4 (< v_main_~i~0_877 v_main_~i~0_876) .cse5))) InVars {main_~m~0=v_main_~m~0_548, main_~k~0=v_main_~k~0_2438, main_~j~0=v_main_~j~0_2680, main_~i~0=v_main_~i~0_877, main_#t~post4=|v_main_#t~post4_1521|, main_#t~post5=|v_main_#t~post5_1521|, main_~n~0=v_main_~n~0_294, main_#t~post3=|v_main_#t~post3_652|} OutVars{main_~m~0=v_main_~m~0_548, main_~k~0=v_main_~k~0_2427, main_~j~0=v_main_~j~0_2665, main_~i~0=v_main_~i~0_876, main_#t~post4=|v_main_#t~post4_1507|, main_#t~post5=|v_main_#t~post5_1507|, main_#t~post3=|v_main_#t~post3_648|, main_~n~0=v_main_~n~0_294} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {87061#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} is VALID [2022-04-28 03:33:37,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {87065#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 11))) main_~n~0) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 11)) (not (< 10 main_~m~0))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [234] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {87065#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 11))) main_~n~0) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 11)) (not (< 10 main_~m~0))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:33:37,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {87072#(and (or (<= (+ (div (+ (- 100) main_~k~0) (- 10)) main_~i~0) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 10)) 1)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [233] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_1518| |v_main_#t~post4_1497|)) (.cse1 (= |v_main_#t~post5_1518| |v_main_#t~post5_1497|)) (.cse2 (= v_main_~k~0_2426 v_main_~k~0_2416)) (.cse6 (< 9 v_main_~m~0_547)) (.cse7 (<= v_main_~m~0_547 10)) (.cse3 (= v_main_~i~0_875 v_main_~i~0_874)) (.cse4 (= |v_main_#t~post3_649| |v_main_#t~post3_647|)) (.cse5 (= v_main_~j~0_2677 v_main_~j~0_2654))) (or (and (= v_main_~n~0_293 v_main_~n~0_293) .cse0 (= v_main_~m~0_547 v_main_~m~0_547) .cse1 .cse2 .cse3 .cse4 .cse5) (and (= v_main_~j~0_2654 10) .cse6 .cse7 (< v_main_~i~0_875 v_main_~i~0_874) (= (+ (* 10 v_main_~i~0_874) v_main_~k~0_2426) (+ (* 10 v_main_~i~0_875) v_main_~k~0_2416)) (< v_main_~i~0_874 (+ 1 v_main_~n~0_293))) (and .cse0 .cse1 .cse2 (or (not .cse6) (not .cse7) (not (< v_main_~i~0_875 v_main_~n~0_293))) .cse3 .cse4 .cse5))) InVars {main_~m~0=v_main_~m~0_547, main_~k~0=v_main_~k~0_2426, main_~j~0=v_main_~j~0_2677, main_~i~0=v_main_~i~0_875, main_#t~post4=|v_main_#t~post4_1518|, main_#t~post5=|v_main_#t~post5_1518|, main_~n~0=v_main_~n~0_293, main_#t~post3=|v_main_#t~post3_649|} OutVars{main_~m~0=v_main_~m~0_547, main_~k~0=v_main_~k~0_2416, main_~j~0=v_main_~j~0_2654, main_~i~0=v_main_~i~0_874, main_#t~post4=|v_main_#t~post4_1497|, main_#t~post5=|v_main_#t~post5_1497|, main_#t~post3=|v_main_#t~post3_647|, main_~n~0=v_main_~n~0_293} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {87065#(and (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 11))) main_~n~0) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 11)) (not (< 10 main_~m~0))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:33:37,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {87076#(and (or (<= (div (+ (- 100) main_~k~0) (- 10)) 1) (<= (div (+ (- 100) main_~k~0) (- 10)) main_~n~0)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {87072#(and (or (<= (+ (div (+ (- 100) main_~k~0) (- 10)) main_~i~0) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 10)) 1)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:33:37,709 INFO L290 TraceCheckUtils]: 6: Hoare triple {87012#(<= 0 main_~k~0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {87076#(and (or (<= (div (+ (- 100) main_~k~0) (- 10)) 1) (<= (div (+ (- 100) main_~k~0) (- 10)) main_~n~0)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} is VALID [2022-04-28 03:33:37,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {86980#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {87012#(<= 0 main_~k~0)} is VALID [2022-04-28 03:33:37,710 INFO L272 TraceCheckUtils]: 4: Hoare triple {86980#true} call #t~ret6 := main(); {86980#true} is VALID [2022-04-28 03:33:37,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86980#true} {86980#true} #71#return; {86980#true} is VALID [2022-04-28 03:33:37,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {86980#true} assume true; {86980#true} is VALID [2022-04-28 03:33:37,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {86980#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); {86980#true} is VALID [2022-04-28 03:33:37,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {86980#true} call ULTIMATE.init(); {86980#true} is VALID [2022-04-28 03:33:37,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:33:37,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635911017] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:33:37,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:33:37,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 22 [2022-04-28 03:33:42,686 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:33:42,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [986087505] [2022-04-28 03:33:42,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [986087505] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:33:42,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:33:42,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2022-04-28 03:33:42,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124136779] [2022-04-28 03:33:42,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:33:42,687 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 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 61 [2022-04-28 03:33:42,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:33:42,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 55 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:33:42,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:33:42,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-04-28 03:33:42,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:33:42,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-04-28 03:33:42,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=4110, Unknown=0, NotChecked=0, Total=4692 [2022-04-28 03:33:42,853 INFO L87 Difference]: Start difference. First operand 514 states and 666 transitions. Second operand has 55 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:33:45,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:33:45,968 INFO L93 Difference]: Finished difference Result 546 states and 700 transitions. [2022-04-28 03:33:45,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-28 03:33:45,969 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 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 61 [2022-04-28 03:33:45,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:33:45,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:33:45,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 77 transitions. [2022-04-28 03:33:45,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:33:45,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 77 transitions. [2022-04-28 03:33:45,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 77 transitions. [2022-04-28 03:33:46,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:33:46,162 INFO L225 Difference]: With dead ends: 546 [2022-04-28 03:33:46,162 INFO L226 Difference]: Without dead ends: 537 [2022-04-28 03:33:46,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1409 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=616, Invalid=4496, Unknown=0, NotChecked=0, Total=5112 [2022-04-28 03:33:46,163 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 9 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 402 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:33:46,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 274 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 402 Unchecked, 0.0s Time] [2022-04-28 03:33:46,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2022-04-28 03:33:48,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2022-04-28 03:33:48,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:33:48,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 537 states. Second operand has 537 states, 532 states have (on average 1.287593984962406) internal successors, (685), 532 states have internal predecessors, (685), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:33:48,855 INFO L74 IsIncluded]: Start isIncluded. First operand 537 states. Second operand has 537 states, 532 states have (on average 1.287593984962406) internal successors, (685), 532 states have internal predecessors, (685), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:33:48,855 INFO L87 Difference]: Start difference. First operand 537 states. Second operand has 537 states, 532 states have (on average 1.287593984962406) internal successors, (685), 532 states have internal predecessors, (685), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:33:48,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:33:48,864 INFO L93 Difference]: Finished difference Result 537 states and 689 transitions. [2022-04-28 03:33:48,864 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 689 transitions. [2022-04-28 03:33:48,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:33:48,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:33:48,864 INFO L74 IsIncluded]: Start isIncluded. First operand has 537 states, 532 states have (on average 1.287593984962406) internal successors, (685), 532 states have internal predecessors, (685), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 537 states. [2022-04-28 03:33:48,865 INFO L87 Difference]: Start difference. First operand has 537 states, 532 states have (on average 1.287593984962406) internal successors, (685), 532 states have internal predecessors, (685), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 537 states. [2022-04-28 03:33:48,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:33:48,873 INFO L93 Difference]: Finished difference Result 537 states and 689 transitions. [2022-04-28 03:33:48,873 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 689 transitions. [2022-04-28 03:33:48,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:33:48,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:33:48,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:33:48,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:33:48,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 532 states have (on average 1.287593984962406) internal successors, (685), 532 states have internal predecessors, (685), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:33:48,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 689 transitions. [2022-04-28 03:33:48,885 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 689 transitions. Word has length 61 [2022-04-28 03:33:48,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:33:48,885 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 689 transitions. [2022-04-28 03:33:48,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:33:48,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 537 states and 689 transitions. [2022-04-28 03:33:51,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 689 edges. 689 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:33:51,730 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 689 transitions. [2022-04-28 03:33:51,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 03:33:51,731 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:33:51,731 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:33:51,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-04-28 03:33:51,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:33:51,931 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:33:51,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:33:51,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1837854822, now seen corresponding path program 52 times [2022-04-28 03:33:51,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:33:51,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [559879859] [2022-04-28 03:33:52,266 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:33:52,413 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:33:56,701 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:33:56,832 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:33:59,746 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:33:59,876 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:33:59,877 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:33:59,880 INFO L85 PathProgramCache]: Analyzing trace with hash 2110477121, now seen corresponding path program 1 times [2022-04-28 03:33:59,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:33:59,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802446786] [2022-04-28 03:33:59,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:33:59,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:33:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:33:59,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:33:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:33:59,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {90406#(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); {90393#true} is VALID [2022-04-28 03:33:59,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {90393#true} assume true; {90393#true} is VALID [2022-04-28 03:33:59,972 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {90393#true} {90393#true} #71#return; {90393#true} is VALID [2022-04-28 03:33:59,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {90393#true} call ULTIMATE.init(); {90406#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:33:59,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {90406#(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); {90393#true} is VALID [2022-04-28 03:33:59,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {90393#true} assume true; {90393#true} is VALID [2022-04-28 03:33:59,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90393#true} {90393#true} #71#return; {90393#true} is VALID [2022-04-28 03:33:59,973 INFO L272 TraceCheckUtils]: 4: Hoare triple {90393#true} call #t~ret6 := main(); {90393#true} is VALID [2022-04-28 03:33:59,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {90393#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {90398#(= main_~k~0 0)} is VALID [2022-04-28 03:33:59,973 INFO L290 TraceCheckUtils]: 6: Hoare triple {90398#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {90399#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:33:59,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {90399#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {90400#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:33:59,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {90400#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} [237] L31-3-->L31-4_primed: Formula: (let ((.cse2 (= v_main_~i~0_903 v_main_~i~0_902)) (.cse0 (< 5 v_main_~m~0_562)) (.cse1 (<= v_main_~m~0_562 6)) (.cse3 (= v_main_~j~0_2755 v_main_~j~0_2732)) (.cse4 (= |v_main_#t~post3_670| |v_main_#t~post3_668|)) (.cse5 (= |v_main_#t~post4_1564| |v_main_#t~post4_1543|)) (.cse6 (= |v_main_#t~post5_1565| |v_main_#t~post5_1544|))) (or (and (< v_main_~i~0_903 v_main_~i~0_902) (< v_main_~i~0_902 (+ 1 v_main_~n~0_303)) .cse0 .cse1 (= (+ (* 6 v_main_~i~0_903) v_main_~k~0_2489) (+ (* 6 v_main_~i~0_902) v_main_~k~0_2495)) (= 6 v_main_~j~0_2732)) (and .cse2 .cse3 .cse4 .cse5 .cse6 (= v_main_~m~0_562 v_main_~m~0_562) (= v_main_~k~0_2495 v_main_~k~0_2489) (= v_main_~n~0_303 v_main_~n~0_303)) (and .cse2 (= v_main_~k~0_2489 v_main_~k~0_2495) (or (not (< v_main_~i~0_903 v_main_~n~0_303)) (not .cse0) (not .cse1)) .cse3 .cse4 .cse5 .cse6))) InVars {main_~m~0=v_main_~m~0_562, main_~k~0=v_main_~k~0_2495, main_~j~0=v_main_~j~0_2755, main_~i~0=v_main_~i~0_903, main_#t~post4=|v_main_#t~post4_1564|, main_#t~post5=|v_main_#t~post5_1565|, main_~n~0=v_main_~n~0_303, main_#t~post3=|v_main_#t~post3_670|} OutVars{main_~m~0=v_main_~m~0_562, main_~k~0=v_main_~k~0_2489, main_~j~0=v_main_~j~0_2732, main_~i~0=v_main_~i~0_902, main_#t~post4=|v_main_#t~post4_1543|, main_#t~post5=|v_main_#t~post5_1544|, main_#t~post3=|v_main_#t~post3_668|, main_~n~0=v_main_~n~0_303} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {90401#(and (<= (+ (* main_~i~0 15) 150) (+ main_~k~0 (* main_~n~0 15))) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:33:59,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {90401#(and (<= (+ (* main_~i~0 15) 150) (+ main_~k~0 (* main_~n~0 15))) (<= (+ main_~i~0 10) main_~n~0))} [238] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90401#(and (<= (+ (* main_~i~0 15) 150) (+ main_~k~0 (* main_~n~0 15))) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:33:59,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {90401#(and (<= (+ (* main_~i~0 15) 150) (+ main_~k~0 (* main_~n~0 15))) (<= (+ main_~i~0 10) main_~n~0))} [239] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_905 v_main_~i~0_904)) (.cse3 (= |v_main_#t~post3_673| |v_main_#t~post3_669|)) (.cse4 (= |v_main_#t~post5_1568| |v_main_#t~post5_1550|)) (.cse5 (= |v_main_#t~post4_1567| |v_main_#t~post4_1549|)) (.cse6 (= v_main_~j~0_2758 v_main_~j~0_2739)) (.cse7 (= v_main_~k~0_2511 v_main_~k~0_2496)) (.cse2 (< 14 v_main_~m~0_563)) (.cse1 (<= v_main_~m~0_563 15))) (or (and .cse0 (or (not .cse1) (not (< v_main_~i~0_905 v_main_~n~0_304)) (not .cse2)) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse3 (= v_main_~m~0_563 v_main_~m~0_563) .cse4 .cse5 (= v_main_~n~0_304 v_main_~n~0_304) .cse6 .cse7) (and (= (+ (* 15 v_main_~i~0_905) v_main_~k~0_2496) (+ (* 15 v_main_~i~0_904) v_main_~k~0_2511)) (= v_main_~j~0_2739 15) .cse2 .cse1 (< v_main_~i~0_904 (+ 1 v_main_~n~0_304)) (< v_main_~i~0_905 v_main_~i~0_904)))) InVars {main_~m~0=v_main_~m~0_563, main_~k~0=v_main_~k~0_2511, main_~j~0=v_main_~j~0_2758, main_~i~0=v_main_~i~0_905, main_#t~post4=|v_main_#t~post4_1567|, main_#t~post5=|v_main_#t~post5_1568|, main_~n~0=v_main_~n~0_304, main_#t~post3=|v_main_#t~post3_673|} OutVars{main_~m~0=v_main_~m~0_563, main_~k~0=v_main_~k~0_2496, main_~j~0=v_main_~j~0_2739, main_~i~0=v_main_~i~0_904, main_#t~post4=|v_main_#t~post4_1549|, main_#t~post5=|v_main_#t~post5_1550|, main_#t~post3=|v_main_#t~post3_669|, main_~n~0=v_main_~n~0_304} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {90402#(or (<= (+ (* main_~i~0 15) 150) (+ main_~k~0 (* main_~n~0 15))) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:33:59,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {90402#(or (<= (+ (* main_~i~0 15) 150) (+ main_~k~0 (* main_~n~0 15))) (<= (+ main_~i~0 10) main_~n~0))} [236] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {90403#(<= 150 main_~k~0)} is VALID [2022-04-28 03:33:59,977 INFO L272 TraceCheckUtils]: 12: Hoare triple {90403#(<= 150 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {90404#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:33:59,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {90404#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {90405#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:33:59,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {90405#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {90394#false} is VALID [2022-04-28 03:33:59,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {90394#false} assume !false; {90394#false} is VALID [2022-04-28 03:33:59,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:33:59,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:33:59,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802446786] [2022-04-28 03:33:59,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802446786] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:33:59,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645943947] [2022-04-28 03:33:59,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:33:59,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:33:59,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:33:59,979 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:33:59,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-28 03:34:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:34:00,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:34:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:34:00,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:34:00,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {90393#true} call ULTIMATE.init(); {90393#true} is VALID [2022-04-28 03:34:00,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {90393#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); {90393#true} is VALID [2022-04-28 03:34:00,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {90393#true} assume true; {90393#true} is VALID [2022-04-28 03:34:00,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90393#true} {90393#true} #71#return; {90393#true} is VALID [2022-04-28 03:34:00,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {90393#true} call #t~ret6 := main(); {90393#true} is VALID [2022-04-28 03:34:00,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {90393#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {90425#(<= 0 main_~k~0)} is VALID [2022-04-28 03:34:00,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {90425#(<= 0 main_~k~0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {90429#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} is VALID [2022-04-28 03:34:00,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {90429#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {90433#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:34:00,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {90433#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [237] L31-3-->L31-4_primed: Formula: (let ((.cse2 (= v_main_~i~0_903 v_main_~i~0_902)) (.cse0 (< 5 v_main_~m~0_562)) (.cse1 (<= v_main_~m~0_562 6)) (.cse3 (= v_main_~j~0_2755 v_main_~j~0_2732)) (.cse4 (= |v_main_#t~post3_670| |v_main_#t~post3_668|)) (.cse5 (= |v_main_#t~post4_1564| |v_main_#t~post4_1543|)) (.cse6 (= |v_main_#t~post5_1565| |v_main_#t~post5_1544|))) (or (and (< v_main_~i~0_903 v_main_~i~0_902) (< v_main_~i~0_902 (+ 1 v_main_~n~0_303)) .cse0 .cse1 (= (+ (* 6 v_main_~i~0_903) v_main_~k~0_2489) (+ (* 6 v_main_~i~0_902) v_main_~k~0_2495)) (= 6 v_main_~j~0_2732)) (and .cse2 .cse3 .cse4 .cse5 .cse6 (= v_main_~m~0_562 v_main_~m~0_562) (= v_main_~k~0_2495 v_main_~k~0_2489) (= v_main_~n~0_303 v_main_~n~0_303)) (and .cse2 (= v_main_~k~0_2489 v_main_~k~0_2495) (or (not (< v_main_~i~0_903 v_main_~n~0_303)) (not .cse0) (not .cse1)) .cse3 .cse4 .cse5 .cse6))) InVars {main_~m~0=v_main_~m~0_562, main_~k~0=v_main_~k~0_2495, main_~j~0=v_main_~j~0_2755, main_~i~0=v_main_~i~0_903, main_#t~post4=|v_main_#t~post4_1564|, main_#t~post5=|v_main_#t~post5_1565|, main_~n~0=v_main_~n~0_303, main_#t~post3=|v_main_#t~post3_670|} OutVars{main_~m~0=v_main_~m~0_562, main_~k~0=v_main_~k~0_2489, main_~j~0=v_main_~j~0_2732, main_~i~0=v_main_~i~0_902, main_#t~post4=|v_main_#t~post4_1543|, main_#t~post5=|v_main_#t~post5_1544|, main_#t~post3=|v_main_#t~post3_668|, main_~n~0=v_main_~n~0_303} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {90433#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:34:00,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {90433#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [238] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90433#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:34:00,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {90433#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [239] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_905 v_main_~i~0_904)) (.cse3 (= |v_main_#t~post3_673| |v_main_#t~post3_669|)) (.cse4 (= |v_main_#t~post5_1568| |v_main_#t~post5_1550|)) (.cse5 (= |v_main_#t~post4_1567| |v_main_#t~post4_1549|)) (.cse6 (= v_main_~j~0_2758 v_main_~j~0_2739)) (.cse7 (= v_main_~k~0_2511 v_main_~k~0_2496)) (.cse2 (< 14 v_main_~m~0_563)) (.cse1 (<= v_main_~m~0_563 15))) (or (and .cse0 (or (not .cse1) (not (< v_main_~i~0_905 v_main_~n~0_304)) (not .cse2)) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse3 (= v_main_~m~0_563 v_main_~m~0_563) .cse4 .cse5 (= v_main_~n~0_304 v_main_~n~0_304) .cse6 .cse7) (and (= (+ (* 15 v_main_~i~0_905) v_main_~k~0_2496) (+ (* 15 v_main_~i~0_904) v_main_~k~0_2511)) (= v_main_~j~0_2739 15) .cse2 .cse1 (< v_main_~i~0_904 (+ 1 v_main_~n~0_304)) (< v_main_~i~0_905 v_main_~i~0_904)))) InVars {main_~m~0=v_main_~m~0_563, main_~k~0=v_main_~k~0_2511, main_~j~0=v_main_~j~0_2758, main_~i~0=v_main_~i~0_905, main_#t~post4=|v_main_#t~post4_1567|, main_#t~post5=|v_main_#t~post5_1568|, main_~n~0=v_main_~n~0_304, main_#t~post3=|v_main_#t~post3_673|} OutVars{main_~m~0=v_main_~m~0_563, main_~k~0=v_main_~k~0_2496, main_~j~0=v_main_~j~0_2739, main_~i~0=v_main_~i~0_904, main_#t~post4=|v_main_#t~post4_1549|, main_#t~post5=|v_main_#t~post5_1550|, main_#t~post3=|v_main_#t~post3_669|, main_~n~0=v_main_~n~0_304} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {90443#(and (<= 10 main_~n~0) (or (and (<= (+ (div main_~k~0 (- 15)) main_~i~0) 0) (< (div main_~k~0 (- 15)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:34:00,492 INFO L290 TraceCheckUtils]: 11: Hoare triple {90443#(and (<= 10 main_~n~0) (or (and (<= (+ (div main_~k~0 (- 15)) main_~i~0) 0) (< (div main_~k~0 (- 15)) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [236] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {90403#(<= 150 main_~k~0)} is VALID [2022-04-28 03:34:00,493 INFO L272 TraceCheckUtils]: 12: Hoare triple {90403#(<= 150 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {90450#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:34:00,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {90450#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {90454#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:34:00,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {90454#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {90394#false} is VALID [2022-04-28 03:34:00,493 INFO L290 TraceCheckUtils]: 15: Hoare triple {90394#false} assume !false; {90394#false} is VALID [2022-04-28 03:34:00,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:34:00,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:34:01,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {90394#false} assume !false; {90394#false} is VALID [2022-04-28 03:34:01,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {90454#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {90394#false} is VALID [2022-04-28 03:34:01,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {90450#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {90454#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:34:01,219 INFO L272 TraceCheckUtils]: 12: Hoare triple {90470#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {90450#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:34:01,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {90474#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} [236] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {90470#(<= 100 main_~k~0)} is VALID [2022-04-28 03:34:01,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {90478#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [239] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_905 v_main_~i~0_904)) (.cse3 (= |v_main_#t~post3_673| |v_main_#t~post3_669|)) (.cse4 (= |v_main_#t~post5_1568| |v_main_#t~post5_1550|)) (.cse5 (= |v_main_#t~post4_1567| |v_main_#t~post4_1549|)) (.cse6 (= v_main_~j~0_2758 v_main_~j~0_2739)) (.cse7 (= v_main_~k~0_2511 v_main_~k~0_2496)) (.cse2 (< 14 v_main_~m~0_563)) (.cse1 (<= v_main_~m~0_563 15))) (or (and .cse0 (or (not .cse1) (not (< v_main_~i~0_905 v_main_~n~0_304)) (not .cse2)) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse3 (= v_main_~m~0_563 v_main_~m~0_563) .cse4 .cse5 (= v_main_~n~0_304 v_main_~n~0_304) .cse6 .cse7) (and (= (+ (* 15 v_main_~i~0_905) v_main_~k~0_2496) (+ (* 15 v_main_~i~0_904) v_main_~k~0_2511)) (= v_main_~j~0_2739 15) .cse2 .cse1 (< v_main_~i~0_904 (+ 1 v_main_~n~0_304)) (< v_main_~i~0_905 v_main_~i~0_904)))) InVars {main_~m~0=v_main_~m~0_563, main_~k~0=v_main_~k~0_2511, main_~j~0=v_main_~j~0_2758, main_~i~0=v_main_~i~0_905, main_#t~post4=|v_main_#t~post4_1567|, main_#t~post5=|v_main_#t~post5_1568|, main_~n~0=v_main_~n~0_304, main_#t~post3=|v_main_#t~post3_673|} OutVars{main_~m~0=v_main_~m~0_563, main_~k~0=v_main_~k~0_2496, main_~j~0=v_main_~j~0_2739, main_~i~0=v_main_~i~0_904, main_#t~post4=|v_main_#t~post4_1549|, main_#t~post5=|v_main_#t~post5_1550|, main_#t~post3=|v_main_#t~post3_669|, main_~n~0=v_main_~n~0_304} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {90474#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} is VALID [2022-04-28 03:34:01,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {90478#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [238] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90478#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:34:01,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {90485#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (not (<= main_~m~0 6)) (not (< 5 main_~m~0)) (<= (+ (div (+ (- 100) main_~k~0) (- 6)) main_~i~0) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 6)) 1)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [237] L31-3-->L31-4_primed: Formula: (let ((.cse2 (= v_main_~i~0_903 v_main_~i~0_902)) (.cse0 (< 5 v_main_~m~0_562)) (.cse1 (<= v_main_~m~0_562 6)) (.cse3 (= v_main_~j~0_2755 v_main_~j~0_2732)) (.cse4 (= |v_main_#t~post3_670| |v_main_#t~post3_668|)) (.cse5 (= |v_main_#t~post4_1564| |v_main_#t~post4_1543|)) (.cse6 (= |v_main_#t~post5_1565| |v_main_#t~post5_1544|))) (or (and (< v_main_~i~0_903 v_main_~i~0_902) (< v_main_~i~0_902 (+ 1 v_main_~n~0_303)) .cse0 .cse1 (= (+ (* 6 v_main_~i~0_903) v_main_~k~0_2489) (+ (* 6 v_main_~i~0_902) v_main_~k~0_2495)) (= 6 v_main_~j~0_2732)) (and .cse2 .cse3 .cse4 .cse5 .cse6 (= v_main_~m~0_562 v_main_~m~0_562) (= v_main_~k~0_2495 v_main_~k~0_2489) (= v_main_~n~0_303 v_main_~n~0_303)) (and .cse2 (= v_main_~k~0_2489 v_main_~k~0_2495) (or (not (< v_main_~i~0_903 v_main_~n~0_303)) (not .cse0) (not .cse1)) .cse3 .cse4 .cse5 .cse6))) InVars {main_~m~0=v_main_~m~0_562, main_~k~0=v_main_~k~0_2495, main_~j~0=v_main_~j~0_2755, main_~i~0=v_main_~i~0_903, main_#t~post4=|v_main_#t~post4_1564|, main_#t~post5=|v_main_#t~post5_1565|, main_~n~0=v_main_~n~0_303, main_#t~post3=|v_main_#t~post3_670|} OutVars{main_~m~0=v_main_~m~0_562, main_~k~0=v_main_~k~0_2489, main_~j~0=v_main_~j~0_2732, main_~i~0=v_main_~i~0_902, main_#t~post4=|v_main_#t~post4_1543|, main_#t~post5=|v_main_#t~post5_1544|, main_#t~post3=|v_main_#t~post3_668|, main_~n~0=v_main_~n~0_303} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {90478#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:34:01,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {90489#(and (or (< 0 main_~n~0) (<= 100 main_~k~0)) (or (<= (div (+ (- 100) main_~k~0) (- 15)) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 15)) 1)))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {90485#(and (or (<= main_~n~0 main_~i~0) (not (< 14 main_~m~0)) (not (<= main_~m~0 15)) (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 15))) main_~n~0)) (or (not (<= main_~m~0 6)) (not (< 5 main_~m~0)) (<= (+ (div (+ (- 100) main_~k~0) (- 6)) main_~i~0) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 6)) 1)) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:34:01,223 INFO L290 TraceCheckUtils]: 6: Hoare triple {90493#(<= (div (+ (- 100) main_~k~0) (- 15)) 10)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {90489#(and (or (< 0 main_~n~0) (<= 100 main_~k~0)) (or (<= (div (+ (- 100) main_~k~0) (- 15)) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 15)) 1)))} is VALID [2022-04-28 03:34:01,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {90393#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {90493#(<= (div (+ (- 100) main_~k~0) (- 15)) 10)} is VALID [2022-04-28 03:34:01,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {90393#true} call #t~ret6 := main(); {90393#true} is VALID [2022-04-28 03:34:01,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90393#true} {90393#true} #71#return; {90393#true} is VALID [2022-04-28 03:34:01,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {90393#true} assume true; {90393#true} is VALID [2022-04-28 03:34:01,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {90393#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); {90393#true} is VALID [2022-04-28 03:34:01,224 INFO L272 TraceCheckUtils]: 0: Hoare triple {90393#true} call ULTIMATE.init(); {90393#true} is VALID [2022-04-28 03:34:01,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:34:01,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645943947] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:34:01,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:34:01,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 23 [2022-04-28 03:34:03,016 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:34:03,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [559879859] [2022-04-28 03:34:03,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [559879859] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:34:03,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:34:03,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2022-04-28 03:34:03,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103113245] [2022-04-28 03:34:03,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:34:03,017 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 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 61 [2022-04-28 03:34:03,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:34:03,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 55 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:34:03,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:34:03,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-04-28 03:34:03,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:34:03,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-04-28 03:34:03,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=680, Invalid=4012, Unknown=0, NotChecked=0, Total=4692 [2022-04-28 03:34:03,057 INFO L87 Difference]: Start difference. First operand 537 states and 689 transitions. Second operand has 55 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:34:11,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:34:11,706 INFO L93 Difference]: Finished difference Result 551 states and 705 transitions. [2022-04-28 03:34:11,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-28 03:34:11,706 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 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 61 [2022-04-28 03:34:11,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:34:11,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:34:11,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 85 transitions. [2022-04-28 03:34:11,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:34:11,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 85 transitions. [2022-04-28 03:34:11,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 85 transitions. [2022-04-28 03:34:11,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:34:11,783 INFO L225 Difference]: With dead ends: 551 [2022-04-28 03:34:11,783 INFO L226 Difference]: Without dead ends: 542 [2022-04-28 03:34:11,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3666 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1385, Invalid=12421, Unknown=0, NotChecked=0, Total=13806 [2022-04-28 03:34:11,784 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 27 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 3205 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 3238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:34:11,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 265 Invalid, 3238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3205 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 03:34:11,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-04-28 03:34:14,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 539. [2022-04-28 03:34:14,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:34:14,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 542 states. Second operand has 539 states, 534 states have (on average 1.2865168539325842) internal successors, (687), 534 states have internal predecessors, (687), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:34:14,637 INFO L74 IsIncluded]: Start isIncluded. First operand 542 states. Second operand has 539 states, 534 states have (on average 1.2865168539325842) internal successors, (687), 534 states have internal predecessors, (687), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:34:14,638 INFO L87 Difference]: Start difference. First operand 542 states. Second operand has 539 states, 534 states have (on average 1.2865168539325842) internal successors, (687), 534 states have internal predecessors, (687), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:34:14,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:34:14,647 INFO L93 Difference]: Finished difference Result 542 states and 694 transitions. [2022-04-28 03:34:14,647 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 694 transitions. [2022-04-28 03:34:14,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:34:14,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:34:14,647 INFO L74 IsIncluded]: Start isIncluded. First operand has 539 states, 534 states have (on average 1.2865168539325842) internal successors, (687), 534 states have internal predecessors, (687), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 542 states. [2022-04-28 03:34:14,647 INFO L87 Difference]: Start difference. First operand has 539 states, 534 states have (on average 1.2865168539325842) internal successors, (687), 534 states have internal predecessors, (687), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 542 states. [2022-04-28 03:34:14,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:34:14,656 INFO L93 Difference]: Finished difference Result 542 states and 694 transitions. [2022-04-28 03:34:14,656 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 694 transitions. [2022-04-28 03:34:14,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:34:14,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:34:14,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:34:14,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:34:14,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 534 states have (on average 1.2865168539325842) internal successors, (687), 534 states have internal predecessors, (687), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:34:14,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 691 transitions. [2022-04-28 03:34:14,668 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 691 transitions. Word has length 61 [2022-04-28 03:34:14,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:34:14,668 INFO L495 AbstractCegarLoop]: Abstraction has 539 states and 691 transitions. [2022-04-28 03:34:14,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:34:14,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 539 states and 691 transitions. [2022-04-28 03:34:17,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 691 edges. 691 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:34:17,756 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 691 transitions. [2022-04-28 03:34:17,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 03:34:17,756 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:34:17,756 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:34:17,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-28 03:34:17,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-04-28 03:34:17,957 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:34:17,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:34:17,957 INFO L85 PathProgramCache]: Analyzing trace with hash 283984042, now seen corresponding path program 53 times [2022-04-28 03:34:17,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:34:17,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [274506006] [2022-04-28 03:34:18,282 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:34:18,459 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:34:18,890 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:34:21,057 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:34:21,204 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:34:21,205 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:34:21,208 INFO L85 PathProgramCache]: Analyzing trace with hash -134958015, now seen corresponding path program 1 times [2022-04-28 03:34:21,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:34:21,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144979917] [2022-04-28 03:34:21,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:34:21,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:34:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:34:21,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:34:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:34:21,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {93935#(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); {93922#true} is VALID [2022-04-28 03:34:21,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {93922#true} assume true; {93922#true} is VALID [2022-04-28 03:34:21,296 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {93922#true} {93922#true} #71#return; {93922#true} is VALID [2022-04-28 03:34:21,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {93922#true} call ULTIMATE.init(); {93935#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:34:21,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {93935#(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); {93922#true} is VALID [2022-04-28 03:34:21,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {93922#true} assume true; {93922#true} is VALID [2022-04-28 03:34:21,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {93922#true} {93922#true} #71#return; {93922#true} is VALID [2022-04-28 03:34:21,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {93922#true} call #t~ret6 := main(); {93922#true} is VALID [2022-04-28 03:34:21,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {93922#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {93927#(= main_~k~0 0)} is VALID [2022-04-28 03:34:21,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {93927#(= main_~k~0 0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {93928#(and (<= 10 main_~n~0) (= main_~k~0 0))} is VALID [2022-04-28 03:34:21,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {93928#(and (<= 10 main_~n~0) (= main_~k~0 0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {93929#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:34:21,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {93929#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (= main_~k~0 0) (= main_~i~0 0))} [241] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post3_691| |v_main_#t~post3_689|)) (.cse3 (= v_main_~i~0_931 v_main_~i~0_930)) (.cse4 (= v_main_~j~0_2832 v_main_~j~0_2809)) (.cse5 (= v_main_~k~0_2564 v_main_~k~0_2562)) (.cse6 (= |v_main_#t~post5_1611| |v_main_#t~post5_1590|)) (.cse7 (= |v_main_#t~post4_1610| |v_main_#t~post4_1589|)) (.cse2 (< 1 v_main_~m~0_577)) (.cse1 (<= v_main_~m~0_577 2))) (or (and .cse0 (or (not (< v_main_~i~0_931 v_main_~n~0_313)) (not .cse1) (not .cse2)) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 (= v_main_~n~0_313 v_main_~n~0_313) .cse3 .cse4 .cse5 .cse6 .cse7 (= v_main_~m~0_577 v_main_~m~0_577)) (and (= 2 v_main_~j~0_2809) (= (+ v_main_~k~0_2564 (* 2 v_main_~i~0_930)) (+ (* 2 v_main_~i~0_931) v_main_~k~0_2562)) .cse2 (< v_main_~i~0_930 (+ 1 v_main_~n~0_313)) (< v_main_~i~0_931 v_main_~i~0_930) .cse1))) InVars {main_~m~0=v_main_~m~0_577, main_~k~0=v_main_~k~0_2564, main_~j~0=v_main_~j~0_2832, main_~i~0=v_main_~i~0_931, main_#t~post4=|v_main_#t~post4_1610|, main_#t~post5=|v_main_#t~post5_1611|, main_~n~0=v_main_~n~0_313, main_#t~post3=|v_main_#t~post3_691|} OutVars{main_~m~0=v_main_~m~0_577, main_~k~0=v_main_~k~0_2562, main_~j~0=v_main_~j~0_2809, main_~i~0=v_main_~i~0_930, main_#t~post4=|v_main_#t~post4_1589|, main_#t~post5=|v_main_#t~post5_1590|, main_#t~post3=|v_main_#t~post3_689|, main_~n~0=v_main_~n~0_313} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {93930#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:34:21,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {93930#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [242] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93930#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:34:21,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {93930#(and (<= 10 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [243] L31-3-->L31-4_primed: Formula: (let ((.cse0 (<= v_main_~m~0_578 19)) (.cse1 (< 18 v_main_~m~0_578)) (.cse2 (= |v_main_#t~post5_1614| |v_main_#t~post5_1592|)) (.cse3 (= |v_main_#t~post3_694| |v_main_#t~post3_690|)) (.cse4 (= |v_main_#t~post4_1613| |v_main_#t~post4_1591|)) (.cse5 (= v_main_~j~0_2835 v_main_~j~0_2812)) (.cse6 (= v_main_~i~0_933 v_main_~i~0_932)) (.cse7 (= v_main_~k~0_2584 v_main_~k~0_2565))) (or (and (< v_main_~i~0_933 v_main_~i~0_932) (= (+ (* 19 v_main_~i~0_932) v_main_~k~0_2584) (+ (* 19 v_main_~i~0_933) v_main_~k~0_2565)) .cse0 (< v_main_~i~0_932 (+ 1 v_main_~n~0_314)) (= 19 v_main_~j~0_2812) .cse1) (and .cse2 .cse3 .cse4 (or (not .cse0) (not .cse1) (not (< v_main_~i~0_933 v_main_~n~0_314))) .cse5 .cse6 .cse7) (and .cse2 .cse3 .cse4 (= v_main_~m~0_578 v_main_~m~0_578) .cse5 .cse6 (= v_main_~n~0_314 v_main_~n~0_314) .cse7))) InVars {main_~m~0=v_main_~m~0_578, main_~k~0=v_main_~k~0_2584, main_~j~0=v_main_~j~0_2835, main_~i~0=v_main_~i~0_933, main_#t~post4=|v_main_#t~post4_1613|, main_#t~post5=|v_main_#t~post5_1614|, main_~n~0=v_main_~n~0_314, main_#t~post3=|v_main_#t~post3_694|} OutVars{main_~m~0=v_main_~m~0_578, main_~k~0=v_main_~k~0_2565, main_~j~0=v_main_~j~0_2812, main_~i~0=v_main_~i~0_932, main_#t~post4=|v_main_#t~post4_1591|, main_#t~post5=|v_main_#t~post5_1592|, main_#t~post3=|v_main_#t~post3_690|, main_~n~0=v_main_~n~0_314} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {93931#(or (<= (+ 190 (* 19 main_~i~0)) (+ (* 19 main_~n~0) main_~k~0)) (<= (+ main_~i~0 10) main_~n~0))} is VALID [2022-04-28 03:34:21,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {93931#(or (<= (+ 190 (* 19 main_~i~0)) (+ (* 19 main_~n~0) main_~k~0)) (<= (+ main_~i~0 10) main_~n~0))} [240] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {93932#(<= 190 main_~k~0)} is VALID [2022-04-28 03:34:21,300 INFO L272 TraceCheckUtils]: 12: Hoare triple {93932#(<= 190 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {93933#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:34:21,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {93933#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {93934#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:34:21,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {93934#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {93923#false} is VALID [2022-04-28 03:34:21,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {93923#false} assume !false; {93923#false} is VALID [2022-04-28 03:34:21,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:34:21,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:34:21,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144979917] [2022-04-28 03:34:21,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144979917] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:34:21,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713934999] [2022-04-28 03:34:21,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:34:21,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:34:21,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:34:21,302 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:34:21,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-28 03:34:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:34:21,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:34:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:34:21,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:34:21,799 INFO L272 TraceCheckUtils]: 0: Hoare triple {93922#true} call ULTIMATE.init(); {93922#true} is VALID [2022-04-28 03:34:21,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {93922#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); {93922#true} is VALID [2022-04-28 03:34:21,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {93922#true} assume true; {93922#true} is VALID [2022-04-28 03:34:21,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {93922#true} {93922#true} #71#return; {93922#true} is VALID [2022-04-28 03:34:21,800 INFO L272 TraceCheckUtils]: 4: Hoare triple {93922#true} call #t~ret6 := main(); {93922#true} is VALID [2022-04-28 03:34:21,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {93922#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {93954#(<= 0 main_~k~0)} is VALID [2022-04-28 03:34:21,800 INFO L290 TraceCheckUtils]: 6: Hoare triple {93954#(<= 0 main_~k~0)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {93958#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} is VALID [2022-04-28 03:34:21,801 INFO L290 TraceCheckUtils]: 7: Hoare triple {93958#(and (<= 10 main_~n~0) (<= 0 main_~k~0))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {93962#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:34:21,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {93962#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [241] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post3_691| |v_main_#t~post3_689|)) (.cse3 (= v_main_~i~0_931 v_main_~i~0_930)) (.cse4 (= v_main_~j~0_2832 v_main_~j~0_2809)) (.cse5 (= v_main_~k~0_2564 v_main_~k~0_2562)) (.cse6 (= |v_main_#t~post5_1611| |v_main_#t~post5_1590|)) (.cse7 (= |v_main_#t~post4_1610| |v_main_#t~post4_1589|)) (.cse2 (< 1 v_main_~m~0_577)) (.cse1 (<= v_main_~m~0_577 2))) (or (and .cse0 (or (not (< v_main_~i~0_931 v_main_~n~0_313)) (not .cse1) (not .cse2)) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 (= v_main_~n~0_313 v_main_~n~0_313) .cse3 .cse4 .cse5 .cse6 .cse7 (= v_main_~m~0_577 v_main_~m~0_577)) (and (= 2 v_main_~j~0_2809) (= (+ v_main_~k~0_2564 (* 2 v_main_~i~0_930)) (+ (* 2 v_main_~i~0_931) v_main_~k~0_2562)) .cse2 (< v_main_~i~0_930 (+ 1 v_main_~n~0_313)) (< v_main_~i~0_931 v_main_~i~0_930) .cse1))) InVars {main_~m~0=v_main_~m~0_577, main_~k~0=v_main_~k~0_2564, main_~j~0=v_main_~j~0_2832, main_~i~0=v_main_~i~0_931, main_#t~post4=|v_main_#t~post4_1610|, main_#t~post5=|v_main_#t~post5_1611|, main_~n~0=v_main_~n~0_313, main_#t~post3=|v_main_#t~post3_691|} OutVars{main_~m~0=v_main_~m~0_577, main_~k~0=v_main_~k~0_2562, main_~j~0=v_main_~j~0_2809, main_~i~0=v_main_~i~0_930, main_#t~post4=|v_main_#t~post4_1589|, main_#t~post5=|v_main_#t~post5_1590|, main_#t~post3=|v_main_#t~post3_689|, main_~n~0=v_main_~n~0_313} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {93962#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:34:21,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {93962#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [242] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93962#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:34:21,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {93962#(and (<= 10 main_~n~0) (<= 10 main_~m~0) (<= 0 main_~k~0) (<= main_~i~0 0))} [243] L31-3-->L31-4_primed: Formula: (let ((.cse0 (<= v_main_~m~0_578 19)) (.cse1 (< 18 v_main_~m~0_578)) (.cse2 (= |v_main_#t~post5_1614| |v_main_#t~post5_1592|)) (.cse3 (= |v_main_#t~post3_694| |v_main_#t~post3_690|)) (.cse4 (= |v_main_#t~post4_1613| |v_main_#t~post4_1591|)) (.cse5 (= v_main_~j~0_2835 v_main_~j~0_2812)) (.cse6 (= v_main_~i~0_933 v_main_~i~0_932)) (.cse7 (= v_main_~k~0_2584 v_main_~k~0_2565))) (or (and (< v_main_~i~0_933 v_main_~i~0_932) (= (+ (* 19 v_main_~i~0_932) v_main_~k~0_2584) (+ (* 19 v_main_~i~0_933) v_main_~k~0_2565)) .cse0 (< v_main_~i~0_932 (+ 1 v_main_~n~0_314)) (= 19 v_main_~j~0_2812) .cse1) (and .cse2 .cse3 .cse4 (or (not .cse0) (not .cse1) (not (< v_main_~i~0_933 v_main_~n~0_314))) .cse5 .cse6 .cse7) (and .cse2 .cse3 .cse4 (= v_main_~m~0_578 v_main_~m~0_578) .cse5 .cse6 (= v_main_~n~0_314 v_main_~n~0_314) .cse7))) InVars {main_~m~0=v_main_~m~0_578, main_~k~0=v_main_~k~0_2584, main_~j~0=v_main_~j~0_2835, main_~i~0=v_main_~i~0_933, main_#t~post4=|v_main_#t~post4_1613|, main_#t~post5=|v_main_#t~post5_1614|, main_~n~0=v_main_~n~0_314, main_#t~post3=|v_main_#t~post3_694|} OutVars{main_~m~0=v_main_~m~0_578, main_~k~0=v_main_~k~0_2565, main_~j~0=v_main_~j~0_2812, main_~i~0=v_main_~i~0_932, main_#t~post4=|v_main_#t~post4_1591|, main_#t~post5=|v_main_#t~post5_1592|, main_#t~post3=|v_main_#t~post3_690|, main_~n~0=v_main_~n~0_314} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {93972#(and (<= 10 main_~n~0) (or (and (< (div main_~k~0 (- 19)) 0) (<= (+ (div main_~k~0 (- 19)) main_~i~0) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} is VALID [2022-04-28 03:34:21,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {93972#(and (<= 10 main_~n~0) (or (and (< (div main_~k~0 (- 19)) 0) (<= (+ (div main_~k~0 (- 19)) main_~i~0) 0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0))))} [240] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {93932#(<= 190 main_~k~0)} is VALID [2022-04-28 03:34:21,805 INFO L272 TraceCheckUtils]: 12: Hoare triple {93932#(<= 190 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {93979#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:34:21,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {93979#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {93983#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:34:21,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {93983#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {93923#false} is VALID [2022-04-28 03:34:21,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {93923#false} assume !false; {93923#false} is VALID [2022-04-28 03:34:21,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:34:21,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:34:22,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {93923#false} assume !false; {93923#false} is VALID [2022-04-28 03:34:22,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {93983#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {93923#false} is VALID [2022-04-28 03:34:22,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {93979#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {93983#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:34:22,539 INFO L272 TraceCheckUtils]: 12: Hoare triple {93999#(<= 100 main_~k~0)} call __VERIFIER_assert((if ~k~0 >= 100 then 1 else 0)); {93979#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:34:22,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {94003#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} [240] L31-4_primed-->L31-4: Formula: (not (< v_main_~i~0_5 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {93999#(<= 100 main_~k~0)} is VALID [2022-04-28 03:34:22,541 INFO L290 TraceCheckUtils]: 10: Hoare triple {94007#(and (or (<= main_~n~0 main_~i~0) (<= (+ (div (+ (- 100) main_~k~0) (- 19)) main_~i~0) main_~n~0) (not (< 18 main_~m~0)) (not (<= main_~m~0 19))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [243] L31-3-->L31-4_primed: Formula: (let ((.cse0 (<= v_main_~m~0_578 19)) (.cse1 (< 18 v_main_~m~0_578)) (.cse2 (= |v_main_#t~post5_1614| |v_main_#t~post5_1592|)) (.cse3 (= |v_main_#t~post3_694| |v_main_#t~post3_690|)) (.cse4 (= |v_main_#t~post4_1613| |v_main_#t~post4_1591|)) (.cse5 (= v_main_~j~0_2835 v_main_~j~0_2812)) (.cse6 (= v_main_~i~0_933 v_main_~i~0_932)) (.cse7 (= v_main_~k~0_2584 v_main_~k~0_2565))) (or (and (< v_main_~i~0_933 v_main_~i~0_932) (= (+ (* 19 v_main_~i~0_932) v_main_~k~0_2584) (+ (* 19 v_main_~i~0_933) v_main_~k~0_2565)) .cse0 (< v_main_~i~0_932 (+ 1 v_main_~n~0_314)) (= 19 v_main_~j~0_2812) .cse1) (and .cse2 .cse3 .cse4 (or (not .cse0) (not .cse1) (not (< v_main_~i~0_933 v_main_~n~0_314))) .cse5 .cse6 .cse7) (and .cse2 .cse3 .cse4 (= v_main_~m~0_578 v_main_~m~0_578) .cse5 .cse6 (= v_main_~n~0_314 v_main_~n~0_314) .cse7))) InVars {main_~m~0=v_main_~m~0_578, main_~k~0=v_main_~k~0_2584, main_~j~0=v_main_~j~0_2835, main_~i~0=v_main_~i~0_933, main_#t~post4=|v_main_#t~post4_1613|, main_#t~post5=|v_main_#t~post5_1614|, main_~n~0=v_main_~n~0_314, main_#t~post3=|v_main_#t~post3_694|} OutVars{main_~m~0=v_main_~m~0_578, main_~k~0=v_main_~k~0_2565, main_~j~0=v_main_~j~0_2812, main_~i~0=v_main_~i~0_932, main_#t~post4=|v_main_#t~post4_1591|, main_#t~post5=|v_main_#t~post5_1592|, main_#t~post3=|v_main_#t~post3_690|, main_~n~0=v_main_~n~0_314} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {94003#(or (<= 100 main_~k~0) (< main_~i~0 main_~n~0))} is VALID [2022-04-28 03:34:22,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {94007#(and (or (<= main_~n~0 main_~i~0) (<= (+ (div (+ (- 100) main_~k~0) (- 19)) main_~i~0) main_~n~0) (not (< 18 main_~m~0)) (not (<= main_~m~0 19))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [242] L31-4_primed-->L31-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {94007#(and (or (<= main_~n~0 main_~i~0) (<= (+ (div (+ (- 100) main_~k~0) (- 19)) main_~i~0) main_~n~0) (not (< 18 main_~m~0)) (not (<= main_~m~0 19))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:34:22,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {94014#(and (or (<= main_~n~0 main_~i~0) (<= (+ (div (+ (- 100) main_~k~0) (- 19)) main_~i~0) main_~n~0) (not (< 18 main_~m~0)) (not (<= main_~m~0 19))) (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 2))) main_~n~0) (not (< 1 main_~m~0)) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 2))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} [241] L31-3-->L31-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post3_691| |v_main_#t~post3_689|)) (.cse3 (= v_main_~i~0_931 v_main_~i~0_930)) (.cse4 (= v_main_~j~0_2832 v_main_~j~0_2809)) (.cse5 (= v_main_~k~0_2564 v_main_~k~0_2562)) (.cse6 (= |v_main_#t~post5_1611| |v_main_#t~post5_1590|)) (.cse7 (= |v_main_#t~post4_1610| |v_main_#t~post4_1589|)) (.cse2 (< 1 v_main_~m~0_577)) (.cse1 (<= v_main_~m~0_577 2))) (or (and .cse0 (or (not (< v_main_~i~0_931 v_main_~n~0_313)) (not .cse1) (not .cse2)) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 (= v_main_~n~0_313 v_main_~n~0_313) .cse3 .cse4 .cse5 .cse6 .cse7 (= v_main_~m~0_577 v_main_~m~0_577)) (and (= 2 v_main_~j~0_2809) (= (+ v_main_~k~0_2564 (* 2 v_main_~i~0_930)) (+ (* 2 v_main_~i~0_931) v_main_~k~0_2562)) .cse2 (< v_main_~i~0_930 (+ 1 v_main_~n~0_313)) (< v_main_~i~0_931 v_main_~i~0_930) .cse1))) InVars {main_~m~0=v_main_~m~0_577, main_~k~0=v_main_~k~0_2564, main_~j~0=v_main_~j~0_2832, main_~i~0=v_main_~i~0_931, main_#t~post4=|v_main_#t~post4_1610|, main_#t~post5=|v_main_#t~post5_1611|, main_~n~0=v_main_~n~0_313, main_#t~post3=|v_main_#t~post3_691|} OutVars{main_~m~0=v_main_~m~0_577, main_~k~0=v_main_~k~0_2562, main_~j~0=v_main_~j~0_2809, main_~i~0=v_main_~i~0_930, main_#t~post4=|v_main_#t~post4_1589|, main_#t~post5=|v_main_#t~post5_1590|, main_#t~post3=|v_main_#t~post3_689|, main_~n~0=v_main_~n~0_313} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_#t~post4, main_#t~post5, main_#t~post3] {94007#(and (or (<= main_~n~0 main_~i~0) (<= (+ (div (+ (- 100) main_~k~0) (- 19)) main_~i~0) main_~n~0) (not (< 18 main_~m~0)) (not (<= main_~m~0 19))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:34:22,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {94018#(and (or (<= (div (+ (- 100) main_~k~0) (- 19)) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 19)) 1)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} assume !!(10 <= ~m~0 && ~m~0 <= 10000);~i~0 := 0; {94014#(and (or (<= main_~n~0 main_~i~0) (<= (+ (div (+ (- 100) main_~k~0) (- 19)) main_~i~0) main_~n~0) (not (< 18 main_~m~0)) (not (<= main_~m~0 19))) (or (<= (+ main_~i~0 (div (+ (- 100) main_~k~0) (- 2))) main_~n~0) (not (< 1 main_~m~0)) (<= main_~n~0 main_~i~0) (not (<= main_~m~0 2))) (or (<= 100 main_~k~0) (< main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:34:22,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {94022#(<= (div (+ (- 100) main_~k~0) (- 19)) 10)} assume !!(10 <= ~n~0 && ~n~0 <= 10000); {94018#(and (or (<= (div (+ (- 100) main_~k~0) (- 19)) main_~n~0) (<= (div (+ (- 100) main_~k~0) (- 19)) 1)) (or (< 0 main_~n~0) (<= 100 main_~k~0)))} is VALID [2022-04-28 03:34:22,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {93922#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;~k~0 := 0;havoc ~i~0;havoc ~j~0; {94022#(<= (div (+ (- 100) main_~k~0) (- 19)) 10)} is VALID [2022-04-28 03:34:22,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {93922#true} call #t~ret6 := main(); {93922#true} is VALID [2022-04-28 03:34:22,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {93922#true} {93922#true} #71#return; {93922#true} is VALID [2022-04-28 03:34:22,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {93922#true} assume true; {93922#true} is VALID [2022-04-28 03:34:22,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {93922#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); {93922#true} is VALID [2022-04-28 03:34:22,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {93922#true} call ULTIMATE.init(); {93922#true} is VALID [2022-04-28 03:34:22,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:34:22,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713934999] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:34:22,545 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:34:22,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 23 [2022-04-28 03:34:24,395 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:34:24,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [274506006] [2022-04-28 03:34:24,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [274506006] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:34:24,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:34:24,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2022-04-28 03:34:24,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429381065] [2022-04-28 03:34:24,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:34:24,396 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 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 61 [2022-04-28 03:34:24,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:34:24,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 55 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:34:24,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:34:24,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-04-28 03:34:24,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:34:24,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-04-28 03:34:24,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=663, Invalid=4029, Unknown=0, NotChecked=0, Total=4692 [2022-04-28 03:34:24,453 INFO L87 Difference]: Start difference. First operand 539 states and 691 transitions. Second operand has 55 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 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)