/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-simple/nested_3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:33:45,907 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:33:45,924 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:33:45,971 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:33:45,972 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:33:45,973 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:33:45,979 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:33:45,982 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:33:45,989 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:33:45,995 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:33:45,995 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:33:45,996 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:33:45,996 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:33:45,997 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:33:45,998 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:33:45,998 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:33:45,999 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:33:45,999 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:33:46,001 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:33:46,002 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:33:46,003 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:33:46,006 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:33:46,008 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:33:46,010 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:33:46,011 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:33:46,020 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:33:46,020 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:33:46,021 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:33:46,021 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:33:46,022 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:33:46,023 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:33:46,023 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:33:46,024 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:33:46,025 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:33:46,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:33:46,026 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:33:46,026 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:33:46,027 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:33:46,027 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:33:46,027 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:33:46,028 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:33:46,030 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:33:46,031 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 10:33:46,041 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:33:46,042 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:33:46,043 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:33:46,043 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:33:46,043 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:33:46,043 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:33:46,043 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:33:46,044 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:33:46,044 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:33:46,044 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:33:46,045 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:33:46,045 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:33:46,045 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:33:46,045 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:33:46,045 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:33:46,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:33:46,045 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:33:46,046 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:33:46,046 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:33:46,046 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:33:46,046 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:33:46,046 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:33:46,046 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 10:33:46,253 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:33:46,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:33:46,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:33:46,277 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:33:46,277 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:33:46,279 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-simple/nested_3.c [2022-04-28 10:33:46,325 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91abd5da9/321937dae87246b08eb6f73196787882/FLAG0246ce941 [2022-04-28 10:33:46,661 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:33:46,662 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_3.c [2022-04-28 10:33:46,666 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91abd5da9/321937dae87246b08eb6f73196787882/FLAG0246ce941 [2022-04-28 10:33:47,096 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91abd5da9/321937dae87246b08eb6f73196787882 [2022-04-28 10:33:47,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:33:47,099 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:33:47,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:33:47,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:33:47,105 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:33:47,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:33:47" (1/1) ... [2022-04-28 10:33:47,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49102fcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:33:47, skipping insertion in model container [2022-04-28 10:33:47,108 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:33:47" (1/1) ... [2022-04-28 10:33:47,113 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:33:47,122 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:33:47,347 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-simple/nested_3.c[784,797] [2022-04-28 10:33:47,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:33:47,370 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:33:47,385 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-simple/nested_3.c[784,797] [2022-04-28 10:33:47,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:33:47,396 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:33:47,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:33:47 WrapperNode [2022-04-28 10:33:47,397 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:33:47,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:33:47,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:33:47,399 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:33:47,408 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:33:47" (1/1) ... [2022-04-28 10:33:47,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:33:47" (1/1) ... [2022-04-28 10:33:47,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:33:47" (1/1) ... [2022-04-28 10:33:47,412 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:33:47" (1/1) ... [2022-04-28 10:33:47,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:33:47" (1/1) ... [2022-04-28 10:33:47,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:33:47" (1/1) ... [2022-04-28 10:33:47,424 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:33:47" (1/1) ... [2022-04-28 10:33:47,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:33:47,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:33:47,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:33:47,426 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:33:47,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:33:47" (1/1) ... [2022-04-28 10:33:47,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:33:47,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:47,463 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 10:33:47,465 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 10:33:47,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:33:47,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:33:47,495 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:33:47,495 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:33:47,495 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:33:47,496 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:33:47,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:33:47,496 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:33:47,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:33:47,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:33:47,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:33:47,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:33:47,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:33:47,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:33:47,543 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:33:47,545 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:33:47,628 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:33:47,634 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:33:47,634 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-28 10:33:47,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:33:47 BoogieIcfgContainer [2022-04-28 10:33:47,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:33:47,638 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:33:47,638 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:33:47,660 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:33:47,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:33:47" (1/3) ... [2022-04-28 10:33:47,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c3fdab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:33:47, skipping insertion in model container [2022-04-28 10:33:47,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:33:47" (2/3) ... [2022-04-28 10:33:47,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c3fdab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:33:47, skipping insertion in model container [2022-04-28 10:33:47,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:33:47" (3/3) ... [2022-04-28 10:33:47,663 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_3.c [2022-04-28 10:33:47,674 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:33:47,674 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:33:47,714 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:33:47,738 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@49b38231, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1eb19ef1 [2022-04-28 10:33:47,739 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:33:47,756 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:33:47,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-28 10:33:47,762 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:47,762 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:47,763 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:47,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:47,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1607939523, now seen corresponding path program 1 times [2022-04-28 10:33:47,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:47,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1371859508] [2022-04-28 10:33:47,812 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:33:47,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1607939523, now seen corresponding path program 2 times [2022-04-28 10:33:47,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:47,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419804875] [2022-04-28 10:33:47,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:47,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:47,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:47,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(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(11, 2);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-28 10:33:47,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 10:33:47,980 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #56#return; {23#true} is VALID [2022-04-28 10:33:47,985 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:47,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(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(11, 2);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-28 10:33:47,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 10:33:47,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #56#return; {23#true} is VALID [2022-04-28 10:33:47,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret7 := main(); {23#true} is VALID [2022-04-28 10:33:47,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {23#true} is VALID [2022-04-28 10:33:47,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-04-28 10:33:47,988 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {24#false} is VALID [2022-04-28 10:33:47,989 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-28 10:33:47,989 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 10:33:47,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:47,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419804875] [2022-04-28 10:33:47,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419804875] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:47,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:47,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:33:47,993 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:47,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1371859508] [2022-04-28 10:33:47,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1371859508] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:47,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:47,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:33:47,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443256816] [2022-04-28 10:33:47,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:48,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-28 10:33:48,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:48,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:48,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 10:33:48,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:48,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 10:33:48,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:33:48,055 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:48,147 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-04-28 10:33:48,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 10:33:48,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-28 10:33:48,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:48,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-28 10:33:48,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-28 10:33:48,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 46 transitions. [2022-04-28 10:33:48,213 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 10:33:48,220 INFO L225 Difference]: With dead ends: 34 [2022-04-28 10:33:48,220 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 10:33:48,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:33:48,225 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:48,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:48,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 10:33:48,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 10:33:48,251 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:48,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,252 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,252 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:48,254 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-28 10:33:48,254 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-28 10:33:48,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:48,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:48,255 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 10:33:48,256 INFO L87 Difference]: Start difference. First operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 10:33:48,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:48,258 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-28 10:33:48,258 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-28 10:33:48,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:48,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:48,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:48,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:48,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-04-28 10:33:48,261 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 9 [2022-04-28 10:33:48,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:48,262 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-04-28 10:33:48,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 17 transitions. [2022-04-28 10:33:48,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:48,283 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-28 10:33:48,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-28 10:33:48,283 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:48,283 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:48,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:33:48,284 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:48,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:48,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1607968353, now seen corresponding path program 1 times [2022-04-28 10:33:48,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:48,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [385787399] [2022-04-28 10:33:48,286 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:33:48,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1607968353, now seen corresponding path program 2 times [2022-04-28 10:33:48,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:48,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740250964] [2022-04-28 10:33:48,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:48,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:48,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:48,359 INFO L290 TraceCheckUtils]: 0: Hoare triple {165#(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(11, 2);call #Ultimate.allocInit(12, 3); {159#true} is VALID [2022-04-28 10:33:48,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#true} assume true; {159#true} is VALID [2022-04-28 10:33:48,359 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {159#true} {159#true} #56#return; {159#true} is VALID [2022-04-28 10:33:48,360 INFO L272 TraceCheckUtils]: 0: Hoare triple {159#true} call ULTIMATE.init(); {165#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:48,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {165#(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(11, 2);call #Ultimate.allocInit(12, 3); {159#true} is VALID [2022-04-28 10:33:48,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {159#true} assume true; {159#true} is VALID [2022-04-28 10:33:48,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {159#true} {159#true} #56#return; {159#true} is VALID [2022-04-28 10:33:48,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {159#true} call #t~ret7 := main(); {159#true} is VALID [2022-04-28 10:33:48,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {159#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {164#(= main_~a~0 0)} is VALID [2022-04-28 10:33:48,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {164#(= main_~a~0 0)} assume !(~a~0 < 6); {160#false} is VALID [2022-04-28 10:33:48,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {160#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {160#false} is VALID [2022-04-28 10:33:48,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {160#false} assume !false; {160#false} is VALID [2022-04-28 10:33:48,363 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 10:33:48,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:48,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740250964] [2022-04-28 10:33:48,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740250964] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:48,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:48,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:33:48,365 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:48,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [385787399] [2022-04-28 10:33:48,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [385787399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:48,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:48,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:33:48,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220152262] [2022-04-28 10:33:48,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:48,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-28 10:33:48,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:48,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:48,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 10:33:48,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:48,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 10:33:48,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 10:33:48,377 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:48,439 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-28 10:33:48,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 10:33:48,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-28 10:33:48,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:48,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-28 10:33:48,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-28 10:33:48,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-28 10:33:48,472 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 10:33:48,473 INFO L225 Difference]: With dead ends: 24 [2022-04-28 10:33:48,473 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 10:33:48,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:33:48,474 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:48,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 22 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:48,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 10:33:48,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2022-04-28 10:33:48,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:48,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,480 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,480 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:48,482 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-04-28 10:33:48,482 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-04-28 10:33:48,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:48,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:48,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 10:33:48,483 INFO L87 Difference]: Start difference. First operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 10:33:48,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:48,485 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-04-28 10:33:48,485 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-04-28 10:33:48,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:48,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:48,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:48,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:48,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-28 10:33:48,489 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 9 [2022-04-28 10:33:48,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:48,489 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-28 10:33:48,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-28 10:33:48,526 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 10:33:48,526 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-28 10:33:48,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 10:33:48,526 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:48,526 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:48,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 10:33:48,527 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:48,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:48,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1181899718, now seen corresponding path program 1 times [2022-04-28 10:33:48,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:48,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1356482980] [2022-04-28 10:33:48,545 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:48,545 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:48,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1181899718, now seen corresponding path program 2 times [2022-04-28 10:33:48,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:48,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353809214] [2022-04-28 10:33:48,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:48,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:48,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:48,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {298#(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(11, 2);call #Ultimate.allocInit(12, 3); {292#true} is VALID [2022-04-28 10:33:48,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {292#true} assume true; {292#true} is VALID [2022-04-28 10:33:48,596 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {292#true} {292#true} #56#return; {292#true} is VALID [2022-04-28 10:33:48,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {292#true} call ULTIMATE.init(); {298#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:48,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {298#(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(11, 2);call #Ultimate.allocInit(12, 3); {292#true} is VALID [2022-04-28 10:33:48,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {292#true} assume true; {292#true} is VALID [2022-04-28 10:33:48,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {292#true} {292#true} #56#return; {292#true} is VALID [2022-04-28 10:33:48,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {292#true} call #t~ret7 := main(); {292#true} is VALID [2022-04-28 10:33:48,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {292#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {292#true} is VALID [2022-04-28 10:33:48,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {292#true} assume !!(~a~0 < 6);~b~0 := 0; {297#(= main_~b~0 0)} is VALID [2022-04-28 10:33:48,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {297#(= main_~b~0 0)} assume !(~b~0 < 6); {293#false} is VALID [2022-04-28 10:33:48,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {293#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {293#false} is VALID [2022-04-28 10:33:48,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {293#false} assume !(~a~0 < 6); {293#false} is VALID [2022-04-28 10:33:48,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {293#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {293#false} is VALID [2022-04-28 10:33:48,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {293#false} assume !false; {293#false} is VALID [2022-04-28 10:33:48,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:48,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:48,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353809214] [2022-04-28 10:33:48,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353809214] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:48,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:48,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:33:48,601 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:48,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1356482980] [2022-04-28 10:33:48,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1356482980] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:48,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:48,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:33:48,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302761299] [2022-04-28 10:33:48,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:48,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 10:33:48,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:48,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:48,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 10:33:48,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:48,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 10:33:48,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 10:33:48,615 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:48,671 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-28 10:33:48,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 10:33:48,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 10:33:48,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:48,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-04-28 10:33:48,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-04-28 10:33:48,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 34 transitions. [2022-04-28 10:33:48,706 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 10:33:48,707 INFO L225 Difference]: With dead ends: 29 [2022-04-28 10:33:48,707 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 10:33:48,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:33:48,708 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 20 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:48,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 22 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:48,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 10:33:48,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2022-04-28 10:33:48,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:48,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,713 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,714 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:48,715 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-28 10:33:48,715 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-28 10:33:48,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:48,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:48,716 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 10:33:48,716 INFO L87 Difference]: Start difference. First operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 10:33:48,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:48,718 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-28 10:33:48,718 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-28 10:33:48,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:48,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:48,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:48,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:48,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-28 10:33:48,719 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2022-04-28 10:33:48,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:48,720 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-28 10:33:48,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-28 10:33:48,741 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 10:33:48,741 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 10:33:48,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 10:33:48,742 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:48,742 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:48,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 10:33:48,742 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:48,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:48,743 INFO L85 PathProgramCache]: Analyzing trace with hash -2039168997, now seen corresponding path program 1 times [2022-04-28 10:33:48,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:48,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1202395250] [2022-04-28 10:33:48,752 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:48,766 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:48,766 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:48,766 INFO L85 PathProgramCache]: Analyzing trace with hash -2039168997, now seen corresponding path program 2 times [2022-04-28 10:33:48,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:48,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156397739] [2022-04-28 10:33:48,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:48,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:48,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:48,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {441#(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(11, 2);call #Ultimate.allocInit(12, 3); {435#true} is VALID [2022-04-28 10:33:48,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {435#true} assume true; {435#true} is VALID [2022-04-28 10:33:48,813 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {435#true} {435#true} #56#return; {435#true} is VALID [2022-04-28 10:33:48,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {435#true} call ULTIMATE.init(); {441#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:48,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {441#(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(11, 2);call #Ultimate.allocInit(12, 3); {435#true} is VALID [2022-04-28 10:33:48,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {435#true} assume true; {435#true} is VALID [2022-04-28 10:33:48,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {435#true} {435#true} #56#return; {435#true} is VALID [2022-04-28 10:33:48,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {435#true} call #t~ret7 := main(); {435#true} is VALID [2022-04-28 10:33:48,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {435#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {435#true} is VALID [2022-04-28 10:33:48,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {435#true} assume !!(~a~0 < 6);~b~0 := 0; {435#true} is VALID [2022-04-28 10:33:48,816 INFO L290 TraceCheckUtils]: 7: Hoare triple {435#true} assume !!(~b~0 < 6);~c~0 := 0; {440#(= main_~c~0 0)} is VALID [2022-04-28 10:33:48,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {440#(= main_~c~0 0)} assume !(~c~0 < 6); {436#false} is VALID [2022-04-28 10:33:48,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {436#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {436#false} is VALID [2022-04-28 10:33:48,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {436#false} assume !(~b~0 < 6); {436#false} is VALID [2022-04-28 10:33:48,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {436#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {436#false} is VALID [2022-04-28 10:33:48,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {436#false} assume !(~a~0 < 6); {436#false} is VALID [2022-04-28 10:33:48,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {436#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {436#false} is VALID [2022-04-28 10:33:48,817 INFO L290 TraceCheckUtils]: 14: Hoare triple {436#false} assume !false; {436#false} is VALID [2022-04-28 10:33:48,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:48,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:48,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156397739] [2022-04-28 10:33:48,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156397739] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:48,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:48,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:33:48,819 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:48,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1202395250] [2022-04-28 10:33:48,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1202395250] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:48,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:48,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:33:48,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804334193] [2022-04-28 10:33:48,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:48,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 10:33:48,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:48,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:48,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 10:33:48,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:48,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 10:33:48,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 10:33:48,834 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:48,894 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-04-28 10:33:48,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 10:33:48,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 10:33:48,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:48,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-28 10:33:48,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-28 10:33:48,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 31 transitions. [2022-04-28 10:33:48,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:48,930 INFO L225 Difference]: With dead ends: 29 [2022-04-28 10:33:48,930 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 10:33:48,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:33:48,934 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:48,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 22 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:48,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 10:33:48,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-28 10:33:48,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:48,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,943 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,944 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:48,948 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-28 10:33:48,949 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 10:33:48,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:48,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:48,949 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 10:33:48,950 INFO L87 Difference]: Start difference. First operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 10:33:48,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:48,953 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-28 10:33:48,953 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 10:33:48,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:48,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:48,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:48,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:48,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-28 10:33:48,956 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2022-04-28 10:33:48,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:48,957 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-28 10:33:48,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:48,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-28 10:33:48,984 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 10:33:48,984 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 10:33:48,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:33:48,985 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:48,985 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:48,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 10:33:48,985 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:48,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:48,986 INFO L85 PathProgramCache]: Analyzing trace with hash -434811975, now seen corresponding path program 1 times [2022-04-28 10:33:48,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:48,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [724886045] [2022-04-28 10:33:49,008 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:49,010 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:49,010 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:49,028 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:49,028 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:49,028 INFO L85 PathProgramCache]: Analyzing trace with hash -434811975, now seen corresponding path program 2 times [2022-04-28 10:33:49,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:49,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028385371] [2022-04-28 10:33:49,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:49,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:49,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:49,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:49,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {585#(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(11, 2);call #Ultimate.allocInit(12, 3); {578#true} is VALID [2022-04-28 10:33:49,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {578#true} assume true; {578#true} is VALID [2022-04-28 10:33:49,106 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {578#true} {578#true} #56#return; {578#true} is VALID [2022-04-28 10:33:49,106 INFO L272 TraceCheckUtils]: 0: Hoare triple {578#true} call ULTIMATE.init(); {585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:49,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {585#(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(11, 2);call #Ultimate.allocInit(12, 3); {578#true} is VALID [2022-04-28 10:33:49,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {578#true} assume true; {578#true} is VALID [2022-04-28 10:33:49,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {578#true} {578#true} #56#return; {578#true} is VALID [2022-04-28 10:33:49,107 INFO L272 TraceCheckUtils]: 4: Hoare triple {578#true} call #t~ret7 := main(); {578#true} is VALID [2022-04-28 10:33:49,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {578#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {578#true} is VALID [2022-04-28 10:33:49,108 INFO L290 TraceCheckUtils]: 6: Hoare triple {578#true} assume !!(~a~0 < 6);~b~0 := 0; {578#true} is VALID [2022-04-28 10:33:49,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {578#true} assume !!(~b~0 < 6);~c~0 := 0; {583#(= main_~c~0 0)} is VALID [2022-04-28 10:33:49,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {583#(= main_~c~0 0)} assume !!(~c~0 < 6); {583#(= main_~c~0 0)} is VALID [2022-04-28 10:33:49,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {583#(= main_~c~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {584#(<= main_~c~0 1)} is VALID [2022-04-28 10:33:49,111 INFO L290 TraceCheckUtils]: 10: Hoare triple {584#(<= main_~c~0 1)} assume !(~c~0 < 6); {579#false} is VALID [2022-04-28 10:33:49,111 INFO L290 TraceCheckUtils]: 11: Hoare triple {579#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {579#false} is VALID [2022-04-28 10:33:49,111 INFO L290 TraceCheckUtils]: 12: Hoare triple {579#false} assume !(~b~0 < 6); {579#false} is VALID [2022-04-28 10:33:49,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {579#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {579#false} is VALID [2022-04-28 10:33:49,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {579#false} assume !(~a~0 < 6); {579#false} is VALID [2022-04-28 10:33:49,112 INFO L290 TraceCheckUtils]: 15: Hoare triple {579#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {579#false} is VALID [2022-04-28 10:33:49,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {579#false} assume !false; {579#false} is VALID [2022-04-28 10:33:49,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:49,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:49,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028385371] [2022-04-28 10:33:49,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028385371] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:33:49,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511807155] [2022-04-28 10:33:49,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:33:49,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:49,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:49,119 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 10:33:49,134 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 10:33:49,164 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:33:49,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:49,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-28 10:33:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:49,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:49,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {578#true} call ULTIMATE.init(); {578#true} is VALID [2022-04-28 10:33:49,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {578#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(11, 2);call #Ultimate.allocInit(12, 3); {578#true} is VALID [2022-04-28 10:33:49,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {578#true} assume true; {578#true} is VALID [2022-04-28 10:33:49,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {578#true} {578#true} #56#return; {578#true} is VALID [2022-04-28 10:33:49,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {578#true} call #t~ret7 := main(); {578#true} is VALID [2022-04-28 10:33:49,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {578#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {578#true} is VALID [2022-04-28 10:33:49,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {578#true} assume !!(~a~0 < 6);~b~0 := 0; {578#true} is VALID [2022-04-28 10:33:49,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {578#true} assume !!(~b~0 < 6);~c~0 := 0; {610#(<= main_~c~0 0)} is VALID [2022-04-28 10:33:49,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {610#(<= main_~c~0 0)} assume !!(~c~0 < 6); {610#(<= main_~c~0 0)} is VALID [2022-04-28 10:33:49,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {610#(<= main_~c~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {584#(<= main_~c~0 1)} is VALID [2022-04-28 10:33:49,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {584#(<= main_~c~0 1)} assume !(~c~0 < 6); {579#false} is VALID [2022-04-28 10:33:49,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {579#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {579#false} is VALID [2022-04-28 10:33:49,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {579#false} assume !(~b~0 < 6); {579#false} is VALID [2022-04-28 10:33:49,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {579#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {579#false} is VALID [2022-04-28 10:33:49,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {579#false} assume !(~a~0 < 6); {579#false} is VALID [2022-04-28 10:33:49,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {579#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {579#false} is VALID [2022-04-28 10:33:49,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {579#false} assume !false; {579#false} is VALID [2022-04-28 10:33:49,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:49,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:33:49,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {579#false} assume !false; {579#false} is VALID [2022-04-28 10:33:49,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {579#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {579#false} is VALID [2022-04-28 10:33:49,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {579#false} assume !(~a~0 < 6); {579#false} is VALID [2022-04-28 10:33:49,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {579#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {579#false} is VALID [2022-04-28 10:33:49,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {579#false} assume !(~b~0 < 6); {579#false} is VALID [2022-04-28 10:33:49,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {579#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {579#false} is VALID [2022-04-28 10:33:49,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {656#(< main_~c~0 6)} assume !(~c~0 < 6); {579#false} is VALID [2022-04-28 10:33:49,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {660#(< main_~c~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {656#(< main_~c~0 6)} is VALID [2022-04-28 10:33:49,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {660#(< main_~c~0 5)} assume !!(~c~0 < 6); {660#(< main_~c~0 5)} is VALID [2022-04-28 10:33:49,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {578#true} assume !!(~b~0 < 6);~c~0 := 0; {660#(< main_~c~0 5)} is VALID [2022-04-28 10:33:49,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {578#true} assume !!(~a~0 < 6);~b~0 := 0; {578#true} is VALID [2022-04-28 10:33:49,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {578#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {578#true} is VALID [2022-04-28 10:33:49,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {578#true} call #t~ret7 := main(); {578#true} is VALID [2022-04-28 10:33:49,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {578#true} {578#true} #56#return; {578#true} is VALID [2022-04-28 10:33:49,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {578#true} assume true; {578#true} is VALID [2022-04-28 10:33:49,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {578#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(11, 2);call #Ultimate.allocInit(12, 3); {578#true} is VALID [2022-04-28 10:33:49,377 INFO L272 TraceCheckUtils]: 0: Hoare triple {578#true} call ULTIMATE.init(); {578#true} is VALID [2022-04-28 10:33:49,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:49,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511807155] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:33:49,378 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:33:49,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-28 10:33:49,379 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:49,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [724886045] [2022-04-28 10:33:49,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [724886045] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:49,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:49,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:33:49,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876608498] [2022-04-28 10:33:49,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:49,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 10:33:49,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:49,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:49,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:49,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:33:49,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:49,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:33:49,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-28 10:33:49,395 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:49,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:49,471 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-28 10:33:49,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:33:49,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 10:33:49,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:49,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:49,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-04-28 10:33:49,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:49,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-04-28 10:33:49,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2022-04-28 10:33:49,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:49,502 INFO L225 Difference]: With dead ends: 32 [2022-04-28 10:33:49,503 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 10:33:49,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:33:49,504 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 16 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:49,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 27 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:49,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 10:33:49,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-04-28 10:33:49,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:49,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:49,509 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:49,510 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:49,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:49,511 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-28 10:33:49,511 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-28 10:33:49,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:49,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:49,511 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 10:33:49,511 INFO L87 Difference]: Start difference. First operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 10:33:49,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:49,512 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-28 10:33:49,513 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-28 10:33:49,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:49,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:49,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:49,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:49,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:49,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-28 10:33:49,514 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2022-04-28 10:33:49,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:49,514 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-28 10:33:49,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:49,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 22 transitions. [2022-04-28 10:33:49,536 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 10:33:49,537 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-28 10:33:49,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 10:33:49,537 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:49,537 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:49,564 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 10:33:49,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:49,752 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:49,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:49,752 INFO L85 PathProgramCache]: Analyzing trace with hash -540973097, now seen corresponding path program 3 times [2022-04-28 10:33:49,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:49,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1221742184] [2022-04-28 10:33:49,794 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:49,795 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:49,795 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:49,822 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:49,823 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:49,823 INFO L85 PathProgramCache]: Analyzing trace with hash -540973097, now seen corresponding path program 4 times [2022-04-28 10:33:49,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:49,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061796319] [2022-04-28 10:33:49,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:49,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:49,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:49,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {847#(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(11, 2);call #Ultimate.allocInit(12, 3); {840#true} is VALID [2022-04-28 10:33:49,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-28 10:33:49,885 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {840#true} {840#true} #56#return; {840#true} is VALID [2022-04-28 10:33:49,886 INFO L272 TraceCheckUtils]: 0: Hoare triple {840#true} call ULTIMATE.init(); {847#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:49,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {847#(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(11, 2);call #Ultimate.allocInit(12, 3); {840#true} is VALID [2022-04-28 10:33:49,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-28 10:33:49,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {840#true} {840#true} #56#return; {840#true} is VALID [2022-04-28 10:33:49,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {840#true} call #t~ret7 := main(); {840#true} is VALID [2022-04-28 10:33:49,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {840#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {840#true} is VALID [2022-04-28 10:33:49,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {840#true} assume !!(~a~0 < 6);~b~0 := 0; {845#(= main_~b~0 0)} is VALID [2022-04-28 10:33:49,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {845#(= main_~b~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {845#(= main_~b~0 0)} is VALID [2022-04-28 10:33:49,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {845#(= main_~b~0 0)} assume !!(~c~0 < 6); {845#(= main_~b~0 0)} is VALID [2022-04-28 10:33:49,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {845#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {845#(= main_~b~0 0)} is VALID [2022-04-28 10:33:49,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {845#(= main_~b~0 0)} assume !!(~c~0 < 6); {845#(= main_~b~0 0)} is VALID [2022-04-28 10:33:49,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {845#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {845#(= main_~b~0 0)} is VALID [2022-04-28 10:33:49,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {845#(= main_~b~0 0)} assume !(~c~0 < 6); {845#(= main_~b~0 0)} is VALID [2022-04-28 10:33:49,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {845#(= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {846#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:49,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {846#(<= main_~b~0 1)} assume !(~b~0 < 6); {841#false} is VALID [2022-04-28 10:33:49,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {841#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {841#false} is VALID [2022-04-28 10:33:49,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {841#false} assume !(~a~0 < 6); {841#false} is VALID [2022-04-28 10:33:49,891 INFO L290 TraceCheckUtils]: 17: Hoare triple {841#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {841#false} is VALID [2022-04-28 10:33:49,891 INFO L290 TraceCheckUtils]: 18: Hoare triple {841#false} assume !false; {841#false} is VALID [2022-04-28 10:33:49,891 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 10:33:49,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:49,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061796319] [2022-04-28 10:33:49,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061796319] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:33:49,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749343495] [2022-04-28 10:33:49,892 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:33:49,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:49,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:49,893 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 10:33:49,894 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 10:33:49,926 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:33:49,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:49,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 10:33:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:49,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:50,013 INFO L272 TraceCheckUtils]: 0: Hoare triple {840#true} call ULTIMATE.init(); {840#true} is VALID [2022-04-28 10:33:50,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {840#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(11, 2);call #Ultimate.allocInit(12, 3); {840#true} is VALID [2022-04-28 10:33:50,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-28 10:33:50,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {840#true} {840#true} #56#return; {840#true} is VALID [2022-04-28 10:33:50,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {840#true} call #t~ret7 := main(); {840#true} is VALID [2022-04-28 10:33:50,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {840#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {840#true} is VALID [2022-04-28 10:33:50,014 INFO L290 TraceCheckUtils]: 6: Hoare triple {840#true} assume !!(~a~0 < 6);~b~0 := 0; {840#true} is VALID [2022-04-28 10:33:50,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {840#true} assume !!(~b~0 < 6);~c~0 := 0; {872#(<= main_~c~0 0)} is VALID [2022-04-28 10:33:50,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {872#(<= main_~c~0 0)} assume !!(~c~0 < 6); {872#(<= main_~c~0 0)} is VALID [2022-04-28 10:33:50,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {872#(<= main_~c~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {879#(<= main_~c~0 1)} is VALID [2022-04-28 10:33:50,016 INFO L290 TraceCheckUtils]: 10: Hoare triple {879#(<= main_~c~0 1)} assume !!(~c~0 < 6); {879#(<= main_~c~0 1)} is VALID [2022-04-28 10:33:50,017 INFO L290 TraceCheckUtils]: 11: Hoare triple {879#(<= main_~c~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {886#(<= main_~c~0 2)} is VALID [2022-04-28 10:33:50,017 INFO L290 TraceCheckUtils]: 12: Hoare triple {886#(<= main_~c~0 2)} assume !(~c~0 < 6); {841#false} is VALID [2022-04-28 10:33:50,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {841#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {841#false} is VALID [2022-04-28 10:33:50,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {841#false} assume !(~b~0 < 6); {841#false} is VALID [2022-04-28 10:33:50,018 INFO L290 TraceCheckUtils]: 15: Hoare triple {841#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {841#false} is VALID [2022-04-28 10:33:50,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {841#false} assume !(~a~0 < 6); {841#false} is VALID [2022-04-28 10:33:50,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {841#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {841#false} is VALID [2022-04-28 10:33:50,018 INFO L290 TraceCheckUtils]: 18: Hoare triple {841#false} assume !false; {841#false} is VALID [2022-04-28 10:33:50,018 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:50,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:33:50,112 INFO L290 TraceCheckUtils]: 18: Hoare triple {841#false} assume !false; {841#false} is VALID [2022-04-28 10:33:50,113 INFO L290 TraceCheckUtils]: 17: Hoare triple {841#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {841#false} is VALID [2022-04-28 10:33:50,113 INFO L290 TraceCheckUtils]: 16: Hoare triple {841#false} assume !(~a~0 < 6); {841#false} is VALID [2022-04-28 10:33:50,113 INFO L290 TraceCheckUtils]: 15: Hoare triple {841#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {841#false} is VALID [2022-04-28 10:33:50,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {841#false} assume !(~b~0 < 6); {841#false} is VALID [2022-04-28 10:33:50,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {841#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {841#false} is VALID [2022-04-28 10:33:50,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {926#(< main_~c~0 6)} assume !(~c~0 < 6); {841#false} is VALID [2022-04-28 10:33:50,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {930#(< main_~c~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {926#(< main_~c~0 6)} is VALID [2022-04-28 10:33:50,115 INFO L290 TraceCheckUtils]: 10: Hoare triple {930#(< main_~c~0 5)} assume !!(~c~0 < 6); {930#(< main_~c~0 5)} is VALID [2022-04-28 10:33:50,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {937#(< main_~c~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {930#(< main_~c~0 5)} is VALID [2022-04-28 10:33:50,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {937#(< main_~c~0 4)} assume !!(~c~0 < 6); {937#(< main_~c~0 4)} is VALID [2022-04-28 10:33:50,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {840#true} assume !!(~b~0 < 6);~c~0 := 0; {937#(< main_~c~0 4)} is VALID [2022-04-28 10:33:50,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {840#true} assume !!(~a~0 < 6);~b~0 := 0; {840#true} is VALID [2022-04-28 10:33:50,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {840#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {840#true} is VALID [2022-04-28 10:33:50,116 INFO L272 TraceCheckUtils]: 4: Hoare triple {840#true} call #t~ret7 := main(); {840#true} is VALID [2022-04-28 10:33:50,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {840#true} {840#true} #56#return; {840#true} is VALID [2022-04-28 10:33:50,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-28 10:33:50,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {840#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(11, 2);call #Ultimate.allocInit(12, 3); {840#true} is VALID [2022-04-28 10:33:50,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {840#true} call ULTIMATE.init(); {840#true} is VALID [2022-04-28 10:33:50,117 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:50,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749343495] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:33:50,117 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:33:50,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-04-28 10:33:50,118 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:50,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1221742184] [2022-04-28 10:33:50,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1221742184] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:50,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:50,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:33:50,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530103043] [2022-04-28 10:33:50,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:50,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 10:33:50,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:50,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:50,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:50,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:33:50,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:50,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:33:50,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-28 10:33:50,133 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:50,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:50,212 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-04-28 10:33:50,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:33:50,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 10:33:50,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:50,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:50,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-04-28 10:33:50,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:50,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-04-28 10:33:50,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 39 transitions. [2022-04-28 10:33:50,246 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 10:33:50,247 INFO L225 Difference]: With dead ends: 46 [2022-04-28 10:33:50,247 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 10:33:50,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:33:50,248 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:50,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 22 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:50,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 10:33:50,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2022-04-28 10:33:50,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:50,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:50,262 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:50,262 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:50,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:50,264 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-28 10:33:50,264 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-28 10:33:50,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:50,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:50,264 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 10:33:50,265 INFO L87 Difference]: Start difference. First operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 10:33:50,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:50,266 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-28 10:33:50,266 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-28 10:33:50,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:50,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:50,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:50,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:50,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:50,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-28 10:33:50,268 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 19 [2022-04-28 10:33:50,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:50,268 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-28 10:33:50,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:50,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions. [2022-04-28 10:33:50,297 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 10:33:50,297 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-28 10:33:50,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 10:33:50,298 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:50,298 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:50,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 10:33:50,503 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,SelfDestructingSolverStorable5 [2022-04-28 10:33:50,503 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:50,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:50,504 INFO L85 PathProgramCache]: Analyzing trace with hash 611633562, now seen corresponding path program 5 times [2022-04-28 10:33:50,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:50,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1767508285] [2022-04-28 10:33:50,624 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:50,625 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:50,625 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:50,643 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:50,643 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:50,643 INFO L85 PathProgramCache]: Analyzing trace with hash 611633562, now seen corresponding path program 6 times [2022-04-28 10:33:50,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:50,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715311078] [2022-04-28 10:33:50,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:50,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:50,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:50,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {1190#(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(11, 2);call #Ultimate.allocInit(12, 3); {1183#true} is VALID [2022-04-28 10:33:50,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {1183#true} assume true; {1183#true} is VALID [2022-04-28 10:33:50,688 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1183#true} {1183#true} #56#return; {1183#true} is VALID [2022-04-28 10:33:50,688 INFO L272 TraceCheckUtils]: 0: Hoare triple {1183#true} call ULTIMATE.init(); {1190#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:50,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {1190#(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(11, 2);call #Ultimate.allocInit(12, 3); {1183#true} is VALID [2022-04-28 10:33:50,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {1183#true} assume true; {1183#true} is VALID [2022-04-28 10:33:50,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1183#true} {1183#true} #56#return; {1183#true} is VALID [2022-04-28 10:33:50,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {1183#true} call #t~ret7 := main(); {1183#true} is VALID [2022-04-28 10:33:50,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {1183#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {1188#(= main_~a~0 0)} is VALID [2022-04-28 10:33:50,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {1188#(= main_~a~0 0)} assume !!(~a~0 < 6);~b~0 := 0; {1188#(= main_~a~0 0)} is VALID [2022-04-28 10:33:50,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {1188#(= main_~a~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {1188#(= main_~a~0 0)} is VALID [2022-04-28 10:33:50,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {1188#(= main_~a~0 0)} assume !!(~c~0 < 6); {1188#(= main_~a~0 0)} is VALID [2022-04-28 10:33:50,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {1188#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1188#(= main_~a~0 0)} is VALID [2022-04-28 10:33:50,703 INFO L290 TraceCheckUtils]: 10: Hoare triple {1188#(= main_~a~0 0)} assume !!(~c~0 < 6); {1188#(= main_~a~0 0)} is VALID [2022-04-28 10:33:50,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {1188#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1188#(= main_~a~0 0)} is VALID [2022-04-28 10:33:50,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {1188#(= main_~a~0 0)} assume !(~c~0 < 6); {1188#(= main_~a~0 0)} is VALID [2022-04-28 10:33:50,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {1188#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1188#(= main_~a~0 0)} is VALID [2022-04-28 10:33:50,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {1188#(= main_~a~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {1188#(= main_~a~0 0)} is VALID [2022-04-28 10:33:50,705 INFO L290 TraceCheckUtils]: 15: Hoare triple {1188#(= main_~a~0 0)} assume !!(~c~0 < 6); {1188#(= main_~a~0 0)} is VALID [2022-04-28 10:33:50,705 INFO L290 TraceCheckUtils]: 16: Hoare triple {1188#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1188#(= main_~a~0 0)} is VALID [2022-04-28 10:33:50,705 INFO L290 TraceCheckUtils]: 17: Hoare triple {1188#(= main_~a~0 0)} assume !!(~c~0 < 6); {1188#(= main_~a~0 0)} is VALID [2022-04-28 10:33:50,706 INFO L290 TraceCheckUtils]: 18: Hoare triple {1188#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1188#(= main_~a~0 0)} is VALID [2022-04-28 10:33:50,706 INFO L290 TraceCheckUtils]: 19: Hoare triple {1188#(= main_~a~0 0)} assume !(~c~0 < 6); {1188#(= main_~a~0 0)} is VALID [2022-04-28 10:33:50,706 INFO L290 TraceCheckUtils]: 20: Hoare triple {1188#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1188#(= main_~a~0 0)} is VALID [2022-04-28 10:33:50,707 INFO L290 TraceCheckUtils]: 21: Hoare triple {1188#(= main_~a~0 0)} assume !(~b~0 < 6); {1188#(= main_~a~0 0)} is VALID [2022-04-28 10:33:50,707 INFO L290 TraceCheckUtils]: 22: Hoare triple {1188#(= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1189#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:50,708 INFO L290 TraceCheckUtils]: 23: Hoare triple {1189#(<= main_~a~0 1)} assume !(~a~0 < 6); {1184#false} is VALID [2022-04-28 10:33:50,708 INFO L290 TraceCheckUtils]: 24: Hoare triple {1184#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {1184#false} is VALID [2022-04-28 10:33:50,708 INFO L290 TraceCheckUtils]: 25: Hoare triple {1184#false} assume !false; {1184#false} is VALID [2022-04-28 10:33:50,708 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-28 10:33:50,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:50,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715311078] [2022-04-28 10:33:50,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715311078] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:33:50,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454870846] [2022-04-28 10:33:50,709 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:33:50,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:50,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:50,710 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 10:33:50,740 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 10:33:50,756 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:33:50,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:50,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-28 10:33:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:50,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:50,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {1183#true} call ULTIMATE.init(); {1183#true} is VALID [2022-04-28 10:33:50,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {1183#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(11, 2);call #Ultimate.allocInit(12, 3); {1183#true} is VALID [2022-04-28 10:33:50,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {1183#true} assume true; {1183#true} is VALID [2022-04-28 10:33:50,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1183#true} {1183#true} #56#return; {1183#true} is VALID [2022-04-28 10:33:50,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {1183#true} call #t~ret7 := main(); {1183#true} is VALID [2022-04-28 10:33:50,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {1183#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {1209#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:50,866 INFO L290 TraceCheckUtils]: 6: Hoare triple {1209#(<= main_~a~0 0)} assume !!(~a~0 < 6);~b~0 := 0; {1209#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:50,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {1209#(<= main_~a~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {1209#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:50,867 INFO L290 TraceCheckUtils]: 8: Hoare triple {1209#(<= main_~a~0 0)} assume !!(~c~0 < 6); {1209#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:50,867 INFO L290 TraceCheckUtils]: 9: Hoare triple {1209#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1209#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:50,867 INFO L290 TraceCheckUtils]: 10: Hoare triple {1209#(<= main_~a~0 0)} assume !!(~c~0 < 6); {1209#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:50,868 INFO L290 TraceCheckUtils]: 11: Hoare triple {1209#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1209#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:50,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {1209#(<= main_~a~0 0)} assume !(~c~0 < 6); {1209#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:50,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {1209#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1209#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:50,869 INFO L290 TraceCheckUtils]: 14: Hoare triple {1209#(<= main_~a~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {1209#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:50,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {1209#(<= main_~a~0 0)} assume !!(~c~0 < 6); {1209#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:50,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {1209#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1209#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:50,870 INFO L290 TraceCheckUtils]: 17: Hoare triple {1209#(<= main_~a~0 0)} assume !!(~c~0 < 6); {1209#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:50,870 INFO L290 TraceCheckUtils]: 18: Hoare triple {1209#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1209#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:50,870 INFO L290 TraceCheckUtils]: 19: Hoare triple {1209#(<= main_~a~0 0)} assume !(~c~0 < 6); {1209#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:50,870 INFO L290 TraceCheckUtils]: 20: Hoare triple {1209#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1209#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:50,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {1209#(<= main_~a~0 0)} assume !(~b~0 < 6); {1209#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:50,871 INFO L290 TraceCheckUtils]: 22: Hoare triple {1209#(<= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1189#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:50,872 INFO L290 TraceCheckUtils]: 23: Hoare triple {1189#(<= main_~a~0 1)} assume !(~a~0 < 6); {1184#false} is VALID [2022-04-28 10:33:50,872 INFO L290 TraceCheckUtils]: 24: Hoare triple {1184#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {1184#false} is VALID [2022-04-28 10:33:50,872 INFO L290 TraceCheckUtils]: 25: Hoare triple {1184#false} assume !false; {1184#false} is VALID [2022-04-28 10:33:50,872 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-28 10:33:50,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:33:50,989 INFO L290 TraceCheckUtils]: 25: Hoare triple {1184#false} assume !false; {1184#false} is VALID [2022-04-28 10:33:50,989 INFO L290 TraceCheckUtils]: 24: Hoare triple {1184#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {1184#false} is VALID [2022-04-28 10:33:50,989 INFO L290 TraceCheckUtils]: 23: Hoare triple {1276#(< main_~a~0 6)} assume !(~a~0 < 6); {1184#false} is VALID [2022-04-28 10:33:50,990 INFO L290 TraceCheckUtils]: 22: Hoare triple {1280#(< main_~a~0 5)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1276#(< main_~a~0 6)} is VALID [2022-04-28 10:33:50,990 INFO L290 TraceCheckUtils]: 21: Hoare triple {1280#(< main_~a~0 5)} assume !(~b~0 < 6); {1280#(< main_~a~0 5)} is VALID [2022-04-28 10:33:50,991 INFO L290 TraceCheckUtils]: 20: Hoare triple {1280#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1280#(< main_~a~0 5)} is VALID [2022-04-28 10:33:50,991 INFO L290 TraceCheckUtils]: 19: Hoare triple {1280#(< main_~a~0 5)} assume !(~c~0 < 6); {1280#(< main_~a~0 5)} is VALID [2022-04-28 10:33:50,991 INFO L290 TraceCheckUtils]: 18: Hoare triple {1280#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1280#(< main_~a~0 5)} is VALID [2022-04-28 10:33:50,992 INFO L290 TraceCheckUtils]: 17: Hoare triple {1280#(< main_~a~0 5)} assume !!(~c~0 < 6); {1280#(< main_~a~0 5)} is VALID [2022-04-28 10:33:50,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {1280#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1280#(< main_~a~0 5)} is VALID [2022-04-28 10:33:50,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {1280#(< main_~a~0 5)} assume !!(~c~0 < 6); {1280#(< main_~a~0 5)} is VALID [2022-04-28 10:33:50,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {1280#(< main_~a~0 5)} assume !!(~b~0 < 6);~c~0 := 0; {1280#(< main_~a~0 5)} is VALID [2022-04-28 10:33:50,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {1280#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1280#(< main_~a~0 5)} is VALID [2022-04-28 10:33:50,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {1280#(< main_~a~0 5)} assume !(~c~0 < 6); {1280#(< main_~a~0 5)} is VALID [2022-04-28 10:33:50,994 INFO L290 TraceCheckUtils]: 11: Hoare triple {1280#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1280#(< main_~a~0 5)} is VALID [2022-04-28 10:33:50,994 INFO L290 TraceCheckUtils]: 10: Hoare triple {1280#(< main_~a~0 5)} assume !!(~c~0 < 6); {1280#(< main_~a~0 5)} is VALID [2022-04-28 10:33:50,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {1280#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1280#(< main_~a~0 5)} is VALID [2022-04-28 10:33:50,995 INFO L290 TraceCheckUtils]: 8: Hoare triple {1280#(< main_~a~0 5)} assume !!(~c~0 < 6); {1280#(< main_~a~0 5)} is VALID [2022-04-28 10:33:50,995 INFO L290 TraceCheckUtils]: 7: Hoare triple {1280#(< main_~a~0 5)} assume !!(~b~0 < 6);~c~0 := 0; {1280#(< main_~a~0 5)} is VALID [2022-04-28 10:33:50,995 INFO L290 TraceCheckUtils]: 6: Hoare triple {1280#(< main_~a~0 5)} assume !!(~a~0 < 6);~b~0 := 0; {1280#(< main_~a~0 5)} is VALID [2022-04-28 10:33:50,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {1183#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {1280#(< main_~a~0 5)} is VALID [2022-04-28 10:33:50,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {1183#true} call #t~ret7 := main(); {1183#true} is VALID [2022-04-28 10:33:50,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1183#true} {1183#true} #56#return; {1183#true} is VALID [2022-04-28 10:33:50,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {1183#true} assume true; {1183#true} is VALID [2022-04-28 10:33:50,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {1183#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(11, 2);call #Ultimate.allocInit(12, 3); {1183#true} is VALID [2022-04-28 10:33:50,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {1183#true} call ULTIMATE.init(); {1183#true} is VALID [2022-04-28 10:33:50,997 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-28 10:33:50,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454870846] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:33:50,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:33:50,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-28 10:33:50,998 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:50,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1767508285] [2022-04-28 10:33:50,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1767508285] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:50,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:50,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:33:50,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685112411] [2022-04-28 10:33:50,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:50,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 10:33:50,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:50,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:51,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:51,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:33:51,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:51,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:33:51,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-28 10:33:51,013 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:51,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:51,125 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2022-04-28 10:33:51,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:33:51,126 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 10:33:51,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:51,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:51,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-28 10:33:51,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:51,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-28 10:33:51,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-28 10:33:51,158 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 10:33:51,160 INFO L225 Difference]: With dead ends: 63 [2022-04-28 10:33:51,160 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 10:33:51,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:33:51,162 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 40 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:51,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 22 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:51,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 10:33:51,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 44. [2022-04-28 10:33:51,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:51,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 44 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:51,192 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 44 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:51,192 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 44 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:51,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:51,194 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2022-04-28 10:33:51,195 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2022-04-28 10:33:51,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:51,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:51,198 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-28 10:33:51,198 INFO L87 Difference]: Start difference. First operand has 44 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-28 10:33:51,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:51,202 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2022-04-28 10:33:51,202 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2022-04-28 10:33:51,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:51,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:51,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:51,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:51,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:51,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-04-28 10:33:51,206 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 26 [2022-04-28 10:33:51,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:51,206 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-04-28 10:33:51,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:51,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 50 transitions. [2022-04-28 10:33:51,254 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 10:33:51,254 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-04-28 10:33:51,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 10:33:51,255 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:51,255 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:51,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 10:33:51,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:51,480 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:51,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:51,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1035792127, now seen corresponding path program 7 times [2022-04-28 10:33:51,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:51,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [36472966] [2022-04-28 10:33:51,714 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:51,737 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:51,737 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:51,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1035792127, now seen corresponding path program 8 times [2022-04-28 10:33:51,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:51,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940445348] [2022-04-28 10:33:51,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:51,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:51,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:51,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {1695#(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(11, 2);call #Ultimate.allocInit(12, 3); {1687#true} is VALID [2022-04-28 10:33:51,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {1687#true} assume true; {1687#true} is VALID [2022-04-28 10:33:51,801 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1687#true} {1687#true} #56#return; {1687#true} is VALID [2022-04-28 10:33:51,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {1687#true} call ULTIMATE.init(); {1695#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:51,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {1695#(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(11, 2);call #Ultimate.allocInit(12, 3); {1687#true} is VALID [2022-04-28 10:33:51,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {1687#true} assume true; {1687#true} is VALID [2022-04-28 10:33:51,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1687#true} {1687#true} #56#return; {1687#true} is VALID [2022-04-28 10:33:51,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {1687#true} call #t~ret7 := main(); {1687#true} is VALID [2022-04-28 10:33:51,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {1687#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {1687#true} is VALID [2022-04-28 10:33:51,803 INFO L290 TraceCheckUtils]: 6: Hoare triple {1687#true} assume !!(~a~0 < 6);~b~0 := 0; {1687#true} is VALID [2022-04-28 10:33:51,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {1687#true} assume !!(~b~0 < 6);~c~0 := 0; {1692#(= main_~c~0 0)} is VALID [2022-04-28 10:33:51,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {1692#(= main_~c~0 0)} assume !!(~c~0 < 6); {1692#(= main_~c~0 0)} is VALID [2022-04-28 10:33:51,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {1692#(= main_~c~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1693#(<= main_~c~0 1)} is VALID [2022-04-28 10:33:51,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {1693#(<= main_~c~0 1)} assume !!(~c~0 < 6); {1693#(<= main_~c~0 1)} is VALID [2022-04-28 10:33:51,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {1693#(<= main_~c~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1694#(<= main_~c~0 2)} is VALID [2022-04-28 10:33:51,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {1694#(<= main_~c~0 2)} assume !(~c~0 < 6); {1688#false} is VALID [2022-04-28 10:33:51,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {1688#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1688#false} is VALID [2022-04-28 10:33:51,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {1688#false} assume !!(~b~0 < 6);~c~0 := 0; {1688#false} is VALID [2022-04-28 10:33:51,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-28 10:33:51,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {1688#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1688#false} is VALID [2022-04-28 10:33:51,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-28 10:33:51,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {1688#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1688#false} is VALID [2022-04-28 10:33:51,806 INFO L290 TraceCheckUtils]: 19: Hoare triple {1688#false} assume !(~c~0 < 6); {1688#false} is VALID [2022-04-28 10:33:51,806 INFO L290 TraceCheckUtils]: 20: Hoare triple {1688#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1688#false} is VALID [2022-04-28 10:33:51,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {1688#false} assume !(~b~0 < 6); {1688#false} is VALID [2022-04-28 10:33:51,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {1688#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1688#false} is VALID [2022-04-28 10:33:51,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {1688#false} assume !!(~a~0 < 6);~b~0 := 0; {1688#false} is VALID [2022-04-28 10:33:51,806 INFO L290 TraceCheckUtils]: 24: Hoare triple {1688#false} assume !!(~b~0 < 6);~c~0 := 0; {1688#false} is VALID [2022-04-28 10:33:51,806 INFO L290 TraceCheckUtils]: 25: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-28 10:33:51,807 INFO L290 TraceCheckUtils]: 26: Hoare triple {1688#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1688#false} is VALID [2022-04-28 10:33:51,807 INFO L290 TraceCheckUtils]: 27: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-28 10:33:51,807 INFO L290 TraceCheckUtils]: 28: Hoare triple {1688#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1688#false} is VALID [2022-04-28 10:33:51,807 INFO L290 TraceCheckUtils]: 29: Hoare triple {1688#false} assume !(~c~0 < 6); {1688#false} is VALID [2022-04-28 10:33:51,807 INFO L290 TraceCheckUtils]: 30: Hoare triple {1688#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1688#false} is VALID [2022-04-28 10:33:51,807 INFO L290 TraceCheckUtils]: 31: Hoare triple {1688#false} assume !!(~b~0 < 6);~c~0 := 0; {1688#false} is VALID [2022-04-28 10:33:51,807 INFO L290 TraceCheckUtils]: 32: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-28 10:33:51,807 INFO L290 TraceCheckUtils]: 33: Hoare triple {1688#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1688#false} is VALID [2022-04-28 10:33:51,807 INFO L290 TraceCheckUtils]: 34: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-28 10:33:51,807 INFO L290 TraceCheckUtils]: 35: Hoare triple {1688#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1688#false} is VALID [2022-04-28 10:33:51,808 INFO L290 TraceCheckUtils]: 36: Hoare triple {1688#false} assume !(~c~0 < 6); {1688#false} is VALID [2022-04-28 10:33:51,808 INFO L290 TraceCheckUtils]: 37: Hoare triple {1688#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1688#false} is VALID [2022-04-28 10:33:51,808 INFO L290 TraceCheckUtils]: 38: Hoare triple {1688#false} assume !(~b~0 < 6); {1688#false} is VALID [2022-04-28 10:33:51,808 INFO L290 TraceCheckUtils]: 39: Hoare triple {1688#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1688#false} is VALID [2022-04-28 10:33:51,808 INFO L290 TraceCheckUtils]: 40: Hoare triple {1688#false} assume !(~a~0 < 6); {1688#false} is VALID [2022-04-28 10:33:51,808 INFO L290 TraceCheckUtils]: 41: Hoare triple {1688#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {1688#false} is VALID [2022-04-28 10:33:51,808 INFO L290 TraceCheckUtils]: 42: Hoare triple {1688#false} assume !false; {1688#false} is VALID [2022-04-28 10:33:51,808 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 46 proven. 4 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-28 10:33:51,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:51,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940445348] [2022-04-28 10:33:51,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940445348] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:33:51,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021198293] [2022-04-28 10:33:51,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:33:51,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:51,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:51,810 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 10:33:51,855 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 10:33:51,872 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:33:51,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:51,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 10:33:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:51,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:51,987 INFO L272 TraceCheckUtils]: 0: Hoare triple {1687#true} call ULTIMATE.init(); {1687#true} is VALID [2022-04-28 10:33:51,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {1687#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(11, 2);call #Ultimate.allocInit(12, 3); {1687#true} is VALID [2022-04-28 10:33:51,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {1687#true} assume true; {1687#true} is VALID [2022-04-28 10:33:51,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1687#true} {1687#true} #56#return; {1687#true} is VALID [2022-04-28 10:33:51,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {1687#true} call #t~ret7 := main(); {1687#true} is VALID [2022-04-28 10:33:51,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {1687#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {1687#true} is VALID [2022-04-28 10:33:51,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {1687#true} assume !!(~a~0 < 6);~b~0 := 0; {1687#true} is VALID [2022-04-28 10:33:51,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {1687#true} assume !!(~b~0 < 6);~c~0 := 0; {1720#(<= main_~c~0 0)} is VALID [2022-04-28 10:33:51,989 INFO L290 TraceCheckUtils]: 8: Hoare triple {1720#(<= main_~c~0 0)} assume !!(~c~0 < 6); {1720#(<= main_~c~0 0)} is VALID [2022-04-28 10:33:51,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {1720#(<= main_~c~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1693#(<= main_~c~0 1)} is VALID [2022-04-28 10:33:51,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {1693#(<= main_~c~0 1)} assume !!(~c~0 < 6); {1693#(<= main_~c~0 1)} is VALID [2022-04-28 10:33:51,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {1693#(<= main_~c~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1694#(<= main_~c~0 2)} is VALID [2022-04-28 10:33:51,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {1694#(<= main_~c~0 2)} assume !(~c~0 < 6); {1688#false} is VALID [2022-04-28 10:33:51,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {1688#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1688#false} is VALID [2022-04-28 10:33:51,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {1688#false} assume !!(~b~0 < 6);~c~0 := 0; {1688#false} is VALID [2022-04-28 10:33:51,993 INFO L290 TraceCheckUtils]: 15: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-28 10:33:51,993 INFO L290 TraceCheckUtils]: 16: Hoare triple {1688#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1688#false} is VALID [2022-04-28 10:33:51,993 INFO L290 TraceCheckUtils]: 17: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-28 10:33:51,993 INFO L290 TraceCheckUtils]: 18: Hoare triple {1688#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1688#false} is VALID [2022-04-28 10:33:51,993 INFO L290 TraceCheckUtils]: 19: Hoare triple {1688#false} assume !(~c~0 < 6); {1688#false} is VALID [2022-04-28 10:33:51,993 INFO L290 TraceCheckUtils]: 20: Hoare triple {1688#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1688#false} is VALID [2022-04-28 10:33:51,994 INFO L290 TraceCheckUtils]: 21: Hoare triple {1688#false} assume !(~b~0 < 6); {1688#false} is VALID [2022-04-28 10:33:51,994 INFO L290 TraceCheckUtils]: 22: Hoare triple {1688#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1688#false} is VALID [2022-04-28 10:33:51,994 INFO L290 TraceCheckUtils]: 23: Hoare triple {1688#false} assume !!(~a~0 < 6);~b~0 := 0; {1688#false} is VALID [2022-04-28 10:33:51,994 INFO L290 TraceCheckUtils]: 24: Hoare triple {1688#false} assume !!(~b~0 < 6);~c~0 := 0; {1688#false} is VALID [2022-04-28 10:33:51,994 INFO L290 TraceCheckUtils]: 25: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-28 10:33:51,994 INFO L290 TraceCheckUtils]: 26: Hoare triple {1688#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1688#false} is VALID [2022-04-28 10:33:51,994 INFO L290 TraceCheckUtils]: 27: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-28 10:33:51,994 INFO L290 TraceCheckUtils]: 28: Hoare triple {1688#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1688#false} is VALID [2022-04-28 10:33:51,994 INFO L290 TraceCheckUtils]: 29: Hoare triple {1688#false} assume !(~c~0 < 6); {1688#false} is VALID [2022-04-28 10:33:51,995 INFO L290 TraceCheckUtils]: 30: Hoare triple {1688#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1688#false} is VALID [2022-04-28 10:33:51,995 INFO L290 TraceCheckUtils]: 31: Hoare triple {1688#false} assume !!(~b~0 < 6);~c~0 := 0; {1688#false} is VALID [2022-04-28 10:33:51,995 INFO L290 TraceCheckUtils]: 32: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-28 10:33:51,995 INFO L290 TraceCheckUtils]: 33: Hoare triple {1688#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1688#false} is VALID [2022-04-28 10:33:51,995 INFO L290 TraceCheckUtils]: 34: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-28 10:33:51,995 INFO L290 TraceCheckUtils]: 35: Hoare triple {1688#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1688#false} is VALID [2022-04-28 10:33:51,995 INFO L290 TraceCheckUtils]: 36: Hoare triple {1688#false} assume !(~c~0 < 6); {1688#false} is VALID [2022-04-28 10:33:51,995 INFO L290 TraceCheckUtils]: 37: Hoare triple {1688#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1688#false} is VALID [2022-04-28 10:33:51,995 INFO L290 TraceCheckUtils]: 38: Hoare triple {1688#false} assume !(~b~0 < 6); {1688#false} is VALID [2022-04-28 10:33:51,996 INFO L290 TraceCheckUtils]: 39: Hoare triple {1688#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1688#false} is VALID [2022-04-28 10:33:51,996 INFO L290 TraceCheckUtils]: 40: Hoare triple {1688#false} assume !(~a~0 < 6); {1688#false} is VALID [2022-04-28 10:33:51,996 INFO L290 TraceCheckUtils]: 41: Hoare triple {1688#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {1688#false} is VALID [2022-04-28 10:33:51,996 INFO L290 TraceCheckUtils]: 42: Hoare triple {1688#false} assume !false; {1688#false} is VALID [2022-04-28 10:33:51,996 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 46 proven. 4 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-28 10:33:51,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:33:52,139 INFO L290 TraceCheckUtils]: 42: Hoare triple {1688#false} assume !false; {1688#false} is VALID [2022-04-28 10:33:52,140 INFO L290 TraceCheckUtils]: 41: Hoare triple {1688#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {1688#false} is VALID [2022-04-28 10:33:52,140 INFO L290 TraceCheckUtils]: 40: Hoare triple {1688#false} assume !(~a~0 < 6); {1688#false} is VALID [2022-04-28 10:33:52,140 INFO L290 TraceCheckUtils]: 39: Hoare triple {1688#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1688#false} is VALID [2022-04-28 10:33:52,140 INFO L290 TraceCheckUtils]: 38: Hoare triple {1688#false} assume !(~b~0 < 6); {1688#false} is VALID [2022-04-28 10:33:52,140 INFO L290 TraceCheckUtils]: 37: Hoare triple {1688#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1688#false} is VALID [2022-04-28 10:33:52,140 INFO L290 TraceCheckUtils]: 36: Hoare triple {1688#false} assume !(~c~0 < 6); {1688#false} is VALID [2022-04-28 10:33:52,140 INFO L290 TraceCheckUtils]: 35: Hoare triple {1688#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1688#false} is VALID [2022-04-28 10:33:52,140 INFO L290 TraceCheckUtils]: 34: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-28 10:33:52,141 INFO L290 TraceCheckUtils]: 33: Hoare triple {1688#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1688#false} is VALID [2022-04-28 10:33:52,141 INFO L290 TraceCheckUtils]: 32: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-28 10:33:52,141 INFO L290 TraceCheckUtils]: 31: Hoare triple {1688#false} assume !!(~b~0 < 6);~c~0 := 0; {1688#false} is VALID [2022-04-28 10:33:52,141 INFO L290 TraceCheckUtils]: 30: Hoare triple {1688#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1688#false} is VALID [2022-04-28 10:33:52,141 INFO L290 TraceCheckUtils]: 29: Hoare triple {1688#false} assume !(~c~0 < 6); {1688#false} is VALID [2022-04-28 10:33:52,141 INFO L290 TraceCheckUtils]: 28: Hoare triple {1688#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1688#false} is VALID [2022-04-28 10:33:52,141 INFO L290 TraceCheckUtils]: 27: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-28 10:33:52,141 INFO L290 TraceCheckUtils]: 26: Hoare triple {1688#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1688#false} is VALID [2022-04-28 10:33:52,141 INFO L290 TraceCheckUtils]: 25: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-28 10:33:52,141 INFO L290 TraceCheckUtils]: 24: Hoare triple {1688#false} assume !!(~b~0 < 6);~c~0 := 0; {1688#false} is VALID [2022-04-28 10:33:52,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {1688#false} assume !!(~a~0 < 6);~b~0 := 0; {1688#false} is VALID [2022-04-28 10:33:52,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {1688#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1688#false} is VALID [2022-04-28 10:33:52,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {1688#false} assume !(~b~0 < 6); {1688#false} is VALID [2022-04-28 10:33:52,142 INFO L290 TraceCheckUtils]: 20: Hoare triple {1688#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1688#false} is VALID [2022-04-28 10:33:52,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {1688#false} assume !(~c~0 < 6); {1688#false} is VALID [2022-04-28 10:33:52,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {1688#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1688#false} is VALID [2022-04-28 10:33:52,142 INFO L290 TraceCheckUtils]: 17: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-28 10:33:52,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {1688#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1688#false} is VALID [2022-04-28 10:33:52,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {1688#false} assume !!(~c~0 < 6); {1688#false} is VALID [2022-04-28 10:33:52,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {1688#false} assume !!(~b~0 < 6);~c~0 := 0; {1688#false} is VALID [2022-04-28 10:33:52,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {1688#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1688#false} is VALID [2022-04-28 10:33:52,143 INFO L290 TraceCheckUtils]: 12: Hoare triple {1916#(< main_~c~0 6)} assume !(~c~0 < 6); {1688#false} is VALID [2022-04-28 10:33:52,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {1920#(< main_~c~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1916#(< main_~c~0 6)} is VALID [2022-04-28 10:33:52,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {1920#(< main_~c~0 5)} assume !!(~c~0 < 6); {1920#(< main_~c~0 5)} is VALID [2022-04-28 10:33:52,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {1927#(< main_~c~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1920#(< main_~c~0 5)} is VALID [2022-04-28 10:33:52,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {1927#(< main_~c~0 4)} assume !!(~c~0 < 6); {1927#(< main_~c~0 4)} is VALID [2022-04-28 10:33:52,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {1687#true} assume !!(~b~0 < 6);~c~0 := 0; {1927#(< main_~c~0 4)} is VALID [2022-04-28 10:33:52,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {1687#true} assume !!(~a~0 < 6);~b~0 := 0; {1687#true} is VALID [2022-04-28 10:33:52,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {1687#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {1687#true} is VALID [2022-04-28 10:33:52,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {1687#true} call #t~ret7 := main(); {1687#true} is VALID [2022-04-28 10:33:52,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1687#true} {1687#true} #56#return; {1687#true} is VALID [2022-04-28 10:33:52,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {1687#true} assume true; {1687#true} is VALID [2022-04-28 10:33:52,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {1687#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(11, 2);call #Ultimate.allocInit(12, 3); {1687#true} is VALID [2022-04-28 10:33:52,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {1687#true} call ULTIMATE.init(); {1687#true} is VALID [2022-04-28 10:33:52,148 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 46 proven. 4 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-28 10:33:52,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021198293] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:33:52,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:33:52,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-28 10:33:52,149 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:52,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [36472966] [2022-04-28 10:33:52,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [36472966] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:52,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:52,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:33:52,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290123826] [2022-04-28 10:33:52,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:52,150 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 10:33:52,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:52,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:52,167 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 10:33:52,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:33:52,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:52,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:33:52,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:33:52,168 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:52,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:52,331 INFO L93 Difference]: Finished difference Result 87 states and 102 transitions. [2022-04-28 10:33:52,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:33:52,331 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 10:33:52,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:52,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:52,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-28 10:33:52,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:52,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-28 10:33:52,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2022-04-28 10:33:52,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:52,368 INFO L225 Difference]: With dead ends: 87 [2022-04-28 10:33:52,368 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 10:33:52,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:33:52,369 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:52,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 32 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:52,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 10:33:52,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2022-04-28 10:33:52,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:52,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 52 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:52,409 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 52 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:52,410 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 52 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:52,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:52,412 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-04-28 10:33:52,412 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-04-28 10:33:52,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:52,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:52,412 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-28 10:33:52,412 INFO L87 Difference]: Start difference. First operand has 52 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-28 10:33:52,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:52,414 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-04-28 10:33:52,414 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-04-28 10:33:52,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:52,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:52,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:52,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:52,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:52,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2022-04-28 10:33:52,422 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 43 [2022-04-28 10:33:52,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:52,422 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2022-04-28 10:33:52,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:52,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 58 transitions. [2022-04-28 10:33:52,494 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 10:33:52,494 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2022-04-28 10:33:52,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 10:33:52,497 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:52,497 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:52,524 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 10:33:52,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:52,719 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:52,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:52,720 INFO L85 PathProgramCache]: Analyzing trace with hash 735564927, now seen corresponding path program 9 times [2022-04-28 10:33:52,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:52,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [783217373] [2022-04-28 10:33:52,936 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:52,965 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:52,965 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:52,965 INFO L85 PathProgramCache]: Analyzing trace with hash 735564927, now seen corresponding path program 10 times [2022-04-28 10:33:52,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:52,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243917905] [2022-04-28 10:33:52,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:52,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:53,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:53,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {2362#(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(11, 2);call #Ultimate.allocInit(12, 3); {2353#true} is VALID [2022-04-28 10:33:53,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {2353#true} assume true; {2353#true} is VALID [2022-04-28 10:33:53,041 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2353#true} {2353#true} #56#return; {2353#true} is VALID [2022-04-28 10:33:53,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {2353#true} call ULTIMATE.init(); {2362#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:53,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {2362#(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(11, 2);call #Ultimate.allocInit(12, 3); {2353#true} is VALID [2022-04-28 10:33:53,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {2353#true} assume true; {2353#true} is VALID [2022-04-28 10:33:53,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2353#true} {2353#true} #56#return; {2353#true} is VALID [2022-04-28 10:33:53,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {2353#true} call #t~ret7 := main(); {2353#true} is VALID [2022-04-28 10:33:53,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {2353#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {2353#true} is VALID [2022-04-28 10:33:53,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {2353#true} assume !!(~a~0 < 6);~b~0 := 0; {2353#true} is VALID [2022-04-28 10:33:53,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {2353#true} assume !!(~b~0 < 6);~c~0 := 0; {2358#(= main_~c~0 0)} is VALID [2022-04-28 10:33:53,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {2358#(= main_~c~0 0)} assume !!(~c~0 < 6); {2358#(= main_~c~0 0)} is VALID [2022-04-28 10:33:53,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {2358#(= main_~c~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2359#(<= main_~c~0 1)} is VALID [2022-04-28 10:33:53,043 INFO L290 TraceCheckUtils]: 10: Hoare triple {2359#(<= main_~c~0 1)} assume !!(~c~0 < 6); {2359#(<= main_~c~0 1)} is VALID [2022-04-28 10:33:53,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {2359#(<= main_~c~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2360#(<= main_~c~0 2)} is VALID [2022-04-28 10:33:53,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {2360#(<= main_~c~0 2)} assume !!(~c~0 < 6); {2360#(<= main_~c~0 2)} is VALID [2022-04-28 10:33:53,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {2360#(<= main_~c~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2361#(<= main_~c~0 3)} is VALID [2022-04-28 10:33:53,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {2361#(<= main_~c~0 3)} assume !(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {2354#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2354#false} is VALID [2022-04-28 10:33:53,045 INFO L290 TraceCheckUtils]: 16: Hoare triple {2354#false} assume !!(~b~0 < 6);~c~0 := 0; {2354#false} is VALID [2022-04-28 10:33:53,045 INFO L290 TraceCheckUtils]: 17: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,045 INFO L290 TraceCheckUtils]: 18: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-28 10:33:53,045 INFO L290 TraceCheckUtils]: 19: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,046 INFO L290 TraceCheckUtils]: 20: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-28 10:33:53,046 INFO L290 TraceCheckUtils]: 21: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,046 INFO L290 TraceCheckUtils]: 22: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-28 10:33:53,046 INFO L290 TraceCheckUtils]: 23: Hoare triple {2354#false} assume !(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,046 INFO L290 TraceCheckUtils]: 24: Hoare triple {2354#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2354#false} is VALID [2022-04-28 10:33:53,046 INFO L290 TraceCheckUtils]: 25: Hoare triple {2354#false} assume !(~b~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,046 INFO L290 TraceCheckUtils]: 26: Hoare triple {2354#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {2354#false} is VALID [2022-04-28 10:33:53,046 INFO L290 TraceCheckUtils]: 27: Hoare triple {2354#false} assume !!(~a~0 < 6);~b~0 := 0; {2354#false} is VALID [2022-04-28 10:33:53,046 INFO L290 TraceCheckUtils]: 28: Hoare triple {2354#false} assume !!(~b~0 < 6);~c~0 := 0; {2354#false} is VALID [2022-04-28 10:33:53,047 INFO L290 TraceCheckUtils]: 29: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,047 INFO L290 TraceCheckUtils]: 30: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-28 10:33:53,047 INFO L290 TraceCheckUtils]: 31: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,047 INFO L290 TraceCheckUtils]: 32: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-28 10:33:53,047 INFO L290 TraceCheckUtils]: 33: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,047 INFO L290 TraceCheckUtils]: 34: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-28 10:33:53,047 INFO L290 TraceCheckUtils]: 35: Hoare triple {2354#false} assume !(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,047 INFO L290 TraceCheckUtils]: 36: Hoare triple {2354#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2354#false} is VALID [2022-04-28 10:33:53,047 INFO L290 TraceCheckUtils]: 37: Hoare triple {2354#false} assume !!(~b~0 < 6);~c~0 := 0; {2354#false} is VALID [2022-04-28 10:33:53,047 INFO L290 TraceCheckUtils]: 38: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,047 INFO L290 TraceCheckUtils]: 39: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-28 10:33:53,048 INFO L290 TraceCheckUtils]: 40: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,048 INFO L290 TraceCheckUtils]: 41: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-28 10:33:53,048 INFO L290 TraceCheckUtils]: 42: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,048 INFO L290 TraceCheckUtils]: 43: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-28 10:33:53,048 INFO L290 TraceCheckUtils]: 44: Hoare triple {2354#false} assume !(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,048 INFO L290 TraceCheckUtils]: 45: Hoare triple {2354#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2354#false} is VALID [2022-04-28 10:33:53,048 INFO L290 TraceCheckUtils]: 46: Hoare triple {2354#false} assume !(~b~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,048 INFO L290 TraceCheckUtils]: 47: Hoare triple {2354#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {2354#false} is VALID [2022-04-28 10:33:53,048 INFO L290 TraceCheckUtils]: 48: Hoare triple {2354#false} assume !(~a~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,048 INFO L290 TraceCheckUtils]: 49: Hoare triple {2354#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {2354#false} is VALID [2022-04-28 10:33:53,048 INFO L290 TraceCheckUtils]: 50: Hoare triple {2354#false} assume !false; {2354#false} is VALID [2022-04-28 10:33:53,049 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 82 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-28 10:33:53,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:53,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243917905] [2022-04-28 10:33:53,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243917905] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:33:53,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521498780] [2022-04-28 10:33:53,049 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:33:53,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:53,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:53,051 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 10:33:53,074 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 10:33:53,097 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:33:53,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:53,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 10:33:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:53,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:53,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {2353#true} call ULTIMATE.init(); {2353#true} is VALID [2022-04-28 10:33:53,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {2353#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(11, 2);call #Ultimate.allocInit(12, 3); {2353#true} is VALID [2022-04-28 10:33:53,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {2353#true} assume true; {2353#true} is VALID [2022-04-28 10:33:53,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2353#true} {2353#true} #56#return; {2353#true} is VALID [2022-04-28 10:33:53,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {2353#true} call #t~ret7 := main(); {2353#true} is VALID [2022-04-28 10:33:53,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {2353#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {2353#true} is VALID [2022-04-28 10:33:53,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {2353#true} assume !!(~a~0 < 6);~b~0 := 0; {2353#true} is VALID [2022-04-28 10:33:53,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {2353#true} assume !!(~b~0 < 6);~c~0 := 0; {2387#(<= main_~c~0 0)} is VALID [2022-04-28 10:33:53,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {2387#(<= main_~c~0 0)} assume !!(~c~0 < 6); {2387#(<= main_~c~0 0)} is VALID [2022-04-28 10:33:53,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {2387#(<= main_~c~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2359#(<= main_~c~0 1)} is VALID [2022-04-28 10:33:53,251 INFO L290 TraceCheckUtils]: 10: Hoare triple {2359#(<= main_~c~0 1)} assume !!(~c~0 < 6); {2359#(<= main_~c~0 1)} is VALID [2022-04-28 10:33:53,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {2359#(<= main_~c~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2360#(<= main_~c~0 2)} is VALID [2022-04-28 10:33:53,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {2360#(<= main_~c~0 2)} assume !!(~c~0 < 6); {2360#(<= main_~c~0 2)} is VALID [2022-04-28 10:33:53,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {2360#(<= main_~c~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2361#(<= main_~c~0 3)} is VALID [2022-04-28 10:33:53,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {2361#(<= main_~c~0 3)} assume !(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,253 INFO L290 TraceCheckUtils]: 15: Hoare triple {2354#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2354#false} is VALID [2022-04-28 10:33:53,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {2354#false} assume !!(~b~0 < 6);~c~0 := 0; {2354#false} is VALID [2022-04-28 10:33:53,253 INFO L290 TraceCheckUtils]: 17: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,254 INFO L290 TraceCheckUtils]: 18: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-28 10:33:53,254 INFO L290 TraceCheckUtils]: 19: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,254 INFO L290 TraceCheckUtils]: 20: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-28 10:33:53,254 INFO L290 TraceCheckUtils]: 21: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,254 INFO L290 TraceCheckUtils]: 22: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-28 10:33:53,254 INFO L290 TraceCheckUtils]: 23: Hoare triple {2354#false} assume !(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,254 INFO L290 TraceCheckUtils]: 24: Hoare triple {2354#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2354#false} is VALID [2022-04-28 10:33:53,254 INFO L290 TraceCheckUtils]: 25: Hoare triple {2354#false} assume !(~b~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,254 INFO L290 TraceCheckUtils]: 26: Hoare triple {2354#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {2354#false} is VALID [2022-04-28 10:33:53,254 INFO L290 TraceCheckUtils]: 27: Hoare triple {2354#false} assume !!(~a~0 < 6);~b~0 := 0; {2354#false} is VALID [2022-04-28 10:33:53,255 INFO L290 TraceCheckUtils]: 28: Hoare triple {2354#false} assume !!(~b~0 < 6);~c~0 := 0; {2354#false} is VALID [2022-04-28 10:33:53,255 INFO L290 TraceCheckUtils]: 29: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,255 INFO L290 TraceCheckUtils]: 30: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-28 10:33:53,255 INFO L290 TraceCheckUtils]: 31: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,255 INFO L290 TraceCheckUtils]: 32: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-28 10:33:53,255 INFO L290 TraceCheckUtils]: 33: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,255 INFO L290 TraceCheckUtils]: 34: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-28 10:33:53,255 INFO L290 TraceCheckUtils]: 35: Hoare triple {2354#false} assume !(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,255 INFO L290 TraceCheckUtils]: 36: Hoare triple {2354#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2354#false} is VALID [2022-04-28 10:33:53,255 INFO L290 TraceCheckUtils]: 37: Hoare triple {2354#false} assume !!(~b~0 < 6);~c~0 := 0; {2354#false} is VALID [2022-04-28 10:33:53,255 INFO L290 TraceCheckUtils]: 38: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,256 INFO L290 TraceCheckUtils]: 39: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-28 10:33:53,256 INFO L290 TraceCheckUtils]: 40: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,256 INFO L290 TraceCheckUtils]: 41: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-28 10:33:53,256 INFO L290 TraceCheckUtils]: 42: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,256 INFO L290 TraceCheckUtils]: 43: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-28 10:33:53,256 INFO L290 TraceCheckUtils]: 44: Hoare triple {2354#false} assume !(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,256 INFO L290 TraceCheckUtils]: 45: Hoare triple {2354#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2354#false} is VALID [2022-04-28 10:33:53,256 INFO L290 TraceCheckUtils]: 46: Hoare triple {2354#false} assume !(~b~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,256 INFO L290 TraceCheckUtils]: 47: Hoare triple {2354#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {2354#false} is VALID [2022-04-28 10:33:53,257 INFO L290 TraceCheckUtils]: 48: Hoare triple {2354#false} assume !(~a~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,257 INFO L290 TraceCheckUtils]: 49: Hoare triple {2354#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {2354#false} is VALID [2022-04-28 10:33:53,257 INFO L290 TraceCheckUtils]: 50: Hoare triple {2354#false} assume !false; {2354#false} is VALID [2022-04-28 10:33:53,257 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 82 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-28 10:33:53,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:33:53,431 INFO L290 TraceCheckUtils]: 50: Hoare triple {2354#false} assume !false; {2354#false} is VALID [2022-04-28 10:33:53,431 INFO L290 TraceCheckUtils]: 49: Hoare triple {2354#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {2354#false} is VALID [2022-04-28 10:33:53,431 INFO L290 TraceCheckUtils]: 48: Hoare triple {2354#false} assume !(~a~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,431 INFO L290 TraceCheckUtils]: 47: Hoare triple {2354#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {2354#false} is VALID [2022-04-28 10:33:53,431 INFO L290 TraceCheckUtils]: 46: Hoare triple {2354#false} assume !(~b~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,432 INFO L290 TraceCheckUtils]: 45: Hoare triple {2354#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2354#false} is VALID [2022-04-28 10:33:53,432 INFO L290 TraceCheckUtils]: 44: Hoare triple {2354#false} assume !(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,432 INFO L290 TraceCheckUtils]: 43: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-28 10:33:53,432 INFO L290 TraceCheckUtils]: 42: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,432 INFO L290 TraceCheckUtils]: 41: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-28 10:33:53,432 INFO L290 TraceCheckUtils]: 40: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,432 INFO L290 TraceCheckUtils]: 39: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-28 10:33:53,432 INFO L290 TraceCheckUtils]: 38: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,432 INFO L290 TraceCheckUtils]: 37: Hoare triple {2354#false} assume !!(~b~0 < 6);~c~0 := 0; {2354#false} is VALID [2022-04-28 10:33:53,432 INFO L290 TraceCheckUtils]: 36: Hoare triple {2354#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2354#false} is VALID [2022-04-28 10:33:53,432 INFO L290 TraceCheckUtils]: 35: Hoare triple {2354#false} assume !(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,433 INFO L290 TraceCheckUtils]: 34: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-28 10:33:53,433 INFO L290 TraceCheckUtils]: 33: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,433 INFO L290 TraceCheckUtils]: 32: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-28 10:33:53,433 INFO L290 TraceCheckUtils]: 31: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,433 INFO L290 TraceCheckUtils]: 30: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-28 10:33:53,433 INFO L290 TraceCheckUtils]: 29: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,433 INFO L290 TraceCheckUtils]: 28: Hoare triple {2354#false} assume !!(~b~0 < 6);~c~0 := 0; {2354#false} is VALID [2022-04-28 10:33:53,433 INFO L290 TraceCheckUtils]: 27: Hoare triple {2354#false} assume !!(~a~0 < 6);~b~0 := 0; {2354#false} is VALID [2022-04-28 10:33:53,433 INFO L290 TraceCheckUtils]: 26: Hoare triple {2354#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {2354#false} is VALID [2022-04-28 10:33:53,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {2354#false} assume !(~b~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,434 INFO L290 TraceCheckUtils]: 24: Hoare triple {2354#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2354#false} is VALID [2022-04-28 10:33:53,434 INFO L290 TraceCheckUtils]: 23: Hoare triple {2354#false} assume !(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,434 INFO L290 TraceCheckUtils]: 22: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-28 10:33:53,434 INFO L290 TraceCheckUtils]: 21: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-28 10:33:53,434 INFO L290 TraceCheckUtils]: 19: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {2354#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2354#false} is VALID [2022-04-28 10:33:53,434 INFO L290 TraceCheckUtils]: 17: Hoare triple {2354#false} assume !!(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {2354#false} assume !!(~b~0 < 6);~c~0 := 0; {2354#false} is VALID [2022-04-28 10:33:53,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {2354#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2354#false} is VALID [2022-04-28 10:33:53,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {2625#(< main_~c~0 6)} assume !(~c~0 < 6); {2354#false} is VALID [2022-04-28 10:33:53,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {2629#(< main_~c~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2625#(< main_~c~0 6)} is VALID [2022-04-28 10:33:53,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {2629#(< main_~c~0 5)} assume !!(~c~0 < 6); {2629#(< main_~c~0 5)} is VALID [2022-04-28 10:33:53,438 INFO L290 TraceCheckUtils]: 11: Hoare triple {2361#(<= main_~c~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2629#(< main_~c~0 5)} is VALID [2022-04-28 10:33:53,439 INFO L290 TraceCheckUtils]: 10: Hoare triple {2361#(<= main_~c~0 3)} assume !!(~c~0 < 6); {2361#(<= main_~c~0 3)} is VALID [2022-04-28 10:33:53,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {2360#(<= main_~c~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2361#(<= main_~c~0 3)} is VALID [2022-04-28 10:33:53,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {2360#(<= main_~c~0 2)} assume !!(~c~0 < 6); {2360#(<= main_~c~0 2)} is VALID [2022-04-28 10:33:53,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {2353#true} assume !!(~b~0 < 6);~c~0 := 0; {2360#(<= main_~c~0 2)} is VALID [2022-04-28 10:33:53,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {2353#true} assume !!(~a~0 < 6);~b~0 := 0; {2353#true} is VALID [2022-04-28 10:33:53,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {2353#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {2353#true} is VALID [2022-04-28 10:33:53,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {2353#true} call #t~ret7 := main(); {2353#true} is VALID [2022-04-28 10:33:53,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2353#true} {2353#true} #56#return; {2353#true} is VALID [2022-04-28 10:33:53,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {2353#true} assume true; {2353#true} is VALID [2022-04-28 10:33:53,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {2353#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(11, 2);call #Ultimate.allocInit(12, 3); {2353#true} is VALID [2022-04-28 10:33:53,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {2353#true} call ULTIMATE.init(); {2353#true} is VALID [2022-04-28 10:33:53,441 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 82 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-28 10:33:53,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521498780] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:33:53,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:33:53,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-04-28 10:33:53,441 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:53,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [783217373] [2022-04-28 10:33:53,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [783217373] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:53,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:53,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:33:53,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056935789] [2022-04-28 10:33:53,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:53,442 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 10:33:53,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:53,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:53,459 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 10:33:53,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:33:53,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:53,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:33:53,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:33:53,460 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:53,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:53,629 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2022-04-28 10:33:53,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:33:53,629 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 10:33:53,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:53,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:53,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2022-04-28 10:33:53,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:53,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2022-04-28 10:33:53,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 37 transitions. [2022-04-28 10:33:53,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:53,659 INFO L225 Difference]: With dead ends: 101 [2022-04-28 10:33:53,659 INFO L226 Difference]: Without dead ends: 64 [2022-04-28 10:33:53,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=107, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:33:53,660 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 20 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:53,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 32 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:53,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-28 10:33:53,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2022-04-28 10:33:53,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:53,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 60 states, 56 states have (on average 1.125) internal successors, (63), 56 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:53,712 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 60 states, 56 states have (on average 1.125) internal successors, (63), 56 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:53,712 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 60 states, 56 states have (on average 1.125) internal successors, (63), 56 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:53,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:53,713 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-04-28 10:33:53,714 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-04-28 10:33:53,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:53,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:53,714 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 56 states have (on average 1.125) internal successors, (63), 56 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-28 10:33:53,714 INFO L87 Difference]: Start difference. First operand has 60 states, 56 states have (on average 1.125) internal successors, (63), 56 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-28 10:33:53,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:53,716 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-04-28 10:33:53,716 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-04-28 10:33:53,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:53,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:53,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:53,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:53,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 56 states have (on average 1.125) internal successors, (63), 56 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:53,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2022-04-28 10:33:53,718 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 51 [2022-04-28 10:33:53,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:53,718 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2022-04-28 10:33:53,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:53,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 66 transitions. [2022-04-28 10:33:53,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:53,786 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2022-04-28 10:33:53,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 10:33:53,787 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:53,787 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:53,806 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 10:33:53,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:53,995 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:53,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:53,996 INFO L85 PathProgramCache]: Analyzing trace with hash 954849791, now seen corresponding path program 11 times [2022-04-28 10:33:53,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:53,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1324373383] [2022-04-28 10:33:54,204 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:54,231 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:54,232 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:54,232 INFO L85 PathProgramCache]: Analyzing trace with hash 954849791, now seen corresponding path program 12 times [2022-04-28 10:33:54,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:54,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323162221] [2022-04-28 10:33:54,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:54,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:54,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:54,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {3139#(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(11, 2);call #Ultimate.allocInit(12, 3); {3129#true} is VALID [2022-04-28 10:33:54,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {3129#true} assume true; {3129#true} is VALID [2022-04-28 10:33:54,313 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3129#true} {3129#true} #56#return; {3129#true} is VALID [2022-04-28 10:33:54,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {3129#true} call ULTIMATE.init(); {3139#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:54,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {3139#(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(11, 2);call #Ultimate.allocInit(12, 3); {3129#true} is VALID [2022-04-28 10:33:54,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {3129#true} assume true; {3129#true} is VALID [2022-04-28 10:33:54,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3129#true} {3129#true} #56#return; {3129#true} is VALID [2022-04-28 10:33:54,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {3129#true} call #t~ret7 := main(); {3129#true} is VALID [2022-04-28 10:33:54,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {3129#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {3129#true} is VALID [2022-04-28 10:33:54,314 INFO L290 TraceCheckUtils]: 6: Hoare triple {3129#true} assume !!(~a~0 < 6);~b~0 := 0; {3129#true} is VALID [2022-04-28 10:33:54,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {3129#true} assume !!(~b~0 < 6);~c~0 := 0; {3134#(= main_~c~0 0)} is VALID [2022-04-28 10:33:54,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {3134#(= main_~c~0 0)} assume !!(~c~0 < 6); {3134#(= main_~c~0 0)} is VALID [2022-04-28 10:33:54,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {3134#(= main_~c~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3135#(<= main_~c~0 1)} is VALID [2022-04-28 10:33:54,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {3135#(<= main_~c~0 1)} assume !!(~c~0 < 6); {3135#(<= main_~c~0 1)} is VALID [2022-04-28 10:33:54,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {3135#(<= main_~c~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3136#(<= main_~c~0 2)} is VALID [2022-04-28 10:33:54,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {3136#(<= main_~c~0 2)} assume !!(~c~0 < 6); {3136#(<= main_~c~0 2)} is VALID [2022-04-28 10:33:54,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {3136#(<= main_~c~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3137#(<= main_~c~0 3)} is VALID [2022-04-28 10:33:54,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {3137#(<= main_~c~0 3)} assume !!(~c~0 < 6); {3137#(<= main_~c~0 3)} is VALID [2022-04-28 10:33:54,317 INFO L290 TraceCheckUtils]: 15: Hoare triple {3137#(<= main_~c~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3138#(<= main_~c~0 4)} is VALID [2022-04-28 10:33:54,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {3138#(<= main_~c~0 4)} assume !(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {3130#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3130#false} is VALID [2022-04-28 10:33:54,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {3130#false} assume !!(~b~0 < 6);~c~0 := 0; {3130#false} is VALID [2022-04-28 10:33:54,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,318 INFO L290 TraceCheckUtils]: 20: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-28 10:33:54,318 INFO L290 TraceCheckUtils]: 21: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,318 INFO L290 TraceCheckUtils]: 22: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-28 10:33:54,318 INFO L290 TraceCheckUtils]: 23: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,318 INFO L290 TraceCheckUtils]: 24: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-28 10:33:54,318 INFO L290 TraceCheckUtils]: 25: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,318 INFO L290 TraceCheckUtils]: 26: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-28 10:33:54,318 INFO L290 TraceCheckUtils]: 27: Hoare triple {3130#false} assume !(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,319 INFO L290 TraceCheckUtils]: 28: Hoare triple {3130#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3130#false} is VALID [2022-04-28 10:33:54,319 INFO L290 TraceCheckUtils]: 29: Hoare triple {3130#false} assume !(~b~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,319 INFO L290 TraceCheckUtils]: 30: Hoare triple {3130#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {3130#false} is VALID [2022-04-28 10:33:54,319 INFO L290 TraceCheckUtils]: 31: Hoare triple {3130#false} assume !!(~a~0 < 6);~b~0 := 0; {3130#false} is VALID [2022-04-28 10:33:54,319 INFO L290 TraceCheckUtils]: 32: Hoare triple {3130#false} assume !!(~b~0 < 6);~c~0 := 0; {3130#false} is VALID [2022-04-28 10:33:54,319 INFO L290 TraceCheckUtils]: 33: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,319 INFO L290 TraceCheckUtils]: 34: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-28 10:33:54,319 INFO L290 TraceCheckUtils]: 35: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,319 INFO L290 TraceCheckUtils]: 36: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-28 10:33:54,319 INFO L290 TraceCheckUtils]: 37: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,319 INFO L290 TraceCheckUtils]: 38: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-28 10:33:54,319 INFO L290 TraceCheckUtils]: 39: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,320 INFO L290 TraceCheckUtils]: 40: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-28 10:33:54,320 INFO L290 TraceCheckUtils]: 41: Hoare triple {3130#false} assume !(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,320 INFO L290 TraceCheckUtils]: 42: Hoare triple {3130#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3130#false} is VALID [2022-04-28 10:33:54,320 INFO L290 TraceCheckUtils]: 43: Hoare triple {3130#false} assume !!(~b~0 < 6);~c~0 := 0; {3130#false} is VALID [2022-04-28 10:33:54,320 INFO L290 TraceCheckUtils]: 44: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,320 INFO L290 TraceCheckUtils]: 45: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-28 10:33:54,320 INFO L290 TraceCheckUtils]: 46: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,320 INFO L290 TraceCheckUtils]: 47: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-28 10:33:54,320 INFO L290 TraceCheckUtils]: 48: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,320 INFO L290 TraceCheckUtils]: 49: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-28 10:33:54,320 INFO L290 TraceCheckUtils]: 50: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,320 INFO L290 TraceCheckUtils]: 51: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-28 10:33:54,320 INFO L290 TraceCheckUtils]: 52: Hoare triple {3130#false} assume !(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,321 INFO L290 TraceCheckUtils]: 53: Hoare triple {3130#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3130#false} is VALID [2022-04-28 10:33:54,321 INFO L290 TraceCheckUtils]: 54: Hoare triple {3130#false} assume !(~b~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,321 INFO L290 TraceCheckUtils]: 55: Hoare triple {3130#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {3130#false} is VALID [2022-04-28 10:33:54,321 INFO L290 TraceCheckUtils]: 56: Hoare triple {3130#false} assume !(~a~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,321 INFO L290 TraceCheckUtils]: 57: Hoare triple {3130#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {3130#false} is VALID [2022-04-28 10:33:54,321 INFO L290 TraceCheckUtils]: 58: Hoare triple {3130#false} assume !false; {3130#false} is VALID [2022-04-28 10:33:54,321 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 130 proven. 16 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-04-28 10:33:54,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:54,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323162221] [2022-04-28 10:33:54,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323162221] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:33:54,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744033908] [2022-04-28 10:33:54,322 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:33:54,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:54,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:54,323 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 10:33:54,348 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 10:33:54,395 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 10:33:54,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:54,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 10:33:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:54,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:54,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {3129#true} call ULTIMATE.init(); {3129#true} is VALID [2022-04-28 10:33:54,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {3129#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(11, 2);call #Ultimate.allocInit(12, 3); {3129#true} is VALID [2022-04-28 10:33:54,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {3129#true} assume true; {3129#true} is VALID [2022-04-28 10:33:54,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3129#true} {3129#true} #56#return; {3129#true} is VALID [2022-04-28 10:33:54,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {3129#true} call #t~ret7 := main(); {3129#true} is VALID [2022-04-28 10:33:54,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {3129#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {3129#true} is VALID [2022-04-28 10:33:54,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {3129#true} assume !!(~a~0 < 6);~b~0 := 0; {3129#true} is VALID [2022-04-28 10:33:54,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {3129#true} assume !!(~b~0 < 6);~c~0 := 0; {3129#true} is VALID [2022-04-28 10:33:54,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {3129#true} assume !!(~c~0 < 6); {3129#true} is VALID [2022-04-28 10:33:54,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {3129#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3129#true} is VALID [2022-04-28 10:33:54,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {3129#true} assume !!(~c~0 < 6); {3129#true} is VALID [2022-04-28 10:33:54,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {3129#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3129#true} is VALID [2022-04-28 10:33:54,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {3129#true} assume !!(~c~0 < 6); {3129#true} is VALID [2022-04-28 10:33:54,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {3129#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3129#true} is VALID [2022-04-28 10:33:54,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {3129#true} assume !!(~c~0 < 6); {3129#true} is VALID [2022-04-28 10:33:54,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {3129#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3129#true} is VALID [2022-04-28 10:33:54,561 INFO L290 TraceCheckUtils]: 16: Hoare triple {3129#true} assume !(~c~0 < 6); {3129#true} is VALID [2022-04-28 10:33:54,561 INFO L290 TraceCheckUtils]: 17: Hoare triple {3129#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3129#true} is VALID [2022-04-28 10:33:54,561 INFO L290 TraceCheckUtils]: 18: Hoare triple {3129#true} assume !!(~b~0 < 6);~c~0 := 0; {3197#(<= main_~c~0 0)} is VALID [2022-04-28 10:33:54,561 INFO L290 TraceCheckUtils]: 19: Hoare triple {3197#(<= main_~c~0 0)} assume !!(~c~0 < 6); {3197#(<= main_~c~0 0)} is VALID [2022-04-28 10:33:54,562 INFO L290 TraceCheckUtils]: 20: Hoare triple {3197#(<= main_~c~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3135#(<= main_~c~0 1)} is VALID [2022-04-28 10:33:54,562 INFO L290 TraceCheckUtils]: 21: Hoare triple {3135#(<= main_~c~0 1)} assume !!(~c~0 < 6); {3135#(<= main_~c~0 1)} is VALID [2022-04-28 10:33:54,563 INFO L290 TraceCheckUtils]: 22: Hoare triple {3135#(<= main_~c~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3136#(<= main_~c~0 2)} is VALID [2022-04-28 10:33:54,563 INFO L290 TraceCheckUtils]: 23: Hoare triple {3136#(<= main_~c~0 2)} assume !!(~c~0 < 6); {3136#(<= main_~c~0 2)} is VALID [2022-04-28 10:33:54,563 INFO L290 TraceCheckUtils]: 24: Hoare triple {3136#(<= main_~c~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3137#(<= main_~c~0 3)} is VALID [2022-04-28 10:33:54,563 INFO L290 TraceCheckUtils]: 25: Hoare triple {3137#(<= main_~c~0 3)} assume !!(~c~0 < 6); {3137#(<= main_~c~0 3)} is VALID [2022-04-28 10:33:54,564 INFO L290 TraceCheckUtils]: 26: Hoare triple {3137#(<= main_~c~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3138#(<= main_~c~0 4)} is VALID [2022-04-28 10:33:54,564 INFO L290 TraceCheckUtils]: 27: Hoare triple {3138#(<= main_~c~0 4)} assume !(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,564 INFO L290 TraceCheckUtils]: 28: Hoare triple {3130#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3130#false} is VALID [2022-04-28 10:33:54,564 INFO L290 TraceCheckUtils]: 29: Hoare triple {3130#false} assume !(~b~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,564 INFO L290 TraceCheckUtils]: 30: Hoare triple {3130#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {3130#false} is VALID [2022-04-28 10:33:54,564 INFO L290 TraceCheckUtils]: 31: Hoare triple {3130#false} assume !!(~a~0 < 6);~b~0 := 0; {3130#false} is VALID [2022-04-28 10:33:54,564 INFO L290 TraceCheckUtils]: 32: Hoare triple {3130#false} assume !!(~b~0 < 6);~c~0 := 0; {3130#false} is VALID [2022-04-28 10:33:54,565 INFO L290 TraceCheckUtils]: 33: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,565 INFO L290 TraceCheckUtils]: 34: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-28 10:33:54,565 INFO L290 TraceCheckUtils]: 35: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,565 INFO L290 TraceCheckUtils]: 36: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-28 10:33:54,565 INFO L290 TraceCheckUtils]: 37: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,565 INFO L290 TraceCheckUtils]: 38: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-28 10:33:54,565 INFO L290 TraceCheckUtils]: 39: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,565 INFO L290 TraceCheckUtils]: 40: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-28 10:33:54,565 INFO L290 TraceCheckUtils]: 41: Hoare triple {3130#false} assume !(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,565 INFO L290 TraceCheckUtils]: 42: Hoare triple {3130#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3130#false} is VALID [2022-04-28 10:33:54,565 INFO L290 TraceCheckUtils]: 43: Hoare triple {3130#false} assume !!(~b~0 < 6);~c~0 := 0; {3130#false} is VALID [2022-04-28 10:33:54,565 INFO L290 TraceCheckUtils]: 44: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,565 INFO L290 TraceCheckUtils]: 45: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-28 10:33:54,565 INFO L290 TraceCheckUtils]: 46: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,566 INFO L290 TraceCheckUtils]: 47: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-28 10:33:54,566 INFO L290 TraceCheckUtils]: 48: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,566 INFO L290 TraceCheckUtils]: 49: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-28 10:33:54,566 INFO L290 TraceCheckUtils]: 50: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,566 INFO L290 TraceCheckUtils]: 51: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-28 10:33:54,566 INFO L290 TraceCheckUtils]: 52: Hoare triple {3130#false} assume !(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,566 INFO L290 TraceCheckUtils]: 53: Hoare triple {3130#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3130#false} is VALID [2022-04-28 10:33:54,566 INFO L290 TraceCheckUtils]: 54: Hoare triple {3130#false} assume !(~b~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,566 INFO L290 TraceCheckUtils]: 55: Hoare triple {3130#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {3130#false} is VALID [2022-04-28 10:33:54,566 INFO L290 TraceCheckUtils]: 56: Hoare triple {3130#false} assume !(~a~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,566 INFO L290 TraceCheckUtils]: 57: Hoare triple {3130#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {3130#false} is VALID [2022-04-28 10:33:54,567 INFO L290 TraceCheckUtils]: 58: Hoare triple {3130#false} assume !false; {3130#false} is VALID [2022-04-28 10:33:54,567 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 218 proven. 16 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-04-28 10:33:54,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:33:54,748 INFO L290 TraceCheckUtils]: 58: Hoare triple {3130#false} assume !false; {3130#false} is VALID [2022-04-28 10:33:54,749 INFO L290 TraceCheckUtils]: 57: Hoare triple {3130#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {3130#false} is VALID [2022-04-28 10:33:54,749 INFO L290 TraceCheckUtils]: 56: Hoare triple {3130#false} assume !(~a~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,749 INFO L290 TraceCheckUtils]: 55: Hoare triple {3130#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {3130#false} is VALID [2022-04-28 10:33:54,749 INFO L290 TraceCheckUtils]: 54: Hoare triple {3130#false} assume !(~b~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,749 INFO L290 TraceCheckUtils]: 53: Hoare triple {3130#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3130#false} is VALID [2022-04-28 10:33:54,749 INFO L290 TraceCheckUtils]: 52: Hoare triple {3130#false} assume !(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,749 INFO L290 TraceCheckUtils]: 51: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-28 10:33:54,749 INFO L290 TraceCheckUtils]: 50: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,749 INFO L290 TraceCheckUtils]: 49: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-28 10:33:54,749 INFO L290 TraceCheckUtils]: 48: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,749 INFO L290 TraceCheckUtils]: 47: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-28 10:33:54,749 INFO L290 TraceCheckUtils]: 46: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,749 INFO L290 TraceCheckUtils]: 45: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-28 10:33:54,749 INFO L290 TraceCheckUtils]: 44: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,749 INFO L290 TraceCheckUtils]: 43: Hoare triple {3130#false} assume !!(~b~0 < 6);~c~0 := 0; {3130#false} is VALID [2022-04-28 10:33:54,750 INFO L290 TraceCheckUtils]: 42: Hoare triple {3130#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3130#false} is VALID [2022-04-28 10:33:54,750 INFO L290 TraceCheckUtils]: 41: Hoare triple {3130#false} assume !(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,750 INFO L290 TraceCheckUtils]: 40: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-28 10:33:54,750 INFO L290 TraceCheckUtils]: 39: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,750 INFO L290 TraceCheckUtils]: 38: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-28 10:33:54,750 INFO L290 TraceCheckUtils]: 37: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,750 INFO L290 TraceCheckUtils]: 36: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-28 10:33:54,750 INFO L290 TraceCheckUtils]: 35: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,750 INFO L290 TraceCheckUtils]: 34: Hoare triple {3130#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3130#false} is VALID [2022-04-28 10:33:54,750 INFO L290 TraceCheckUtils]: 33: Hoare triple {3130#false} assume !!(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,750 INFO L290 TraceCheckUtils]: 32: Hoare triple {3130#false} assume !!(~b~0 < 6);~c~0 := 0; {3130#false} is VALID [2022-04-28 10:33:54,750 INFO L290 TraceCheckUtils]: 31: Hoare triple {3130#false} assume !!(~a~0 < 6);~b~0 := 0; {3130#false} is VALID [2022-04-28 10:33:54,751 INFO L290 TraceCheckUtils]: 30: Hoare triple {3130#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {3130#false} is VALID [2022-04-28 10:33:54,751 INFO L290 TraceCheckUtils]: 29: Hoare triple {3130#false} assume !(~b~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,751 INFO L290 TraceCheckUtils]: 28: Hoare triple {3130#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3130#false} is VALID [2022-04-28 10:33:54,753 INFO L290 TraceCheckUtils]: 27: Hoare triple {3411#(< main_~c~0 6)} assume !(~c~0 < 6); {3130#false} is VALID [2022-04-28 10:33:54,753 INFO L290 TraceCheckUtils]: 26: Hoare triple {3138#(<= main_~c~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3411#(< main_~c~0 6)} is VALID [2022-04-28 10:33:54,753 INFO L290 TraceCheckUtils]: 25: Hoare triple {3138#(<= main_~c~0 4)} assume !!(~c~0 < 6); {3138#(<= main_~c~0 4)} is VALID [2022-04-28 10:33:54,754 INFO L290 TraceCheckUtils]: 24: Hoare triple {3137#(<= main_~c~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3138#(<= main_~c~0 4)} is VALID [2022-04-28 10:33:54,754 INFO L290 TraceCheckUtils]: 23: Hoare triple {3137#(<= main_~c~0 3)} assume !!(~c~0 < 6); {3137#(<= main_~c~0 3)} is VALID [2022-04-28 10:33:54,754 INFO L290 TraceCheckUtils]: 22: Hoare triple {3136#(<= main_~c~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3137#(<= main_~c~0 3)} is VALID [2022-04-28 10:33:54,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {3136#(<= main_~c~0 2)} assume !!(~c~0 < 6); {3136#(<= main_~c~0 2)} is VALID [2022-04-28 10:33:54,755 INFO L290 TraceCheckUtils]: 20: Hoare triple {3135#(<= main_~c~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3136#(<= main_~c~0 2)} is VALID [2022-04-28 10:33:54,755 INFO L290 TraceCheckUtils]: 19: Hoare triple {3135#(<= main_~c~0 1)} assume !!(~c~0 < 6); {3135#(<= main_~c~0 1)} is VALID [2022-04-28 10:33:54,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {3129#true} assume !!(~b~0 < 6);~c~0 := 0; {3135#(<= main_~c~0 1)} is VALID [2022-04-28 10:33:54,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {3129#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3129#true} is VALID [2022-04-28 10:33:54,756 INFO L290 TraceCheckUtils]: 16: Hoare triple {3129#true} assume !(~c~0 < 6); {3129#true} is VALID [2022-04-28 10:33:54,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {3129#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3129#true} is VALID [2022-04-28 10:33:54,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {3129#true} assume !!(~c~0 < 6); {3129#true} is VALID [2022-04-28 10:33:54,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {3129#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3129#true} is VALID [2022-04-28 10:33:54,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {3129#true} assume !!(~c~0 < 6); {3129#true} is VALID [2022-04-28 10:33:54,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {3129#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3129#true} is VALID [2022-04-28 10:33:54,756 INFO L290 TraceCheckUtils]: 10: Hoare triple {3129#true} assume !!(~c~0 < 6); {3129#true} is VALID [2022-04-28 10:33:54,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {3129#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3129#true} is VALID [2022-04-28 10:33:54,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {3129#true} assume !!(~c~0 < 6); {3129#true} is VALID [2022-04-28 10:33:54,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {3129#true} assume !!(~b~0 < 6);~c~0 := 0; {3129#true} is VALID [2022-04-28 10:33:54,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {3129#true} assume !!(~a~0 < 6);~b~0 := 0; {3129#true} is VALID [2022-04-28 10:33:54,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {3129#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {3129#true} is VALID [2022-04-28 10:33:54,757 INFO L272 TraceCheckUtils]: 4: Hoare triple {3129#true} call #t~ret7 := main(); {3129#true} is VALID [2022-04-28 10:33:54,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3129#true} {3129#true} #56#return; {3129#true} is VALID [2022-04-28 10:33:54,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {3129#true} assume true; {3129#true} is VALID [2022-04-28 10:33:54,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {3129#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(11, 2);call #Ultimate.allocInit(12, 3); {3129#true} is VALID [2022-04-28 10:33:54,757 INFO L272 TraceCheckUtils]: 0: Hoare triple {3129#true} call ULTIMATE.init(); {3129#true} is VALID [2022-04-28 10:33:54,758 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 218 proven. 16 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-04-28 10:33:54,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744033908] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:33:54,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:33:54,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2022-04-28 10:33:54,758 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:54,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1324373383] [2022-04-28 10:33:54,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1324373383] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:54,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:54,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:33:54,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845385532] [2022-04-28 10:33:54,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:54,759 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 10:33:54,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:54,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:54,789 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 10:33:54,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:33:54,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:54,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:33:54,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:33:54,790 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:54,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:54,953 INFO L93 Difference]: Finished difference Result 115 states and 130 transitions. [2022-04-28 10:33:54,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:33:54,953 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 10:33:54,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:54,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:54,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-28 10:33:54,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:54,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-28 10:33:54,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2022-04-28 10:33:54,991 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 10:33:54,992 INFO L225 Difference]: With dead ends: 115 [2022-04-28 10:33:54,993 INFO L226 Difference]: Without dead ends: 72 [2022-04-28 10:33:54,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:33:54,994 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 22 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:54,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 22 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:54,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-28 10:33:55,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2022-04-28 10:33:55,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:55,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 68 states, 64 states have (on average 1.109375) internal successors, (71), 64 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:55,073 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 68 states, 64 states have (on average 1.109375) internal successors, (71), 64 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:55,073 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 68 states, 64 states have (on average 1.109375) internal successors, (71), 64 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:55,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:55,074 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2022-04-28 10:33:55,075 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2022-04-28 10:33:55,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:55,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:55,075 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 64 states have (on average 1.109375) internal successors, (71), 64 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-28 10:33:55,075 INFO L87 Difference]: Start difference. First operand has 68 states, 64 states have (on average 1.109375) internal successors, (71), 64 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-28 10:33:55,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:55,077 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2022-04-28 10:33:55,077 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2022-04-28 10:33:55,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:55,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:55,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:55,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:55,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 64 states have (on average 1.109375) internal successors, (71), 64 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:55,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2022-04-28 10:33:55,079 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 59 [2022-04-28 10:33:55,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:55,079 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2022-04-28 10:33:55,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:55,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 74 transitions. [2022-04-28 10:33:55,160 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 10:33:55,160 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2022-04-28 10:33:55,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 10:33:55,161 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:55,161 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:55,180 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 10:33:55,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:55,372 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:55,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:55,372 INFO L85 PathProgramCache]: Analyzing trace with hash 2144436095, now seen corresponding path program 13 times [2022-04-28 10:33:55,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:55,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1236877549] [2022-04-28 10:33:55,570 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:55,605 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:55,605 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:55,605 INFO L85 PathProgramCache]: Analyzing trace with hash 2144436095, now seen corresponding path program 14 times [2022-04-28 10:33:55,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:55,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586122831] [2022-04-28 10:33:55,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:55,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:55,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:55,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {4026#(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(11, 2);call #Ultimate.allocInit(12, 3); {4015#true} is VALID [2022-04-28 10:33:55,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {4015#true} assume true; {4015#true} is VALID [2022-04-28 10:33:55,683 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4015#true} {4015#true} #56#return; {4015#true} is VALID [2022-04-28 10:33:55,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {4015#true} call ULTIMATE.init(); {4026#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:55,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {4026#(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(11, 2);call #Ultimate.allocInit(12, 3); {4015#true} is VALID [2022-04-28 10:33:55,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {4015#true} assume true; {4015#true} is VALID [2022-04-28 10:33:55,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4015#true} {4015#true} #56#return; {4015#true} is VALID [2022-04-28 10:33:55,684 INFO L272 TraceCheckUtils]: 4: Hoare triple {4015#true} call #t~ret7 := main(); {4015#true} is VALID [2022-04-28 10:33:55,684 INFO L290 TraceCheckUtils]: 5: Hoare triple {4015#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {4015#true} is VALID [2022-04-28 10:33:55,684 INFO L290 TraceCheckUtils]: 6: Hoare triple {4015#true} assume !!(~a~0 < 6);~b~0 := 0; {4015#true} is VALID [2022-04-28 10:33:55,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {4015#true} assume !!(~b~0 < 6);~c~0 := 0; {4020#(= main_~c~0 0)} is VALID [2022-04-28 10:33:55,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {4020#(= main_~c~0 0)} assume !!(~c~0 < 6); {4020#(= main_~c~0 0)} is VALID [2022-04-28 10:33:55,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {4020#(= main_~c~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4021#(<= main_~c~0 1)} is VALID [2022-04-28 10:33:55,686 INFO L290 TraceCheckUtils]: 10: Hoare triple {4021#(<= main_~c~0 1)} assume !!(~c~0 < 6); {4021#(<= main_~c~0 1)} is VALID [2022-04-28 10:33:55,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {4021#(<= main_~c~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4022#(<= main_~c~0 2)} is VALID [2022-04-28 10:33:55,686 INFO L290 TraceCheckUtils]: 12: Hoare triple {4022#(<= main_~c~0 2)} assume !!(~c~0 < 6); {4022#(<= main_~c~0 2)} is VALID [2022-04-28 10:33:55,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {4022#(<= main_~c~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4023#(<= main_~c~0 3)} is VALID [2022-04-28 10:33:55,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {4023#(<= main_~c~0 3)} assume !!(~c~0 < 6); {4023#(<= main_~c~0 3)} is VALID [2022-04-28 10:33:55,687 INFO L290 TraceCheckUtils]: 15: Hoare triple {4023#(<= main_~c~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4024#(<= main_~c~0 4)} is VALID [2022-04-28 10:33:55,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {4024#(<= main_~c~0 4)} assume !!(~c~0 < 6); {4024#(<= main_~c~0 4)} is VALID [2022-04-28 10:33:55,688 INFO L290 TraceCheckUtils]: 17: Hoare triple {4024#(<= main_~c~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4025#(<= main_~c~0 5)} is VALID [2022-04-28 10:33:55,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {4025#(<= main_~c~0 5)} assume !(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,689 INFO L290 TraceCheckUtils]: 19: Hoare triple {4016#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4016#false} is VALID [2022-04-28 10:33:55,689 INFO L290 TraceCheckUtils]: 20: Hoare triple {4016#false} assume !!(~b~0 < 6);~c~0 := 0; {4016#false} is VALID [2022-04-28 10:33:55,689 INFO L290 TraceCheckUtils]: 21: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,689 INFO L290 TraceCheckUtils]: 22: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:55,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:55,689 INFO L290 TraceCheckUtils]: 25: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,689 INFO L290 TraceCheckUtils]: 26: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:55,689 INFO L290 TraceCheckUtils]: 27: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,689 INFO L290 TraceCheckUtils]: 28: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:55,690 INFO L290 TraceCheckUtils]: 29: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,690 INFO L290 TraceCheckUtils]: 30: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:55,690 INFO L290 TraceCheckUtils]: 31: Hoare triple {4016#false} assume !(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,690 INFO L290 TraceCheckUtils]: 32: Hoare triple {4016#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4016#false} is VALID [2022-04-28 10:33:55,690 INFO L290 TraceCheckUtils]: 33: Hoare triple {4016#false} assume !(~b~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,690 INFO L290 TraceCheckUtils]: 34: Hoare triple {4016#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4016#false} is VALID [2022-04-28 10:33:55,690 INFO L290 TraceCheckUtils]: 35: Hoare triple {4016#false} assume !!(~a~0 < 6);~b~0 := 0; {4016#false} is VALID [2022-04-28 10:33:55,690 INFO L290 TraceCheckUtils]: 36: Hoare triple {4016#false} assume !!(~b~0 < 6);~c~0 := 0; {4016#false} is VALID [2022-04-28 10:33:55,690 INFO L290 TraceCheckUtils]: 37: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,690 INFO L290 TraceCheckUtils]: 38: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:55,690 INFO L290 TraceCheckUtils]: 39: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,690 INFO L290 TraceCheckUtils]: 40: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:55,691 INFO L290 TraceCheckUtils]: 41: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,691 INFO L290 TraceCheckUtils]: 42: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:55,691 INFO L290 TraceCheckUtils]: 43: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,691 INFO L290 TraceCheckUtils]: 44: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:55,691 INFO L290 TraceCheckUtils]: 45: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,691 INFO L290 TraceCheckUtils]: 46: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:55,691 INFO L290 TraceCheckUtils]: 47: Hoare triple {4016#false} assume !(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,691 INFO L290 TraceCheckUtils]: 48: Hoare triple {4016#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4016#false} is VALID [2022-04-28 10:33:55,691 INFO L290 TraceCheckUtils]: 49: Hoare triple {4016#false} assume !!(~b~0 < 6);~c~0 := 0; {4016#false} is VALID [2022-04-28 10:33:55,691 INFO L290 TraceCheckUtils]: 50: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,691 INFO L290 TraceCheckUtils]: 51: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:55,691 INFO L290 TraceCheckUtils]: 52: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,692 INFO L290 TraceCheckUtils]: 53: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:55,692 INFO L290 TraceCheckUtils]: 54: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,692 INFO L290 TraceCheckUtils]: 55: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:55,692 INFO L290 TraceCheckUtils]: 56: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,692 INFO L290 TraceCheckUtils]: 57: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:55,692 INFO L290 TraceCheckUtils]: 58: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,692 INFO L290 TraceCheckUtils]: 59: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:55,692 INFO L290 TraceCheckUtils]: 60: Hoare triple {4016#false} assume !(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,692 INFO L290 TraceCheckUtils]: 61: Hoare triple {4016#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4016#false} is VALID [2022-04-28 10:33:55,692 INFO L290 TraceCheckUtils]: 62: Hoare triple {4016#false} assume !(~b~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,692 INFO L290 TraceCheckUtils]: 63: Hoare triple {4016#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4016#false} is VALID [2022-04-28 10:33:55,692 INFO L290 TraceCheckUtils]: 64: Hoare triple {4016#false} assume !(~a~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,693 INFO L290 TraceCheckUtils]: 65: Hoare triple {4016#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {4016#false} is VALID [2022-04-28 10:33:55,693 INFO L290 TraceCheckUtils]: 66: Hoare triple {4016#false} assume !false; {4016#false} is VALID [2022-04-28 10:33:55,693 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 190 proven. 25 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2022-04-28 10:33:55,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:55,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586122831] [2022-04-28 10:33:55,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586122831] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:33:55,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784451549] [2022-04-28 10:33:55,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:33:55,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:55,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:55,696 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 10:33:55,706 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 10:33:55,751 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:33:55,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:55,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 10:33:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:55,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:55,949 INFO L272 TraceCheckUtils]: 0: Hoare triple {4015#true} call ULTIMATE.init(); {4015#true} is VALID [2022-04-28 10:33:55,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {4015#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(11, 2);call #Ultimate.allocInit(12, 3); {4015#true} is VALID [2022-04-28 10:33:55,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {4015#true} assume true; {4015#true} is VALID [2022-04-28 10:33:55,950 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4015#true} {4015#true} #56#return; {4015#true} is VALID [2022-04-28 10:33:55,950 INFO L272 TraceCheckUtils]: 4: Hoare triple {4015#true} call #t~ret7 := main(); {4015#true} is VALID [2022-04-28 10:33:55,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {4015#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {4015#true} is VALID [2022-04-28 10:33:55,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {4015#true} assume !!(~a~0 < 6);~b~0 := 0; {4015#true} is VALID [2022-04-28 10:33:55,950 INFO L290 TraceCheckUtils]: 7: Hoare triple {4015#true} assume !!(~b~0 < 6);~c~0 := 0; {4051#(<= main_~c~0 0)} is VALID [2022-04-28 10:33:55,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {4051#(<= main_~c~0 0)} assume !!(~c~0 < 6); {4051#(<= main_~c~0 0)} is VALID [2022-04-28 10:33:55,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {4051#(<= main_~c~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4021#(<= main_~c~0 1)} is VALID [2022-04-28 10:33:55,951 INFO L290 TraceCheckUtils]: 10: Hoare triple {4021#(<= main_~c~0 1)} assume !!(~c~0 < 6); {4021#(<= main_~c~0 1)} is VALID [2022-04-28 10:33:55,952 INFO L290 TraceCheckUtils]: 11: Hoare triple {4021#(<= main_~c~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4022#(<= main_~c~0 2)} is VALID [2022-04-28 10:33:55,952 INFO L290 TraceCheckUtils]: 12: Hoare triple {4022#(<= main_~c~0 2)} assume !!(~c~0 < 6); {4022#(<= main_~c~0 2)} is VALID [2022-04-28 10:33:55,952 INFO L290 TraceCheckUtils]: 13: Hoare triple {4022#(<= main_~c~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4023#(<= main_~c~0 3)} is VALID [2022-04-28 10:33:55,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {4023#(<= main_~c~0 3)} assume !!(~c~0 < 6); {4023#(<= main_~c~0 3)} is VALID [2022-04-28 10:33:55,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {4023#(<= main_~c~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4024#(<= main_~c~0 4)} is VALID [2022-04-28 10:33:55,953 INFO L290 TraceCheckUtils]: 16: Hoare triple {4024#(<= main_~c~0 4)} assume !!(~c~0 < 6); {4024#(<= main_~c~0 4)} is VALID [2022-04-28 10:33:55,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {4024#(<= main_~c~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4025#(<= main_~c~0 5)} is VALID [2022-04-28 10:33:55,954 INFO L290 TraceCheckUtils]: 18: Hoare triple {4025#(<= main_~c~0 5)} assume !(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,954 INFO L290 TraceCheckUtils]: 19: Hoare triple {4016#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4016#false} is VALID [2022-04-28 10:33:55,954 INFO L290 TraceCheckUtils]: 20: Hoare triple {4016#false} assume !!(~b~0 < 6);~c~0 := 0; {4016#false} is VALID [2022-04-28 10:33:55,954 INFO L290 TraceCheckUtils]: 21: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,954 INFO L290 TraceCheckUtils]: 22: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:55,954 INFO L290 TraceCheckUtils]: 23: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,954 INFO L290 TraceCheckUtils]: 24: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:55,954 INFO L290 TraceCheckUtils]: 25: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,954 INFO L290 TraceCheckUtils]: 26: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:55,954 INFO L290 TraceCheckUtils]: 27: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,955 INFO L290 TraceCheckUtils]: 28: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:55,955 INFO L290 TraceCheckUtils]: 29: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,955 INFO L290 TraceCheckUtils]: 30: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:55,955 INFO L290 TraceCheckUtils]: 31: Hoare triple {4016#false} assume !(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,955 INFO L290 TraceCheckUtils]: 32: Hoare triple {4016#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4016#false} is VALID [2022-04-28 10:33:55,955 INFO L290 TraceCheckUtils]: 33: Hoare triple {4016#false} assume !(~b~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,955 INFO L290 TraceCheckUtils]: 34: Hoare triple {4016#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4016#false} is VALID [2022-04-28 10:33:55,955 INFO L290 TraceCheckUtils]: 35: Hoare triple {4016#false} assume !!(~a~0 < 6);~b~0 := 0; {4016#false} is VALID [2022-04-28 10:33:55,955 INFO L290 TraceCheckUtils]: 36: Hoare triple {4016#false} assume !!(~b~0 < 6);~c~0 := 0; {4016#false} is VALID [2022-04-28 10:33:55,955 INFO L290 TraceCheckUtils]: 37: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,955 INFO L290 TraceCheckUtils]: 38: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:55,956 INFO L290 TraceCheckUtils]: 39: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,956 INFO L290 TraceCheckUtils]: 40: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:55,956 INFO L290 TraceCheckUtils]: 41: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,956 INFO L290 TraceCheckUtils]: 42: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:55,956 INFO L290 TraceCheckUtils]: 43: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,956 INFO L290 TraceCheckUtils]: 44: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:55,956 INFO L290 TraceCheckUtils]: 45: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,956 INFO L290 TraceCheckUtils]: 46: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:55,956 INFO L290 TraceCheckUtils]: 47: Hoare triple {4016#false} assume !(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,956 INFO L290 TraceCheckUtils]: 48: Hoare triple {4016#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4016#false} is VALID [2022-04-28 10:33:55,956 INFO L290 TraceCheckUtils]: 49: Hoare triple {4016#false} assume !!(~b~0 < 6);~c~0 := 0; {4016#false} is VALID [2022-04-28 10:33:55,956 INFO L290 TraceCheckUtils]: 50: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,957 INFO L290 TraceCheckUtils]: 51: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:55,957 INFO L290 TraceCheckUtils]: 52: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,957 INFO L290 TraceCheckUtils]: 53: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:55,957 INFO L290 TraceCheckUtils]: 54: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,957 INFO L290 TraceCheckUtils]: 55: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:55,957 INFO L290 TraceCheckUtils]: 56: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,957 INFO L290 TraceCheckUtils]: 57: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:55,957 INFO L290 TraceCheckUtils]: 58: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,957 INFO L290 TraceCheckUtils]: 59: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:55,957 INFO L290 TraceCheckUtils]: 60: Hoare triple {4016#false} assume !(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,957 INFO L290 TraceCheckUtils]: 61: Hoare triple {4016#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4016#false} is VALID [2022-04-28 10:33:55,958 INFO L290 TraceCheckUtils]: 62: Hoare triple {4016#false} assume !(~b~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,958 INFO L290 TraceCheckUtils]: 63: Hoare triple {4016#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4016#false} is VALID [2022-04-28 10:33:55,958 INFO L290 TraceCheckUtils]: 64: Hoare triple {4016#false} assume !(~a~0 < 6); {4016#false} is VALID [2022-04-28 10:33:55,958 INFO L290 TraceCheckUtils]: 65: Hoare triple {4016#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {4016#false} is VALID [2022-04-28 10:33:55,958 INFO L290 TraceCheckUtils]: 66: Hoare triple {4016#false} assume !false; {4016#false} is VALID [2022-04-28 10:33:55,958 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 190 proven. 25 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2022-04-28 10:33:55,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:33:56,206 INFO L290 TraceCheckUtils]: 66: Hoare triple {4016#false} assume !false; {4016#false} is VALID [2022-04-28 10:33:56,206 INFO L290 TraceCheckUtils]: 65: Hoare triple {4016#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {4016#false} is VALID [2022-04-28 10:33:56,206 INFO L290 TraceCheckUtils]: 64: Hoare triple {4016#false} assume !(~a~0 < 6); {4016#false} is VALID [2022-04-28 10:33:56,206 INFO L290 TraceCheckUtils]: 63: Hoare triple {4016#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4016#false} is VALID [2022-04-28 10:33:56,206 INFO L290 TraceCheckUtils]: 62: Hoare triple {4016#false} assume !(~b~0 < 6); {4016#false} is VALID [2022-04-28 10:33:56,206 INFO L290 TraceCheckUtils]: 61: Hoare triple {4016#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4016#false} is VALID [2022-04-28 10:33:56,206 INFO L290 TraceCheckUtils]: 60: Hoare triple {4016#false} assume !(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:56,206 INFO L290 TraceCheckUtils]: 59: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:56,206 INFO L290 TraceCheckUtils]: 58: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:56,206 INFO L290 TraceCheckUtils]: 57: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:56,207 INFO L290 TraceCheckUtils]: 56: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:56,207 INFO L290 TraceCheckUtils]: 55: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:56,207 INFO L290 TraceCheckUtils]: 54: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:56,207 INFO L290 TraceCheckUtils]: 53: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:56,207 INFO L290 TraceCheckUtils]: 52: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:56,207 INFO L290 TraceCheckUtils]: 51: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:56,207 INFO L290 TraceCheckUtils]: 50: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:56,207 INFO L290 TraceCheckUtils]: 49: Hoare triple {4016#false} assume !!(~b~0 < 6);~c~0 := 0; {4016#false} is VALID [2022-04-28 10:33:56,207 INFO L290 TraceCheckUtils]: 48: Hoare triple {4016#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4016#false} is VALID [2022-04-28 10:33:56,207 INFO L290 TraceCheckUtils]: 47: Hoare triple {4016#false} assume !(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:56,207 INFO L290 TraceCheckUtils]: 46: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:56,207 INFO L290 TraceCheckUtils]: 45: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:56,207 INFO L290 TraceCheckUtils]: 44: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:56,208 INFO L290 TraceCheckUtils]: 43: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:56,208 INFO L290 TraceCheckUtils]: 42: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:56,208 INFO L290 TraceCheckUtils]: 41: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:56,208 INFO L290 TraceCheckUtils]: 40: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:56,208 INFO L290 TraceCheckUtils]: 39: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:56,208 INFO L290 TraceCheckUtils]: 38: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:56,208 INFO L290 TraceCheckUtils]: 37: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:56,208 INFO L290 TraceCheckUtils]: 36: Hoare triple {4016#false} assume !!(~b~0 < 6);~c~0 := 0; {4016#false} is VALID [2022-04-28 10:33:56,208 INFO L290 TraceCheckUtils]: 35: Hoare triple {4016#false} assume !!(~a~0 < 6);~b~0 := 0; {4016#false} is VALID [2022-04-28 10:33:56,208 INFO L290 TraceCheckUtils]: 34: Hoare triple {4016#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4016#false} is VALID [2022-04-28 10:33:56,208 INFO L290 TraceCheckUtils]: 33: Hoare triple {4016#false} assume !(~b~0 < 6); {4016#false} is VALID [2022-04-28 10:33:56,208 INFO L290 TraceCheckUtils]: 32: Hoare triple {4016#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4016#false} is VALID [2022-04-28 10:33:56,208 INFO L290 TraceCheckUtils]: 31: Hoare triple {4016#false} assume !(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:56,208 INFO L290 TraceCheckUtils]: 30: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:56,209 INFO L290 TraceCheckUtils]: 29: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:56,209 INFO L290 TraceCheckUtils]: 28: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:56,209 INFO L290 TraceCheckUtils]: 27: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:56,209 INFO L290 TraceCheckUtils]: 26: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:56,209 INFO L290 TraceCheckUtils]: 25: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:56,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:56,209 INFO L290 TraceCheckUtils]: 23: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:56,209 INFO L290 TraceCheckUtils]: 22: Hoare triple {4016#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4016#false} is VALID [2022-04-28 10:33:56,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {4016#false} assume !!(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:56,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {4016#false} assume !!(~b~0 < 6);~c~0 := 0; {4016#false} is VALID [2022-04-28 10:33:56,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {4016#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4016#false} is VALID [2022-04-28 10:33:56,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {4025#(<= main_~c~0 5)} assume !(~c~0 < 6); {4016#false} is VALID [2022-04-28 10:33:56,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {4024#(<= main_~c~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4025#(<= main_~c~0 5)} is VALID [2022-04-28 10:33:56,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {4024#(<= main_~c~0 4)} assume !!(~c~0 < 6); {4024#(<= main_~c~0 4)} is VALID [2022-04-28 10:33:56,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {4023#(<= main_~c~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4024#(<= main_~c~0 4)} is VALID [2022-04-28 10:33:56,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {4023#(<= main_~c~0 3)} assume !!(~c~0 < 6); {4023#(<= main_~c~0 3)} is VALID [2022-04-28 10:33:56,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {4022#(<= main_~c~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4023#(<= main_~c~0 3)} is VALID [2022-04-28 10:33:56,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {4022#(<= main_~c~0 2)} assume !!(~c~0 < 6); {4022#(<= main_~c~0 2)} is VALID [2022-04-28 10:33:56,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {4021#(<= main_~c~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4022#(<= main_~c~0 2)} is VALID [2022-04-28 10:33:56,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {4021#(<= main_~c~0 1)} assume !!(~c~0 < 6); {4021#(<= main_~c~0 1)} is VALID [2022-04-28 10:33:56,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {4051#(<= main_~c~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4021#(<= main_~c~0 1)} is VALID [2022-04-28 10:33:56,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {4051#(<= main_~c~0 0)} assume !!(~c~0 < 6); {4051#(<= main_~c~0 0)} is VALID [2022-04-28 10:33:56,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {4015#true} assume !!(~b~0 < 6);~c~0 := 0; {4051#(<= main_~c~0 0)} is VALID [2022-04-28 10:33:56,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {4015#true} assume !!(~a~0 < 6);~b~0 := 0; {4015#true} is VALID [2022-04-28 10:33:56,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {4015#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {4015#true} is VALID [2022-04-28 10:33:56,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {4015#true} call #t~ret7 := main(); {4015#true} is VALID [2022-04-28 10:33:56,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4015#true} {4015#true} #56#return; {4015#true} is VALID [2022-04-28 10:33:56,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {4015#true} assume true; {4015#true} is VALID [2022-04-28 10:33:56,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {4015#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(11, 2);call #Ultimate.allocInit(12, 3); {4015#true} is VALID [2022-04-28 10:33:56,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {4015#true} call ULTIMATE.init(); {4015#true} is VALID [2022-04-28 10:33:56,222 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 190 proven. 25 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2022-04-28 10:33:56,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784451549] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:33:56,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:33:56,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 10 [2022-04-28 10:33:56,222 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:56,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1236877549] [2022-04-28 10:33:56,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1236877549] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:56,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:56,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:33:56,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962688826] [2022-04-28 10:33:56,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:56,223 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-28 10:33:56,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:56,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:56,258 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 10:33:56,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:33:56,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:56,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:33:56,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:33:56,259 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:56,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:56,479 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2022-04-28 10:33:56,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:33:56,479 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-28 10:33:56,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:56,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:56,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2022-04-28 10:33:56,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:56,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2022-04-28 10:33:56,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 40 transitions. [2022-04-28 10:33:56,519 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 10:33:56,521 INFO L225 Difference]: With dead ends: 125 [2022-04-28 10:33:56,521 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 10:33:56,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:33:56,522 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 23 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:56,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 22 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:56,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 10:33:56,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-28 10:33:56,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:56,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 76 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:56,617 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 76 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:56,617 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 76 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:56,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:56,618 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-04-28 10:33:56,619 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2022-04-28 10:33:56,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:56,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:56,619 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 76 states. [2022-04-28 10:33:56,619 INFO L87 Difference]: Start difference. First operand has 76 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 76 states. [2022-04-28 10:33:56,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:56,620 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-04-28 10:33:56,621 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2022-04-28 10:33:56,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:56,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:56,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:56,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:56,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:56,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2022-04-28 10:33:56,622 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 67 [2022-04-28 10:33:56,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:56,623 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2022-04-28 10:33:56,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:56,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 82 transitions. [2022-04-28 10:33:56,709 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 10:33:56,709 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2022-04-28 10:33:56,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 10:33:56,709 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:56,709 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:56,726 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 10:33:56,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:56,910 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:56,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:56,911 INFO L85 PathProgramCache]: Analyzing trace with hash 275596543, now seen corresponding path program 15 times [2022-04-28 10:33:56,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:56,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [533282616] [2022-04-28 10:33:57,169 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:57,207 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:57,207 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:57,207 INFO L85 PathProgramCache]: Analyzing trace with hash 275596543, now seen corresponding path program 16 times [2022-04-28 10:33:57,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:57,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767232273] [2022-04-28 10:33:57,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:57,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:57,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:57,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {5003#(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(11, 2);call #Ultimate.allocInit(12, 3); {4995#true} is VALID [2022-04-28 10:33:57,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {4995#true} assume true; {4995#true} is VALID [2022-04-28 10:33:57,272 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4995#true} {4995#true} #56#return; {4995#true} is VALID [2022-04-28 10:33:57,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {4995#true} call ULTIMATE.init(); {5003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:57,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {5003#(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(11, 2);call #Ultimate.allocInit(12, 3); {4995#true} is VALID [2022-04-28 10:33:57,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {4995#true} assume true; {4995#true} is VALID [2022-04-28 10:33:57,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4995#true} {4995#true} #56#return; {4995#true} is VALID [2022-04-28 10:33:57,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {4995#true} call #t~ret7 := main(); {4995#true} is VALID [2022-04-28 10:33:57,273 INFO L290 TraceCheckUtils]: 5: Hoare triple {4995#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {4995#true} is VALID [2022-04-28 10:33:57,273 INFO L290 TraceCheckUtils]: 6: Hoare triple {4995#true} assume !!(~a~0 < 6);~b~0 := 0; {5000#(= main_~b~0 0)} is VALID [2022-04-28 10:33:57,274 INFO L290 TraceCheckUtils]: 7: Hoare triple {5000#(= main_~b~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {5000#(= main_~b~0 0)} is VALID [2022-04-28 10:33:57,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {5000#(= main_~b~0 0)} assume !!(~c~0 < 6); {5000#(= main_~b~0 0)} is VALID [2022-04-28 10:33:57,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {5000#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5000#(= main_~b~0 0)} is VALID [2022-04-28 10:33:57,275 INFO L290 TraceCheckUtils]: 10: Hoare triple {5000#(= main_~b~0 0)} assume !!(~c~0 < 6); {5000#(= main_~b~0 0)} is VALID [2022-04-28 10:33:57,275 INFO L290 TraceCheckUtils]: 11: Hoare triple {5000#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5000#(= main_~b~0 0)} is VALID [2022-04-28 10:33:57,275 INFO L290 TraceCheckUtils]: 12: Hoare triple {5000#(= main_~b~0 0)} assume !!(~c~0 < 6); {5000#(= main_~b~0 0)} is VALID [2022-04-28 10:33:57,275 INFO L290 TraceCheckUtils]: 13: Hoare triple {5000#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5000#(= main_~b~0 0)} is VALID [2022-04-28 10:33:57,276 INFO L290 TraceCheckUtils]: 14: Hoare triple {5000#(= main_~b~0 0)} assume !!(~c~0 < 6); {5000#(= main_~b~0 0)} is VALID [2022-04-28 10:33:57,276 INFO L290 TraceCheckUtils]: 15: Hoare triple {5000#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5000#(= main_~b~0 0)} is VALID [2022-04-28 10:33:57,276 INFO L290 TraceCheckUtils]: 16: Hoare triple {5000#(= main_~b~0 0)} assume !!(~c~0 < 6); {5000#(= main_~b~0 0)} is VALID [2022-04-28 10:33:57,277 INFO L290 TraceCheckUtils]: 17: Hoare triple {5000#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5000#(= main_~b~0 0)} is VALID [2022-04-28 10:33:57,277 INFO L290 TraceCheckUtils]: 18: Hoare triple {5000#(= main_~b~0 0)} assume !!(~c~0 < 6); {5000#(= main_~b~0 0)} is VALID [2022-04-28 10:33:57,277 INFO L290 TraceCheckUtils]: 19: Hoare triple {5000#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5000#(= main_~b~0 0)} is VALID [2022-04-28 10:33:57,277 INFO L290 TraceCheckUtils]: 20: Hoare triple {5000#(= main_~b~0 0)} assume !(~c~0 < 6); {5000#(= main_~b~0 0)} is VALID [2022-04-28 10:33:57,278 INFO L290 TraceCheckUtils]: 21: Hoare triple {5000#(= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {5001#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:57,278 INFO L290 TraceCheckUtils]: 22: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~b~0 < 6);~c~0 := 0; {5001#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:57,278 INFO L290 TraceCheckUtils]: 23: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:57,279 INFO L290 TraceCheckUtils]: 24: Hoare triple {5001#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5001#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:57,279 INFO L290 TraceCheckUtils]: 25: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:57,279 INFO L290 TraceCheckUtils]: 26: Hoare triple {5001#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5001#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:57,279 INFO L290 TraceCheckUtils]: 27: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:57,280 INFO L290 TraceCheckUtils]: 28: Hoare triple {5001#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5001#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:57,280 INFO L290 TraceCheckUtils]: 29: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:57,280 INFO L290 TraceCheckUtils]: 30: Hoare triple {5001#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5001#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:57,281 INFO L290 TraceCheckUtils]: 31: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:57,281 INFO L290 TraceCheckUtils]: 32: Hoare triple {5001#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5001#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:57,281 INFO L290 TraceCheckUtils]: 33: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:57,281 INFO L290 TraceCheckUtils]: 34: Hoare triple {5001#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5001#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:57,282 INFO L290 TraceCheckUtils]: 35: Hoare triple {5001#(<= main_~b~0 1)} assume !(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:57,282 INFO L290 TraceCheckUtils]: 36: Hoare triple {5001#(<= main_~b~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {5002#(<= main_~b~0 2)} is VALID [2022-04-28 10:33:57,283 INFO L290 TraceCheckUtils]: 37: Hoare triple {5002#(<= main_~b~0 2)} assume !(~b~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,283 INFO L290 TraceCheckUtils]: 38: Hoare triple {4996#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4996#false} is VALID [2022-04-28 10:33:57,283 INFO L290 TraceCheckUtils]: 39: Hoare triple {4996#false} assume !!(~a~0 < 6);~b~0 := 0; {4996#false} is VALID [2022-04-28 10:33:57,283 INFO L290 TraceCheckUtils]: 40: Hoare triple {4996#false} assume !!(~b~0 < 6);~c~0 := 0; {4996#false} is VALID [2022-04-28 10:33:57,283 INFO L290 TraceCheckUtils]: 41: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,283 INFO L290 TraceCheckUtils]: 42: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-28 10:33:57,283 INFO L290 TraceCheckUtils]: 43: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,283 INFO L290 TraceCheckUtils]: 44: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-28 10:33:57,283 INFO L290 TraceCheckUtils]: 45: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,283 INFO L290 TraceCheckUtils]: 46: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-28 10:33:57,283 INFO L290 TraceCheckUtils]: 47: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,283 INFO L290 TraceCheckUtils]: 48: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-28 10:33:57,284 INFO L290 TraceCheckUtils]: 49: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,284 INFO L290 TraceCheckUtils]: 50: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-28 10:33:57,284 INFO L290 TraceCheckUtils]: 51: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,284 INFO L290 TraceCheckUtils]: 52: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-28 10:33:57,284 INFO L290 TraceCheckUtils]: 53: Hoare triple {4996#false} assume !(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,284 INFO L290 TraceCheckUtils]: 54: Hoare triple {4996#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4996#false} is VALID [2022-04-28 10:33:57,284 INFO L290 TraceCheckUtils]: 55: Hoare triple {4996#false} assume !!(~b~0 < 6);~c~0 := 0; {4996#false} is VALID [2022-04-28 10:33:57,284 INFO L290 TraceCheckUtils]: 56: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,284 INFO L290 TraceCheckUtils]: 57: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-28 10:33:57,284 INFO L290 TraceCheckUtils]: 58: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,284 INFO L290 TraceCheckUtils]: 59: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-28 10:33:57,285 INFO L290 TraceCheckUtils]: 60: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,285 INFO L290 TraceCheckUtils]: 61: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-28 10:33:57,285 INFO L290 TraceCheckUtils]: 62: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,285 INFO L290 TraceCheckUtils]: 63: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-28 10:33:57,285 INFO L290 TraceCheckUtils]: 64: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,285 INFO L290 TraceCheckUtils]: 65: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-28 10:33:57,285 INFO L290 TraceCheckUtils]: 66: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,285 INFO L290 TraceCheckUtils]: 67: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-28 10:33:57,285 INFO L290 TraceCheckUtils]: 68: Hoare triple {4996#false} assume !(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,285 INFO L290 TraceCheckUtils]: 69: Hoare triple {4996#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4996#false} is VALID [2022-04-28 10:33:57,285 INFO L290 TraceCheckUtils]: 70: Hoare triple {4996#false} assume !(~b~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,285 INFO L290 TraceCheckUtils]: 71: Hoare triple {4996#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4996#false} is VALID [2022-04-28 10:33:57,286 INFO L290 TraceCheckUtils]: 72: Hoare triple {4996#false} assume !(~a~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,286 INFO L290 TraceCheckUtils]: 73: Hoare triple {4996#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {4996#false} is VALID [2022-04-28 10:33:57,286 INFO L290 TraceCheckUtils]: 74: Hoare triple {4996#false} assume !false; {4996#false} is VALID [2022-04-28 10:33:57,286 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 355 proven. 89 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-04-28 10:33:57,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:57,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767232273] [2022-04-28 10:33:57,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767232273] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:33:57,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942027601] [2022-04-28 10:33:57,287 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:33:57,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:57,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:57,288 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 10:33:57,315 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 10:33:57,343 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:33:57,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:57,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 10:33:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:57,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:57,549 INFO L272 TraceCheckUtils]: 0: Hoare triple {4995#true} call ULTIMATE.init(); {4995#true} is VALID [2022-04-28 10:33:57,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {4995#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(11, 2);call #Ultimate.allocInit(12, 3); {4995#true} is VALID [2022-04-28 10:33:57,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {4995#true} assume true; {4995#true} is VALID [2022-04-28 10:33:57,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4995#true} {4995#true} #56#return; {4995#true} is VALID [2022-04-28 10:33:57,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {4995#true} call #t~ret7 := main(); {4995#true} is VALID [2022-04-28 10:33:57,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {4995#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {4995#true} is VALID [2022-04-28 10:33:57,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {4995#true} assume !!(~a~0 < 6);~b~0 := 0; {5025#(<= main_~b~0 0)} is VALID [2022-04-28 10:33:57,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {5025#(<= main_~b~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {5025#(<= main_~b~0 0)} is VALID [2022-04-28 10:33:57,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {5025#(<= main_~b~0 0)} assume !!(~c~0 < 6); {5025#(<= main_~b~0 0)} is VALID [2022-04-28 10:33:57,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {5025#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5025#(<= main_~b~0 0)} is VALID [2022-04-28 10:33:57,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {5025#(<= main_~b~0 0)} assume !!(~c~0 < 6); {5025#(<= main_~b~0 0)} is VALID [2022-04-28 10:33:57,554 INFO L290 TraceCheckUtils]: 11: Hoare triple {5025#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5025#(<= main_~b~0 0)} is VALID [2022-04-28 10:33:57,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {5025#(<= main_~b~0 0)} assume !!(~c~0 < 6); {5025#(<= main_~b~0 0)} is VALID [2022-04-28 10:33:57,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {5025#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5025#(<= main_~b~0 0)} is VALID [2022-04-28 10:33:57,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {5025#(<= main_~b~0 0)} assume !!(~c~0 < 6); {5025#(<= main_~b~0 0)} is VALID [2022-04-28 10:33:57,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {5025#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5025#(<= main_~b~0 0)} is VALID [2022-04-28 10:33:57,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {5025#(<= main_~b~0 0)} assume !!(~c~0 < 6); {5025#(<= main_~b~0 0)} is VALID [2022-04-28 10:33:57,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {5025#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5025#(<= main_~b~0 0)} is VALID [2022-04-28 10:33:57,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {5025#(<= main_~b~0 0)} assume !!(~c~0 < 6); {5025#(<= main_~b~0 0)} is VALID [2022-04-28 10:33:57,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {5025#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5025#(<= main_~b~0 0)} is VALID [2022-04-28 10:33:57,562 INFO L290 TraceCheckUtils]: 20: Hoare triple {5025#(<= main_~b~0 0)} assume !(~c~0 < 6); {5025#(<= main_~b~0 0)} is VALID [2022-04-28 10:33:57,563 INFO L290 TraceCheckUtils]: 21: Hoare triple {5025#(<= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {5001#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:57,563 INFO L290 TraceCheckUtils]: 22: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~b~0 < 6);~c~0 := 0; {5001#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:57,564 INFO L290 TraceCheckUtils]: 23: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:57,564 INFO L290 TraceCheckUtils]: 24: Hoare triple {5001#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5001#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:57,564 INFO L290 TraceCheckUtils]: 25: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:57,564 INFO L290 TraceCheckUtils]: 26: Hoare triple {5001#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5001#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:57,565 INFO L290 TraceCheckUtils]: 27: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:57,565 INFO L290 TraceCheckUtils]: 28: Hoare triple {5001#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5001#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:57,565 INFO L290 TraceCheckUtils]: 29: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:57,565 INFO L290 TraceCheckUtils]: 30: Hoare triple {5001#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5001#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:57,566 INFO L290 TraceCheckUtils]: 31: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:57,566 INFO L290 TraceCheckUtils]: 32: Hoare triple {5001#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5001#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:57,566 INFO L290 TraceCheckUtils]: 33: Hoare triple {5001#(<= main_~b~0 1)} assume !!(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:57,567 INFO L290 TraceCheckUtils]: 34: Hoare triple {5001#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5001#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:57,567 INFO L290 TraceCheckUtils]: 35: Hoare triple {5001#(<= main_~b~0 1)} assume !(~c~0 < 6); {5001#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:57,567 INFO L290 TraceCheckUtils]: 36: Hoare triple {5001#(<= main_~b~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {5002#(<= main_~b~0 2)} is VALID [2022-04-28 10:33:57,568 INFO L290 TraceCheckUtils]: 37: Hoare triple {5002#(<= main_~b~0 2)} assume !(~b~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,568 INFO L290 TraceCheckUtils]: 38: Hoare triple {4996#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4996#false} is VALID [2022-04-28 10:33:57,568 INFO L290 TraceCheckUtils]: 39: Hoare triple {4996#false} assume !!(~a~0 < 6);~b~0 := 0; {4996#false} is VALID [2022-04-28 10:33:57,568 INFO L290 TraceCheckUtils]: 40: Hoare triple {4996#false} assume !!(~b~0 < 6);~c~0 := 0; {4996#false} is VALID [2022-04-28 10:33:57,568 INFO L290 TraceCheckUtils]: 41: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,568 INFO L290 TraceCheckUtils]: 42: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-28 10:33:57,568 INFO L290 TraceCheckUtils]: 43: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,568 INFO L290 TraceCheckUtils]: 44: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-28 10:33:57,568 INFO L290 TraceCheckUtils]: 45: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,568 INFO L290 TraceCheckUtils]: 46: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-28 10:33:57,568 INFO L290 TraceCheckUtils]: 47: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,569 INFO L290 TraceCheckUtils]: 48: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-28 10:33:57,569 INFO L290 TraceCheckUtils]: 49: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,569 INFO L290 TraceCheckUtils]: 50: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-28 10:33:57,569 INFO L290 TraceCheckUtils]: 51: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,569 INFO L290 TraceCheckUtils]: 52: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-28 10:33:57,569 INFO L290 TraceCheckUtils]: 53: Hoare triple {4996#false} assume !(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,569 INFO L290 TraceCheckUtils]: 54: Hoare triple {4996#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4996#false} is VALID [2022-04-28 10:33:57,569 INFO L290 TraceCheckUtils]: 55: Hoare triple {4996#false} assume !!(~b~0 < 6);~c~0 := 0; {4996#false} is VALID [2022-04-28 10:33:57,569 INFO L290 TraceCheckUtils]: 56: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,569 INFO L290 TraceCheckUtils]: 57: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-28 10:33:57,569 INFO L290 TraceCheckUtils]: 58: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,570 INFO L290 TraceCheckUtils]: 59: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-28 10:33:57,570 INFO L290 TraceCheckUtils]: 60: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,570 INFO L290 TraceCheckUtils]: 61: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-28 10:33:57,570 INFO L290 TraceCheckUtils]: 62: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,570 INFO L290 TraceCheckUtils]: 63: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-28 10:33:57,570 INFO L290 TraceCheckUtils]: 64: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,570 INFO L290 TraceCheckUtils]: 65: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-28 10:33:57,570 INFO L290 TraceCheckUtils]: 66: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,570 INFO L290 TraceCheckUtils]: 67: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-28 10:33:57,570 INFO L290 TraceCheckUtils]: 68: Hoare triple {4996#false} assume !(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,570 INFO L290 TraceCheckUtils]: 69: Hoare triple {4996#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4996#false} is VALID [2022-04-28 10:33:57,571 INFO L290 TraceCheckUtils]: 70: Hoare triple {4996#false} assume !(~b~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,571 INFO L290 TraceCheckUtils]: 71: Hoare triple {4996#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4996#false} is VALID [2022-04-28 10:33:57,571 INFO L290 TraceCheckUtils]: 72: Hoare triple {4996#false} assume !(~a~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,571 INFO L290 TraceCheckUtils]: 73: Hoare triple {4996#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {4996#false} is VALID [2022-04-28 10:33:57,571 INFO L290 TraceCheckUtils]: 74: Hoare triple {4996#false} assume !false; {4996#false} is VALID [2022-04-28 10:33:57,571 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 355 proven. 89 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-04-28 10:33:57,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:33:57,816 INFO L290 TraceCheckUtils]: 74: Hoare triple {4996#false} assume !false; {4996#false} is VALID [2022-04-28 10:33:57,816 INFO L290 TraceCheckUtils]: 73: Hoare triple {4996#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {4996#false} is VALID [2022-04-28 10:33:57,816 INFO L290 TraceCheckUtils]: 72: Hoare triple {4996#false} assume !(~a~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,816 INFO L290 TraceCheckUtils]: 71: Hoare triple {4996#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4996#false} is VALID [2022-04-28 10:33:57,816 INFO L290 TraceCheckUtils]: 70: Hoare triple {4996#false} assume !(~b~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,816 INFO L290 TraceCheckUtils]: 69: Hoare triple {4996#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4996#false} is VALID [2022-04-28 10:33:57,816 INFO L290 TraceCheckUtils]: 68: Hoare triple {4996#false} assume !(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,816 INFO L290 TraceCheckUtils]: 67: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-28 10:33:57,817 INFO L290 TraceCheckUtils]: 66: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,817 INFO L290 TraceCheckUtils]: 65: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-28 10:33:57,817 INFO L290 TraceCheckUtils]: 64: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,817 INFO L290 TraceCheckUtils]: 63: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-28 10:33:57,817 INFO L290 TraceCheckUtils]: 62: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,817 INFO L290 TraceCheckUtils]: 61: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-28 10:33:57,817 INFO L290 TraceCheckUtils]: 60: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,817 INFO L290 TraceCheckUtils]: 59: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-28 10:33:57,817 INFO L290 TraceCheckUtils]: 58: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,817 INFO L290 TraceCheckUtils]: 57: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-28 10:33:57,817 INFO L290 TraceCheckUtils]: 56: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,817 INFO L290 TraceCheckUtils]: 55: Hoare triple {4996#false} assume !!(~b~0 < 6);~c~0 := 0; {4996#false} is VALID [2022-04-28 10:33:57,817 INFO L290 TraceCheckUtils]: 54: Hoare triple {4996#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4996#false} is VALID [2022-04-28 10:33:57,817 INFO L290 TraceCheckUtils]: 53: Hoare triple {4996#false} assume !(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,817 INFO L290 TraceCheckUtils]: 52: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-28 10:33:57,817 INFO L290 TraceCheckUtils]: 51: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,817 INFO L290 TraceCheckUtils]: 50: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-28 10:33:57,818 INFO L290 TraceCheckUtils]: 49: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,818 INFO L290 TraceCheckUtils]: 48: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-28 10:33:57,818 INFO L290 TraceCheckUtils]: 47: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,818 INFO L290 TraceCheckUtils]: 46: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-28 10:33:57,818 INFO L290 TraceCheckUtils]: 45: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,818 INFO L290 TraceCheckUtils]: 44: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-28 10:33:57,818 INFO L290 TraceCheckUtils]: 43: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,818 INFO L290 TraceCheckUtils]: 42: Hoare triple {4996#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4996#false} is VALID [2022-04-28 10:33:57,818 INFO L290 TraceCheckUtils]: 41: Hoare triple {4996#false} assume !!(~c~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,818 INFO L290 TraceCheckUtils]: 40: Hoare triple {4996#false} assume !!(~b~0 < 6);~c~0 := 0; {4996#false} is VALID [2022-04-28 10:33:57,818 INFO L290 TraceCheckUtils]: 39: Hoare triple {4996#false} assume !!(~a~0 < 6);~b~0 := 0; {4996#false} is VALID [2022-04-28 10:33:57,818 INFO L290 TraceCheckUtils]: 38: Hoare triple {4996#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4996#false} is VALID [2022-04-28 10:33:57,818 INFO L290 TraceCheckUtils]: 37: Hoare triple {5341#(< main_~b~0 6)} assume !(~b~0 < 6); {4996#false} is VALID [2022-04-28 10:33:57,819 INFO L290 TraceCheckUtils]: 36: Hoare triple {5345#(< main_~b~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {5341#(< main_~b~0 6)} is VALID [2022-04-28 10:33:57,819 INFO L290 TraceCheckUtils]: 35: Hoare triple {5345#(< main_~b~0 5)} assume !(~c~0 < 6); {5345#(< main_~b~0 5)} is VALID [2022-04-28 10:33:57,819 INFO L290 TraceCheckUtils]: 34: Hoare triple {5345#(< main_~b~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5345#(< main_~b~0 5)} is VALID [2022-04-28 10:33:57,820 INFO L290 TraceCheckUtils]: 33: Hoare triple {5345#(< main_~b~0 5)} assume !!(~c~0 < 6); {5345#(< main_~b~0 5)} is VALID [2022-04-28 10:33:57,820 INFO L290 TraceCheckUtils]: 32: Hoare triple {5345#(< main_~b~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5345#(< main_~b~0 5)} is VALID [2022-04-28 10:33:57,820 INFO L290 TraceCheckUtils]: 31: Hoare triple {5345#(< main_~b~0 5)} assume !!(~c~0 < 6); {5345#(< main_~b~0 5)} is VALID [2022-04-28 10:33:57,820 INFO L290 TraceCheckUtils]: 30: Hoare triple {5345#(< main_~b~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5345#(< main_~b~0 5)} is VALID [2022-04-28 10:33:57,821 INFO L290 TraceCheckUtils]: 29: Hoare triple {5345#(< main_~b~0 5)} assume !!(~c~0 < 6); {5345#(< main_~b~0 5)} is VALID [2022-04-28 10:33:57,821 INFO L290 TraceCheckUtils]: 28: Hoare triple {5345#(< main_~b~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5345#(< main_~b~0 5)} is VALID [2022-04-28 10:33:57,821 INFO L290 TraceCheckUtils]: 27: Hoare triple {5345#(< main_~b~0 5)} assume !!(~c~0 < 6); {5345#(< main_~b~0 5)} is VALID [2022-04-28 10:33:57,821 INFO L290 TraceCheckUtils]: 26: Hoare triple {5345#(< main_~b~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5345#(< main_~b~0 5)} is VALID [2022-04-28 10:33:57,822 INFO L290 TraceCheckUtils]: 25: Hoare triple {5345#(< main_~b~0 5)} assume !!(~c~0 < 6); {5345#(< main_~b~0 5)} is VALID [2022-04-28 10:33:57,822 INFO L290 TraceCheckUtils]: 24: Hoare triple {5345#(< main_~b~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5345#(< main_~b~0 5)} is VALID [2022-04-28 10:33:57,822 INFO L290 TraceCheckUtils]: 23: Hoare triple {5345#(< main_~b~0 5)} assume !!(~c~0 < 6); {5345#(< main_~b~0 5)} is VALID [2022-04-28 10:33:57,823 INFO L290 TraceCheckUtils]: 22: Hoare triple {5345#(< main_~b~0 5)} assume !!(~b~0 < 6);~c~0 := 0; {5345#(< main_~b~0 5)} is VALID [2022-04-28 10:33:57,823 INFO L290 TraceCheckUtils]: 21: Hoare triple {5391#(< main_~b~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {5345#(< main_~b~0 5)} is VALID [2022-04-28 10:33:57,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {5391#(< main_~b~0 4)} assume !(~c~0 < 6); {5391#(< main_~b~0 4)} is VALID [2022-04-28 10:33:57,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {5391#(< main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5391#(< main_~b~0 4)} is VALID [2022-04-28 10:33:57,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {5391#(< main_~b~0 4)} assume !!(~c~0 < 6); {5391#(< main_~b~0 4)} is VALID [2022-04-28 10:33:57,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {5391#(< main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5391#(< main_~b~0 4)} is VALID [2022-04-28 10:33:57,824 INFO L290 TraceCheckUtils]: 16: Hoare triple {5391#(< main_~b~0 4)} assume !!(~c~0 < 6); {5391#(< main_~b~0 4)} is VALID [2022-04-28 10:33:57,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {5391#(< main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5391#(< main_~b~0 4)} is VALID [2022-04-28 10:33:57,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {5391#(< main_~b~0 4)} assume !!(~c~0 < 6); {5391#(< main_~b~0 4)} is VALID [2022-04-28 10:33:57,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {5391#(< main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5391#(< main_~b~0 4)} is VALID [2022-04-28 10:33:57,825 INFO L290 TraceCheckUtils]: 12: Hoare triple {5391#(< main_~b~0 4)} assume !!(~c~0 < 6); {5391#(< main_~b~0 4)} is VALID [2022-04-28 10:33:57,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {5391#(< main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5391#(< main_~b~0 4)} is VALID [2022-04-28 10:33:57,826 INFO L290 TraceCheckUtils]: 10: Hoare triple {5391#(< main_~b~0 4)} assume !!(~c~0 < 6); {5391#(< main_~b~0 4)} is VALID [2022-04-28 10:33:57,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {5391#(< main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5391#(< main_~b~0 4)} is VALID [2022-04-28 10:33:57,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {5391#(< main_~b~0 4)} assume !!(~c~0 < 6); {5391#(< main_~b~0 4)} is VALID [2022-04-28 10:33:57,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {5391#(< main_~b~0 4)} assume !!(~b~0 < 6);~c~0 := 0; {5391#(< main_~b~0 4)} is VALID [2022-04-28 10:33:57,827 INFO L290 TraceCheckUtils]: 6: Hoare triple {4995#true} assume !!(~a~0 < 6);~b~0 := 0; {5391#(< main_~b~0 4)} is VALID [2022-04-28 10:33:57,827 INFO L290 TraceCheckUtils]: 5: Hoare triple {4995#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {4995#true} is VALID [2022-04-28 10:33:57,827 INFO L272 TraceCheckUtils]: 4: Hoare triple {4995#true} call #t~ret7 := main(); {4995#true} is VALID [2022-04-28 10:33:57,827 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4995#true} {4995#true} #56#return; {4995#true} is VALID [2022-04-28 10:33:57,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {4995#true} assume true; {4995#true} is VALID [2022-04-28 10:33:57,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {4995#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(11, 2);call #Ultimate.allocInit(12, 3); {4995#true} is VALID [2022-04-28 10:33:57,827 INFO L272 TraceCheckUtils]: 0: Hoare triple {4995#true} call ULTIMATE.init(); {4995#true} is VALID [2022-04-28 10:33:57,828 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 355 proven. 89 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-04-28 10:33:57,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942027601] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:33:57,828 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:33:57,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-28 10:33:57,828 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:57,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [533282616] [2022-04-28 10:33:57,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [533282616] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:57,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:57,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:33:57,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560840723] [2022-04-28 10:33:57,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:57,829 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-28 10:33:57,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:57,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:57,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:57,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:33:57,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:57,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:33:57,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:33:57,848 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:58,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:58,125 INFO L93 Difference]: Finished difference Result 172 states and 187 transitions. [2022-04-28 10:33:58,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:33:58,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-28 10:33:58,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:58,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:58,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-28 10:33:58,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:58,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-28 10:33:58,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-28 10:33:58,162 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 10:33:58,164 INFO L225 Difference]: With dead ends: 172 [2022-04-28 10:33:58,164 INFO L226 Difference]: Without dead ends: 134 [2022-04-28 10:33:58,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:33:58,165 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 36 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:58,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 27 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:33:58,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-28 10:33:58,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 106. [2022-04-28 10:33:58,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:58,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 106 states, 102 states have (on average 1.088235294117647) internal successors, (111), 102 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:58,311 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 106 states, 102 states have (on average 1.088235294117647) internal successors, (111), 102 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:58,311 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 106 states, 102 states have (on average 1.088235294117647) internal successors, (111), 102 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:58,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:58,313 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2022-04-28 10:33:58,313 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2022-04-28 10:33:58,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:58,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:58,314 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 102 states have (on average 1.088235294117647) internal successors, (111), 102 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 10:33:58,314 INFO L87 Difference]: Start difference. First operand has 106 states, 102 states have (on average 1.088235294117647) internal successors, (111), 102 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 10:33:58,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:58,317 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2022-04-28 10:33:58,317 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2022-04-28 10:33:58,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:58,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:58,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:58,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:58,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 102 states have (on average 1.088235294117647) internal successors, (111), 102 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:58,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2022-04-28 10:33:58,319 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 75 [2022-04-28 10:33:58,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:58,319 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2022-04-28 10:33:58,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:58,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 114 transitions. [2022-04-28 10:33:58,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:58,441 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2022-04-28 10:33:58,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-28 10:33:58,442 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:58,442 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:58,459 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 10:33:58,647 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,SelfDestructingSolverStorable11 [2022-04-28 10:33:58,648 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:58,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:58,648 INFO L85 PathProgramCache]: Analyzing trace with hash 2068267583, now seen corresponding path program 17 times [2022-04-28 10:33:58,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:58,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [565040306] [2022-04-28 10:33:58,889 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:58,965 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:58,965 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:58,965 INFO L85 PathProgramCache]: Analyzing trace with hash 2068267583, now seen corresponding path program 18 times [2022-04-28 10:33:58,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:58,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693739493] [2022-04-28 10:33:58,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:58,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:59,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:59,046 INFO L290 TraceCheckUtils]: 0: Hoare triple {6296#(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(11, 2);call #Ultimate.allocInit(12, 3); {6287#true} is VALID [2022-04-28 10:33:59,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {6287#true} assume true; {6287#true} is VALID [2022-04-28 10:33:59,047 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6287#true} {6287#true} #56#return; {6287#true} is VALID [2022-04-28 10:33:59,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {6287#true} call ULTIMATE.init(); {6296#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:59,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {6296#(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(11, 2);call #Ultimate.allocInit(12, 3); {6287#true} is VALID [2022-04-28 10:33:59,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {6287#true} assume true; {6287#true} is VALID [2022-04-28 10:33:59,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6287#true} {6287#true} #56#return; {6287#true} is VALID [2022-04-28 10:33:59,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {6287#true} call #t~ret7 := main(); {6287#true} is VALID [2022-04-28 10:33:59,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {6287#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {6287#true} is VALID [2022-04-28 10:33:59,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {6287#true} assume !!(~a~0 < 6);~b~0 := 0; {6292#(= main_~b~0 0)} is VALID [2022-04-28 10:33:59,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {6292#(= main_~b~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {6292#(= main_~b~0 0)} is VALID [2022-04-28 10:33:59,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {6292#(= main_~b~0 0)} assume !!(~c~0 < 6); {6292#(= main_~b~0 0)} is VALID [2022-04-28 10:33:59,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {6292#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6292#(= main_~b~0 0)} is VALID [2022-04-28 10:33:59,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {6292#(= main_~b~0 0)} assume !!(~c~0 < 6); {6292#(= main_~b~0 0)} is VALID [2022-04-28 10:33:59,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {6292#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6292#(= main_~b~0 0)} is VALID [2022-04-28 10:33:59,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {6292#(= main_~b~0 0)} assume !!(~c~0 < 6); {6292#(= main_~b~0 0)} is VALID [2022-04-28 10:33:59,050 INFO L290 TraceCheckUtils]: 13: Hoare triple {6292#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6292#(= main_~b~0 0)} is VALID [2022-04-28 10:33:59,050 INFO L290 TraceCheckUtils]: 14: Hoare triple {6292#(= main_~b~0 0)} assume !!(~c~0 < 6); {6292#(= main_~b~0 0)} is VALID [2022-04-28 10:33:59,050 INFO L290 TraceCheckUtils]: 15: Hoare triple {6292#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6292#(= main_~b~0 0)} is VALID [2022-04-28 10:33:59,051 INFO L290 TraceCheckUtils]: 16: Hoare triple {6292#(= main_~b~0 0)} assume !!(~c~0 < 6); {6292#(= main_~b~0 0)} is VALID [2022-04-28 10:33:59,051 INFO L290 TraceCheckUtils]: 17: Hoare triple {6292#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6292#(= main_~b~0 0)} is VALID [2022-04-28 10:33:59,051 INFO L290 TraceCheckUtils]: 18: Hoare triple {6292#(= main_~b~0 0)} assume !!(~c~0 < 6); {6292#(= main_~b~0 0)} is VALID [2022-04-28 10:33:59,052 INFO L290 TraceCheckUtils]: 19: Hoare triple {6292#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6292#(= main_~b~0 0)} is VALID [2022-04-28 10:33:59,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {6292#(= main_~b~0 0)} assume !(~c~0 < 6); {6292#(= main_~b~0 0)} is VALID [2022-04-28 10:33:59,052 INFO L290 TraceCheckUtils]: 21: Hoare triple {6292#(= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {6293#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:59,052 INFO L290 TraceCheckUtils]: 22: Hoare triple {6293#(<= main_~b~0 1)} assume !!(~b~0 < 6);~c~0 := 0; {6293#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:59,053 INFO L290 TraceCheckUtils]: 23: Hoare triple {6293#(<= main_~b~0 1)} assume !!(~c~0 < 6); {6293#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:59,053 INFO L290 TraceCheckUtils]: 24: Hoare triple {6293#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6293#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:59,053 INFO L290 TraceCheckUtils]: 25: Hoare triple {6293#(<= main_~b~0 1)} assume !!(~c~0 < 6); {6293#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:59,054 INFO L290 TraceCheckUtils]: 26: Hoare triple {6293#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6293#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:59,054 INFO L290 TraceCheckUtils]: 27: Hoare triple {6293#(<= main_~b~0 1)} assume !!(~c~0 < 6); {6293#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:59,054 INFO L290 TraceCheckUtils]: 28: Hoare triple {6293#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6293#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:59,054 INFO L290 TraceCheckUtils]: 29: Hoare triple {6293#(<= main_~b~0 1)} assume !!(~c~0 < 6); {6293#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:59,055 INFO L290 TraceCheckUtils]: 30: Hoare triple {6293#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6293#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:59,055 INFO L290 TraceCheckUtils]: 31: Hoare triple {6293#(<= main_~b~0 1)} assume !!(~c~0 < 6); {6293#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:59,055 INFO L290 TraceCheckUtils]: 32: Hoare triple {6293#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6293#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:59,055 INFO L290 TraceCheckUtils]: 33: Hoare triple {6293#(<= main_~b~0 1)} assume !!(~c~0 < 6); {6293#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:59,056 INFO L290 TraceCheckUtils]: 34: Hoare triple {6293#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6293#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:59,056 INFO L290 TraceCheckUtils]: 35: Hoare triple {6293#(<= main_~b~0 1)} assume !(~c~0 < 6); {6293#(<= main_~b~0 1)} is VALID [2022-04-28 10:33:59,057 INFO L290 TraceCheckUtils]: 36: Hoare triple {6293#(<= main_~b~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {6294#(<= main_~b~0 2)} is VALID [2022-04-28 10:33:59,057 INFO L290 TraceCheckUtils]: 37: Hoare triple {6294#(<= main_~b~0 2)} assume !!(~b~0 < 6);~c~0 := 0; {6294#(<= main_~b~0 2)} is VALID [2022-04-28 10:33:59,057 INFO L290 TraceCheckUtils]: 38: Hoare triple {6294#(<= main_~b~0 2)} assume !!(~c~0 < 6); {6294#(<= main_~b~0 2)} is VALID [2022-04-28 10:33:59,057 INFO L290 TraceCheckUtils]: 39: Hoare triple {6294#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6294#(<= main_~b~0 2)} is VALID [2022-04-28 10:33:59,058 INFO L290 TraceCheckUtils]: 40: Hoare triple {6294#(<= main_~b~0 2)} assume !!(~c~0 < 6); {6294#(<= main_~b~0 2)} is VALID [2022-04-28 10:33:59,058 INFO L290 TraceCheckUtils]: 41: Hoare triple {6294#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6294#(<= main_~b~0 2)} is VALID [2022-04-28 10:33:59,058 INFO L290 TraceCheckUtils]: 42: Hoare triple {6294#(<= main_~b~0 2)} assume !!(~c~0 < 6); {6294#(<= main_~b~0 2)} is VALID [2022-04-28 10:33:59,059 INFO L290 TraceCheckUtils]: 43: Hoare triple {6294#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6294#(<= main_~b~0 2)} is VALID [2022-04-28 10:33:59,059 INFO L290 TraceCheckUtils]: 44: Hoare triple {6294#(<= main_~b~0 2)} assume !!(~c~0 < 6); {6294#(<= main_~b~0 2)} is VALID [2022-04-28 10:33:59,059 INFO L290 TraceCheckUtils]: 45: Hoare triple {6294#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6294#(<= main_~b~0 2)} is VALID [2022-04-28 10:33:59,059 INFO L290 TraceCheckUtils]: 46: Hoare triple {6294#(<= main_~b~0 2)} assume !!(~c~0 < 6); {6294#(<= main_~b~0 2)} is VALID [2022-04-28 10:33:59,060 INFO L290 TraceCheckUtils]: 47: Hoare triple {6294#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6294#(<= main_~b~0 2)} is VALID [2022-04-28 10:33:59,060 INFO L290 TraceCheckUtils]: 48: Hoare triple {6294#(<= main_~b~0 2)} assume !!(~c~0 < 6); {6294#(<= main_~b~0 2)} is VALID [2022-04-28 10:33:59,060 INFO L290 TraceCheckUtils]: 49: Hoare triple {6294#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6294#(<= main_~b~0 2)} is VALID [2022-04-28 10:33:59,060 INFO L290 TraceCheckUtils]: 50: Hoare triple {6294#(<= main_~b~0 2)} assume !(~c~0 < 6); {6294#(<= main_~b~0 2)} is VALID [2022-04-28 10:33:59,061 INFO L290 TraceCheckUtils]: 51: Hoare triple {6294#(<= main_~b~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {6295#(<= main_~b~0 3)} is VALID [2022-04-28 10:33:59,061 INFO L290 TraceCheckUtils]: 52: Hoare triple {6295#(<= main_~b~0 3)} assume !(~b~0 < 6); {6288#false} is VALID [2022-04-28 10:33:59,061 INFO L290 TraceCheckUtils]: 53: Hoare triple {6288#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {6288#false} is VALID [2022-04-28 10:33:59,061 INFO L290 TraceCheckUtils]: 54: Hoare triple {6288#false} assume !!(~a~0 < 6);~b~0 := 0; {6288#false} is VALID [2022-04-28 10:33:59,062 INFO L290 TraceCheckUtils]: 55: Hoare triple {6288#false} assume !!(~b~0 < 6);~c~0 := 0; {6288#false} is VALID [2022-04-28 10:33:59,062 INFO L290 TraceCheckUtils]: 56: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-28 10:33:59,062 INFO L290 TraceCheckUtils]: 57: Hoare triple {6288#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6288#false} is VALID [2022-04-28 10:33:59,062 INFO L290 TraceCheckUtils]: 58: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-28 10:33:59,062 INFO L290 TraceCheckUtils]: 59: Hoare triple {6288#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6288#false} is VALID [2022-04-28 10:33:59,062 INFO L290 TraceCheckUtils]: 60: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-28 10:33:59,062 INFO L290 TraceCheckUtils]: 61: Hoare triple {6288#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6288#false} is VALID [2022-04-28 10:33:59,062 INFO L290 TraceCheckUtils]: 62: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-28 10:33:59,062 INFO L290 TraceCheckUtils]: 63: Hoare triple {6288#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6288#false} is VALID [2022-04-28 10:33:59,062 INFO L290 TraceCheckUtils]: 64: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-28 10:33:59,062 INFO L290 TraceCheckUtils]: 65: Hoare triple {6288#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6288#false} is VALID [2022-04-28 10:33:59,062 INFO L290 TraceCheckUtils]: 66: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-28 10:33:59,063 INFO L290 TraceCheckUtils]: 67: Hoare triple {6288#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6288#false} is VALID [2022-04-28 10:33:59,063 INFO L290 TraceCheckUtils]: 68: Hoare triple {6288#false} assume !(~c~0 < 6); {6288#false} is VALID [2022-04-28 10:33:59,063 INFO L290 TraceCheckUtils]: 69: Hoare triple {6288#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {6288#false} is VALID [2022-04-28 10:33:59,063 INFO L290 TraceCheckUtils]: 70: Hoare triple {6288#false} assume !!(~b~0 < 6);~c~0 := 0; {6288#false} is VALID [2022-04-28 10:33:59,063 INFO L290 TraceCheckUtils]: 71: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-28 10:33:59,063 INFO L290 TraceCheckUtils]: 72: Hoare triple {6288#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6288#false} is VALID [2022-04-28 10:33:59,063 INFO L290 TraceCheckUtils]: 73: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-28 10:33:59,063 INFO L290 TraceCheckUtils]: 74: Hoare triple {6288#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6288#false} is VALID [2022-04-28 10:33:59,063 INFO L290 TraceCheckUtils]: 75: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-28 10:33:59,063 INFO L290 TraceCheckUtils]: 76: Hoare triple {6288#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6288#false} is VALID [2022-04-28 10:33:59,063 INFO L290 TraceCheckUtils]: 77: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-28 10:33:59,063 INFO L290 TraceCheckUtils]: 78: Hoare triple {6288#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6288#false} is VALID [2022-04-28 10:33:59,063 INFO L290 TraceCheckUtils]: 79: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-28 10:33:59,064 INFO L290 TraceCheckUtils]: 80: Hoare triple {6288#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6288#false} is VALID [2022-04-28 10:33:59,064 INFO L290 TraceCheckUtils]: 81: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-28 10:33:59,064 INFO L290 TraceCheckUtils]: 82: Hoare triple {6288#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6288#false} is VALID [2022-04-28 10:33:59,064 INFO L290 TraceCheckUtils]: 83: Hoare triple {6288#false} assume !(~c~0 < 6); {6288#false} is VALID [2022-04-28 10:33:59,064 INFO L290 TraceCheckUtils]: 84: Hoare triple {6288#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {6288#false} is VALID [2022-04-28 10:33:59,064 INFO L290 TraceCheckUtils]: 85: Hoare triple {6288#false} assume !!(~b~0 < 6);~c~0 := 0; {6288#false} is VALID [2022-04-28 10:33:59,064 INFO L290 TraceCheckUtils]: 86: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-28 10:33:59,064 INFO L290 TraceCheckUtils]: 87: Hoare triple {6288#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6288#false} is VALID [2022-04-28 10:33:59,064 INFO L290 TraceCheckUtils]: 88: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-28 10:33:59,064 INFO L290 TraceCheckUtils]: 89: Hoare triple {6288#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6288#false} is VALID [2022-04-28 10:33:59,064 INFO L290 TraceCheckUtils]: 90: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-28 10:33:59,065 INFO L290 TraceCheckUtils]: 91: Hoare triple {6288#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6288#false} is VALID [2022-04-28 10:33:59,065 INFO L290 TraceCheckUtils]: 92: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-28 10:33:59,065 INFO L290 TraceCheckUtils]: 93: Hoare triple {6288#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6288#false} is VALID [2022-04-28 10:33:59,065 INFO L290 TraceCheckUtils]: 94: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-28 10:33:59,065 INFO L290 TraceCheckUtils]: 95: Hoare triple {6288#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6288#false} is VALID [2022-04-28 10:33:59,065 INFO L290 TraceCheckUtils]: 96: Hoare triple {6288#false} assume !!(~c~0 < 6); {6288#false} is VALID [2022-04-28 10:33:59,065 INFO L290 TraceCheckUtils]: 97: Hoare triple {6288#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6288#false} is VALID [2022-04-28 10:33:59,065 INFO L290 TraceCheckUtils]: 98: Hoare triple {6288#false} assume !(~c~0 < 6); {6288#false} is VALID [2022-04-28 10:33:59,065 INFO L290 TraceCheckUtils]: 99: Hoare triple {6288#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {6288#false} is VALID [2022-04-28 10:33:59,065 INFO L290 TraceCheckUtils]: 100: Hoare triple {6288#false} assume !(~b~0 < 6); {6288#false} is VALID [2022-04-28 10:33:59,065 INFO L290 TraceCheckUtils]: 101: Hoare triple {6288#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {6288#false} is VALID [2022-04-28 10:33:59,065 INFO L290 TraceCheckUtils]: 102: Hoare triple {6288#false} assume !(~a~0 < 6); {6288#false} is VALID [2022-04-28 10:33:59,065 INFO L290 TraceCheckUtils]: 103: Hoare triple {6288#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {6288#false} is VALID [2022-04-28 10:33:59,066 INFO L290 TraceCheckUtils]: 104: Hoare triple {6288#false} assume !false; {6288#false} is VALID [2022-04-28 10:33:59,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 792 proven. 264 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2022-04-28 10:33:59,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:59,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693739493] [2022-04-28 10:33:59,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693739493] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:33:59,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467252236] [2022-04-28 10:33:59,067 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:33:59,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:59,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:59,068 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 10:33:59,077 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 10:33:59,147 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2022-04-28 10:33:59,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:59,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 10:33:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:59,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:59,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {6287#true} call ULTIMATE.init(); {6287#true} is VALID [2022-04-28 10:33:59,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {6287#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(11, 2);call #Ultimate.allocInit(12, 3); {6287#true} is VALID [2022-04-28 10:33:59,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {6287#true} assume true; {6287#true} is VALID [2022-04-28 10:33:59,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6287#true} {6287#true} #56#return; {6287#true} is VALID [2022-04-28 10:33:59,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {6287#true} call #t~ret7 := main(); {6287#true} is VALID [2022-04-28 10:33:59,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {6287#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~a~0 < 6);~b~0 := 0; {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {6315#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,580 INFO L290 TraceCheckUtils]: 10: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {6315#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,581 INFO L290 TraceCheckUtils]: 12: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {6315#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,582 INFO L290 TraceCheckUtils]: 15: Hoare triple {6315#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,582 INFO L290 TraceCheckUtils]: 16: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {6315#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,583 INFO L290 TraceCheckUtils]: 18: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {6315#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,584 INFO L290 TraceCheckUtils]: 20: Hoare triple {6315#(<= main_~a~0 0)} assume !(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,584 INFO L290 TraceCheckUtils]: 21: Hoare triple {6315#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,585 INFO L290 TraceCheckUtils]: 22: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,585 INFO L290 TraceCheckUtils]: 23: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,585 INFO L290 TraceCheckUtils]: 24: Hoare triple {6315#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,586 INFO L290 TraceCheckUtils]: 25: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,586 INFO L290 TraceCheckUtils]: 26: Hoare triple {6315#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,586 INFO L290 TraceCheckUtils]: 27: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,587 INFO L290 TraceCheckUtils]: 28: Hoare triple {6315#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,587 INFO L290 TraceCheckUtils]: 29: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,587 INFO L290 TraceCheckUtils]: 30: Hoare triple {6315#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,588 INFO L290 TraceCheckUtils]: 31: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,588 INFO L290 TraceCheckUtils]: 32: Hoare triple {6315#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,589 INFO L290 TraceCheckUtils]: 33: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,589 INFO L290 TraceCheckUtils]: 34: Hoare triple {6315#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,589 INFO L290 TraceCheckUtils]: 35: Hoare triple {6315#(<= main_~a~0 0)} assume !(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,590 INFO L290 TraceCheckUtils]: 36: Hoare triple {6315#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,590 INFO L290 TraceCheckUtils]: 37: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,590 INFO L290 TraceCheckUtils]: 38: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,591 INFO L290 TraceCheckUtils]: 39: Hoare triple {6315#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,591 INFO L290 TraceCheckUtils]: 40: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,591 INFO L290 TraceCheckUtils]: 41: Hoare triple {6315#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,592 INFO L290 TraceCheckUtils]: 42: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,592 INFO L290 TraceCheckUtils]: 43: Hoare triple {6315#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,592 INFO L290 TraceCheckUtils]: 44: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,593 INFO L290 TraceCheckUtils]: 45: Hoare triple {6315#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,593 INFO L290 TraceCheckUtils]: 46: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,594 INFO L290 TraceCheckUtils]: 47: Hoare triple {6315#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,594 INFO L290 TraceCheckUtils]: 48: Hoare triple {6315#(<= main_~a~0 0)} assume !!(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,594 INFO L290 TraceCheckUtils]: 49: Hoare triple {6315#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,595 INFO L290 TraceCheckUtils]: 50: Hoare triple {6315#(<= main_~a~0 0)} assume !(~c~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,595 INFO L290 TraceCheckUtils]: 51: Hoare triple {6315#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,595 INFO L290 TraceCheckUtils]: 52: Hoare triple {6315#(<= main_~a~0 0)} assume !(~b~0 < 6); {6315#(<= main_~a~0 0)} is VALID [2022-04-28 10:33:59,596 INFO L290 TraceCheckUtils]: 53: Hoare triple {6315#(<= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,596 INFO L290 TraceCheckUtils]: 54: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~a~0 < 6);~b~0 := 0; {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,596 INFO L290 TraceCheckUtils]: 55: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~b~0 < 6);~c~0 := 0; {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,597 INFO L290 TraceCheckUtils]: 56: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,597 INFO L290 TraceCheckUtils]: 57: Hoare triple {6460#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,597 INFO L290 TraceCheckUtils]: 58: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,598 INFO L290 TraceCheckUtils]: 59: Hoare triple {6460#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,598 INFO L290 TraceCheckUtils]: 60: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,598 INFO L290 TraceCheckUtils]: 61: Hoare triple {6460#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,598 INFO L290 TraceCheckUtils]: 62: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,599 INFO L290 TraceCheckUtils]: 63: Hoare triple {6460#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,599 INFO L290 TraceCheckUtils]: 64: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,599 INFO L290 TraceCheckUtils]: 65: Hoare triple {6460#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,599 INFO L290 TraceCheckUtils]: 66: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,600 INFO L290 TraceCheckUtils]: 67: Hoare triple {6460#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,600 INFO L290 TraceCheckUtils]: 68: Hoare triple {6460#(<= main_~a~0 1)} assume !(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,600 INFO L290 TraceCheckUtils]: 69: Hoare triple {6460#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,600 INFO L290 TraceCheckUtils]: 70: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~b~0 < 6);~c~0 := 0; {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,601 INFO L290 TraceCheckUtils]: 71: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,601 INFO L290 TraceCheckUtils]: 72: Hoare triple {6460#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,601 INFO L290 TraceCheckUtils]: 73: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,602 INFO L290 TraceCheckUtils]: 74: Hoare triple {6460#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,602 INFO L290 TraceCheckUtils]: 75: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,602 INFO L290 TraceCheckUtils]: 76: Hoare triple {6460#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,603 INFO L290 TraceCheckUtils]: 77: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,603 INFO L290 TraceCheckUtils]: 78: Hoare triple {6460#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,603 INFO L290 TraceCheckUtils]: 79: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,604 INFO L290 TraceCheckUtils]: 80: Hoare triple {6460#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,604 INFO L290 TraceCheckUtils]: 81: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,604 INFO L290 TraceCheckUtils]: 82: Hoare triple {6460#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,604 INFO L290 TraceCheckUtils]: 83: Hoare triple {6460#(<= main_~a~0 1)} assume !(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,605 INFO L290 TraceCheckUtils]: 84: Hoare triple {6460#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,605 INFO L290 TraceCheckUtils]: 85: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~b~0 < 6);~c~0 := 0; {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,606 INFO L290 TraceCheckUtils]: 86: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,606 INFO L290 TraceCheckUtils]: 87: Hoare triple {6460#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,606 INFO L290 TraceCheckUtils]: 88: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,607 INFO L290 TraceCheckUtils]: 89: Hoare triple {6460#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,607 INFO L290 TraceCheckUtils]: 90: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,607 INFO L290 TraceCheckUtils]: 91: Hoare triple {6460#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,607 INFO L290 TraceCheckUtils]: 92: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,608 INFO L290 TraceCheckUtils]: 93: Hoare triple {6460#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,608 INFO L290 TraceCheckUtils]: 94: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,608 INFO L290 TraceCheckUtils]: 95: Hoare triple {6460#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,609 INFO L290 TraceCheckUtils]: 96: Hoare triple {6460#(<= main_~a~0 1)} assume !!(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,609 INFO L290 TraceCheckUtils]: 97: Hoare triple {6460#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,609 INFO L290 TraceCheckUtils]: 98: Hoare triple {6460#(<= main_~a~0 1)} assume !(~c~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,610 INFO L290 TraceCheckUtils]: 99: Hoare triple {6460#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,610 INFO L290 TraceCheckUtils]: 100: Hoare triple {6460#(<= main_~a~0 1)} assume !(~b~0 < 6); {6460#(<= main_~a~0 1)} is VALID [2022-04-28 10:33:59,610 INFO L290 TraceCheckUtils]: 101: Hoare triple {6460#(<= main_~a~0 1)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {6605#(<= main_~a~0 2)} is VALID [2022-04-28 10:33:59,611 INFO L290 TraceCheckUtils]: 102: Hoare triple {6605#(<= main_~a~0 2)} assume !(~a~0 < 6); {6288#false} is VALID [2022-04-28 10:33:59,611 INFO L290 TraceCheckUtils]: 103: Hoare triple {6288#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {6288#false} is VALID [2022-04-28 10:33:59,611 INFO L290 TraceCheckUtils]: 104: Hoare triple {6288#false} assume !false; {6288#false} is VALID [2022-04-28 10:33:59,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 0 proven. 794 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2022-04-28 10:33:59,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:34:00,041 INFO L290 TraceCheckUtils]: 104: Hoare triple {6288#false} assume !false; {6288#false} is VALID [2022-04-28 10:34:00,041 INFO L290 TraceCheckUtils]: 103: Hoare triple {6288#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {6288#false} is VALID [2022-04-28 10:34:00,042 INFO L290 TraceCheckUtils]: 102: Hoare triple {6621#(< main_~a~0 6)} assume !(~a~0 < 6); {6288#false} is VALID [2022-04-28 10:34:00,042 INFO L290 TraceCheckUtils]: 101: Hoare triple {6625#(< main_~a~0 5)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {6621#(< main_~a~0 6)} is VALID [2022-04-28 10:34:00,043 INFO L290 TraceCheckUtils]: 100: Hoare triple {6625#(< main_~a~0 5)} assume !(~b~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,043 INFO L290 TraceCheckUtils]: 99: Hoare triple {6625#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,043 INFO L290 TraceCheckUtils]: 98: Hoare triple {6625#(< main_~a~0 5)} assume !(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,044 INFO L290 TraceCheckUtils]: 97: Hoare triple {6625#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,044 INFO L290 TraceCheckUtils]: 96: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,044 INFO L290 TraceCheckUtils]: 95: Hoare triple {6625#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,045 INFO L290 TraceCheckUtils]: 94: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,045 INFO L290 TraceCheckUtils]: 93: Hoare triple {6625#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,046 INFO L290 TraceCheckUtils]: 92: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,046 INFO L290 TraceCheckUtils]: 91: Hoare triple {6625#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,046 INFO L290 TraceCheckUtils]: 90: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,047 INFO L290 TraceCheckUtils]: 89: Hoare triple {6625#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,047 INFO L290 TraceCheckUtils]: 88: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,047 INFO L290 TraceCheckUtils]: 87: Hoare triple {6625#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,048 INFO L290 TraceCheckUtils]: 86: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,048 INFO L290 TraceCheckUtils]: 85: Hoare triple {6625#(< main_~a~0 5)} assume !!(~b~0 < 6);~c~0 := 0; {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,048 INFO L290 TraceCheckUtils]: 84: Hoare triple {6625#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,049 INFO L290 TraceCheckUtils]: 83: Hoare triple {6625#(< main_~a~0 5)} assume !(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,049 INFO L290 TraceCheckUtils]: 82: Hoare triple {6625#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,049 INFO L290 TraceCheckUtils]: 81: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,050 INFO L290 TraceCheckUtils]: 80: Hoare triple {6625#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,050 INFO L290 TraceCheckUtils]: 79: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,050 INFO L290 TraceCheckUtils]: 78: Hoare triple {6625#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,051 INFO L290 TraceCheckUtils]: 77: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,051 INFO L290 TraceCheckUtils]: 76: Hoare triple {6625#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,051 INFO L290 TraceCheckUtils]: 75: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,052 INFO L290 TraceCheckUtils]: 74: Hoare triple {6625#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,052 INFO L290 TraceCheckUtils]: 73: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,052 INFO L290 TraceCheckUtils]: 72: Hoare triple {6625#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,053 INFO L290 TraceCheckUtils]: 71: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,053 INFO L290 TraceCheckUtils]: 70: Hoare triple {6625#(< main_~a~0 5)} assume !!(~b~0 < 6);~c~0 := 0; {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,053 INFO L290 TraceCheckUtils]: 69: Hoare triple {6625#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,054 INFO L290 TraceCheckUtils]: 68: Hoare triple {6625#(< main_~a~0 5)} assume !(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,054 INFO L290 TraceCheckUtils]: 67: Hoare triple {6625#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,054 INFO L290 TraceCheckUtils]: 66: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,055 INFO L290 TraceCheckUtils]: 65: Hoare triple {6625#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,055 INFO L290 TraceCheckUtils]: 64: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,055 INFO L290 TraceCheckUtils]: 63: Hoare triple {6625#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,056 INFO L290 TraceCheckUtils]: 62: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,056 INFO L290 TraceCheckUtils]: 61: Hoare triple {6625#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,056 INFO L290 TraceCheckUtils]: 60: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,056 INFO L290 TraceCheckUtils]: 59: Hoare triple {6625#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,057 INFO L290 TraceCheckUtils]: 58: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,057 INFO L290 TraceCheckUtils]: 57: Hoare triple {6625#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,057 INFO L290 TraceCheckUtils]: 56: Hoare triple {6625#(< main_~a~0 5)} assume !!(~c~0 < 6); {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,057 INFO L290 TraceCheckUtils]: 55: Hoare triple {6625#(< main_~a~0 5)} assume !!(~b~0 < 6);~c~0 := 0; {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,058 INFO L290 TraceCheckUtils]: 54: Hoare triple {6625#(< main_~a~0 5)} assume !!(~a~0 < 6);~b~0 := 0; {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,058 INFO L290 TraceCheckUtils]: 53: Hoare triple {6770#(< main_~a~0 4)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {6625#(< main_~a~0 5)} is VALID [2022-04-28 10:34:00,063 INFO L290 TraceCheckUtils]: 52: Hoare triple {6770#(< main_~a~0 4)} assume !(~b~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,064 INFO L290 TraceCheckUtils]: 51: Hoare triple {6770#(< main_~a~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,064 INFO L290 TraceCheckUtils]: 50: Hoare triple {6770#(< main_~a~0 4)} assume !(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,064 INFO L290 TraceCheckUtils]: 49: Hoare triple {6770#(< main_~a~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,065 INFO L290 TraceCheckUtils]: 48: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,065 INFO L290 TraceCheckUtils]: 47: Hoare triple {6770#(< main_~a~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,065 INFO L290 TraceCheckUtils]: 46: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,066 INFO L290 TraceCheckUtils]: 45: Hoare triple {6770#(< main_~a~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,066 INFO L290 TraceCheckUtils]: 44: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,066 INFO L290 TraceCheckUtils]: 43: Hoare triple {6770#(< main_~a~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,067 INFO L290 TraceCheckUtils]: 42: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,067 INFO L290 TraceCheckUtils]: 41: Hoare triple {6770#(< main_~a~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,067 INFO L290 TraceCheckUtils]: 40: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,068 INFO L290 TraceCheckUtils]: 39: Hoare triple {6770#(< main_~a~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,068 INFO L290 TraceCheckUtils]: 38: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,068 INFO L290 TraceCheckUtils]: 37: Hoare triple {6770#(< main_~a~0 4)} assume !!(~b~0 < 6);~c~0 := 0; {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,069 INFO L290 TraceCheckUtils]: 36: Hoare triple {6770#(< main_~a~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,069 INFO L290 TraceCheckUtils]: 35: Hoare triple {6770#(< main_~a~0 4)} assume !(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,070 INFO L290 TraceCheckUtils]: 34: Hoare triple {6770#(< main_~a~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,070 INFO L290 TraceCheckUtils]: 33: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,070 INFO L290 TraceCheckUtils]: 32: Hoare triple {6770#(< main_~a~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,071 INFO L290 TraceCheckUtils]: 31: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,071 INFO L290 TraceCheckUtils]: 30: Hoare triple {6770#(< main_~a~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,071 INFO L290 TraceCheckUtils]: 29: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,072 INFO L290 TraceCheckUtils]: 28: Hoare triple {6770#(< main_~a~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,072 INFO L290 TraceCheckUtils]: 27: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,072 INFO L290 TraceCheckUtils]: 26: Hoare triple {6770#(< main_~a~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,073 INFO L290 TraceCheckUtils]: 25: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,073 INFO L290 TraceCheckUtils]: 24: Hoare triple {6770#(< main_~a~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,073 INFO L290 TraceCheckUtils]: 23: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,073 INFO L290 TraceCheckUtils]: 22: Hoare triple {6770#(< main_~a~0 4)} assume !!(~b~0 < 6);~c~0 := 0; {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,074 INFO L290 TraceCheckUtils]: 21: Hoare triple {6770#(< main_~a~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,074 INFO L290 TraceCheckUtils]: 20: Hoare triple {6770#(< main_~a~0 4)} assume !(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,074 INFO L290 TraceCheckUtils]: 19: Hoare triple {6770#(< main_~a~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,074 INFO L290 TraceCheckUtils]: 18: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,075 INFO L290 TraceCheckUtils]: 17: Hoare triple {6770#(< main_~a~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,075 INFO L290 TraceCheckUtils]: 16: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,075 INFO L290 TraceCheckUtils]: 15: Hoare triple {6770#(< main_~a~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,075 INFO L290 TraceCheckUtils]: 14: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {6770#(< main_~a~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,076 INFO L290 TraceCheckUtils]: 12: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {6770#(< main_~a~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,077 INFO L290 TraceCheckUtils]: 10: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {6770#(< main_~a~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {6770#(< main_~a~0 4)} assume !!(~c~0 < 6); {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,077 INFO L290 TraceCheckUtils]: 7: Hoare triple {6770#(< main_~a~0 4)} assume !!(~b~0 < 6);~c~0 := 0; {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {6770#(< main_~a~0 4)} assume !!(~a~0 < 6);~b~0 := 0; {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {6287#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {6770#(< main_~a~0 4)} is VALID [2022-04-28 10:34:00,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {6287#true} call #t~ret7 := main(); {6287#true} is VALID [2022-04-28 10:34:00,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6287#true} {6287#true} #56#return; {6287#true} is VALID [2022-04-28 10:34:00,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {6287#true} assume true; {6287#true} is VALID [2022-04-28 10:34:00,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {6287#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(11, 2);call #Ultimate.allocInit(12, 3); {6287#true} is VALID [2022-04-28 10:34:00,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {6287#true} call ULTIMATE.init(); {6287#true} is VALID [2022-04-28 10:34:00,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 0 proven. 794 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2022-04-28 10:34:00,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467252236] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:34:00,079 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:34:00,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2022-04-28 10:34:00,079 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:34:00,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [565040306] [2022-04-28 10:34:00,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [565040306] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:34:00,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:34:00,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:34:00,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196141850] [2022-04-28 10:34:00,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:34:00,080 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2022-04-28 10:34:00,080 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:34:00,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:00,100 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 10:34:00,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:34:00,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:34:00,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:34:00,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:34:00,101 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:00,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:34:00,480 INFO L93 Difference]: Finished difference Result 217 states and 235 transitions. [2022-04-28 10:34:00,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:34:00,480 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2022-04-28 10:34:00,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:34:00,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:00,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-28 10:34:00,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:00,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-28 10:34:00,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 49 transitions. [2022-04-28 10:34:00,519 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 10:34:00,521 INFO L225 Difference]: With dead ends: 217 [2022-04-28 10:34:00,521 INFO L226 Difference]: Without dead ends: 164 [2022-04-28 10:34:00,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-04-28 10:34:00,522 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 44 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:34:00,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 32 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:34:00,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-28 10:34:00,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 136. [2022-04-28 10:34:00,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:34:00,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 136 states, 132 states have (on average 1.0833333333333333) internal successors, (143), 132 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:00,708 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 136 states, 132 states have (on average 1.0833333333333333) internal successors, (143), 132 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:00,708 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 136 states, 132 states have (on average 1.0833333333333333) internal successors, (143), 132 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:00,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:34:00,711 INFO L93 Difference]: Finished difference Result 164 states and 176 transitions. [2022-04-28 10:34:00,711 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 176 transitions. [2022-04-28 10:34:00,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:34:00,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:34:00,712 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 132 states have (on average 1.0833333333333333) internal successors, (143), 132 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 164 states. [2022-04-28 10:34:00,712 INFO L87 Difference]: Start difference. First operand has 136 states, 132 states have (on average 1.0833333333333333) internal successors, (143), 132 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 164 states. [2022-04-28 10:34:00,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:34:00,715 INFO L93 Difference]: Finished difference Result 164 states and 176 transitions. [2022-04-28 10:34:00,715 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 176 transitions. [2022-04-28 10:34:00,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:34:00,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:34:00,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:34:00,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:34:00,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 132 states have (on average 1.0833333333333333) internal successors, (143), 132 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:00,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 146 transitions. [2022-04-28 10:34:00,718 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 146 transitions. Word has length 105 [2022-04-28 10:34:00,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:34:00,718 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 146 transitions. [2022-04-28 10:34:00,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:00,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 136 states and 146 transitions. [2022-04-28 10:34:00,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:34:00,858 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 146 transitions. [2022-04-28 10:34:00,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-28 10:34:00,859 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:34:00,859 INFO L195 NwaCegarLoop]: trace histogram [48, 48, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:34:00,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-28 10:34:01,067 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,SelfDestructingSolverStorable12 [2022-04-28 10:34:01,068 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:34:01,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:34:01,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1520409151, now seen corresponding path program 19 times [2022-04-28 10:34:01,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:34:01,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [9354854] [2022-04-28 10:34:01,308 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:34:01,407 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:34:01,407 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:34:01,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1520409151, now seen corresponding path program 20 times [2022-04-28 10:34:01,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:34:01,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902523327] [2022-04-28 10:34:01,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:34:01,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:34:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:34:01,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:34:01,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:34:01,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {7984#(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(11, 2);call #Ultimate.allocInit(12, 3); {7974#true} is VALID [2022-04-28 10:34:01,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {7974#true} assume true; {7974#true} is VALID [2022-04-28 10:34:01,515 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7974#true} {7974#true} #56#return; {7974#true} is VALID [2022-04-28 10:34:01,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {7974#true} call ULTIMATE.init(); {7984#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:34:01,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {7984#(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(11, 2);call #Ultimate.allocInit(12, 3); {7974#true} is VALID [2022-04-28 10:34:01,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {7974#true} assume true; {7974#true} is VALID [2022-04-28 10:34:01,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7974#true} {7974#true} #56#return; {7974#true} is VALID [2022-04-28 10:34:01,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {7974#true} call #t~ret7 := main(); {7974#true} is VALID [2022-04-28 10:34:01,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {7974#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {7974#true} is VALID [2022-04-28 10:34:01,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {7974#true} assume !!(~a~0 < 6);~b~0 := 0; {7979#(= main_~b~0 0)} is VALID [2022-04-28 10:34:01,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {7979#(= main_~b~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {7979#(= main_~b~0 0)} is VALID [2022-04-28 10:34:01,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {7979#(= main_~b~0 0)} assume !!(~c~0 < 6); {7979#(= main_~b~0 0)} is VALID [2022-04-28 10:34:01,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {7979#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7979#(= main_~b~0 0)} is VALID [2022-04-28 10:34:01,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {7979#(= main_~b~0 0)} assume !!(~c~0 < 6); {7979#(= main_~b~0 0)} is VALID [2022-04-28 10:34:01,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {7979#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7979#(= main_~b~0 0)} is VALID [2022-04-28 10:34:01,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {7979#(= main_~b~0 0)} assume !!(~c~0 < 6); {7979#(= main_~b~0 0)} is VALID [2022-04-28 10:34:01,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {7979#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7979#(= main_~b~0 0)} is VALID [2022-04-28 10:34:01,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {7979#(= main_~b~0 0)} assume !!(~c~0 < 6); {7979#(= main_~b~0 0)} is VALID [2022-04-28 10:34:01,519 INFO L290 TraceCheckUtils]: 15: Hoare triple {7979#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7979#(= main_~b~0 0)} is VALID [2022-04-28 10:34:01,519 INFO L290 TraceCheckUtils]: 16: Hoare triple {7979#(= main_~b~0 0)} assume !!(~c~0 < 6); {7979#(= main_~b~0 0)} is VALID [2022-04-28 10:34:01,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {7979#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7979#(= main_~b~0 0)} is VALID [2022-04-28 10:34:01,520 INFO L290 TraceCheckUtils]: 18: Hoare triple {7979#(= main_~b~0 0)} assume !!(~c~0 < 6); {7979#(= main_~b~0 0)} is VALID [2022-04-28 10:34:01,520 INFO L290 TraceCheckUtils]: 19: Hoare triple {7979#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7979#(= main_~b~0 0)} is VALID [2022-04-28 10:34:01,520 INFO L290 TraceCheckUtils]: 20: Hoare triple {7979#(= main_~b~0 0)} assume !(~c~0 < 6); {7979#(= main_~b~0 0)} is VALID [2022-04-28 10:34:01,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {7979#(= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:01,521 INFO L290 TraceCheckUtils]: 22: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~b~0 < 6);~c~0 := 0; {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:01,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:01,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {7980#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:01,522 INFO L290 TraceCheckUtils]: 25: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:01,522 INFO L290 TraceCheckUtils]: 26: Hoare triple {7980#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:01,522 INFO L290 TraceCheckUtils]: 27: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:01,522 INFO L290 TraceCheckUtils]: 28: Hoare triple {7980#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:01,523 INFO L290 TraceCheckUtils]: 29: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:01,523 INFO L290 TraceCheckUtils]: 30: Hoare triple {7980#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:01,523 INFO L290 TraceCheckUtils]: 31: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:01,524 INFO L290 TraceCheckUtils]: 32: Hoare triple {7980#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:01,524 INFO L290 TraceCheckUtils]: 33: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:01,524 INFO L290 TraceCheckUtils]: 34: Hoare triple {7980#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:01,524 INFO L290 TraceCheckUtils]: 35: Hoare triple {7980#(<= main_~b~0 1)} assume !(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:01,525 INFO L290 TraceCheckUtils]: 36: Hoare triple {7980#(<= main_~b~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:01,525 INFO L290 TraceCheckUtils]: 37: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~b~0 < 6);~c~0 := 0; {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:01,526 INFO L290 TraceCheckUtils]: 38: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:01,526 INFO L290 TraceCheckUtils]: 39: Hoare triple {7981#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:01,526 INFO L290 TraceCheckUtils]: 40: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:01,526 INFO L290 TraceCheckUtils]: 41: Hoare triple {7981#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:01,527 INFO L290 TraceCheckUtils]: 42: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:01,527 INFO L290 TraceCheckUtils]: 43: Hoare triple {7981#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:01,527 INFO L290 TraceCheckUtils]: 44: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:01,528 INFO L290 TraceCheckUtils]: 45: Hoare triple {7981#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:01,528 INFO L290 TraceCheckUtils]: 46: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:01,528 INFO L290 TraceCheckUtils]: 47: Hoare triple {7981#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:01,528 INFO L290 TraceCheckUtils]: 48: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:01,529 INFO L290 TraceCheckUtils]: 49: Hoare triple {7981#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:01,529 INFO L290 TraceCheckUtils]: 50: Hoare triple {7981#(<= main_~b~0 2)} assume !(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:01,529 INFO L290 TraceCheckUtils]: 51: Hoare triple {7981#(<= main_~b~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:01,530 INFO L290 TraceCheckUtils]: 52: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~b~0 < 6);~c~0 := 0; {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:01,530 INFO L290 TraceCheckUtils]: 53: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:01,530 INFO L290 TraceCheckUtils]: 54: Hoare triple {7982#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:01,531 INFO L290 TraceCheckUtils]: 55: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:01,531 INFO L290 TraceCheckUtils]: 56: Hoare triple {7982#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:01,531 INFO L290 TraceCheckUtils]: 57: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:01,531 INFO L290 TraceCheckUtils]: 58: Hoare triple {7982#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:01,532 INFO L290 TraceCheckUtils]: 59: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:01,532 INFO L290 TraceCheckUtils]: 60: Hoare triple {7982#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:01,532 INFO L290 TraceCheckUtils]: 61: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:01,532 INFO L290 TraceCheckUtils]: 62: Hoare triple {7982#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:01,533 INFO L290 TraceCheckUtils]: 63: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:01,533 INFO L290 TraceCheckUtils]: 64: Hoare triple {7982#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:01,533 INFO L290 TraceCheckUtils]: 65: Hoare triple {7982#(<= main_~b~0 3)} assume !(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:01,534 INFO L290 TraceCheckUtils]: 66: Hoare triple {7982#(<= main_~b~0 3)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7983#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:01,534 INFO L290 TraceCheckUtils]: 67: Hoare triple {7983#(<= main_~b~0 4)} assume !(~b~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,534 INFO L290 TraceCheckUtils]: 68: Hoare triple {7975#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {7975#false} is VALID [2022-04-28 10:34:01,534 INFO L290 TraceCheckUtils]: 69: Hoare triple {7975#false} assume !!(~a~0 < 6);~b~0 := 0; {7975#false} is VALID [2022-04-28 10:34:01,534 INFO L290 TraceCheckUtils]: 70: Hoare triple {7975#false} assume !!(~b~0 < 6);~c~0 := 0; {7975#false} is VALID [2022-04-28 10:34:01,535 INFO L290 TraceCheckUtils]: 71: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,535 INFO L290 TraceCheckUtils]: 72: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,535 INFO L290 TraceCheckUtils]: 73: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,535 INFO L290 TraceCheckUtils]: 74: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,535 INFO L290 TraceCheckUtils]: 75: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,535 INFO L290 TraceCheckUtils]: 76: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,535 INFO L290 TraceCheckUtils]: 77: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,535 INFO L290 TraceCheckUtils]: 78: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,535 INFO L290 TraceCheckUtils]: 79: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,535 INFO L290 TraceCheckUtils]: 80: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,535 INFO L290 TraceCheckUtils]: 81: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,535 INFO L290 TraceCheckUtils]: 82: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,536 INFO L290 TraceCheckUtils]: 83: Hoare triple {7975#false} assume !(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,536 INFO L290 TraceCheckUtils]: 84: Hoare triple {7975#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7975#false} is VALID [2022-04-28 10:34:01,536 INFO L290 TraceCheckUtils]: 85: Hoare triple {7975#false} assume !!(~b~0 < 6);~c~0 := 0; {7975#false} is VALID [2022-04-28 10:34:01,536 INFO L290 TraceCheckUtils]: 86: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,536 INFO L290 TraceCheckUtils]: 87: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,536 INFO L290 TraceCheckUtils]: 88: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,536 INFO L290 TraceCheckUtils]: 89: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,536 INFO L290 TraceCheckUtils]: 90: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,536 INFO L290 TraceCheckUtils]: 91: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,536 INFO L290 TraceCheckUtils]: 92: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,536 INFO L290 TraceCheckUtils]: 93: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,536 INFO L290 TraceCheckUtils]: 94: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,536 INFO L290 TraceCheckUtils]: 95: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,537 INFO L290 TraceCheckUtils]: 96: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,537 INFO L290 TraceCheckUtils]: 97: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,537 INFO L290 TraceCheckUtils]: 98: Hoare triple {7975#false} assume !(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,537 INFO L290 TraceCheckUtils]: 99: Hoare triple {7975#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7975#false} is VALID [2022-04-28 10:34:01,537 INFO L290 TraceCheckUtils]: 100: Hoare triple {7975#false} assume !!(~b~0 < 6);~c~0 := 0; {7975#false} is VALID [2022-04-28 10:34:01,537 INFO L290 TraceCheckUtils]: 101: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,537 INFO L290 TraceCheckUtils]: 102: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,537 INFO L290 TraceCheckUtils]: 103: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,537 INFO L290 TraceCheckUtils]: 104: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,537 INFO L290 TraceCheckUtils]: 105: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,537 INFO L290 TraceCheckUtils]: 106: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,537 INFO L290 TraceCheckUtils]: 107: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,538 INFO L290 TraceCheckUtils]: 108: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,538 INFO L290 TraceCheckUtils]: 109: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,538 INFO L290 TraceCheckUtils]: 110: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,538 INFO L290 TraceCheckUtils]: 111: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,538 INFO L290 TraceCheckUtils]: 112: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,538 INFO L290 TraceCheckUtils]: 113: Hoare triple {7975#false} assume !(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,538 INFO L290 TraceCheckUtils]: 114: Hoare triple {7975#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7975#false} is VALID [2022-04-28 10:34:01,538 INFO L290 TraceCheckUtils]: 115: Hoare triple {7975#false} assume !!(~b~0 < 6);~c~0 := 0; {7975#false} is VALID [2022-04-28 10:34:01,538 INFO L290 TraceCheckUtils]: 116: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,538 INFO L290 TraceCheckUtils]: 117: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,538 INFO L290 TraceCheckUtils]: 118: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,538 INFO L290 TraceCheckUtils]: 119: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,539 INFO L290 TraceCheckUtils]: 120: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,539 INFO L290 TraceCheckUtils]: 121: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,539 INFO L290 TraceCheckUtils]: 122: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,539 INFO L290 TraceCheckUtils]: 123: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,539 INFO L290 TraceCheckUtils]: 124: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,539 INFO L290 TraceCheckUtils]: 125: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,539 INFO L290 TraceCheckUtils]: 126: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,539 INFO L290 TraceCheckUtils]: 127: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,539 INFO L290 TraceCheckUtils]: 128: Hoare triple {7975#false} assume !(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,539 INFO L290 TraceCheckUtils]: 129: Hoare triple {7975#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7975#false} is VALID [2022-04-28 10:34:01,539 INFO L290 TraceCheckUtils]: 130: Hoare triple {7975#false} assume !(~b~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,539 INFO L290 TraceCheckUtils]: 131: Hoare triple {7975#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {7975#false} is VALID [2022-04-28 10:34:01,539 INFO L290 TraceCheckUtils]: 132: Hoare triple {7975#false} assume !(~a~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,540 INFO L290 TraceCheckUtils]: 133: Hoare triple {7975#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {7975#false} is VALID [2022-04-28 10:34:01,540 INFO L290 TraceCheckUtils]: 134: Hoare triple {7975#false} assume !false; {7975#false} is VALID [2022-04-28 10:34:01,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2745 backedges. 1403 proven. 526 refuted. 0 times theorem prover too weak. 816 trivial. 0 not checked. [2022-04-28 10:34:01,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:34:01,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902523327] [2022-04-28 10:34:01,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902523327] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:34:01,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045753749] [2022-04-28 10:34:01,541 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:34:01,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:34:01,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:34:01,542 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 10:34:01,543 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 10:34:01,610 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:34:01,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:34:01,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 10:34:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:34:01,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:34:01,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {7974#true} call ULTIMATE.init(); {7974#true} is VALID [2022-04-28 10:34:01,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {7974#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(11, 2);call #Ultimate.allocInit(12, 3); {7974#true} is VALID [2022-04-28 10:34:01,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {7974#true} assume true; {7974#true} is VALID [2022-04-28 10:34:01,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7974#true} {7974#true} #56#return; {7974#true} is VALID [2022-04-28 10:34:01,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {7974#true} call #t~ret7 := main(); {7974#true} is VALID [2022-04-28 10:34:01,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {7974#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {7974#true} is VALID [2022-04-28 10:34:01,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {7974#true} assume !!(~a~0 < 6);~b~0 := 0; {8006#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:01,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {8006#(<= main_~b~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {8006#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:01,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {8006#(<= main_~b~0 0)} assume !!(~c~0 < 6); {8006#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:01,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {8006#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {8006#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:01,971 INFO L290 TraceCheckUtils]: 10: Hoare triple {8006#(<= main_~b~0 0)} assume !!(~c~0 < 6); {8006#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:01,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {8006#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {8006#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:01,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {8006#(<= main_~b~0 0)} assume !!(~c~0 < 6); {8006#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:01,972 INFO L290 TraceCheckUtils]: 13: Hoare triple {8006#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {8006#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:01,973 INFO L290 TraceCheckUtils]: 14: Hoare triple {8006#(<= main_~b~0 0)} assume !!(~c~0 < 6); {8006#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:01,973 INFO L290 TraceCheckUtils]: 15: Hoare triple {8006#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {8006#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:01,973 INFO L290 TraceCheckUtils]: 16: Hoare triple {8006#(<= main_~b~0 0)} assume !!(~c~0 < 6); {8006#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:01,973 INFO L290 TraceCheckUtils]: 17: Hoare triple {8006#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {8006#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:01,974 INFO L290 TraceCheckUtils]: 18: Hoare triple {8006#(<= main_~b~0 0)} assume !!(~c~0 < 6); {8006#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:01,974 INFO L290 TraceCheckUtils]: 19: Hoare triple {8006#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {8006#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:01,974 INFO L290 TraceCheckUtils]: 20: Hoare triple {8006#(<= main_~b~0 0)} assume !(~c~0 < 6); {8006#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:01,975 INFO L290 TraceCheckUtils]: 21: Hoare triple {8006#(<= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:01,975 INFO L290 TraceCheckUtils]: 22: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~b~0 < 6);~c~0 := 0; {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:01,975 INFO L290 TraceCheckUtils]: 23: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:01,975 INFO L290 TraceCheckUtils]: 24: Hoare triple {7980#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:01,976 INFO L290 TraceCheckUtils]: 25: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:01,976 INFO L290 TraceCheckUtils]: 26: Hoare triple {7980#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:01,976 INFO L290 TraceCheckUtils]: 27: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:01,976 INFO L290 TraceCheckUtils]: 28: Hoare triple {7980#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:01,977 INFO L290 TraceCheckUtils]: 29: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:01,977 INFO L290 TraceCheckUtils]: 30: Hoare triple {7980#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:01,977 INFO L290 TraceCheckUtils]: 31: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:01,978 INFO L290 TraceCheckUtils]: 32: Hoare triple {7980#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:01,978 INFO L290 TraceCheckUtils]: 33: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:01,978 INFO L290 TraceCheckUtils]: 34: Hoare triple {7980#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:01,978 INFO L290 TraceCheckUtils]: 35: Hoare triple {7980#(<= main_~b~0 1)} assume !(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:01,979 INFO L290 TraceCheckUtils]: 36: Hoare triple {7980#(<= main_~b~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:01,979 INFO L290 TraceCheckUtils]: 37: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~b~0 < 6);~c~0 := 0; {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:01,979 INFO L290 TraceCheckUtils]: 38: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:01,980 INFO L290 TraceCheckUtils]: 39: Hoare triple {7981#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:01,980 INFO L290 TraceCheckUtils]: 40: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:01,980 INFO L290 TraceCheckUtils]: 41: Hoare triple {7981#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:01,980 INFO L290 TraceCheckUtils]: 42: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:01,981 INFO L290 TraceCheckUtils]: 43: Hoare triple {7981#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:01,981 INFO L290 TraceCheckUtils]: 44: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:01,981 INFO L290 TraceCheckUtils]: 45: Hoare triple {7981#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:01,981 INFO L290 TraceCheckUtils]: 46: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:01,982 INFO L290 TraceCheckUtils]: 47: Hoare triple {7981#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:01,982 INFO L290 TraceCheckUtils]: 48: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:01,982 INFO L290 TraceCheckUtils]: 49: Hoare triple {7981#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:01,983 INFO L290 TraceCheckUtils]: 50: Hoare triple {7981#(<= main_~b~0 2)} assume !(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:01,983 INFO L290 TraceCheckUtils]: 51: Hoare triple {7981#(<= main_~b~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:01,983 INFO L290 TraceCheckUtils]: 52: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~b~0 < 6);~c~0 := 0; {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:01,984 INFO L290 TraceCheckUtils]: 53: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:01,984 INFO L290 TraceCheckUtils]: 54: Hoare triple {7982#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:01,984 INFO L290 TraceCheckUtils]: 55: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:01,985 INFO L290 TraceCheckUtils]: 56: Hoare triple {7982#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:01,985 INFO L290 TraceCheckUtils]: 57: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:01,985 INFO L290 TraceCheckUtils]: 58: Hoare triple {7982#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:01,986 INFO L290 TraceCheckUtils]: 59: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:01,986 INFO L290 TraceCheckUtils]: 60: Hoare triple {7982#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:01,986 INFO L290 TraceCheckUtils]: 61: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:01,986 INFO L290 TraceCheckUtils]: 62: Hoare triple {7982#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:01,987 INFO L290 TraceCheckUtils]: 63: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:01,987 INFO L290 TraceCheckUtils]: 64: Hoare triple {7982#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:01,987 INFO L290 TraceCheckUtils]: 65: Hoare triple {7982#(<= main_~b~0 3)} assume !(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:01,988 INFO L290 TraceCheckUtils]: 66: Hoare triple {7982#(<= main_~b~0 3)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7983#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:01,988 INFO L290 TraceCheckUtils]: 67: Hoare triple {7983#(<= main_~b~0 4)} assume !(~b~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,988 INFO L290 TraceCheckUtils]: 68: Hoare triple {7975#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {7975#false} is VALID [2022-04-28 10:34:01,988 INFO L290 TraceCheckUtils]: 69: Hoare triple {7975#false} assume !!(~a~0 < 6);~b~0 := 0; {7975#false} is VALID [2022-04-28 10:34:01,988 INFO L290 TraceCheckUtils]: 70: Hoare triple {7975#false} assume !!(~b~0 < 6);~c~0 := 0; {7975#false} is VALID [2022-04-28 10:34:01,988 INFO L290 TraceCheckUtils]: 71: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,988 INFO L290 TraceCheckUtils]: 72: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,988 INFO L290 TraceCheckUtils]: 73: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,988 INFO L290 TraceCheckUtils]: 74: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,988 INFO L290 TraceCheckUtils]: 75: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,988 INFO L290 TraceCheckUtils]: 76: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,989 INFO L290 TraceCheckUtils]: 77: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,989 INFO L290 TraceCheckUtils]: 78: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,989 INFO L290 TraceCheckUtils]: 79: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,989 INFO L290 TraceCheckUtils]: 80: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,989 INFO L290 TraceCheckUtils]: 81: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,989 INFO L290 TraceCheckUtils]: 82: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,989 INFO L290 TraceCheckUtils]: 83: Hoare triple {7975#false} assume !(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,989 INFO L290 TraceCheckUtils]: 84: Hoare triple {7975#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7975#false} is VALID [2022-04-28 10:34:01,989 INFO L290 TraceCheckUtils]: 85: Hoare triple {7975#false} assume !!(~b~0 < 6);~c~0 := 0; {7975#false} is VALID [2022-04-28 10:34:01,989 INFO L290 TraceCheckUtils]: 86: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,989 INFO L290 TraceCheckUtils]: 87: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,989 INFO L290 TraceCheckUtils]: 88: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,989 INFO L290 TraceCheckUtils]: 89: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,989 INFO L290 TraceCheckUtils]: 90: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,989 INFO L290 TraceCheckUtils]: 91: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,989 INFO L290 TraceCheckUtils]: 92: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,989 INFO L290 TraceCheckUtils]: 93: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,989 INFO L290 TraceCheckUtils]: 94: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,989 INFO L290 TraceCheckUtils]: 95: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,990 INFO L290 TraceCheckUtils]: 96: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,990 INFO L290 TraceCheckUtils]: 97: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,990 INFO L290 TraceCheckUtils]: 98: Hoare triple {7975#false} assume !(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,990 INFO L290 TraceCheckUtils]: 99: Hoare triple {7975#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7975#false} is VALID [2022-04-28 10:34:01,990 INFO L290 TraceCheckUtils]: 100: Hoare triple {7975#false} assume !!(~b~0 < 6);~c~0 := 0; {7975#false} is VALID [2022-04-28 10:34:01,990 INFO L290 TraceCheckUtils]: 101: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,990 INFO L290 TraceCheckUtils]: 102: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,990 INFO L290 TraceCheckUtils]: 103: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,990 INFO L290 TraceCheckUtils]: 104: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,990 INFO L290 TraceCheckUtils]: 105: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,990 INFO L290 TraceCheckUtils]: 106: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,990 INFO L290 TraceCheckUtils]: 107: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,990 INFO L290 TraceCheckUtils]: 108: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,990 INFO L290 TraceCheckUtils]: 109: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,990 INFO L290 TraceCheckUtils]: 110: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,990 INFO L290 TraceCheckUtils]: 111: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,990 INFO L290 TraceCheckUtils]: 112: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,990 INFO L290 TraceCheckUtils]: 113: Hoare triple {7975#false} assume !(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,990 INFO L290 TraceCheckUtils]: 114: Hoare triple {7975#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7975#false} is VALID [2022-04-28 10:34:01,991 INFO L290 TraceCheckUtils]: 115: Hoare triple {7975#false} assume !!(~b~0 < 6);~c~0 := 0; {7975#false} is VALID [2022-04-28 10:34:01,991 INFO L290 TraceCheckUtils]: 116: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,991 INFO L290 TraceCheckUtils]: 117: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,991 INFO L290 TraceCheckUtils]: 118: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,991 INFO L290 TraceCheckUtils]: 119: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,991 INFO L290 TraceCheckUtils]: 120: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,991 INFO L290 TraceCheckUtils]: 121: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,991 INFO L290 TraceCheckUtils]: 122: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,991 INFO L290 TraceCheckUtils]: 123: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,991 INFO L290 TraceCheckUtils]: 124: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,991 INFO L290 TraceCheckUtils]: 125: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,991 INFO L290 TraceCheckUtils]: 126: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,991 INFO L290 TraceCheckUtils]: 127: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:01,991 INFO L290 TraceCheckUtils]: 128: Hoare triple {7975#false} assume !(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,991 INFO L290 TraceCheckUtils]: 129: Hoare triple {7975#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7975#false} is VALID [2022-04-28 10:34:01,991 INFO L290 TraceCheckUtils]: 130: Hoare triple {7975#false} assume !(~b~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,991 INFO L290 TraceCheckUtils]: 131: Hoare triple {7975#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {7975#false} is VALID [2022-04-28 10:34:01,991 INFO L290 TraceCheckUtils]: 132: Hoare triple {7975#false} assume !(~a~0 < 6); {7975#false} is VALID [2022-04-28 10:34:01,992 INFO L290 TraceCheckUtils]: 133: Hoare triple {7975#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {7975#false} is VALID [2022-04-28 10:34:01,992 INFO L290 TraceCheckUtils]: 134: Hoare triple {7975#false} assume !false; {7975#false} is VALID [2022-04-28 10:34:01,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2745 backedges. 1403 proven. 526 refuted. 0 times theorem prover too weak. 816 trivial. 0 not checked. [2022-04-28 10:34:01,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:34:02,373 INFO L290 TraceCheckUtils]: 134: Hoare triple {7975#false} assume !false; {7975#false} is VALID [2022-04-28 10:34:02,373 INFO L290 TraceCheckUtils]: 133: Hoare triple {7975#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {7975#false} is VALID [2022-04-28 10:34:02,373 INFO L290 TraceCheckUtils]: 132: Hoare triple {7975#false} assume !(~a~0 < 6); {7975#false} is VALID [2022-04-28 10:34:02,373 INFO L290 TraceCheckUtils]: 131: Hoare triple {7975#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {7975#false} is VALID [2022-04-28 10:34:02,373 INFO L290 TraceCheckUtils]: 130: Hoare triple {7975#false} assume !(~b~0 < 6); {7975#false} is VALID [2022-04-28 10:34:02,373 INFO L290 TraceCheckUtils]: 129: Hoare triple {7975#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7975#false} is VALID [2022-04-28 10:34:02,374 INFO L290 TraceCheckUtils]: 128: Hoare triple {7975#false} assume !(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:02,374 INFO L290 TraceCheckUtils]: 127: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:02,374 INFO L290 TraceCheckUtils]: 126: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:02,374 INFO L290 TraceCheckUtils]: 125: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:02,374 INFO L290 TraceCheckUtils]: 124: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:02,374 INFO L290 TraceCheckUtils]: 123: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:02,374 INFO L290 TraceCheckUtils]: 122: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:02,375 INFO L290 TraceCheckUtils]: 121: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:02,375 INFO L290 TraceCheckUtils]: 120: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:02,375 INFO L290 TraceCheckUtils]: 119: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:02,375 INFO L290 TraceCheckUtils]: 118: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:02,375 INFO L290 TraceCheckUtils]: 117: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:02,375 INFO L290 TraceCheckUtils]: 116: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:02,376 INFO L290 TraceCheckUtils]: 115: Hoare triple {7975#false} assume !!(~b~0 < 6);~c~0 := 0; {7975#false} is VALID [2022-04-28 10:34:02,376 INFO L290 TraceCheckUtils]: 114: Hoare triple {7975#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7975#false} is VALID [2022-04-28 10:34:02,376 INFO L290 TraceCheckUtils]: 113: Hoare triple {7975#false} assume !(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:02,376 INFO L290 TraceCheckUtils]: 112: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:02,376 INFO L290 TraceCheckUtils]: 111: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:02,376 INFO L290 TraceCheckUtils]: 110: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:02,376 INFO L290 TraceCheckUtils]: 109: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:02,376 INFO L290 TraceCheckUtils]: 108: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:02,376 INFO L290 TraceCheckUtils]: 107: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:02,376 INFO L290 TraceCheckUtils]: 106: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:02,376 INFO L290 TraceCheckUtils]: 105: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:02,376 INFO L290 TraceCheckUtils]: 104: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:02,376 INFO L290 TraceCheckUtils]: 103: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:02,377 INFO L290 TraceCheckUtils]: 102: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:02,377 INFO L290 TraceCheckUtils]: 101: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:02,377 INFO L290 TraceCheckUtils]: 100: Hoare triple {7975#false} assume !!(~b~0 < 6);~c~0 := 0; {7975#false} is VALID [2022-04-28 10:34:02,377 INFO L290 TraceCheckUtils]: 99: Hoare triple {7975#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7975#false} is VALID [2022-04-28 10:34:02,377 INFO L290 TraceCheckUtils]: 98: Hoare triple {7975#false} assume !(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:02,377 INFO L290 TraceCheckUtils]: 97: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:02,377 INFO L290 TraceCheckUtils]: 96: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:02,377 INFO L290 TraceCheckUtils]: 95: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:02,377 INFO L290 TraceCheckUtils]: 94: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:02,377 INFO L290 TraceCheckUtils]: 93: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:02,377 INFO L290 TraceCheckUtils]: 92: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:02,378 INFO L290 TraceCheckUtils]: 91: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:02,378 INFO L290 TraceCheckUtils]: 90: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:02,378 INFO L290 TraceCheckUtils]: 89: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:02,378 INFO L290 TraceCheckUtils]: 88: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:02,378 INFO L290 TraceCheckUtils]: 87: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:02,378 INFO L290 TraceCheckUtils]: 86: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:02,378 INFO L290 TraceCheckUtils]: 85: Hoare triple {7975#false} assume !!(~b~0 < 6);~c~0 := 0; {7975#false} is VALID [2022-04-28 10:34:02,378 INFO L290 TraceCheckUtils]: 84: Hoare triple {7975#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7975#false} is VALID [2022-04-28 10:34:02,378 INFO L290 TraceCheckUtils]: 83: Hoare triple {7975#false} assume !(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:02,378 INFO L290 TraceCheckUtils]: 82: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:02,378 INFO L290 TraceCheckUtils]: 81: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:02,378 INFO L290 TraceCheckUtils]: 80: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:02,379 INFO L290 TraceCheckUtils]: 79: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:02,379 INFO L290 TraceCheckUtils]: 78: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:02,379 INFO L290 TraceCheckUtils]: 77: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:02,379 INFO L290 TraceCheckUtils]: 76: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:02,379 INFO L290 TraceCheckUtils]: 75: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:02,379 INFO L290 TraceCheckUtils]: 74: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:02,379 INFO L290 TraceCheckUtils]: 73: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:02,379 INFO L290 TraceCheckUtils]: 72: Hoare triple {7975#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7975#false} is VALID [2022-04-28 10:34:02,379 INFO L290 TraceCheckUtils]: 71: Hoare triple {7975#false} assume !!(~c~0 < 6); {7975#false} is VALID [2022-04-28 10:34:02,379 INFO L290 TraceCheckUtils]: 70: Hoare triple {7975#false} assume !!(~b~0 < 6);~c~0 := 0; {7975#false} is VALID [2022-04-28 10:34:02,379 INFO L290 TraceCheckUtils]: 69: Hoare triple {7975#false} assume !!(~a~0 < 6);~b~0 := 0; {7975#false} is VALID [2022-04-28 10:34:02,379 INFO L290 TraceCheckUtils]: 68: Hoare triple {7975#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {7975#false} is VALID [2022-04-28 10:34:02,380 INFO L290 TraceCheckUtils]: 67: Hoare triple {8592#(< main_~b~0 6)} assume !(~b~0 < 6); {7975#false} is VALID [2022-04-28 10:34:02,381 INFO L290 TraceCheckUtils]: 66: Hoare triple {7983#(<= main_~b~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {8592#(< main_~b~0 6)} is VALID [2022-04-28 10:34:02,381 INFO L290 TraceCheckUtils]: 65: Hoare triple {7983#(<= main_~b~0 4)} assume !(~c~0 < 6); {7983#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:02,381 INFO L290 TraceCheckUtils]: 64: Hoare triple {7983#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7983#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:02,381 INFO L290 TraceCheckUtils]: 63: Hoare triple {7983#(<= main_~b~0 4)} assume !!(~c~0 < 6); {7983#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:02,382 INFO L290 TraceCheckUtils]: 62: Hoare triple {7983#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7983#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:02,382 INFO L290 TraceCheckUtils]: 61: Hoare triple {7983#(<= main_~b~0 4)} assume !!(~c~0 < 6); {7983#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:02,382 INFO L290 TraceCheckUtils]: 60: Hoare triple {7983#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7983#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:02,383 INFO L290 TraceCheckUtils]: 59: Hoare triple {7983#(<= main_~b~0 4)} assume !!(~c~0 < 6); {7983#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:02,383 INFO L290 TraceCheckUtils]: 58: Hoare triple {7983#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7983#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:02,383 INFO L290 TraceCheckUtils]: 57: Hoare triple {7983#(<= main_~b~0 4)} assume !!(~c~0 < 6); {7983#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:02,383 INFO L290 TraceCheckUtils]: 56: Hoare triple {7983#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7983#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:02,384 INFO L290 TraceCheckUtils]: 55: Hoare triple {7983#(<= main_~b~0 4)} assume !!(~c~0 < 6); {7983#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:02,384 INFO L290 TraceCheckUtils]: 54: Hoare triple {7983#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7983#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:02,384 INFO L290 TraceCheckUtils]: 53: Hoare triple {7983#(<= main_~b~0 4)} assume !!(~c~0 < 6); {7983#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:02,384 INFO L290 TraceCheckUtils]: 52: Hoare triple {7983#(<= main_~b~0 4)} assume !!(~b~0 < 6);~c~0 := 0; {7983#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:02,385 INFO L290 TraceCheckUtils]: 51: Hoare triple {7982#(<= main_~b~0 3)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7983#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:02,385 INFO L290 TraceCheckUtils]: 50: Hoare triple {7982#(<= main_~b~0 3)} assume !(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:02,385 INFO L290 TraceCheckUtils]: 49: Hoare triple {7982#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:02,386 INFO L290 TraceCheckUtils]: 48: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:02,386 INFO L290 TraceCheckUtils]: 47: Hoare triple {7982#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:02,386 INFO L290 TraceCheckUtils]: 46: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:02,386 INFO L290 TraceCheckUtils]: 45: Hoare triple {7982#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:02,387 INFO L290 TraceCheckUtils]: 44: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:02,387 INFO L290 TraceCheckUtils]: 43: Hoare triple {7982#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:02,387 INFO L290 TraceCheckUtils]: 42: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:02,387 INFO L290 TraceCheckUtils]: 41: Hoare triple {7982#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:02,388 INFO L290 TraceCheckUtils]: 40: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:02,388 INFO L290 TraceCheckUtils]: 39: Hoare triple {7982#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:02,388 INFO L290 TraceCheckUtils]: 38: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~c~0 < 6); {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:02,388 INFO L290 TraceCheckUtils]: 37: Hoare triple {7982#(<= main_~b~0 3)} assume !!(~b~0 < 6);~c~0 := 0; {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:02,389 INFO L290 TraceCheckUtils]: 36: Hoare triple {7981#(<= main_~b~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7982#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:02,389 INFO L290 TraceCheckUtils]: 35: Hoare triple {7981#(<= main_~b~0 2)} assume !(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:02,389 INFO L290 TraceCheckUtils]: 34: Hoare triple {7981#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:02,390 INFO L290 TraceCheckUtils]: 33: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:02,390 INFO L290 TraceCheckUtils]: 32: Hoare triple {7981#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:02,390 INFO L290 TraceCheckUtils]: 31: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:02,390 INFO L290 TraceCheckUtils]: 30: Hoare triple {7981#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:02,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:02,391 INFO L290 TraceCheckUtils]: 28: Hoare triple {7981#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:02,391 INFO L290 TraceCheckUtils]: 27: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:02,391 INFO L290 TraceCheckUtils]: 26: Hoare triple {7981#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:02,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:02,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {7981#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:02,392 INFO L290 TraceCheckUtils]: 23: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~c~0 < 6); {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:02,393 INFO L290 TraceCheckUtils]: 22: Hoare triple {7981#(<= main_~b~0 2)} assume !!(~b~0 < 6);~c~0 := 0; {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:02,393 INFO L290 TraceCheckUtils]: 21: Hoare triple {7980#(<= main_~b~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7981#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:02,393 INFO L290 TraceCheckUtils]: 20: Hoare triple {7980#(<= main_~b~0 1)} assume !(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:02,393 INFO L290 TraceCheckUtils]: 19: Hoare triple {7980#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:02,394 INFO L290 TraceCheckUtils]: 18: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:02,394 INFO L290 TraceCheckUtils]: 17: Hoare triple {7980#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:02,394 INFO L290 TraceCheckUtils]: 16: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:02,395 INFO L290 TraceCheckUtils]: 15: Hoare triple {7980#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:02,395 INFO L290 TraceCheckUtils]: 14: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:02,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {7980#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:02,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:02,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {7980#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:02,396 INFO L290 TraceCheckUtils]: 10: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:02,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {7980#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:02,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~c~0 < 6); {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:02,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {7980#(<= main_~b~0 1)} assume !!(~b~0 < 6);~c~0 := 0; {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:02,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {7974#true} assume !!(~a~0 < 6);~b~0 := 0; {7980#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:02,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {7974#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {7974#true} is VALID [2022-04-28 10:34:02,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {7974#true} call #t~ret7 := main(); {7974#true} is VALID [2022-04-28 10:34:02,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7974#true} {7974#true} #56#return; {7974#true} is VALID [2022-04-28 10:34:02,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {7974#true} assume true; {7974#true} is VALID [2022-04-28 10:34:02,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {7974#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(11, 2);call #Ultimate.allocInit(12, 3); {7974#true} is VALID [2022-04-28 10:34:02,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {7974#true} call ULTIMATE.init(); {7974#true} is VALID [2022-04-28 10:34:02,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2745 backedges. 1403 proven. 526 refuted. 0 times theorem prover too weak. 816 trivial. 0 not checked. [2022-04-28 10:34:02,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045753749] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:34:02,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:34:02,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2022-04-28 10:34:02,399 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:34:02,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [9354854] [2022-04-28 10:34:02,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [9354854] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:34:02,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:34:02,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:34:02,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140396675] [2022-04-28 10:34:02,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:34:02,400 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 135 [2022-04-28 10:34:02,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:34:02,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:02,430 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 10:34:02,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:34:02,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:34:02,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:34:02,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:34:02,431 INFO L87 Difference]: Start difference. First operand 136 states and 146 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:02,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:34:02,939 INFO L93 Difference]: Finished difference Result 262 states and 283 transitions. [2022-04-28 10:34:02,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:34:02,940 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 135 [2022-04-28 10:34:02,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:34:02,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:02,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-28 10:34:02,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:02,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-28 10:34:02,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 54 transitions. [2022-04-28 10:34:02,981 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 10:34:02,985 INFO L225 Difference]: With dead ends: 262 [2022-04-28 10:34:02,985 INFO L226 Difference]: Without dead ends: 194 [2022-04-28 10:34:02,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 269 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:34:02,986 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 52 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:34:02,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 32 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:34:02,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-04-28 10:34:03,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 166. [2022-04-28 10:34:03,238 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:34:03,238 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand has 166 states, 162 states have (on average 1.0802469135802468) internal successors, (175), 162 states have internal predecessors, (175), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:03,239 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand has 166 states, 162 states have (on average 1.0802469135802468) internal successors, (175), 162 states have internal predecessors, (175), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:03,239 INFO L87 Difference]: Start difference. First operand 194 states. Second operand has 166 states, 162 states have (on average 1.0802469135802468) internal successors, (175), 162 states have internal predecessors, (175), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:03,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:34:03,242 INFO L93 Difference]: Finished difference Result 194 states and 208 transitions. [2022-04-28 10:34:03,242 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 208 transitions. [2022-04-28 10:34:03,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:34:03,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:34:03,243 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 162 states have (on average 1.0802469135802468) internal successors, (175), 162 states have internal predecessors, (175), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 194 states. [2022-04-28 10:34:03,244 INFO L87 Difference]: Start difference. First operand has 166 states, 162 states have (on average 1.0802469135802468) internal successors, (175), 162 states have internal predecessors, (175), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 194 states. [2022-04-28 10:34:03,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:34:03,247 INFO L93 Difference]: Finished difference Result 194 states and 208 transitions. [2022-04-28 10:34:03,247 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 208 transitions. [2022-04-28 10:34:03,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:34:03,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:34:03,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:34:03,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:34:03,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 162 states have (on average 1.0802469135802468) internal successors, (175), 162 states have internal predecessors, (175), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:03,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 178 transitions. [2022-04-28 10:34:03,251 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 178 transitions. Word has length 135 [2022-04-28 10:34:03,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:34:03,252 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 178 transitions. [2022-04-28 10:34:03,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:03,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 166 states and 178 transitions. [2022-04-28 10:34:03,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:34:03,442 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 178 transitions. [2022-04-28 10:34:03,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-04-28 10:34:03,443 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:34:03,443 INFO L195 NwaCegarLoop]: trace histogram [60, 60, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:34:03,461 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 10:34:03,651 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,SelfDestructingSolverStorable13 [2022-04-28 10:34:03,652 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:34:03,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:34:03,652 INFO L85 PathProgramCache]: Analyzing trace with hash 404361087, now seen corresponding path program 21 times [2022-04-28 10:34:03,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:34:03,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1714921259] [2022-04-28 10:34:03,883 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:34:03,999 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:34:03,999 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:34:03,999 INFO L85 PathProgramCache]: Analyzing trace with hash 404361087, now seen corresponding path program 22 times [2022-04-28 10:34:03,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:34:03,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970000525] [2022-04-28 10:34:03,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:34:03,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:34:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:34:04,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:34:04,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:34:04,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {10061#(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(11, 2);call #Ultimate.allocInit(12, 3); {10050#true} is VALID [2022-04-28 10:34:04,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {10050#true} assume true; {10050#true} is VALID [2022-04-28 10:34:04,111 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10050#true} {10050#true} #56#return; {10050#true} is VALID [2022-04-28 10:34:04,112 INFO L272 TraceCheckUtils]: 0: Hoare triple {10050#true} call ULTIMATE.init(); {10061#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:34:04,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {10061#(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(11, 2);call #Ultimate.allocInit(12, 3); {10050#true} is VALID [2022-04-28 10:34:04,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {10050#true} assume true; {10050#true} is VALID [2022-04-28 10:34:04,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10050#true} {10050#true} #56#return; {10050#true} is VALID [2022-04-28 10:34:04,112 INFO L272 TraceCheckUtils]: 4: Hoare triple {10050#true} call #t~ret7 := main(); {10050#true} is VALID [2022-04-28 10:34:04,112 INFO L290 TraceCheckUtils]: 5: Hoare triple {10050#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {10050#true} is VALID [2022-04-28 10:34:04,112 INFO L290 TraceCheckUtils]: 6: Hoare triple {10050#true} assume !!(~a~0 < 6);~b~0 := 0; {10055#(= main_~b~0 0)} is VALID [2022-04-28 10:34:04,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {10055#(= main_~b~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {10055#(= main_~b~0 0)} is VALID [2022-04-28 10:34:04,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {10055#(= main_~b~0 0)} assume !!(~c~0 < 6); {10055#(= main_~b~0 0)} is VALID [2022-04-28 10:34:04,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {10055#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10055#(= main_~b~0 0)} is VALID [2022-04-28 10:34:04,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {10055#(= main_~b~0 0)} assume !!(~c~0 < 6); {10055#(= main_~b~0 0)} is VALID [2022-04-28 10:34:04,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {10055#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10055#(= main_~b~0 0)} is VALID [2022-04-28 10:34:04,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {10055#(= main_~b~0 0)} assume !!(~c~0 < 6); {10055#(= main_~b~0 0)} is VALID [2022-04-28 10:34:04,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {10055#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10055#(= main_~b~0 0)} is VALID [2022-04-28 10:34:04,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {10055#(= main_~b~0 0)} assume !!(~c~0 < 6); {10055#(= main_~b~0 0)} is VALID [2022-04-28 10:34:04,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {10055#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10055#(= main_~b~0 0)} is VALID [2022-04-28 10:34:04,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {10055#(= main_~b~0 0)} assume !!(~c~0 < 6); {10055#(= main_~b~0 0)} is VALID [2022-04-28 10:34:04,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {10055#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10055#(= main_~b~0 0)} is VALID [2022-04-28 10:34:04,116 INFO L290 TraceCheckUtils]: 18: Hoare triple {10055#(= main_~b~0 0)} assume !!(~c~0 < 6); {10055#(= main_~b~0 0)} is VALID [2022-04-28 10:34:04,116 INFO L290 TraceCheckUtils]: 19: Hoare triple {10055#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10055#(= main_~b~0 0)} is VALID [2022-04-28 10:34:04,116 INFO L290 TraceCheckUtils]: 20: Hoare triple {10055#(= main_~b~0 0)} assume !(~c~0 < 6); {10055#(= main_~b~0 0)} is VALID [2022-04-28 10:34:04,116 INFO L290 TraceCheckUtils]: 21: Hoare triple {10055#(= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:04,117 INFO L290 TraceCheckUtils]: 22: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~b~0 < 6);~c~0 := 0; {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:04,117 INFO L290 TraceCheckUtils]: 23: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:04,117 INFO L290 TraceCheckUtils]: 24: Hoare triple {10056#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:04,118 INFO L290 TraceCheckUtils]: 25: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:04,118 INFO L290 TraceCheckUtils]: 26: Hoare triple {10056#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:04,118 INFO L290 TraceCheckUtils]: 27: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:04,118 INFO L290 TraceCheckUtils]: 28: Hoare triple {10056#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:04,119 INFO L290 TraceCheckUtils]: 29: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:04,119 INFO L290 TraceCheckUtils]: 30: Hoare triple {10056#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:04,119 INFO L290 TraceCheckUtils]: 31: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:04,120 INFO L290 TraceCheckUtils]: 32: Hoare triple {10056#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:04,120 INFO L290 TraceCheckUtils]: 33: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:04,120 INFO L290 TraceCheckUtils]: 34: Hoare triple {10056#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:04,120 INFO L290 TraceCheckUtils]: 35: Hoare triple {10056#(<= main_~b~0 1)} assume !(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:04,121 INFO L290 TraceCheckUtils]: 36: Hoare triple {10056#(<= main_~b~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:04,121 INFO L290 TraceCheckUtils]: 37: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~b~0 < 6);~c~0 := 0; {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:04,121 INFO L290 TraceCheckUtils]: 38: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:04,122 INFO L290 TraceCheckUtils]: 39: Hoare triple {10057#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:04,122 INFO L290 TraceCheckUtils]: 40: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:04,122 INFO L290 TraceCheckUtils]: 41: Hoare triple {10057#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:04,122 INFO L290 TraceCheckUtils]: 42: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:04,123 INFO L290 TraceCheckUtils]: 43: Hoare triple {10057#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:04,123 INFO L290 TraceCheckUtils]: 44: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:04,123 INFO L290 TraceCheckUtils]: 45: Hoare triple {10057#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:04,124 INFO L290 TraceCheckUtils]: 46: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:04,124 INFO L290 TraceCheckUtils]: 47: Hoare triple {10057#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:04,124 INFO L290 TraceCheckUtils]: 48: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:04,124 INFO L290 TraceCheckUtils]: 49: Hoare triple {10057#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:04,125 INFO L290 TraceCheckUtils]: 50: Hoare triple {10057#(<= main_~b~0 2)} assume !(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:04,125 INFO L290 TraceCheckUtils]: 51: Hoare triple {10057#(<= main_~b~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:04,125 INFO L290 TraceCheckUtils]: 52: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~b~0 < 6);~c~0 := 0; {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:04,126 INFO L290 TraceCheckUtils]: 53: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:04,126 INFO L290 TraceCheckUtils]: 54: Hoare triple {10058#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:04,126 INFO L290 TraceCheckUtils]: 55: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:04,127 INFO L290 TraceCheckUtils]: 56: Hoare triple {10058#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:04,127 INFO L290 TraceCheckUtils]: 57: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:04,127 INFO L290 TraceCheckUtils]: 58: Hoare triple {10058#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:04,127 INFO L290 TraceCheckUtils]: 59: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:04,128 INFO L290 TraceCheckUtils]: 60: Hoare triple {10058#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:04,128 INFO L290 TraceCheckUtils]: 61: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:04,128 INFO L290 TraceCheckUtils]: 62: Hoare triple {10058#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:04,128 INFO L290 TraceCheckUtils]: 63: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:04,129 INFO L290 TraceCheckUtils]: 64: Hoare triple {10058#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:04,129 INFO L290 TraceCheckUtils]: 65: Hoare triple {10058#(<= main_~b~0 3)} assume !(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:04,129 INFO L290 TraceCheckUtils]: 66: Hoare triple {10058#(<= main_~b~0 3)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:04,130 INFO L290 TraceCheckUtils]: 67: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~b~0 < 6);~c~0 := 0; {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:04,130 INFO L290 TraceCheckUtils]: 68: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:04,130 INFO L290 TraceCheckUtils]: 69: Hoare triple {10059#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:04,131 INFO L290 TraceCheckUtils]: 70: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:04,131 INFO L290 TraceCheckUtils]: 71: Hoare triple {10059#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:04,131 INFO L290 TraceCheckUtils]: 72: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:04,131 INFO L290 TraceCheckUtils]: 73: Hoare triple {10059#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:04,132 INFO L290 TraceCheckUtils]: 74: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:04,132 INFO L290 TraceCheckUtils]: 75: Hoare triple {10059#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:04,132 INFO L290 TraceCheckUtils]: 76: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:04,133 INFO L290 TraceCheckUtils]: 77: Hoare triple {10059#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:04,133 INFO L290 TraceCheckUtils]: 78: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:04,133 INFO L290 TraceCheckUtils]: 79: Hoare triple {10059#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:04,133 INFO L290 TraceCheckUtils]: 80: Hoare triple {10059#(<= main_~b~0 4)} assume !(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:04,134 INFO L290 TraceCheckUtils]: 81: Hoare triple {10059#(<= main_~b~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10060#(<= main_~b~0 5)} is VALID [2022-04-28 10:34:04,134 INFO L290 TraceCheckUtils]: 82: Hoare triple {10060#(<= main_~b~0 5)} assume !(~b~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,134 INFO L290 TraceCheckUtils]: 83: Hoare triple {10051#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {10051#false} is VALID [2022-04-28 10:34:04,134 INFO L290 TraceCheckUtils]: 84: Hoare triple {10051#false} assume !!(~a~0 < 6);~b~0 := 0; {10051#false} is VALID [2022-04-28 10:34:04,134 INFO L290 TraceCheckUtils]: 85: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-28 10:34:04,135 INFO L290 TraceCheckUtils]: 86: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,135 INFO L290 TraceCheckUtils]: 87: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,135 INFO L290 TraceCheckUtils]: 88: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,135 INFO L290 TraceCheckUtils]: 89: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,135 INFO L290 TraceCheckUtils]: 90: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,135 INFO L290 TraceCheckUtils]: 91: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,135 INFO L290 TraceCheckUtils]: 92: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,135 INFO L290 TraceCheckUtils]: 93: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,135 INFO L290 TraceCheckUtils]: 94: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,135 INFO L290 TraceCheckUtils]: 95: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,135 INFO L290 TraceCheckUtils]: 96: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,135 INFO L290 TraceCheckUtils]: 97: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,135 INFO L290 TraceCheckUtils]: 98: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,136 INFO L290 TraceCheckUtils]: 99: Hoare triple {10051#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10051#false} is VALID [2022-04-28 10:34:04,136 INFO L290 TraceCheckUtils]: 100: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-28 10:34:04,136 INFO L290 TraceCheckUtils]: 101: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,136 INFO L290 TraceCheckUtils]: 102: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,136 INFO L290 TraceCheckUtils]: 103: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,136 INFO L290 TraceCheckUtils]: 104: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,136 INFO L290 TraceCheckUtils]: 105: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,136 INFO L290 TraceCheckUtils]: 106: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,136 INFO L290 TraceCheckUtils]: 107: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,136 INFO L290 TraceCheckUtils]: 108: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,136 INFO L290 TraceCheckUtils]: 109: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,136 INFO L290 TraceCheckUtils]: 110: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,136 INFO L290 TraceCheckUtils]: 111: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,137 INFO L290 TraceCheckUtils]: 112: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,137 INFO L290 TraceCheckUtils]: 113: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,137 INFO L290 TraceCheckUtils]: 114: Hoare triple {10051#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10051#false} is VALID [2022-04-28 10:34:04,137 INFO L290 TraceCheckUtils]: 115: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-28 10:34:04,137 INFO L290 TraceCheckUtils]: 116: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,137 INFO L290 TraceCheckUtils]: 117: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,137 INFO L290 TraceCheckUtils]: 118: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,137 INFO L290 TraceCheckUtils]: 119: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,137 INFO L290 TraceCheckUtils]: 120: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,137 INFO L290 TraceCheckUtils]: 121: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,137 INFO L290 TraceCheckUtils]: 122: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,137 INFO L290 TraceCheckUtils]: 123: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,137 INFO L290 TraceCheckUtils]: 124: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,138 INFO L290 TraceCheckUtils]: 125: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,138 INFO L290 TraceCheckUtils]: 126: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,138 INFO L290 TraceCheckUtils]: 127: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,138 INFO L290 TraceCheckUtils]: 128: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,138 INFO L290 TraceCheckUtils]: 129: Hoare triple {10051#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10051#false} is VALID [2022-04-28 10:34:04,138 INFO L290 TraceCheckUtils]: 130: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-28 10:34:04,138 INFO L290 TraceCheckUtils]: 131: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,138 INFO L290 TraceCheckUtils]: 132: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,138 INFO L290 TraceCheckUtils]: 133: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,138 INFO L290 TraceCheckUtils]: 134: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,138 INFO L290 TraceCheckUtils]: 135: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,138 INFO L290 TraceCheckUtils]: 136: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,138 INFO L290 TraceCheckUtils]: 137: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,139 INFO L290 TraceCheckUtils]: 138: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,139 INFO L290 TraceCheckUtils]: 139: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,139 INFO L290 TraceCheckUtils]: 140: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,139 INFO L290 TraceCheckUtils]: 141: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,139 INFO L290 TraceCheckUtils]: 142: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,139 INFO L290 TraceCheckUtils]: 143: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,139 INFO L290 TraceCheckUtils]: 144: Hoare triple {10051#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10051#false} is VALID [2022-04-28 10:34:04,139 INFO L290 TraceCheckUtils]: 145: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-28 10:34:04,139 INFO L290 TraceCheckUtils]: 146: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,139 INFO L290 TraceCheckUtils]: 147: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,139 INFO L290 TraceCheckUtils]: 148: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,139 INFO L290 TraceCheckUtils]: 149: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,139 INFO L290 TraceCheckUtils]: 150: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,140 INFO L290 TraceCheckUtils]: 151: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,140 INFO L290 TraceCheckUtils]: 152: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,140 INFO L290 TraceCheckUtils]: 153: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,140 INFO L290 TraceCheckUtils]: 154: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,140 INFO L290 TraceCheckUtils]: 155: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,140 INFO L290 TraceCheckUtils]: 156: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,140 INFO L290 TraceCheckUtils]: 157: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,140 INFO L290 TraceCheckUtils]: 158: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,140 INFO L290 TraceCheckUtils]: 159: Hoare triple {10051#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10051#false} is VALID [2022-04-28 10:34:04,140 INFO L290 TraceCheckUtils]: 160: Hoare triple {10051#false} assume !(~b~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,140 INFO L290 TraceCheckUtils]: 161: Hoare triple {10051#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {10051#false} is VALID [2022-04-28 10:34:04,140 INFO L290 TraceCheckUtils]: 162: Hoare triple {10051#false} assume !(~a~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,141 INFO L290 TraceCheckUtils]: 163: Hoare triple {10051#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {10051#false} is VALID [2022-04-28 10:34:04,141 INFO L290 TraceCheckUtils]: 164: Hoare triple {10051#false} assume !false; {10051#false} is VALID [2022-04-28 10:34:04,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4300 backedges. 2188 proven. 875 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2022-04-28 10:34:04,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:34:04,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970000525] [2022-04-28 10:34:04,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970000525] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:34:04,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296082904] [2022-04-28 10:34:04,143 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:34:04,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:34:04,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:34:04,144 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 10:34:04,175 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 10:34:04,237 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:34:04,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:34:04,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 10:34:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:34:04,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:34:04,714 INFO L272 TraceCheckUtils]: 0: Hoare triple {10050#true} call ULTIMATE.init(); {10050#true} is VALID [2022-04-28 10:34:04,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {10050#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(11, 2);call #Ultimate.allocInit(12, 3); {10050#true} is VALID [2022-04-28 10:34:04,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {10050#true} assume true; {10050#true} is VALID [2022-04-28 10:34:04,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10050#true} {10050#true} #56#return; {10050#true} is VALID [2022-04-28 10:34:04,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {10050#true} call #t~ret7 := main(); {10050#true} is VALID [2022-04-28 10:34:04,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {10050#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {10050#true} is VALID [2022-04-28 10:34:04,715 INFO L290 TraceCheckUtils]: 6: Hoare triple {10050#true} assume !!(~a~0 < 6);~b~0 := 0; {10083#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:04,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {10083#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:04,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:04,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {10083#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10083#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:04,716 INFO L290 TraceCheckUtils]: 10: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:04,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {10083#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10083#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:04,716 INFO L290 TraceCheckUtils]: 12: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:04,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {10083#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10083#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:04,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:04,717 INFO L290 TraceCheckUtils]: 15: Hoare triple {10083#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10083#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:04,717 INFO L290 TraceCheckUtils]: 16: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:04,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {10083#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10083#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:04,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:04,718 INFO L290 TraceCheckUtils]: 19: Hoare triple {10083#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10083#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:04,718 INFO L290 TraceCheckUtils]: 20: Hoare triple {10083#(<= main_~b~0 0)} assume !(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:04,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {10083#(<= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:04,719 INFO L290 TraceCheckUtils]: 22: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~b~0 < 6);~c~0 := 0; {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:04,719 INFO L290 TraceCheckUtils]: 23: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:04,720 INFO L290 TraceCheckUtils]: 24: Hoare triple {10056#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:04,720 INFO L290 TraceCheckUtils]: 25: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:04,720 INFO L290 TraceCheckUtils]: 26: Hoare triple {10056#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:04,720 INFO L290 TraceCheckUtils]: 27: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:04,721 INFO L290 TraceCheckUtils]: 28: Hoare triple {10056#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:04,721 INFO L290 TraceCheckUtils]: 29: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:04,721 INFO L290 TraceCheckUtils]: 30: Hoare triple {10056#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:04,722 INFO L290 TraceCheckUtils]: 31: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:04,722 INFO L290 TraceCheckUtils]: 32: Hoare triple {10056#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:04,722 INFO L290 TraceCheckUtils]: 33: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:04,723 INFO L290 TraceCheckUtils]: 34: Hoare triple {10056#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:04,724 INFO L290 TraceCheckUtils]: 35: Hoare triple {10056#(<= main_~b~0 1)} assume !(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:04,724 INFO L290 TraceCheckUtils]: 36: Hoare triple {10056#(<= main_~b~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:04,725 INFO L290 TraceCheckUtils]: 37: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~b~0 < 6);~c~0 := 0; {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:04,725 INFO L290 TraceCheckUtils]: 38: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:04,725 INFO L290 TraceCheckUtils]: 39: Hoare triple {10057#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:04,725 INFO L290 TraceCheckUtils]: 40: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:04,726 INFO L290 TraceCheckUtils]: 41: Hoare triple {10057#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:04,726 INFO L290 TraceCheckUtils]: 42: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:04,726 INFO L290 TraceCheckUtils]: 43: Hoare triple {10057#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:04,726 INFO L290 TraceCheckUtils]: 44: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:04,727 INFO L290 TraceCheckUtils]: 45: Hoare triple {10057#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:04,727 INFO L290 TraceCheckUtils]: 46: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:04,727 INFO L290 TraceCheckUtils]: 47: Hoare triple {10057#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:04,727 INFO L290 TraceCheckUtils]: 48: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:04,728 INFO L290 TraceCheckUtils]: 49: Hoare triple {10057#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:04,728 INFO L290 TraceCheckUtils]: 50: Hoare triple {10057#(<= main_~b~0 2)} assume !(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:04,728 INFO L290 TraceCheckUtils]: 51: Hoare triple {10057#(<= main_~b~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:04,729 INFO L290 TraceCheckUtils]: 52: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~b~0 < 6);~c~0 := 0; {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:04,729 INFO L290 TraceCheckUtils]: 53: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:04,729 INFO L290 TraceCheckUtils]: 54: Hoare triple {10058#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:04,729 INFO L290 TraceCheckUtils]: 55: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:04,730 INFO L290 TraceCheckUtils]: 56: Hoare triple {10058#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:04,730 INFO L290 TraceCheckUtils]: 57: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:04,730 INFO L290 TraceCheckUtils]: 58: Hoare triple {10058#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:04,731 INFO L290 TraceCheckUtils]: 59: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:04,731 INFO L290 TraceCheckUtils]: 60: Hoare triple {10058#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:04,731 INFO L290 TraceCheckUtils]: 61: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:04,731 INFO L290 TraceCheckUtils]: 62: Hoare triple {10058#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:04,732 INFO L290 TraceCheckUtils]: 63: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:04,732 INFO L290 TraceCheckUtils]: 64: Hoare triple {10058#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:04,732 INFO L290 TraceCheckUtils]: 65: Hoare triple {10058#(<= main_~b~0 3)} assume !(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:04,733 INFO L290 TraceCheckUtils]: 66: Hoare triple {10058#(<= main_~b~0 3)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:04,733 INFO L290 TraceCheckUtils]: 67: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~b~0 < 6);~c~0 := 0; {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:04,733 INFO L290 TraceCheckUtils]: 68: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:04,733 INFO L290 TraceCheckUtils]: 69: Hoare triple {10059#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:04,734 INFO L290 TraceCheckUtils]: 70: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:04,734 INFO L290 TraceCheckUtils]: 71: Hoare triple {10059#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:04,734 INFO L290 TraceCheckUtils]: 72: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:04,734 INFO L290 TraceCheckUtils]: 73: Hoare triple {10059#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:04,735 INFO L290 TraceCheckUtils]: 74: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:04,735 INFO L290 TraceCheckUtils]: 75: Hoare triple {10059#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:04,735 INFO L290 TraceCheckUtils]: 76: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:04,736 INFO L290 TraceCheckUtils]: 77: Hoare triple {10059#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:04,736 INFO L290 TraceCheckUtils]: 78: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:04,736 INFO L290 TraceCheckUtils]: 79: Hoare triple {10059#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:04,736 INFO L290 TraceCheckUtils]: 80: Hoare triple {10059#(<= main_~b~0 4)} assume !(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:04,737 INFO L290 TraceCheckUtils]: 81: Hoare triple {10059#(<= main_~b~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10060#(<= main_~b~0 5)} is VALID [2022-04-28 10:34:04,737 INFO L290 TraceCheckUtils]: 82: Hoare triple {10060#(<= main_~b~0 5)} assume !(~b~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,737 INFO L290 TraceCheckUtils]: 83: Hoare triple {10051#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {10051#false} is VALID [2022-04-28 10:34:04,737 INFO L290 TraceCheckUtils]: 84: Hoare triple {10051#false} assume !!(~a~0 < 6);~b~0 := 0; {10051#false} is VALID [2022-04-28 10:34:04,737 INFO L290 TraceCheckUtils]: 85: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-28 10:34:04,737 INFO L290 TraceCheckUtils]: 86: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,737 INFO L290 TraceCheckUtils]: 87: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,737 INFO L290 TraceCheckUtils]: 88: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,738 INFO L290 TraceCheckUtils]: 89: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,738 INFO L290 TraceCheckUtils]: 90: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,738 INFO L290 TraceCheckUtils]: 91: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,738 INFO L290 TraceCheckUtils]: 92: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,738 INFO L290 TraceCheckUtils]: 93: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,738 INFO L290 TraceCheckUtils]: 94: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,738 INFO L290 TraceCheckUtils]: 95: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,738 INFO L290 TraceCheckUtils]: 96: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,738 INFO L290 TraceCheckUtils]: 97: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,738 INFO L290 TraceCheckUtils]: 98: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,738 INFO L290 TraceCheckUtils]: 99: Hoare triple {10051#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10051#false} is VALID [2022-04-28 10:34:04,738 INFO L290 TraceCheckUtils]: 100: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-28 10:34:04,738 INFO L290 TraceCheckUtils]: 101: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,739 INFO L290 TraceCheckUtils]: 102: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,739 INFO L290 TraceCheckUtils]: 103: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,739 INFO L290 TraceCheckUtils]: 104: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,739 INFO L290 TraceCheckUtils]: 105: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,739 INFO L290 TraceCheckUtils]: 106: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,739 INFO L290 TraceCheckUtils]: 107: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,739 INFO L290 TraceCheckUtils]: 108: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,739 INFO L290 TraceCheckUtils]: 109: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,739 INFO L290 TraceCheckUtils]: 110: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,739 INFO L290 TraceCheckUtils]: 111: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,739 INFO L290 TraceCheckUtils]: 112: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,739 INFO L290 TraceCheckUtils]: 113: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,739 INFO L290 TraceCheckUtils]: 114: Hoare triple {10051#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10051#false} is VALID [2022-04-28 10:34:04,739 INFO L290 TraceCheckUtils]: 115: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-28 10:34:04,739 INFO L290 TraceCheckUtils]: 116: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,739 INFO L290 TraceCheckUtils]: 117: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,740 INFO L290 TraceCheckUtils]: 118: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,740 INFO L290 TraceCheckUtils]: 119: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,740 INFO L290 TraceCheckUtils]: 120: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,740 INFO L290 TraceCheckUtils]: 121: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,740 INFO L290 TraceCheckUtils]: 122: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,740 INFO L290 TraceCheckUtils]: 123: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,740 INFO L290 TraceCheckUtils]: 124: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,740 INFO L290 TraceCheckUtils]: 125: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,740 INFO L290 TraceCheckUtils]: 126: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,740 INFO L290 TraceCheckUtils]: 127: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,742 INFO L290 TraceCheckUtils]: 128: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,742 INFO L290 TraceCheckUtils]: 129: Hoare triple {10051#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10051#false} is VALID [2022-04-28 10:34:04,742 INFO L290 TraceCheckUtils]: 130: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-28 10:34:04,742 INFO L290 TraceCheckUtils]: 131: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,742 INFO L290 TraceCheckUtils]: 132: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,742 INFO L290 TraceCheckUtils]: 133: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,742 INFO L290 TraceCheckUtils]: 134: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,742 INFO L290 TraceCheckUtils]: 135: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,742 INFO L290 TraceCheckUtils]: 136: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,743 INFO L290 TraceCheckUtils]: 137: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,743 INFO L290 TraceCheckUtils]: 138: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,743 INFO L290 TraceCheckUtils]: 139: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,743 INFO L290 TraceCheckUtils]: 140: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,743 INFO L290 TraceCheckUtils]: 141: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,743 INFO L290 TraceCheckUtils]: 142: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,743 INFO L290 TraceCheckUtils]: 143: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,743 INFO L290 TraceCheckUtils]: 144: Hoare triple {10051#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10051#false} is VALID [2022-04-28 10:34:04,743 INFO L290 TraceCheckUtils]: 145: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-28 10:34:04,743 INFO L290 TraceCheckUtils]: 146: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,743 INFO L290 TraceCheckUtils]: 147: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,743 INFO L290 TraceCheckUtils]: 148: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,743 INFO L290 TraceCheckUtils]: 149: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,743 INFO L290 TraceCheckUtils]: 150: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,743 INFO L290 TraceCheckUtils]: 151: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,743 INFO L290 TraceCheckUtils]: 152: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,743 INFO L290 TraceCheckUtils]: 153: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,744 INFO L290 TraceCheckUtils]: 154: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,744 INFO L290 TraceCheckUtils]: 155: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,744 INFO L290 TraceCheckUtils]: 156: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,744 INFO L290 TraceCheckUtils]: 157: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:04,744 INFO L290 TraceCheckUtils]: 158: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,744 INFO L290 TraceCheckUtils]: 159: Hoare triple {10051#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10051#false} is VALID [2022-04-28 10:34:04,744 INFO L290 TraceCheckUtils]: 160: Hoare triple {10051#false} assume !(~b~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,744 INFO L290 TraceCheckUtils]: 161: Hoare triple {10051#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {10051#false} is VALID [2022-04-28 10:34:04,744 INFO L290 TraceCheckUtils]: 162: Hoare triple {10051#false} assume !(~a~0 < 6); {10051#false} is VALID [2022-04-28 10:34:04,744 INFO L290 TraceCheckUtils]: 163: Hoare triple {10051#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {10051#false} is VALID [2022-04-28 10:34:04,744 INFO L290 TraceCheckUtils]: 164: Hoare triple {10051#false} assume !false; {10051#false} is VALID [2022-04-28 10:34:04,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4300 backedges. 2188 proven. 875 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2022-04-28 10:34:04,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:34:05,187 INFO L290 TraceCheckUtils]: 164: Hoare triple {10051#false} assume !false; {10051#false} is VALID [2022-04-28 10:34:05,187 INFO L290 TraceCheckUtils]: 163: Hoare triple {10051#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {10051#false} is VALID [2022-04-28 10:34:05,187 INFO L290 TraceCheckUtils]: 162: Hoare triple {10051#false} assume !(~a~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,187 INFO L290 TraceCheckUtils]: 161: Hoare triple {10051#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {10051#false} is VALID [2022-04-28 10:34:05,188 INFO L290 TraceCheckUtils]: 160: Hoare triple {10051#false} assume !(~b~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,188 INFO L290 TraceCheckUtils]: 159: Hoare triple {10051#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10051#false} is VALID [2022-04-28 10:34:05,188 INFO L290 TraceCheckUtils]: 158: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,188 INFO L290 TraceCheckUtils]: 157: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:05,188 INFO L290 TraceCheckUtils]: 156: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,188 INFO L290 TraceCheckUtils]: 155: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:05,188 INFO L290 TraceCheckUtils]: 154: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,188 INFO L290 TraceCheckUtils]: 153: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:05,188 INFO L290 TraceCheckUtils]: 152: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,188 INFO L290 TraceCheckUtils]: 151: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:05,188 INFO L290 TraceCheckUtils]: 150: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,188 INFO L290 TraceCheckUtils]: 149: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:05,188 INFO L290 TraceCheckUtils]: 148: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,188 INFO L290 TraceCheckUtils]: 147: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:05,188 INFO L290 TraceCheckUtils]: 146: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,188 INFO L290 TraceCheckUtils]: 145: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-28 10:34:05,188 INFO L290 TraceCheckUtils]: 144: Hoare triple {10051#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10051#false} is VALID [2022-04-28 10:34:05,188 INFO L290 TraceCheckUtils]: 143: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,189 INFO L290 TraceCheckUtils]: 142: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:05,189 INFO L290 TraceCheckUtils]: 141: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,189 INFO L290 TraceCheckUtils]: 140: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:05,189 INFO L290 TraceCheckUtils]: 139: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,189 INFO L290 TraceCheckUtils]: 138: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:05,189 INFO L290 TraceCheckUtils]: 137: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,189 INFO L290 TraceCheckUtils]: 136: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:05,189 INFO L290 TraceCheckUtils]: 135: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,189 INFO L290 TraceCheckUtils]: 134: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:05,189 INFO L290 TraceCheckUtils]: 133: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,189 INFO L290 TraceCheckUtils]: 132: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:05,189 INFO L290 TraceCheckUtils]: 131: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,189 INFO L290 TraceCheckUtils]: 130: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-28 10:34:05,189 INFO L290 TraceCheckUtils]: 129: Hoare triple {10051#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10051#false} is VALID [2022-04-28 10:34:05,189 INFO L290 TraceCheckUtils]: 128: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,189 INFO L290 TraceCheckUtils]: 127: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:05,189 INFO L290 TraceCheckUtils]: 126: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,189 INFO L290 TraceCheckUtils]: 125: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:05,189 INFO L290 TraceCheckUtils]: 124: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,190 INFO L290 TraceCheckUtils]: 123: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:05,190 INFO L290 TraceCheckUtils]: 122: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,190 INFO L290 TraceCheckUtils]: 121: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:05,190 INFO L290 TraceCheckUtils]: 120: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,190 INFO L290 TraceCheckUtils]: 119: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:05,190 INFO L290 TraceCheckUtils]: 118: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,190 INFO L290 TraceCheckUtils]: 117: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:05,190 INFO L290 TraceCheckUtils]: 116: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,190 INFO L290 TraceCheckUtils]: 115: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-28 10:34:05,190 INFO L290 TraceCheckUtils]: 114: Hoare triple {10051#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10051#false} is VALID [2022-04-28 10:34:05,190 INFO L290 TraceCheckUtils]: 113: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,190 INFO L290 TraceCheckUtils]: 112: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:05,190 INFO L290 TraceCheckUtils]: 111: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,190 INFO L290 TraceCheckUtils]: 110: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:05,190 INFO L290 TraceCheckUtils]: 109: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,190 INFO L290 TraceCheckUtils]: 108: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:05,190 INFO L290 TraceCheckUtils]: 107: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,190 INFO L290 TraceCheckUtils]: 106: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:05,191 INFO L290 TraceCheckUtils]: 105: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,191 INFO L290 TraceCheckUtils]: 104: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:05,191 INFO L290 TraceCheckUtils]: 103: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,191 INFO L290 TraceCheckUtils]: 102: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:05,191 INFO L290 TraceCheckUtils]: 101: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,191 INFO L290 TraceCheckUtils]: 100: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-28 10:34:05,191 INFO L290 TraceCheckUtils]: 99: Hoare triple {10051#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10051#false} is VALID [2022-04-28 10:34:05,191 INFO L290 TraceCheckUtils]: 98: Hoare triple {10051#false} assume !(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,191 INFO L290 TraceCheckUtils]: 97: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:05,191 INFO L290 TraceCheckUtils]: 96: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,191 INFO L290 TraceCheckUtils]: 95: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:05,191 INFO L290 TraceCheckUtils]: 94: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,192 INFO L290 TraceCheckUtils]: 93: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:05,192 INFO L290 TraceCheckUtils]: 92: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,192 INFO L290 TraceCheckUtils]: 91: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:05,192 INFO L290 TraceCheckUtils]: 90: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,192 INFO L290 TraceCheckUtils]: 89: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:05,192 INFO L290 TraceCheckUtils]: 88: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,192 INFO L290 TraceCheckUtils]: 87: Hoare triple {10051#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10051#false} is VALID [2022-04-28 10:34:05,192 INFO L290 TraceCheckUtils]: 86: Hoare triple {10051#false} assume !!(~c~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,192 INFO L290 TraceCheckUtils]: 85: Hoare triple {10051#false} assume !!(~b~0 < 6);~c~0 := 0; {10051#false} is VALID [2022-04-28 10:34:05,192 INFO L290 TraceCheckUtils]: 84: Hoare triple {10051#false} assume !!(~a~0 < 6);~b~0 := 0; {10051#false} is VALID [2022-04-28 10:34:05,192 INFO L290 TraceCheckUtils]: 83: Hoare triple {10051#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {10051#false} is VALID [2022-04-28 10:34:05,193 INFO L290 TraceCheckUtils]: 82: Hoare triple {10060#(<= main_~b~0 5)} assume !(~b~0 < 6); {10051#false} is VALID [2022-04-28 10:34:05,193 INFO L290 TraceCheckUtils]: 81: Hoare triple {10059#(<= main_~b~0 4)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10060#(<= main_~b~0 5)} is VALID [2022-04-28 10:34:05,193 INFO L290 TraceCheckUtils]: 80: Hoare triple {10059#(<= main_~b~0 4)} assume !(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:05,195 INFO L290 TraceCheckUtils]: 79: Hoare triple {10059#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:05,196 INFO L290 TraceCheckUtils]: 78: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:05,196 INFO L290 TraceCheckUtils]: 77: Hoare triple {10059#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:05,196 INFO L290 TraceCheckUtils]: 76: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:05,197 INFO L290 TraceCheckUtils]: 75: Hoare triple {10059#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:05,197 INFO L290 TraceCheckUtils]: 74: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:05,197 INFO L290 TraceCheckUtils]: 73: Hoare triple {10059#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:05,198 INFO L290 TraceCheckUtils]: 72: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:05,198 INFO L290 TraceCheckUtils]: 71: Hoare triple {10059#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:05,198 INFO L290 TraceCheckUtils]: 70: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:05,199 INFO L290 TraceCheckUtils]: 69: Hoare triple {10059#(<= main_~b~0 4)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:05,199 INFO L290 TraceCheckUtils]: 68: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~c~0 < 6); {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:05,199 INFO L290 TraceCheckUtils]: 67: Hoare triple {10059#(<= main_~b~0 4)} assume !!(~b~0 < 6);~c~0 := 0; {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:05,200 INFO L290 TraceCheckUtils]: 66: Hoare triple {10058#(<= main_~b~0 3)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10059#(<= main_~b~0 4)} is VALID [2022-04-28 10:34:05,200 INFO L290 TraceCheckUtils]: 65: Hoare triple {10058#(<= main_~b~0 3)} assume !(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:05,200 INFO L290 TraceCheckUtils]: 64: Hoare triple {10058#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:05,201 INFO L290 TraceCheckUtils]: 63: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:05,201 INFO L290 TraceCheckUtils]: 62: Hoare triple {10058#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:05,201 INFO L290 TraceCheckUtils]: 61: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:05,202 INFO L290 TraceCheckUtils]: 60: Hoare triple {10058#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:05,202 INFO L290 TraceCheckUtils]: 59: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:05,202 INFO L290 TraceCheckUtils]: 58: Hoare triple {10058#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:05,203 INFO L290 TraceCheckUtils]: 57: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:05,203 INFO L290 TraceCheckUtils]: 56: Hoare triple {10058#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:05,203 INFO L290 TraceCheckUtils]: 55: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:05,204 INFO L290 TraceCheckUtils]: 54: Hoare triple {10058#(<= main_~b~0 3)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:05,204 INFO L290 TraceCheckUtils]: 53: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~c~0 < 6); {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:05,204 INFO L290 TraceCheckUtils]: 52: Hoare triple {10058#(<= main_~b~0 3)} assume !!(~b~0 < 6);~c~0 := 0; {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:05,205 INFO L290 TraceCheckUtils]: 51: Hoare triple {10057#(<= main_~b~0 2)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10058#(<= main_~b~0 3)} is VALID [2022-04-28 10:34:05,205 INFO L290 TraceCheckUtils]: 50: Hoare triple {10057#(<= main_~b~0 2)} assume !(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:05,205 INFO L290 TraceCheckUtils]: 49: Hoare triple {10057#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:05,206 INFO L290 TraceCheckUtils]: 48: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:05,206 INFO L290 TraceCheckUtils]: 47: Hoare triple {10057#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:05,206 INFO L290 TraceCheckUtils]: 46: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:05,207 INFO L290 TraceCheckUtils]: 45: Hoare triple {10057#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:05,207 INFO L290 TraceCheckUtils]: 44: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:05,207 INFO L290 TraceCheckUtils]: 43: Hoare triple {10057#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:05,208 INFO L290 TraceCheckUtils]: 42: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:05,208 INFO L290 TraceCheckUtils]: 41: Hoare triple {10057#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:05,208 INFO L290 TraceCheckUtils]: 40: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:05,209 INFO L290 TraceCheckUtils]: 39: Hoare triple {10057#(<= main_~b~0 2)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:05,209 INFO L290 TraceCheckUtils]: 38: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~c~0 < 6); {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:05,209 INFO L290 TraceCheckUtils]: 37: Hoare triple {10057#(<= main_~b~0 2)} assume !!(~b~0 < 6);~c~0 := 0; {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:05,210 INFO L290 TraceCheckUtils]: 36: Hoare triple {10056#(<= main_~b~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10057#(<= main_~b~0 2)} is VALID [2022-04-28 10:34:05,210 INFO L290 TraceCheckUtils]: 35: Hoare triple {10056#(<= main_~b~0 1)} assume !(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:05,211 INFO L290 TraceCheckUtils]: 34: Hoare triple {10056#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:05,211 INFO L290 TraceCheckUtils]: 33: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:05,211 INFO L290 TraceCheckUtils]: 32: Hoare triple {10056#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:05,212 INFO L290 TraceCheckUtils]: 31: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:05,212 INFO L290 TraceCheckUtils]: 30: Hoare triple {10056#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:05,212 INFO L290 TraceCheckUtils]: 29: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:05,213 INFO L290 TraceCheckUtils]: 28: Hoare triple {10056#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:05,213 INFO L290 TraceCheckUtils]: 27: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:05,213 INFO L290 TraceCheckUtils]: 26: Hoare triple {10056#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:05,213 INFO L290 TraceCheckUtils]: 25: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:05,214 INFO L290 TraceCheckUtils]: 24: Hoare triple {10056#(<= main_~b~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:05,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~c~0 < 6); {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:05,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {10056#(<= main_~b~0 1)} assume !!(~b~0 < 6);~c~0 := 0; {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:05,215 INFO L290 TraceCheckUtils]: 21: Hoare triple {10083#(<= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {10056#(<= main_~b~0 1)} is VALID [2022-04-28 10:34:05,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {10083#(<= main_~b~0 0)} assume !(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:05,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {10083#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10083#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:05,215 INFO L290 TraceCheckUtils]: 18: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:05,216 INFO L290 TraceCheckUtils]: 17: Hoare triple {10083#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10083#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:05,216 INFO L290 TraceCheckUtils]: 16: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:05,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {10083#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10083#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:05,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:05,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {10083#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10083#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:05,217 INFO L290 TraceCheckUtils]: 12: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:05,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {10083#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10083#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:05,218 INFO L290 TraceCheckUtils]: 10: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:05,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {10083#(<= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {10083#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:05,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~c~0 < 6); {10083#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:05,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {10083#(<= main_~b~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {10083#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:05,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {10050#true} assume !!(~a~0 < 6);~b~0 := 0; {10083#(<= main_~b~0 0)} is VALID [2022-04-28 10:34:05,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {10050#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {10050#true} is VALID [2022-04-28 10:34:05,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {10050#true} call #t~ret7 := main(); {10050#true} is VALID [2022-04-28 10:34:05,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10050#true} {10050#true} #56#return; {10050#true} is VALID [2022-04-28 10:34:05,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {10050#true} assume true; {10050#true} is VALID [2022-04-28 10:34:05,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {10050#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(11, 2);call #Ultimate.allocInit(12, 3); {10050#true} is VALID [2022-04-28 10:34:05,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {10050#true} call ULTIMATE.init(); {10050#true} is VALID [2022-04-28 10:34:05,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4300 backedges. 2188 proven. 875 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2022-04-28 10:34:05,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296082904] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:34:05,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:34:05,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 10 [2022-04-28 10:34:05,222 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:34:05,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1714921259] [2022-04-28 10:34:05,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1714921259] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:34:05,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:34:05,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:34:05,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820987648] [2022-04-28 10:34:05,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:34:05,223 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 165 [2022-04-28 10:34:05,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:34:05,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:05,254 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 10:34:05,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:34:05,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:34:05,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:34:05,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:34:05,255 INFO L87 Difference]: Start difference. First operand 166 states and 178 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:05,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:34:05,763 INFO L93 Difference]: Finished difference Result 279 states and 301 transitions. [2022-04-28 10:34:05,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:34:05,763 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 165 [2022-04-28 10:34:05,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:34:05,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:05,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2022-04-28 10:34:05,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:05,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2022-04-28 10:34:05,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 55 transitions. [2022-04-28 10:34:05,810 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 10:34:05,813 INFO L225 Difference]: With dead ends: 279 [2022-04-28 10:34:05,814 INFO L226 Difference]: Without dead ends: 196 [2022-04-28 10:34:05,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 330 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:34:05,815 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 56 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:34:05,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 22 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:34:05,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-04-28 10:34:06,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2022-04-28 10:34:06,260 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:34:06,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 196 states. Second operand has 196 states, 192 states have (on average 1.078125) internal successors, (207), 192 states have internal predecessors, (207), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:06,261 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand has 196 states, 192 states have (on average 1.078125) internal successors, (207), 192 states have internal predecessors, (207), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:06,261 INFO L87 Difference]: Start difference. First operand 196 states. Second operand has 196 states, 192 states have (on average 1.078125) internal successors, (207), 192 states have internal predecessors, (207), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:06,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:34:06,265 INFO L93 Difference]: Finished difference Result 196 states and 210 transitions. [2022-04-28 10:34:06,265 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 210 transitions. [2022-04-28 10:34:06,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:34:06,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:34:06,266 INFO L74 IsIncluded]: Start isIncluded. First operand has 196 states, 192 states have (on average 1.078125) internal successors, (207), 192 states have internal predecessors, (207), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 196 states. [2022-04-28 10:34:06,266 INFO L87 Difference]: Start difference. First operand has 196 states, 192 states have (on average 1.078125) internal successors, (207), 192 states have internal predecessors, (207), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 196 states. [2022-04-28 10:34:06,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:34:06,269 INFO L93 Difference]: Finished difference Result 196 states and 210 transitions. [2022-04-28 10:34:06,269 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 210 transitions. [2022-04-28 10:34:06,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:34:06,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:34:06,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:34:06,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:34:06,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 192 states have (on average 1.078125) internal successors, (207), 192 states have internal predecessors, (207), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:06,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 210 transitions. [2022-04-28 10:34:06,274 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 210 transitions. Word has length 165 [2022-04-28 10:34:06,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:34:06,274 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 210 transitions. [2022-04-28 10:34:06,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:06,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 196 states and 210 transitions. [2022-04-28 10:34:06,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:34:06,512 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 210 transitions. [2022-04-28 10:34:06,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-04-28 10:34:06,514 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:34:06,514 INFO L195 NwaCegarLoop]: trace histogram [72, 72, 12, 12, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:34:06,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-28 10:34:06,727 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,SelfDestructingSolverStorable14 [2022-04-28 10:34:06,728 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:34:06,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:34:06,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1201246079, now seen corresponding path program 23 times [2022-04-28 10:34:06,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:34:06,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2144117138] [2022-04-28 10:34:06,960 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:34:07,083 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:34:07,084 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:34:07,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1201246079, now seen corresponding path program 24 times [2022-04-28 10:34:07,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:34:07,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736507845] [2022-04-28 10:34:07,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:34:07,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:34:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:34:07,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:34:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:34:07,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {12414#(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(11, 2);call #Ultimate.allocInit(12, 3); {12406#true} is VALID [2022-04-28 10:34:07,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {12406#true} assume true; {12406#true} is VALID [2022-04-28 10:34:07,195 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12406#true} {12406#true} #56#return; {12406#true} is VALID [2022-04-28 10:34:07,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {12406#true} call ULTIMATE.init(); {12414#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:34:07,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {12414#(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(11, 2);call #Ultimate.allocInit(12, 3); {12406#true} is VALID [2022-04-28 10:34:07,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {12406#true} assume true; {12406#true} is VALID [2022-04-28 10:34:07,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12406#true} {12406#true} #56#return; {12406#true} is VALID [2022-04-28 10:34:07,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {12406#true} call #t~ret7 := main(); {12406#true} is VALID [2022-04-28 10:34:07,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {12406#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {12411#(= main_~a~0 0)} assume !!(~a~0 < 6);~b~0 := 0; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {12411#(= main_~a~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,199 INFO L290 TraceCheckUtils]: 15: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,201 INFO L290 TraceCheckUtils]: 19: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,201 INFO L290 TraceCheckUtils]: 20: Hoare triple {12411#(= main_~a~0 0)} assume !(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,201 INFO L290 TraceCheckUtils]: 21: Hoare triple {12411#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,201 INFO L290 TraceCheckUtils]: 22: Hoare triple {12411#(= main_~a~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,202 INFO L290 TraceCheckUtils]: 23: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,202 INFO L290 TraceCheckUtils]: 24: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,202 INFO L290 TraceCheckUtils]: 25: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,203 INFO L290 TraceCheckUtils]: 26: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,203 INFO L290 TraceCheckUtils]: 27: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,203 INFO L290 TraceCheckUtils]: 28: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,203 INFO L290 TraceCheckUtils]: 29: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,204 INFO L290 TraceCheckUtils]: 30: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,204 INFO L290 TraceCheckUtils]: 31: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,204 INFO L290 TraceCheckUtils]: 32: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,205 INFO L290 TraceCheckUtils]: 33: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,205 INFO L290 TraceCheckUtils]: 34: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,205 INFO L290 TraceCheckUtils]: 35: Hoare triple {12411#(= main_~a~0 0)} assume !(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,205 INFO L290 TraceCheckUtils]: 36: Hoare triple {12411#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,206 INFO L290 TraceCheckUtils]: 37: Hoare triple {12411#(= main_~a~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,206 INFO L290 TraceCheckUtils]: 38: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,206 INFO L290 TraceCheckUtils]: 39: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,207 INFO L290 TraceCheckUtils]: 40: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,207 INFO L290 TraceCheckUtils]: 41: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,207 INFO L290 TraceCheckUtils]: 42: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,207 INFO L290 TraceCheckUtils]: 43: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,208 INFO L290 TraceCheckUtils]: 44: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,208 INFO L290 TraceCheckUtils]: 45: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,208 INFO L290 TraceCheckUtils]: 46: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,209 INFO L290 TraceCheckUtils]: 47: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,209 INFO L290 TraceCheckUtils]: 48: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,209 INFO L290 TraceCheckUtils]: 49: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,209 INFO L290 TraceCheckUtils]: 50: Hoare triple {12411#(= main_~a~0 0)} assume !(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,210 INFO L290 TraceCheckUtils]: 51: Hoare triple {12411#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,210 INFO L290 TraceCheckUtils]: 52: Hoare triple {12411#(= main_~a~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,210 INFO L290 TraceCheckUtils]: 53: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,211 INFO L290 TraceCheckUtils]: 54: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,211 INFO L290 TraceCheckUtils]: 55: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,211 INFO L290 TraceCheckUtils]: 56: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,211 INFO L290 TraceCheckUtils]: 57: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,212 INFO L290 TraceCheckUtils]: 58: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,212 INFO L290 TraceCheckUtils]: 59: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,212 INFO L290 TraceCheckUtils]: 60: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,212 INFO L290 TraceCheckUtils]: 61: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,213 INFO L290 TraceCheckUtils]: 62: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,213 INFO L290 TraceCheckUtils]: 63: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,213 INFO L290 TraceCheckUtils]: 64: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,214 INFO L290 TraceCheckUtils]: 65: Hoare triple {12411#(= main_~a~0 0)} assume !(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,214 INFO L290 TraceCheckUtils]: 66: Hoare triple {12411#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,214 INFO L290 TraceCheckUtils]: 67: Hoare triple {12411#(= main_~a~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,214 INFO L290 TraceCheckUtils]: 68: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,215 INFO L290 TraceCheckUtils]: 69: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,215 INFO L290 TraceCheckUtils]: 70: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,215 INFO L290 TraceCheckUtils]: 71: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,216 INFO L290 TraceCheckUtils]: 72: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,216 INFO L290 TraceCheckUtils]: 73: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,216 INFO L290 TraceCheckUtils]: 74: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,216 INFO L290 TraceCheckUtils]: 75: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,217 INFO L290 TraceCheckUtils]: 76: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,217 INFO L290 TraceCheckUtils]: 77: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,217 INFO L290 TraceCheckUtils]: 78: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,218 INFO L290 TraceCheckUtils]: 79: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,218 INFO L290 TraceCheckUtils]: 80: Hoare triple {12411#(= main_~a~0 0)} assume !(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,218 INFO L290 TraceCheckUtils]: 81: Hoare triple {12411#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,218 INFO L290 TraceCheckUtils]: 82: Hoare triple {12411#(= main_~a~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,219 INFO L290 TraceCheckUtils]: 83: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,219 INFO L290 TraceCheckUtils]: 84: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,219 INFO L290 TraceCheckUtils]: 85: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,219 INFO L290 TraceCheckUtils]: 86: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,220 INFO L290 TraceCheckUtils]: 87: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,220 INFO L290 TraceCheckUtils]: 88: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,220 INFO L290 TraceCheckUtils]: 89: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,221 INFO L290 TraceCheckUtils]: 90: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,221 INFO L290 TraceCheckUtils]: 91: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,221 INFO L290 TraceCheckUtils]: 92: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,221 INFO L290 TraceCheckUtils]: 93: Hoare triple {12411#(= main_~a~0 0)} assume !!(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,222 INFO L290 TraceCheckUtils]: 94: Hoare triple {12411#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,222 INFO L290 TraceCheckUtils]: 95: Hoare triple {12411#(= main_~a~0 0)} assume !(~c~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,222 INFO L290 TraceCheckUtils]: 96: Hoare triple {12411#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,223 INFO L290 TraceCheckUtils]: 97: Hoare triple {12411#(= main_~a~0 0)} assume !(~b~0 < 6); {12411#(= main_~a~0 0)} is VALID [2022-04-28 10:34:07,223 INFO L290 TraceCheckUtils]: 98: Hoare triple {12411#(= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,223 INFO L290 TraceCheckUtils]: 99: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~a~0 < 6);~b~0 := 0; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,224 INFO L290 TraceCheckUtils]: 100: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~b~0 < 6);~c~0 := 0; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,224 INFO L290 TraceCheckUtils]: 101: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,224 INFO L290 TraceCheckUtils]: 102: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,224 INFO L290 TraceCheckUtils]: 103: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,225 INFO L290 TraceCheckUtils]: 104: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,225 INFO L290 TraceCheckUtils]: 105: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,225 INFO L290 TraceCheckUtils]: 106: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,225 INFO L290 TraceCheckUtils]: 107: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,226 INFO L290 TraceCheckUtils]: 108: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,226 INFO L290 TraceCheckUtils]: 109: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,226 INFO L290 TraceCheckUtils]: 110: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,227 INFO L290 TraceCheckUtils]: 111: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,227 INFO L290 TraceCheckUtils]: 112: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,227 INFO L290 TraceCheckUtils]: 113: Hoare triple {12412#(<= main_~a~0 1)} assume !(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,227 INFO L290 TraceCheckUtils]: 114: Hoare triple {12412#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,228 INFO L290 TraceCheckUtils]: 115: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~b~0 < 6);~c~0 := 0; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,228 INFO L290 TraceCheckUtils]: 116: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,228 INFO L290 TraceCheckUtils]: 117: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,228 INFO L290 TraceCheckUtils]: 118: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,229 INFO L290 TraceCheckUtils]: 119: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,229 INFO L290 TraceCheckUtils]: 120: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,229 INFO L290 TraceCheckUtils]: 121: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,229 INFO L290 TraceCheckUtils]: 122: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,230 INFO L290 TraceCheckUtils]: 123: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,230 INFO L290 TraceCheckUtils]: 124: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,230 INFO L290 TraceCheckUtils]: 125: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,231 INFO L290 TraceCheckUtils]: 126: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,231 INFO L290 TraceCheckUtils]: 127: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,231 INFO L290 TraceCheckUtils]: 128: Hoare triple {12412#(<= main_~a~0 1)} assume !(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,231 INFO L290 TraceCheckUtils]: 129: Hoare triple {12412#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,232 INFO L290 TraceCheckUtils]: 130: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~b~0 < 6);~c~0 := 0; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,232 INFO L290 TraceCheckUtils]: 131: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,232 INFO L290 TraceCheckUtils]: 132: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,233 INFO L290 TraceCheckUtils]: 133: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,233 INFO L290 TraceCheckUtils]: 134: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,233 INFO L290 TraceCheckUtils]: 135: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,233 INFO L290 TraceCheckUtils]: 136: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,234 INFO L290 TraceCheckUtils]: 137: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,234 INFO L290 TraceCheckUtils]: 138: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,234 INFO L290 TraceCheckUtils]: 139: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,234 INFO L290 TraceCheckUtils]: 140: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,235 INFO L290 TraceCheckUtils]: 141: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,235 INFO L290 TraceCheckUtils]: 142: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,235 INFO L290 TraceCheckUtils]: 143: Hoare triple {12412#(<= main_~a~0 1)} assume !(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,236 INFO L290 TraceCheckUtils]: 144: Hoare triple {12412#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,236 INFO L290 TraceCheckUtils]: 145: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~b~0 < 6);~c~0 := 0; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,236 INFO L290 TraceCheckUtils]: 146: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,236 INFO L290 TraceCheckUtils]: 147: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,237 INFO L290 TraceCheckUtils]: 148: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,237 INFO L290 TraceCheckUtils]: 149: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,237 INFO L290 TraceCheckUtils]: 150: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,238 INFO L290 TraceCheckUtils]: 151: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,238 INFO L290 TraceCheckUtils]: 152: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,238 INFO L290 TraceCheckUtils]: 153: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,238 INFO L290 TraceCheckUtils]: 154: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,239 INFO L290 TraceCheckUtils]: 155: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,239 INFO L290 TraceCheckUtils]: 156: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,239 INFO L290 TraceCheckUtils]: 157: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,239 INFO L290 TraceCheckUtils]: 158: Hoare triple {12412#(<= main_~a~0 1)} assume !(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,240 INFO L290 TraceCheckUtils]: 159: Hoare triple {12412#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,240 INFO L290 TraceCheckUtils]: 160: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~b~0 < 6);~c~0 := 0; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,240 INFO L290 TraceCheckUtils]: 161: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,241 INFO L290 TraceCheckUtils]: 162: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,241 INFO L290 TraceCheckUtils]: 163: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,241 INFO L290 TraceCheckUtils]: 164: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,241 INFO L290 TraceCheckUtils]: 165: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,242 INFO L290 TraceCheckUtils]: 166: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,242 INFO L290 TraceCheckUtils]: 167: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,242 INFO L290 TraceCheckUtils]: 168: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,242 INFO L290 TraceCheckUtils]: 169: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,243 INFO L290 TraceCheckUtils]: 170: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,243 INFO L290 TraceCheckUtils]: 171: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,243 INFO L290 TraceCheckUtils]: 172: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,244 INFO L290 TraceCheckUtils]: 173: Hoare triple {12412#(<= main_~a~0 1)} assume !(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,244 INFO L290 TraceCheckUtils]: 174: Hoare triple {12412#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,244 INFO L290 TraceCheckUtils]: 175: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~b~0 < 6);~c~0 := 0; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,244 INFO L290 TraceCheckUtils]: 176: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,245 INFO L290 TraceCheckUtils]: 177: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,245 INFO L290 TraceCheckUtils]: 178: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,245 INFO L290 TraceCheckUtils]: 179: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,246 INFO L290 TraceCheckUtils]: 180: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,246 INFO L290 TraceCheckUtils]: 181: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,246 INFO L290 TraceCheckUtils]: 182: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,246 INFO L290 TraceCheckUtils]: 183: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,247 INFO L290 TraceCheckUtils]: 184: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,247 INFO L290 TraceCheckUtils]: 185: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,247 INFO L290 TraceCheckUtils]: 186: Hoare triple {12412#(<= main_~a~0 1)} assume !!(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,247 INFO L290 TraceCheckUtils]: 187: Hoare triple {12412#(<= main_~a~0 1)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,248 INFO L290 TraceCheckUtils]: 188: Hoare triple {12412#(<= main_~a~0 1)} assume !(~c~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,248 INFO L290 TraceCheckUtils]: 189: Hoare triple {12412#(<= main_~a~0 1)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,248 INFO L290 TraceCheckUtils]: 190: Hoare triple {12412#(<= main_~a~0 1)} assume !(~b~0 < 6); {12412#(<= main_~a~0 1)} is VALID [2022-04-28 10:34:07,249 INFO L290 TraceCheckUtils]: 191: Hoare triple {12412#(<= main_~a~0 1)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {12413#(<= main_~a~0 2)} is VALID [2022-04-28 10:34:07,249 INFO L290 TraceCheckUtils]: 192: Hoare triple {12413#(<= main_~a~0 2)} assume !(~a~0 < 6); {12407#false} is VALID [2022-04-28 10:34:07,249 INFO L290 TraceCheckUtils]: 193: Hoare triple {12407#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {12407#false} is VALID [2022-04-28 10:34:07,249 INFO L290 TraceCheckUtils]: 194: Hoare triple {12407#false} assume !false; {12407#false} is VALID [2022-04-28 10:34:07,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6203 backedges. 0 proven. 3149 refuted. 0 times theorem prover too weak. 3054 trivial. 0 not checked. [2022-04-28 10:34:07,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:34:07,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736507845] [2022-04-28 10:34:07,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736507845] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:34:07,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709245587] [2022-04-28 10:34:07,252 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:34:07,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:34:07,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:34:07,253 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 10:34:07,275 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 10:34:07,382 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 42 check-sat command(s) [2022-04-28 10:34:07,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:34:07,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 10:34:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:34:07,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:34:08,351 INFO L272 TraceCheckUtils]: 0: Hoare triple {12406#true} call ULTIMATE.init(); {12406#true} is VALID [2022-04-28 10:34:08,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {12406#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(11, 2);call #Ultimate.allocInit(12, 3); {12406#true} is VALID [2022-04-28 10:34:08,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {12406#true} assume true; {12406#true} is VALID [2022-04-28 10:34:08,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12406#true} {12406#true} #56#return; {12406#true} is VALID [2022-04-28 10:34:08,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {12406#true} call #t~ret7 := main(); {12406#true} is VALID [2022-04-28 10:34:08,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {12406#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {12406#true} is VALID [2022-04-28 10:34:08,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {12406#true} assume !!(~a~0 < 6);~b~0 := 0; {12406#true} is VALID [2022-04-28 10:34:08,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {12406#true} assume !!(~b~0 < 6);~c~0 := 0; {12406#true} is VALID [2022-04-28 10:34:08,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-28 10:34:08,352 INFO L290 TraceCheckUtils]: 10: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-28 10:34:08,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-28 10:34:08,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-28 10:34:08,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-28 10:34:08,352 INFO L290 TraceCheckUtils]: 18: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-28 10:34:08,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {12406#true} assume !(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {12406#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12406#true} is VALID [2022-04-28 10:34:08,352 INFO L290 TraceCheckUtils]: 22: Hoare triple {12406#true} assume !!(~b~0 < 6);~c~0 := 0; {12406#true} is VALID [2022-04-28 10:34:08,352 INFO L290 TraceCheckUtils]: 23: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,352 INFO L290 TraceCheckUtils]: 24: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-28 10:34:08,353 INFO L290 TraceCheckUtils]: 25: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,353 INFO L290 TraceCheckUtils]: 26: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-28 10:34:08,353 INFO L290 TraceCheckUtils]: 27: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,353 INFO L290 TraceCheckUtils]: 28: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-28 10:34:08,353 INFO L290 TraceCheckUtils]: 29: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,353 INFO L290 TraceCheckUtils]: 30: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-28 10:34:08,353 INFO L290 TraceCheckUtils]: 31: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,353 INFO L290 TraceCheckUtils]: 32: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-28 10:34:08,353 INFO L290 TraceCheckUtils]: 33: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,353 INFO L290 TraceCheckUtils]: 34: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-28 10:34:08,353 INFO L290 TraceCheckUtils]: 35: Hoare triple {12406#true} assume !(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,353 INFO L290 TraceCheckUtils]: 36: Hoare triple {12406#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12406#true} is VALID [2022-04-28 10:34:08,353 INFO L290 TraceCheckUtils]: 37: Hoare triple {12406#true} assume !!(~b~0 < 6);~c~0 := 0; {12406#true} is VALID [2022-04-28 10:34:08,353 INFO L290 TraceCheckUtils]: 38: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,353 INFO L290 TraceCheckUtils]: 39: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-28 10:34:08,353 INFO L290 TraceCheckUtils]: 40: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,353 INFO L290 TraceCheckUtils]: 41: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-28 10:34:08,353 INFO L290 TraceCheckUtils]: 42: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,354 INFO L290 TraceCheckUtils]: 43: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-28 10:34:08,354 INFO L290 TraceCheckUtils]: 44: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,354 INFO L290 TraceCheckUtils]: 45: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-28 10:34:08,354 INFO L290 TraceCheckUtils]: 46: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,354 INFO L290 TraceCheckUtils]: 47: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-28 10:34:08,354 INFO L290 TraceCheckUtils]: 48: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,354 INFO L290 TraceCheckUtils]: 49: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-28 10:34:08,354 INFO L290 TraceCheckUtils]: 50: Hoare triple {12406#true} assume !(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,354 INFO L290 TraceCheckUtils]: 51: Hoare triple {12406#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12406#true} is VALID [2022-04-28 10:34:08,354 INFO L290 TraceCheckUtils]: 52: Hoare triple {12406#true} assume !!(~b~0 < 6);~c~0 := 0; {12406#true} is VALID [2022-04-28 10:34:08,354 INFO L290 TraceCheckUtils]: 53: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,354 INFO L290 TraceCheckUtils]: 54: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-28 10:34:08,354 INFO L290 TraceCheckUtils]: 55: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,354 INFO L290 TraceCheckUtils]: 56: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-28 10:34:08,354 INFO L290 TraceCheckUtils]: 57: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,354 INFO L290 TraceCheckUtils]: 58: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-28 10:34:08,354 INFO L290 TraceCheckUtils]: 59: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,354 INFO L290 TraceCheckUtils]: 60: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-28 10:34:08,354 INFO L290 TraceCheckUtils]: 61: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,355 INFO L290 TraceCheckUtils]: 62: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-28 10:34:08,355 INFO L290 TraceCheckUtils]: 63: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,355 INFO L290 TraceCheckUtils]: 64: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-28 10:34:08,355 INFO L290 TraceCheckUtils]: 65: Hoare triple {12406#true} assume !(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,355 INFO L290 TraceCheckUtils]: 66: Hoare triple {12406#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12406#true} is VALID [2022-04-28 10:34:08,355 INFO L290 TraceCheckUtils]: 67: Hoare triple {12406#true} assume !!(~b~0 < 6);~c~0 := 0; {12406#true} is VALID [2022-04-28 10:34:08,355 INFO L290 TraceCheckUtils]: 68: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,355 INFO L290 TraceCheckUtils]: 69: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-28 10:34:08,355 INFO L290 TraceCheckUtils]: 70: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,355 INFO L290 TraceCheckUtils]: 71: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-28 10:34:08,355 INFO L290 TraceCheckUtils]: 72: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,355 INFO L290 TraceCheckUtils]: 73: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-28 10:34:08,355 INFO L290 TraceCheckUtils]: 74: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,355 INFO L290 TraceCheckUtils]: 75: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-28 10:34:08,355 INFO L290 TraceCheckUtils]: 76: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,356 INFO L290 TraceCheckUtils]: 77: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-28 10:34:08,356 INFO L290 TraceCheckUtils]: 78: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,356 INFO L290 TraceCheckUtils]: 79: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-28 10:34:08,356 INFO L290 TraceCheckUtils]: 80: Hoare triple {12406#true} assume !(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,356 INFO L290 TraceCheckUtils]: 81: Hoare triple {12406#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12406#true} is VALID [2022-04-28 10:34:08,356 INFO L290 TraceCheckUtils]: 82: Hoare triple {12406#true} assume !!(~b~0 < 6);~c~0 := 0; {12406#true} is VALID [2022-04-28 10:34:08,356 INFO L290 TraceCheckUtils]: 83: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,356 INFO L290 TraceCheckUtils]: 84: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-28 10:34:08,356 INFO L290 TraceCheckUtils]: 85: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,356 INFO L290 TraceCheckUtils]: 86: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-28 10:34:08,356 INFO L290 TraceCheckUtils]: 87: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,356 INFO L290 TraceCheckUtils]: 88: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-28 10:34:08,357 INFO L290 TraceCheckUtils]: 89: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,357 INFO L290 TraceCheckUtils]: 90: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-28 10:34:08,357 INFO L290 TraceCheckUtils]: 91: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,357 INFO L290 TraceCheckUtils]: 92: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-28 10:34:08,357 INFO L290 TraceCheckUtils]: 93: Hoare triple {12406#true} assume !!(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,357 INFO L290 TraceCheckUtils]: 94: Hoare triple {12406#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12406#true} is VALID [2022-04-28 10:34:08,357 INFO L290 TraceCheckUtils]: 95: Hoare triple {12406#true} assume !(~c~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,357 INFO L290 TraceCheckUtils]: 96: Hoare triple {12406#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12406#true} is VALID [2022-04-28 10:34:08,357 INFO L290 TraceCheckUtils]: 97: Hoare triple {12406#true} assume !(~b~0 < 6); {12406#true} is VALID [2022-04-28 10:34:08,357 INFO L290 TraceCheckUtils]: 98: Hoare triple {12406#true} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {12406#true} is VALID [2022-04-28 10:34:08,358 INFO L290 TraceCheckUtils]: 99: Hoare triple {12406#true} assume !!(~a~0 < 6);~b~0 := 0; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,358 INFO L290 TraceCheckUtils]: 100: Hoare triple {12715#(< main_~a~0 6)} assume !!(~b~0 < 6);~c~0 := 0; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,358 INFO L290 TraceCheckUtils]: 101: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,359 INFO L290 TraceCheckUtils]: 102: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,359 INFO L290 TraceCheckUtils]: 103: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,359 INFO L290 TraceCheckUtils]: 104: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,359 INFO L290 TraceCheckUtils]: 105: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,360 INFO L290 TraceCheckUtils]: 106: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,360 INFO L290 TraceCheckUtils]: 107: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,360 INFO L290 TraceCheckUtils]: 108: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,360 INFO L290 TraceCheckUtils]: 109: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,361 INFO L290 TraceCheckUtils]: 110: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,361 INFO L290 TraceCheckUtils]: 111: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,361 INFO L290 TraceCheckUtils]: 112: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,362 INFO L290 TraceCheckUtils]: 113: Hoare triple {12715#(< main_~a~0 6)} assume !(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,362 INFO L290 TraceCheckUtils]: 114: Hoare triple {12715#(< main_~a~0 6)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,362 INFO L290 TraceCheckUtils]: 115: Hoare triple {12715#(< main_~a~0 6)} assume !!(~b~0 < 6);~c~0 := 0; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,362 INFO L290 TraceCheckUtils]: 116: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,363 INFO L290 TraceCheckUtils]: 117: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,363 INFO L290 TraceCheckUtils]: 118: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,363 INFO L290 TraceCheckUtils]: 119: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,363 INFO L290 TraceCheckUtils]: 120: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,364 INFO L290 TraceCheckUtils]: 121: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,364 INFO L290 TraceCheckUtils]: 122: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,364 INFO L290 TraceCheckUtils]: 123: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,364 INFO L290 TraceCheckUtils]: 124: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,365 INFO L290 TraceCheckUtils]: 125: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,365 INFO L290 TraceCheckUtils]: 126: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,365 INFO L290 TraceCheckUtils]: 127: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,366 INFO L290 TraceCheckUtils]: 128: Hoare triple {12715#(< main_~a~0 6)} assume !(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,366 INFO L290 TraceCheckUtils]: 129: Hoare triple {12715#(< main_~a~0 6)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,366 INFO L290 TraceCheckUtils]: 130: Hoare triple {12715#(< main_~a~0 6)} assume !!(~b~0 < 6);~c~0 := 0; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,367 INFO L290 TraceCheckUtils]: 131: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,367 INFO L290 TraceCheckUtils]: 132: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,368 INFO L290 TraceCheckUtils]: 133: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,368 INFO L290 TraceCheckUtils]: 134: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,368 INFO L290 TraceCheckUtils]: 135: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,368 INFO L290 TraceCheckUtils]: 136: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,369 INFO L290 TraceCheckUtils]: 137: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,369 INFO L290 TraceCheckUtils]: 138: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,369 INFO L290 TraceCheckUtils]: 139: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,369 INFO L290 TraceCheckUtils]: 140: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,370 INFO L290 TraceCheckUtils]: 141: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,370 INFO L290 TraceCheckUtils]: 142: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,370 INFO L290 TraceCheckUtils]: 143: Hoare triple {12715#(< main_~a~0 6)} assume !(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,371 INFO L290 TraceCheckUtils]: 144: Hoare triple {12715#(< main_~a~0 6)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,371 INFO L290 TraceCheckUtils]: 145: Hoare triple {12715#(< main_~a~0 6)} assume !!(~b~0 < 6);~c~0 := 0; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,371 INFO L290 TraceCheckUtils]: 146: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,371 INFO L290 TraceCheckUtils]: 147: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,372 INFO L290 TraceCheckUtils]: 148: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,372 INFO L290 TraceCheckUtils]: 149: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,372 INFO L290 TraceCheckUtils]: 150: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,372 INFO L290 TraceCheckUtils]: 151: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,373 INFO L290 TraceCheckUtils]: 152: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,373 INFO L290 TraceCheckUtils]: 153: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,373 INFO L290 TraceCheckUtils]: 154: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,374 INFO L290 TraceCheckUtils]: 155: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,374 INFO L290 TraceCheckUtils]: 156: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,374 INFO L290 TraceCheckUtils]: 157: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,374 INFO L290 TraceCheckUtils]: 158: Hoare triple {12715#(< main_~a~0 6)} assume !(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,375 INFO L290 TraceCheckUtils]: 159: Hoare triple {12715#(< main_~a~0 6)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,375 INFO L290 TraceCheckUtils]: 160: Hoare triple {12715#(< main_~a~0 6)} assume !!(~b~0 < 6);~c~0 := 0; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,375 INFO L290 TraceCheckUtils]: 161: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,375 INFO L290 TraceCheckUtils]: 162: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,376 INFO L290 TraceCheckUtils]: 163: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,376 INFO L290 TraceCheckUtils]: 164: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,376 INFO L290 TraceCheckUtils]: 165: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,376 INFO L290 TraceCheckUtils]: 166: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,377 INFO L290 TraceCheckUtils]: 167: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,377 INFO L290 TraceCheckUtils]: 168: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,377 INFO L290 TraceCheckUtils]: 169: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,378 INFO L290 TraceCheckUtils]: 170: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,378 INFO L290 TraceCheckUtils]: 171: Hoare triple {12715#(< main_~a~0 6)} assume !!(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,378 INFO L290 TraceCheckUtils]: 172: Hoare triple {12715#(< main_~a~0 6)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,378 INFO L290 TraceCheckUtils]: 173: Hoare triple {12715#(< main_~a~0 6)} assume !(~c~0 < 6); {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,379 INFO L290 TraceCheckUtils]: 174: Hoare triple {12715#(< main_~a~0 6)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12715#(< main_~a~0 6)} is VALID [2022-04-28 10:34:08,379 INFO L290 TraceCheckUtils]: 175: Hoare triple {12715#(< main_~a~0 6)} assume !!(~b~0 < 6);~c~0 := 0; {12944#(and (< main_~b~0 6) (< main_~a~0 6))} is VALID [2022-04-28 10:34:08,379 INFO L290 TraceCheckUtils]: 176: Hoare triple {12944#(and (< main_~b~0 6) (< main_~a~0 6))} assume !!(~c~0 < 6); {12944#(and (< main_~b~0 6) (< main_~a~0 6))} is VALID [2022-04-28 10:34:08,380 INFO L290 TraceCheckUtils]: 177: Hoare triple {12944#(and (< main_~b~0 6) (< main_~a~0 6))} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12944#(and (< main_~b~0 6) (< main_~a~0 6))} is VALID [2022-04-28 10:34:08,380 INFO L290 TraceCheckUtils]: 178: Hoare triple {12944#(and (< main_~b~0 6) (< main_~a~0 6))} assume !!(~c~0 < 6); {12944#(and (< main_~b~0 6) (< main_~a~0 6))} is VALID [2022-04-28 10:34:08,380 INFO L290 TraceCheckUtils]: 179: Hoare triple {12944#(and (< main_~b~0 6) (< main_~a~0 6))} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12944#(and (< main_~b~0 6) (< main_~a~0 6))} is VALID [2022-04-28 10:34:08,381 INFO L290 TraceCheckUtils]: 180: Hoare triple {12944#(and (< main_~b~0 6) (< main_~a~0 6))} assume !!(~c~0 < 6); {12944#(and (< main_~b~0 6) (< main_~a~0 6))} is VALID [2022-04-28 10:34:08,381 INFO L290 TraceCheckUtils]: 181: Hoare triple {12944#(and (< main_~b~0 6) (< main_~a~0 6))} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12944#(and (< main_~b~0 6) (< main_~a~0 6))} is VALID [2022-04-28 10:34:08,381 INFO L290 TraceCheckUtils]: 182: Hoare triple {12944#(and (< main_~b~0 6) (< main_~a~0 6))} assume !!(~c~0 < 6); {12944#(and (< main_~b~0 6) (< main_~a~0 6))} is VALID [2022-04-28 10:34:08,382 INFO L290 TraceCheckUtils]: 183: Hoare triple {12944#(and (< main_~b~0 6) (< main_~a~0 6))} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12944#(and (< main_~b~0 6) (< main_~a~0 6))} is VALID [2022-04-28 10:34:08,382 INFO L290 TraceCheckUtils]: 184: Hoare triple {12944#(and (< main_~b~0 6) (< main_~a~0 6))} assume !!(~c~0 < 6); {12944#(and (< main_~b~0 6) (< main_~a~0 6))} is VALID [2022-04-28 10:34:08,387 INFO L290 TraceCheckUtils]: 185: Hoare triple {12944#(and (< main_~b~0 6) (< main_~a~0 6))} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12944#(and (< main_~b~0 6) (< main_~a~0 6))} is VALID [2022-04-28 10:34:08,388 INFO L290 TraceCheckUtils]: 186: Hoare triple {12944#(and (< main_~b~0 6) (< main_~a~0 6))} assume !!(~c~0 < 6); {12978#(and (< main_~c~0 6) (< main_~b~0 6) (< main_~a~0 6))} is VALID [2022-04-28 10:34:08,389 INFO L290 TraceCheckUtils]: 187: Hoare triple {12978#(and (< main_~c~0 6) (< main_~b~0 6) (< main_~a~0 6))} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {12982#(and (< main_~b~0 6) (< main_~c~0 7) (< main_~a~0 6))} is VALID [2022-04-28 10:34:08,389 INFO L290 TraceCheckUtils]: 188: Hoare triple {12982#(and (< main_~b~0 6) (< main_~c~0 7) (< main_~a~0 6))} assume !(~c~0 < 6); {12986#(and (< main_~b~0 6) (not (< main_~c~0 6)) (< main_~c~0 7) (< main_~a~0 6))} is VALID [2022-04-28 10:34:08,390 INFO L290 TraceCheckUtils]: 189: Hoare triple {12986#(and (< main_~b~0 6) (not (< main_~c~0 6)) (< main_~c~0 7) (< main_~a~0 6))} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {12990#(and (< main_~b~0 7) (not (< main_~c~0 6)) (< main_~c~0 7) (< main_~a~0 6))} is VALID [2022-04-28 10:34:08,390 INFO L290 TraceCheckUtils]: 190: Hoare triple {12990#(and (< main_~b~0 7) (not (< main_~c~0 6)) (< main_~c~0 7) (< main_~a~0 6))} assume !(~b~0 < 6); {12994#(and (< main_~b~0 7) (not (< main_~c~0 6)) (< main_~c~0 7) (< main_~a~0 6) (not (< main_~b~0 6)))} is VALID [2022-04-28 10:34:08,391 INFO L290 TraceCheckUtils]: 191: Hoare triple {12994#(and (< main_~b~0 7) (not (< main_~c~0 6)) (< main_~c~0 7) (< main_~a~0 6) (not (< main_~b~0 6)))} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {12998#(and (< main_~a~0 7) (< main_~b~0 7) (not (< main_~c~0 6)) (< main_~c~0 7) (not (< main_~b~0 6)))} is VALID [2022-04-28 10:34:08,391 INFO L290 TraceCheckUtils]: 192: Hoare triple {12998#(and (< main_~a~0 7) (< main_~b~0 7) (not (< main_~c~0 6)) (< main_~c~0 7) (not (< main_~b~0 6)))} assume !(~a~0 < 6); {13002#(and (< main_~a~0 7) (< main_~b~0 7) (not (< main_~c~0 6)) (< main_~c~0 7) (not (< main_~b~0 6)) (not (< main_~a~0 6)))} is VALID [2022-04-28 10:34:08,392 INFO L290 TraceCheckUtils]: 193: Hoare triple {13002#(and (< main_~a~0 7) (< main_~b~0 7) (not (< main_~c~0 6)) (< main_~c~0 7) (not (< main_~b~0 6)) (not (< main_~a~0 6)))} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {12407#false} is VALID [2022-04-28 10:34:08,392 INFO L290 TraceCheckUtils]: 194: Hoare triple {12407#false} assume !false; {12407#false} is VALID [2022-04-28 10:34:08,395 INFO L134 CoverageAnalysis]: Checked inductivity of 6203 backedges. 3595 proven. 0 refuted. 0 times theorem prover too weak. 2608 trivial. 0 not checked. [2022-04-28 10:34:08,396 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 10:34:08,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709245587] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:34:08,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 10:34:08,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2022-04-28 10:34:08,397 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:34:08,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2144117138] [2022-04-28 10:34:08,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2144117138] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:34:08,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:34:08,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:34:08,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169432075] [2022-04-28 10:34:08,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:34:08,398 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 195 [2022-04-28 10:34:08,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:34:08,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:08,424 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 10:34:08,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:34:08,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:34:08,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:34:08,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:34:08,425 INFO L87 Difference]: Start difference. First operand 196 states and 210 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:09,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:34:09,165 INFO L93 Difference]: Finished difference Result 196 states and 210 transitions. [2022-04-28 10:34:09,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:34:09,166 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 195 [2022-04-28 10:34:09,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:34:09,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:09,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 20 transitions. [2022-04-28 10:34:09,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:09,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 20 transitions. [2022-04-28 10:34:09,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 20 transitions. [2022-04-28 10:34:09,199 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 10:34:09,199 INFO L225 Difference]: With dead ends: 196 [2022-04-28 10:34:09,199 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 10:34:09,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:34:09,200 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 5 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:34:09,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 31 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:34:09,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 10:34:09,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 10:34:09,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:34:09,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:34:09,201 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:34:09,201 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:34:09,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:34:09,201 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 10:34:09,201 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:34:09,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:34:09,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:34:09,202 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 10:34:09,202 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 10:34:09,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:34:09,202 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 10:34:09,202 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:34:09,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:34:09,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:34:09,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:34:09,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:34:09,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:34:09,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 10:34:09,202 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 195 [2022-04-28 10:34:09,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:34:09,203 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 10:34:09,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:09,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 10:34:09,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:34:09,203 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:34:09,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:34:09,205 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 10:34:09,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 10:34:09,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 10:34:09,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 10:34:17,597 WARN L232 SmtUtils]: Spent 7.95s on a formula simplification. DAG size of input: 280 DAG size of output: 279 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 10:34:20,592 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 13) no Hoare annotation was computed. [2022-04-28 10:34:20,592 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 13) no Hoare annotation was computed. [2022-04-28 10:34:20,592 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 13) no Hoare annotation was computed. [2022-04-28 10:34:20,592 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 10:34:20,592 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 10:34:20,592 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 10:34:20,592 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 10:34:20,592 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 10:34:20,592 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 10:34:20,592 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 10:34:20,592 INFO L895 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: false [2022-04-28 10:34:20,592 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 15 32) the Hoare annotation is: true [2022-04-28 10:34:20,592 INFO L895 garLoopResultBuilder]: At program point L23-2(lines 23 25) the Hoare annotation is: (and (<= main_~c~0 5) (<= main_~b~0 5) (< main_~a~0 6)) [2022-04-28 10:34:20,593 INFO L895 garLoopResultBuilder]: At program point L23-3(lines 23 25) the Hoare annotation is: (and (< main_~c~0 7) (<= main_~b~0 5) (< main_~a~0 6)) [2022-04-28 10:34:20,593 INFO L895 garLoopResultBuilder]: At program point L21-2(lines 21 27) the Hoare annotation is: (and (< main_~b~0 7) (not (< main_~c~0 6)) (< main_~c~0 7) (< main_~a~0 6) (not (< main_~b~0 6))) [2022-04-28 10:34:20,593 INFO L895 garLoopResultBuilder]: At program point L21-3(lines 21 27) the Hoare annotation is: (and (< main_~a~0 7) (< main_~b~0 7) (not (< main_~c~0 6)) (< main_~c~0 7) (not (< main_~b~0 6))) [2022-04-28 10:34:20,593 INFO L895 garLoopResultBuilder]: At program point L21-4(lines 15 32) the Hoare annotation is: (and (< main_~a~0 7) (< main_~b~0 7) (not (< main_~c~0 6)) (< main_~c~0 7) (not (< main_~b~0 6)) (not (< main_~a~0 6))) [2022-04-28 10:34:20,593 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 15 32) the Hoare annotation is: true [2022-04-28 10:34:20,593 INFO L895 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 29) the Hoare annotation is: false [2022-04-28 10:34:20,593 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 15 32) the Hoare annotation is: true [2022-04-28 10:34:20,593 INFO L902 garLoopResultBuilder]: At program point L28-1(lines 28 30) the Hoare annotation is: true [2022-04-28 10:34:20,593 INFO L895 garLoopResultBuilder]: At program point L22-2(lines 22 26) the Hoare annotation is: (and (< main_~c~0 7) (<= 6 main_~c~0) (<= main_~b~0 5) (< main_~a~0 6)) [2022-04-28 10:34:20,593 INFO L895 garLoopResultBuilder]: At program point L22-3(lines 22 26) the Hoare annotation is: (and (< main_~b~0 7) (not (< main_~c~0 6)) (< main_~c~0 7) (< main_~a~0 6)) [2022-04-28 10:34:20,595 INFO L356 BasicCegarLoop]: Path program histogram: [24, 2, 2, 2, 2] [2022-04-28 10:34:20,597 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 10:34:20,601 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 10:34:20,602 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 10:34:20,619 INFO L163 areAnnotationChecker]: CFG has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 10:34:20,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 10:34:20 BoogieIcfgContainer [2022-04-28 10:34:20,631 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 10:34:20,632 INFO L158 Benchmark]: Toolchain (without parser) took 33532.40ms. Allocated memory was 199.2MB in the beginning and 526.4MB in the end (delta: 327.2MB). Free memory was 144.1MB in the beginning and 399.2MB in the end (delta: -255.0MB). Peak memory consumption was 296.0MB. Max. memory is 8.0GB. [2022-04-28 10:34:20,633 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 199.2MB. Free memory is still 160.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 10:34:20,634 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.06ms. Allocated memory is still 199.2MB. Free memory was 143.9MB in the beginning and 169.7MB in the end (delta: -25.8MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. [2022-04-28 10:34:20,634 INFO L158 Benchmark]: Boogie Preprocessor took 27.27ms. Allocated memory is still 199.2MB. Free memory was 169.7MB in the beginning and 168.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 10:34:20,634 INFO L158 Benchmark]: RCFGBuilder took 210.05ms. Allocated memory is still 199.2MB. Free memory was 168.1MB in the beginning and 158.2MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-28 10:34:20,635 INFO L158 Benchmark]: TraceAbstraction took 32992.81ms. Allocated memory was 199.2MB in the beginning and 526.4MB in the end (delta: 327.2MB). Free memory was 157.6MB in the beginning and 399.2MB in the end (delta: -241.6MB). Peak memory consumption was 309.3MB. Max. memory is 8.0GB. [2022-04-28 10:34:20,638 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 199.2MB. Free memory is still 160.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 295.06ms. Allocated memory is still 199.2MB. Free memory was 143.9MB in the beginning and 169.7MB in the end (delta: -25.8MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.27ms. Allocated memory is still 199.2MB. Free memory was 169.7MB in the beginning and 168.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 210.05ms. Allocated memory is still 199.2MB. Free memory was 168.1MB in the beginning and 158.2MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 32992.81ms. Allocated memory was 199.2MB in the beginning and 526.4MB in the end (delta: 327.2MB). Free memory was 157.6MB in the beginning and 399.2MB in the end (delta: -241.6MB). Peak memory consumption was 309.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 29]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.9s, OverallIterations: 16, TraceHistogramMax: 72, PathProgramHistogramMax: 24, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 435 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 435 mSDsluCounter, 414 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 176 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 422 IncrementalHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 238 mSDtfsCounter, 422 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1867 GetRequests, 1709 SyntacticMatches, 5 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=15, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 128 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 20 PreInvPairs, 213 NumberOfFragments, 124 HoareAnnotationTreeSize, 20 FomulaSimplifications, 805 FormulaSimplificationTreeSizeReduction, 9.8s HoareSimplificationTime, 20 FomulaSimplificationsInter, 13146 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((b < 7 && !(c < 6)) && c < 7) && a < 6 - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (((a < 7 && b < 7) && !(c < 6)) && c < 7) && !(b < 6) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (c < 7 && b <= 5) && a < 6 - ProcedureContractResult [Line: 15]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 10:34:20,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...