/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_4.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:14:39,979 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:14:39,980 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:14:39,998 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:14:39,998 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:14:39,999 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:14:39,999 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:14:40,001 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:14:40,002 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:14:40,003 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:14:40,003 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:14:40,004 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:14:40,005 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:14:40,005 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:14:40,006 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:14:40,007 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:14:40,008 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:14:40,008 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:14:40,010 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:14:40,011 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:14:40,012 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:14:40,013 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:14:40,013 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:14:40,014 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:14:40,015 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:14:40,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:14:40,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:14:40,017 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:14:40,018 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:14:40,018 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:14:40,018 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:14:40,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:14:40,019 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:14:40,020 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:14:40,020 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:14:40,021 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:14:40,021 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:14:40,021 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:14:40,022 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:14:40,022 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:14:40,022 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:14:40,029 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:14:40,029 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 13:14:40,035 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:14:40,035 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:14:40,036 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:14:40,036 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:14:40,036 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:14:40,036 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:14:40,036 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:14:40,036 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:14:40,037 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:14:40,037 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:14:40,037 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:14:40,037 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:14:40,037 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:14:40,037 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:14:40,038 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:14:40,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:14:40,038 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:14:40,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:14:40,038 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:14:40,038 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:14:40,039 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:14:40,039 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:14:40,039 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-15 13:14:40,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:14:40,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:14:40,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:14:40,212 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:14:40,213 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:14:40,214 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-simple/nested_4.c [2022-04-15 13:14:40,272 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/423810158/422f85aac64442f1a0890ec4611097e3/FLAG037278d06 [2022-04-15 13:14:40,560 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:14:40,561 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_4.c [2022-04-15 13:14:40,565 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/423810158/422f85aac64442f1a0890ec4611097e3/FLAG037278d06 [2022-04-15 13:14:40,996 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/423810158/422f85aac64442f1a0890ec4611097e3 [2022-04-15 13:14:40,998 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:14:40,999 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:14:41,000 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:14:41,000 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:14:41,002 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:14:41,002 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:14:40" (1/1) ... [2022-04-15 13:14:41,003 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d9a38ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:41, skipping insertion in model container [2022-04-15 13:14:41,003 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:14:40" (1/1) ... [2022-04-15 13:14:41,007 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:14:41,013 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:14:41,134 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_4.c[841,854] [2022-04-15 13:14:41,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:14:41,142 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:14:41,151 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_4.c[841,854] [2022-04-15 13:14:41,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:14:41,159 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:14:41,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:41 WrapperNode [2022-04-15 13:14:41,159 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:14:41,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:14:41,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:14:41,160 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:14:41,166 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:41" (1/1) ... [2022-04-15 13:14:41,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:41" (1/1) ... [2022-04-15 13:14:41,170 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:41" (1/1) ... [2022-04-15 13:14:41,170 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:41" (1/1) ... [2022-04-15 13:14:41,173 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:41" (1/1) ... [2022-04-15 13:14:41,176 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:41" (1/1) ... [2022-04-15 13:14:41,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:41" (1/1) ... [2022-04-15 13:14:41,177 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:14:41,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:14:41,178 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:14:41,178 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:14:41,179 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:41" (1/1) ... [2022-04-15 13:14:41,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:14:41,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:14:41,197 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-15 13:14:41,207 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-15 13:14:41,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:14:41,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:14:41,227 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:14:41,227 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:14:41,227 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:14:41,227 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:14:41,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:14:41,228 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:14:41,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:14:41,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:14:41,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:14:41,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:14:41,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:14:41,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:14:41,276 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:14:41,277 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:14:41,370 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:14:41,375 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:14:41,375 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-15 13:14:41,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:14:41 BoogieIcfgContainer [2022-04-15 13:14:41,376 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:14:41,377 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:14:41,377 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:14:41,389 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:14:41,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:14:40" (1/3) ... [2022-04-15 13:14:41,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1e2049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:14:41, skipping insertion in model container [2022-04-15 13:14:41,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:14:41" (2/3) ... [2022-04-15 13:14:41,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1e2049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:14:41, skipping insertion in model container [2022-04-15 13:14:41,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:14:41" (3/3) ... [2022-04-15 13:14:41,391 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_4.c [2022-04-15 13:14:41,394 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:14:41,394 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:14:41,420 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:14:41,424 INFO L340 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 [2022-04-15 13:14:41,424 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:14:41,440 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 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-15 13:14:41,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-15 13:14:41,444 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:41,444 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:41,445 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:41,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:41,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1467912619, now seen corresponding path program 1 times [2022-04-15 13:14:41,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:41,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [252707799] [2022-04-15 13:14:41,459 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:14:41,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1467912619, now seen corresponding path program 2 times [2022-04-15 13:14:41,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:41,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551369468] [2022-04-15 13:14:41,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:41,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:41,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:41,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-15 13:14:41,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 13:14:41,618 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #68#return; {25#true} is VALID [2022-04-15 13:14:41,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:41,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-15 13:14:41,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 13:14:41,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #68#return; {25#true} is VALID [2022-04-15 13:14:41,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret8 := main(); {25#true} is VALID [2022-04-15 13:14:41,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {25#true} is VALID [2022-04-15 13:14:41,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-15 13:14:41,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {26#false} is VALID [2022-04-15 13:14:41,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-15 13:14:41,638 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-15 13:14:41,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:41,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551369468] [2022-04-15 13:14:41,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551369468] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:41,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:41,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:14:41,641 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:41,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [252707799] [2022-04-15 13:14:41,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [252707799] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:41,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:41,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:14:41,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192188613] [2022-04-15 13:14:41,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:41,645 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-15 13:14:41,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:41,648 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-15 13:14:41,658 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-15 13:14:41,658 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 13:14:41,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:41,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 13:14:41,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:14:41,689 INFO L87 Difference]: Start difference. First operand has 22 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 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-15 13:14:41,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:41,768 INFO L93 Difference]: Finished difference Result 38 states and 54 transitions. [2022-04-15 13:14:41,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 13:14:41,768 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-15 13:14:41,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:14:41,769 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-15 13:14:41,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-04-15 13:14:41,776 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-15 13:14:41,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-04-15 13:14:41,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2022-04-15 13:14:41,838 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-15 13:14:41,845 INFO L225 Difference]: With dead ends: 38 [2022-04-15 13:14:41,846 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 13:14:41,848 INFO L912 BasicCegarLoop]: 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-15 13:14:41,854 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 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-15 13:14:41,856 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:14:41,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 13:14:41,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 13:14:41,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:14:41,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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-15 13:14:41,885 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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-15 13:14:41,885 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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-15 13:14:41,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:41,889 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-15 13:14:41,889 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-15 13:14:41,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:41,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:41,890 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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 17 states. [2022-04-15 13:14:41,891 INFO L87 Difference]: Start difference. First operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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 17 states. [2022-04-15 13:14:41,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:41,893 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-15 13:14:41,893 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-15 13:14:41,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:41,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:41,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:14:41,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:14:41,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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-15 13:14:41,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-04-15 13:14:41,900 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 9 [2022-04-15 13:14:41,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:14:41,901 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-04-15 13:14:41,901 INFO L479 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-15 13:14:41,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 20 transitions. [2022-04-15 13:14:41,924 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-15 13:14:41,925 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-15 13:14:41,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-15 13:14:41,925 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:41,925 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:41,926 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:14:41,926 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:41,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:41,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1467952981, now seen corresponding path program 1 times [2022-04-15 13:14:41,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:41,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1910024411] [2022-04-15 13:14:41,932 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:14:41,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1467952981, now seen corresponding path program 2 times [2022-04-15 13:14:41,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:41,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753934327] [2022-04-15 13:14:41,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:41,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:41,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:42,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {183#(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); {177#true} is VALID [2022-04-15 13:14:42,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {177#true} assume true; {177#true} is VALID [2022-04-15 13:14:42,017 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {177#true} {177#true} #68#return; {177#true} is VALID [2022-04-15 13:14:42,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {177#true} call ULTIMATE.init(); {183#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:42,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {183#(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); {177#true} is VALID [2022-04-15 13:14:42,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {177#true} assume true; {177#true} is VALID [2022-04-15 13:14:42,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177#true} {177#true} #68#return; {177#true} is VALID [2022-04-15 13:14:42,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {177#true} call #t~ret8 := main(); {177#true} is VALID [2022-04-15 13:14:42,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {177#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {182#(= main_~a~0 0)} is VALID [2022-04-15 13:14:42,019 INFO L290 TraceCheckUtils]: 6: Hoare triple {182#(= main_~a~0 0)} assume !(~a~0 < 6); {178#false} is VALID [2022-04-15 13:14:42,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {178#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {178#false} is VALID [2022-04-15 13:14:42,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {178#false} assume !false; {178#false} is VALID [2022-04-15 13:14:42,020 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-15 13:14:42,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:42,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753934327] [2022-04-15 13:14:42,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753934327] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:42,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:42,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:14:42,024 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:42,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1910024411] [2022-04-15 13:14:42,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1910024411] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:42,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:42,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:14:42,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005378631] [2022-04-15 13:14:42,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:42,026 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-15 13:14:42,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:42,027 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-15 13:14:42,035 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-15 13:14:42,035 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 13:14:42,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:42,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 13:14:42,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 13:14:42,036 INFO L87 Difference]: Start difference. First operand 17 states and 20 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-15 13:14:42,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:42,110 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-15 13:14:42,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 13:14:42,110 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-15 13:14:42,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:14:42,111 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-15 13:14:42,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-04-15 13:14:42,115 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-15 13:14:42,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-04-15 13:14:42,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 34 transitions. [2022-04-15 13:14:42,151 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-15 13:14:42,153 INFO L225 Difference]: With dead ends: 28 [2022-04-15 13:14:42,153 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 13:14:42,153 INFO L912 BasicCegarLoop]: 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-15 13:14:42,155 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 35 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:14:42,156 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 25 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:14:42,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 13:14:42,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2022-04-15 13:14:42,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:14:42,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 18 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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-15 13:14:42,162 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 18 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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-15 13:14:42,162 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 18 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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-15 13:14:42,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:42,163 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-15 13:14:42,163 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-15 13:14:42,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:42,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:42,164 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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 25 states. [2022-04-15 13:14:42,164 INFO L87 Difference]: Start difference. First operand has 18 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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 25 states. [2022-04-15 13:14:42,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:42,165 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-15 13:14:42,165 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-15 13:14:42,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:42,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:42,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:14:42,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:14:42,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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-15 13:14:42,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-04-15 13:14:42,167 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 9 [2022-04-15 13:14:42,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:14:42,167 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-04-15 13:14:42,167 INFO L479 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-15 13:14:42,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 21 transitions. [2022-04-15 13:14:42,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:42,185 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-15 13:14:42,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 13:14:42,186 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:42,186 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:42,186 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 13:14:42,186 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:42,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:42,186 INFO L85 PathProgramCache]: Analyzing trace with hash -408278750, now seen corresponding path program 1 times [2022-04-15 13:14:42,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:42,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [667055712] [2022-04-15 13:14:42,263 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:14:42,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1739867075, now seen corresponding path program 1 times [2022-04-15 13:14:42,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:42,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029292741] [2022-04-15 13:14:42,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:42,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:42,272 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:14:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:14:42,288 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:14:42,288 INFO L85 PathProgramCache]: Analyzing trace with hash -408278750, now seen corresponding path program 2 times [2022-04-15 13:14:42,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:42,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897308199] [2022-04-15 13:14:42,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:42,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:42,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:42,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:42,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {336#(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); {330#true} is VALID [2022-04-15 13:14:42,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {330#true} assume true; {330#true} is VALID [2022-04-15 13:14:42,336 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {330#true} {330#true} #68#return; {330#true} is VALID [2022-04-15 13:14:42,337 INFO L272 TraceCheckUtils]: 0: Hoare triple {330#true} call ULTIMATE.init(); {336#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:42,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {336#(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); {330#true} is VALID [2022-04-15 13:14:42,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {330#true} assume true; {330#true} is VALID [2022-04-15 13:14:42,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {330#true} {330#true} #68#return; {330#true} is VALID [2022-04-15 13:14:42,337 INFO L272 TraceCheckUtils]: 4: Hoare triple {330#true} call #t~ret8 := main(); {330#true} is VALID [2022-04-15 13:14:42,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {330#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {330#true} is VALID [2022-04-15 13:14:42,338 INFO L290 TraceCheckUtils]: 6: Hoare triple {330#true} assume !!(~a~0 < 6);~b~0 := 0; {335#(= main_~b~0 0)} is VALID [2022-04-15 13:14:42,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {335#(= main_~b~0 0)} assume !(~b~0 < 6); {331#false} is VALID [2022-04-15 13:14:42,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {331#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {331#false} is VALID [2022-04-15 13:14:42,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {331#false} assume !(~a~0 < 6); {331#false} is VALID [2022-04-15 13:14:42,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {331#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {331#false} is VALID [2022-04-15 13:14:42,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {331#false} assume !false; {331#false} is VALID [2022-04-15 13:14:42,343 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-15 13:14:42,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:42,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897308199] [2022-04-15 13:14:42,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897308199] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:42,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:42,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:14:42,344 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:42,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [667055712] [2022-04-15 13:14:42,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [667055712] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:42,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:42,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:14:42,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629907882] [2022-04-15 13:14:42,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:42,345 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-15 13:14:42,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:42,345 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-15 13:14:42,355 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-15 13:14:42,355 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 13:14:42,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:42,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 13:14:42,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 13:14:42,356 INFO L87 Difference]: Start difference. First operand 18 states and 21 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-15 13:14:42,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:42,409 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-15 13:14:42,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 13:14:42,409 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-15 13:14:42,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:14:42,410 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-15 13:14:42,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-04-15 13:14:42,411 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-15 13:14:42,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-04-15 13:14:42,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 43 transitions. [2022-04-15 13:14:42,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:42,443 INFO L225 Difference]: With dead ends: 35 [2022-04-15 13:14:42,443 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 13:14:42,443 INFO L912 BasicCegarLoop]: 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-15 13:14:42,444 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 29 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:14:42,444 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 25 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:14:42,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 13:14:42,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2022-04-15 13:14:42,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:14:42,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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-15 13:14:42,448 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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-15 13:14:42,448 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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-15 13:14:42,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:42,449 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-04-15 13:14:42,449 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-04-15 13:14:42,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:42,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:42,449 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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 24 states. [2022-04-15 13:14:42,450 INFO L87 Difference]: Start difference. First operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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 24 states. [2022-04-15 13:14:42,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:42,450 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-04-15 13:14:42,450 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-04-15 13:14:42,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:42,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:42,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:14:42,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:14:42,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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-15 13:14:42,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-04-15 13:14:42,452 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 12 [2022-04-15 13:14:42,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:14:42,452 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-04-15 13:14:42,452 INFO L479 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-15 13:14:42,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 22 transitions. [2022-04-15 13:14:42,471 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-15 13:14:42,471 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-15 13:14:42,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 13:14:42,471 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:42,471 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:42,471 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,SelfDestructingSolverStorable2 [2022-04-15 13:14:42,472 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:42,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:42,472 INFO L85 PathProgramCache]: Analyzing trace with hash 675904015, now seen corresponding path program 1 times [2022-04-15 13:14:42,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:42,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1995785858] [2022-04-15 13:14:42,734 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:14:42,735 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:14:42,735 INFO L85 PathProgramCache]: Analyzing trace with hash 675904015, now seen corresponding path program 2 times [2022-04-15 13:14:42,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:42,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073307717] [2022-04-15 13:14:42,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:42,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:42,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:14:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:42,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {503#(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); {497#true} is VALID [2022-04-15 13:14:42,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {497#true} assume true; {497#true} is VALID [2022-04-15 13:14:42,781 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {497#true} {497#true} #68#return; {497#true} is VALID [2022-04-15 13:14:42,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {497#true} call ULTIMATE.init(); {503#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:14:42,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {503#(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); {497#true} is VALID [2022-04-15 13:14:42,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {497#true} assume true; {497#true} is VALID [2022-04-15 13:14:42,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {497#true} {497#true} #68#return; {497#true} is VALID [2022-04-15 13:14:42,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {497#true} call #t~ret8 := main(); {497#true} is VALID [2022-04-15 13:14:42,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {497#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {497#true} is VALID [2022-04-15 13:14:42,782 INFO L290 TraceCheckUtils]: 6: Hoare triple {497#true} assume !!(~a~0 < 6);~b~0 := 0; {497#true} is VALID [2022-04-15 13:14:42,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {497#true} assume !!(~b~0 < 6);~c~0 := 0; {502#(= main_~c~0 0)} is VALID [2022-04-15 13:14:42,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {502#(= main_~c~0 0)} assume !(~c~0 < 6); {498#false} is VALID [2022-04-15 13:14:42,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {498#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {498#false} is VALID [2022-04-15 13:14:42,783 INFO L290 TraceCheckUtils]: 10: Hoare triple {498#false} assume !(~b~0 < 6); {498#false} is VALID [2022-04-15 13:14:42,783 INFO L290 TraceCheckUtils]: 11: Hoare triple {498#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {498#false} is VALID [2022-04-15 13:14:42,783 INFO L290 TraceCheckUtils]: 12: Hoare triple {498#false} assume !(~a~0 < 6); {498#false} is VALID [2022-04-15 13:14:42,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {498#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {498#false} is VALID [2022-04-15 13:14:42,784 INFO L290 TraceCheckUtils]: 14: Hoare triple {498#false} assume !false; {498#false} is VALID [2022-04-15 13:14:42,784 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-15 13:14:42,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:42,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073307717] [2022-04-15 13:14:42,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073307717] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:42,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:42,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:14:42,784 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:42,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1995785858] [2022-04-15 13:14:42,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1995785858] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:42,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:42,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:14:42,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763003477] [2022-04-15 13:14:42,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:42,785 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-15 13:14:42,785 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:42,785 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-15 13:14:42,794 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-15 13:14:42,794 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 13:14:42,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:42,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 13:14:42,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 13:14:42,795 INFO L87 Difference]: Start difference. First operand 19 states and 22 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-15 13:14:42,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:42,846 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-04-15 13:14:42,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 13:14:42,846 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-15 13:14:42,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:14:42,846 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-15 13:14:42,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-04-15 13:14:42,849 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-15 13:14:42,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-04-15 13:14:42,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 40 transitions. [2022-04-15 13:14:42,872 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-15 13:14:42,872 INFO L225 Difference]: With dead ends: 35 [2022-04-15 13:14:42,872 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 13:14:42,873 INFO L912 BasicCegarLoop]: 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-15 13:14:42,873 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:14:42,873 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 25 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:14:42,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 13:14:42,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2022-04-15 13:14:42,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:14:42,876 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 20 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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-15 13:14:42,876 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 20 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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-15 13:14:42,877 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 20 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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-15 13:14:42,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:42,877 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-15 13:14:42,877 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-15 13:14:42,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:42,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:42,878 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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 23 states. [2022-04-15 13:14:42,878 INFO L87 Difference]: Start difference. First operand has 20 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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 23 states. [2022-04-15 13:14:42,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:42,879 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-15 13:14:42,879 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-15 13:14:42,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:42,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:42,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:14:42,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:14:42,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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-15 13:14:42,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-15 13:14:42,880 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 15 [2022-04-15 13:14:42,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:14:42,880 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-15 13:14:42,880 INFO L479 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-15 13:14:42,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 23 transitions. [2022-04-15 13:14:42,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:42,896 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-15 13:14:42,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 13:14:42,896 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:42,896 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:42,897 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 13:14:42,897 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:42,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:42,897 INFO L85 PathProgramCache]: Analyzing trace with hash 919301982, now seen corresponding path program 1 times [2022-04-15 13:14:42,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:42,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [762918250] [2022-04-15 13:29:02,443 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:29:02,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1739928579, now seen corresponding path program 1 times [2022-04-15 13:29:02,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:29:02,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461091375] [2022-04-15 13:29:02,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:29:02,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:29:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:29:02,449 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:29:02,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:29:02,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:29:02,454 INFO L85 PathProgramCache]: Analyzing trace with hash 919301982, now seen corresponding path program 2 times [2022-04-15 13:29:02,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:29:02,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168566328] [2022-04-15 13:29:02,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:29:02,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:29:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:29:02,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:29:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:29:02,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {670#(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); {664#true} is VALID [2022-04-15 13:29:02,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {664#true} assume true; {664#true} is VALID [2022-04-15 13:29:02,487 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {664#true} {664#true} #68#return; {664#true} is VALID [2022-04-15 13:29:02,487 INFO L272 TraceCheckUtils]: 0: Hoare triple {664#true} call ULTIMATE.init(); {670#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:29:02,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {670#(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); {664#true} is VALID [2022-04-15 13:29:02,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {664#true} assume true; {664#true} is VALID [2022-04-15 13:29:02,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {664#true} {664#true} #68#return; {664#true} is VALID [2022-04-15 13:29:02,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {664#true} call #t~ret8 := main(); {664#true} is VALID [2022-04-15 13:29:02,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {664#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {664#true} is VALID [2022-04-15 13:29:02,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {664#true} assume !!(~a~0 < 6);~b~0 := 0; {664#true} is VALID [2022-04-15 13:29:02,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {664#true} assume !!(~b~0 < 6);~c~0 := 0; {664#true} is VALID [2022-04-15 13:29:02,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {664#true} assume !!(~c~0 < 6);~d~0 := 0; {669#(= main_~d~0 0)} is VALID [2022-04-15 13:29:02,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {669#(= main_~d~0 0)} assume !(~d~0 < 6); {665#false} is VALID [2022-04-15 13:29:02,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {665#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {665#false} is VALID [2022-04-15 13:29:02,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {665#false} assume !(~c~0 < 6); {665#false} is VALID [2022-04-15 13:29:02,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {665#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {665#false} is VALID [2022-04-15 13:29:02,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {665#false} assume !(~b~0 < 6); {665#false} is VALID [2022-04-15 13:29:02,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {665#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {665#false} is VALID [2022-04-15 13:29:02,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {665#false} assume !(~a~0 < 6); {665#false} is VALID [2022-04-15 13:29:02,490 INFO L290 TraceCheckUtils]: 16: Hoare triple {665#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {665#false} is VALID [2022-04-15 13:29:02,490 INFO L290 TraceCheckUtils]: 17: Hoare triple {665#false} assume !false; {665#false} is VALID [2022-04-15 13:29:02,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:29:02,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:29:02,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168566328] [2022-04-15 13:29:02,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168566328] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:29:02,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:29:02,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:29:02,491 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:29:02,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [762918250] [2022-04-15 13:29:02,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [762918250] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:29:02,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:29:02,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:29:02,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854125853] [2022-04-15 13:29:02,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:29:02,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2022-04-15 13:29:02,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:29:02,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-15 13:29:02,500 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-15 13:29:02,500 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 13:29:02,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:29:02,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 13:29:02,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 13:29:02,501 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-15 13:29:02,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:29:02,545 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-15 13:29:02,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 13:29:02,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2022-04-15 13:29:02,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:29:02,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-15 13:29:02,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-15 13:29:02,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-15 13:29:02,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-15 13:29:02,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-04-15 13:29:02,587 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-15 13:29:02,587 INFO L225 Difference]: With dead ends: 35 [2022-04-15 13:29:02,587 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 13:29:02,587 INFO L912 BasicCegarLoop]: 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-15 13:29:02,588 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 17 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:29:02,588 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 25 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:29:02,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 13:29:02,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-15 13:29:02,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:29:02,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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-15 13:29:02,591 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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-15 13:29:02,591 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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-15 13:29:02,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:29:02,592 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-15 13:29:02,592 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-15 13:29:02,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:29:02,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:29:02,592 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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 22 states. [2022-04-15 13:29:02,592 INFO L87 Difference]: Start difference. First operand has 21 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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 22 states. [2022-04-15 13:29:02,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:29:02,593 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-15 13:29:02,593 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-15 13:29:02,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:29:02,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:29:02,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:29:02,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:29:02,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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-15 13:29:02,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-04-15 13:29:02,594 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 18 [2022-04-15 13:29:02,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:29:02,594 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-04-15 13:29:02,594 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-15 13:29:02,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 24 transitions. [2022-04-15 13:29:02,612 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-15 13:29:02,612 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-15 13:29:02,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 13:29:02,613 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:29:02,613 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:29:02,613 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,SelfDestructingSolverStorable5 [2022-04-15 13:29:02,613 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:29:02,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:29:02,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1380235844, now seen corresponding path program 1 times [2022-04-15 13:29:02,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:29:02,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [839032136] [2022-04-15 13:29:04,693 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:29:04,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1739990083, now seen corresponding path program 1 times [2022-04-15 13:29:04,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:29:04,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93761225] [2022-04-15 13:29:04,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:29:04,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:29:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:29:04,699 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:29:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:29:04,705 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:29:04,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1380235844, now seen corresponding path program 2 times [2022-04-15 13:29:04,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:29:04,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681064852] [2022-04-15 13:29:04,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:29:04,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:29:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:29:04,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:29:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:29:04,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {838#(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); {831#true} is VALID [2022-04-15 13:29:04,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {831#true} assume true; {831#true} is VALID [2022-04-15 13:29:04,743 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {831#true} {831#true} #68#return; {831#true} is VALID [2022-04-15 13:29:04,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {831#true} call ULTIMATE.init(); {838#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:29:04,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {838#(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); {831#true} is VALID [2022-04-15 13:29:04,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {831#true} assume true; {831#true} is VALID [2022-04-15 13:29:04,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {831#true} {831#true} #68#return; {831#true} is VALID [2022-04-15 13:29:04,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {831#true} call #t~ret8 := main(); {831#true} is VALID [2022-04-15 13:29:04,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {831#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {831#true} is VALID [2022-04-15 13:29:04,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {831#true} assume !!(~a~0 < 6);~b~0 := 0; {831#true} is VALID [2022-04-15 13:29:04,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {831#true} assume !!(~b~0 < 6);~c~0 := 0; {831#true} is VALID [2022-04-15 13:29:04,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {831#true} assume !!(~c~0 < 6);~d~0 := 0; {836#(= main_~d~0 0)} is VALID [2022-04-15 13:29:04,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {836#(= main_~d~0 0)} assume !!(~d~0 < 6); {836#(= main_~d~0 0)} is VALID [2022-04-15 13:29:04,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {836#(= main_~d~0 0)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {837#(<= main_~d~0 1)} is VALID [2022-04-15 13:29:04,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {837#(<= main_~d~0 1)} assume !(~d~0 < 6); {832#false} is VALID [2022-04-15 13:29:04,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {832#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {832#false} is VALID [2022-04-15 13:29:04,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {832#false} assume !(~c~0 < 6); {832#false} is VALID [2022-04-15 13:29:04,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {832#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {832#false} is VALID [2022-04-15 13:29:04,746 INFO L290 TraceCheckUtils]: 15: Hoare triple {832#false} assume !(~b~0 < 6); {832#false} is VALID [2022-04-15 13:29:04,746 INFO L290 TraceCheckUtils]: 16: Hoare triple {832#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {832#false} is VALID [2022-04-15 13:29:04,746 INFO L290 TraceCheckUtils]: 17: Hoare triple {832#false} assume !(~a~0 < 6); {832#false} is VALID [2022-04-15 13:29:04,746 INFO L290 TraceCheckUtils]: 18: Hoare triple {832#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {832#false} is VALID [2022-04-15 13:29:04,746 INFO L290 TraceCheckUtils]: 19: Hoare triple {832#false} assume !false; {832#false} is VALID [2022-04-15 13:29:04,747 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:29:04,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:29:04,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681064852] [2022-04-15 13:29:04,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681064852] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:29:04,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126731503] [2022-04-15 13:29:04,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:29:04,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:29:04,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:29:04,748 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-15 13:29:04,759 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-15 13:29:04,790 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:29:04,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:29:04,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 13:29:04,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:29:04,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:29:04,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {831#true} call ULTIMATE.init(); {831#true} is VALID [2022-04-15 13:29:04,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {831#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); {831#true} is VALID [2022-04-15 13:29:04,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {831#true} assume true; {831#true} is VALID [2022-04-15 13:29:04,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {831#true} {831#true} #68#return; {831#true} is VALID [2022-04-15 13:29:04,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {831#true} call #t~ret8 := main(); {831#true} is VALID [2022-04-15 13:29:04,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {831#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {857#(<= main_~a~0 0)} is VALID [2022-04-15 13:29:04,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {857#(<= main_~a~0 0)} assume !!(~a~0 < 6);~b~0 := 0; {857#(<= main_~a~0 0)} is VALID [2022-04-15 13:29:04,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {857#(<= main_~a~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {857#(<= main_~a~0 0)} is VALID [2022-04-15 13:29:04,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {857#(<= main_~a~0 0)} assume !!(~c~0 < 6);~d~0 := 0; {857#(<= main_~a~0 0)} is VALID [2022-04-15 13:29:04,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {857#(<= main_~a~0 0)} assume !!(~d~0 < 6); {857#(<= main_~a~0 0)} is VALID [2022-04-15 13:29:04,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {857#(<= main_~a~0 0)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {857#(<= main_~a~0 0)} is VALID [2022-04-15 13:29:04,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {857#(<= main_~a~0 0)} assume !(~d~0 < 6); {857#(<= main_~a~0 0)} is VALID [2022-04-15 13:29:04,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {857#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {857#(<= main_~a~0 0)} is VALID [2022-04-15 13:29:04,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {857#(<= main_~a~0 0)} assume !(~c~0 < 6); {857#(<= main_~a~0 0)} is VALID [2022-04-15 13:29:04,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {857#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {857#(<= main_~a~0 0)} is VALID [2022-04-15 13:29:04,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {857#(<= main_~a~0 0)} assume !(~b~0 < 6); {857#(<= main_~a~0 0)} is VALID [2022-04-15 13:29:04,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {857#(<= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {891#(<= main_~a~0 1)} is VALID [2022-04-15 13:29:04,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {891#(<= main_~a~0 1)} assume !(~a~0 < 6); {832#false} is VALID [2022-04-15 13:29:04,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {832#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {832#false} is VALID [2022-04-15 13:29:04,876 INFO L290 TraceCheckUtils]: 19: Hoare triple {832#false} assume !false; {832#false} is VALID [2022-04-15 13:29:04,876 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 13:29:04,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:29:04,953 INFO L290 TraceCheckUtils]: 19: Hoare triple {832#false} assume !false; {832#false} is VALID [2022-04-15 13:29:04,954 INFO L290 TraceCheckUtils]: 18: Hoare triple {832#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {832#false} is VALID [2022-04-15 13:29:04,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {907#(< main_~a~0 6)} assume !(~a~0 < 6); {832#false} is VALID [2022-04-15 13:29:04,961 INFO L290 TraceCheckUtils]: 16: Hoare triple {911#(< main_~a~0 5)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {907#(< main_~a~0 6)} is VALID [2022-04-15 13:29:04,961 INFO L290 TraceCheckUtils]: 15: Hoare triple {911#(< main_~a~0 5)} assume !(~b~0 < 6); {911#(< main_~a~0 5)} is VALID [2022-04-15 13:29:04,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {911#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {911#(< main_~a~0 5)} is VALID [2022-04-15 13:29:04,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {911#(< main_~a~0 5)} assume !(~c~0 < 6); {911#(< main_~a~0 5)} is VALID [2022-04-15 13:29:04,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {911#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {911#(< main_~a~0 5)} is VALID [2022-04-15 13:29:04,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {911#(< main_~a~0 5)} assume !(~d~0 < 6); {911#(< main_~a~0 5)} is VALID [2022-04-15 13:29:04,971 INFO L290 TraceCheckUtils]: 10: Hoare triple {911#(< main_~a~0 5)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {911#(< main_~a~0 5)} is VALID [2022-04-15 13:29:04,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {911#(< main_~a~0 5)} assume !!(~d~0 < 6); {911#(< main_~a~0 5)} is VALID [2022-04-15 13:29:04,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {911#(< main_~a~0 5)} assume !!(~c~0 < 6);~d~0 := 0; {911#(< main_~a~0 5)} is VALID [2022-04-15 13:29:04,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {911#(< main_~a~0 5)} assume !!(~b~0 < 6);~c~0 := 0; {911#(< main_~a~0 5)} is VALID [2022-04-15 13:29:04,973 INFO L290 TraceCheckUtils]: 6: Hoare triple {911#(< main_~a~0 5)} assume !!(~a~0 < 6);~b~0 := 0; {911#(< main_~a~0 5)} is VALID [2022-04-15 13:29:04,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {831#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {911#(< main_~a~0 5)} is VALID [2022-04-15 13:29:04,973 INFO L272 TraceCheckUtils]: 4: Hoare triple {831#true} call #t~ret8 := main(); {831#true} is VALID [2022-04-15 13:29:04,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {831#true} {831#true} #68#return; {831#true} is VALID [2022-04-15 13:29:04,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {831#true} assume true; {831#true} is VALID [2022-04-15 13:29:04,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {831#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); {831#true} is VALID [2022-04-15 13:29:04,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {831#true} call ULTIMATE.init(); {831#true} is VALID [2022-04-15 13:29:04,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 13:29:04,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126731503] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:29:04,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:29:04,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-04-15 13:29:04,974 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:29:04,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [839032136] [2022-04-15 13:29:04,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [839032136] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:29:04,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:29:04,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:29:04,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915908775] [2022-04-15 13:29:04,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:29:04,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 20 [2022-04-15 13:29:04,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:29:04,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-15 13:29:04,986 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-15 13:29:04,986 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:29:04,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:29:04,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:29:04,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-15 13:29:04,987 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-15 13:29:05,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:29:05,043 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-15 13:29:05,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:29:05,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 20 [2022-04-15 13:29:05,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:29:05,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-15 13:29:05,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-04-15 13:29:05,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-15 13:29:05,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-04-15 13:29:05,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 39 transitions. [2022-04-15 13:29:05,074 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-15 13:29:05,074 INFO L225 Difference]: With dead ends: 38 [2022-04-15 13:29:05,074 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 13:29:05,074 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-04-15 13:29:05,075 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 19 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 25 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-15 13:29:05,075 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 25 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:29:05,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 13:29:05,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-04-15 13:29:05,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:29:05,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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-15 13:29:05,079 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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-15 13:29:05,079 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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-15 13:29:05,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:29:05,080 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-15 13:29:05,080 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-15 13:29:05,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:29:05,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:29:05,080 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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 24 states. [2022-04-15 13:29:05,080 INFO L87 Difference]: Start difference. First operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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 24 states. [2022-04-15 13:29:05,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:29:05,081 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-15 13:29:05,081 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-15 13:29:05,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:29:05,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:29:05,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:29:05,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:29:05,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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-15 13:29:05,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-04-15 13:29:05,082 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 20 [2022-04-15 13:29:05,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:29:05,082 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-04-15 13:29:05,082 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-15 13:29:05,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 26 transitions. [2022-04-15 13:29:05,101 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-15 13:29:05,101 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-15 13:29:05,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 13:29:05,101 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:29:05,101 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:29:05,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 13:29:05,301 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:29:05,302 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:29:05,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:29:05,302 INFO L85 PathProgramCache]: Analyzing trace with hash 672070810, now seen corresponding path program 3 times [2022-04-15 13:29:05,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:29:05,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [495810502] [2022-04-15 13:29:06,273 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:29:06,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1740051587, now seen corresponding path program 1 times [2022-04-15 13:29:06,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:29:06,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801592362] [2022-04-15 13:29:06,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:29:06,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:29:06,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:29:06,278 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:29:06,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:29:06,282 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:29:06,282 INFO L85 PathProgramCache]: Analyzing trace with hash 672070810, now seen corresponding path program 4 times [2022-04-15 13:29:06,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:29:06,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273382931] [2022-04-15 13:29:06,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:29:06,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:29:06,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:29:06,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:29:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:29:06,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {1143#(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); {1136#true} is VALID [2022-04-15 13:29:06,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {1136#true} assume true; {1136#true} is VALID [2022-04-15 13:29:06,308 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1136#true} {1136#true} #68#return; {1136#true} is VALID [2022-04-15 13:29:06,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {1136#true} call ULTIMATE.init(); {1143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:29:06,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {1143#(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); {1136#true} is VALID [2022-04-15 13:29:06,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {1136#true} assume true; {1136#true} is VALID [2022-04-15 13:29:06,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1136#true} {1136#true} #68#return; {1136#true} is VALID [2022-04-15 13:29:06,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {1136#true} call #t~ret8 := main(); {1136#true} is VALID [2022-04-15 13:29:06,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {1136#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {1136#true} is VALID [2022-04-15 13:29:06,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {1136#true} assume !!(~a~0 < 6);~b~0 := 0; {1136#true} is VALID [2022-04-15 13:29:06,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {1136#true} assume !!(~b~0 < 6);~c~0 := 0; {1141#(= main_~c~0 0)} is VALID [2022-04-15 13:29:06,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {1141#(= main_~c~0 0)} assume !!(~c~0 < 6);~d~0 := 0; {1141#(= main_~c~0 0)} is VALID [2022-04-15 13:29:06,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {1141#(= main_~c~0 0)} assume !!(~d~0 < 6); {1141#(= main_~c~0 0)} is VALID [2022-04-15 13:29:06,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {1141#(= main_~c~0 0)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {1141#(= main_~c~0 0)} is VALID [2022-04-15 13:29:06,310 INFO L290 TraceCheckUtils]: 11: Hoare triple {1141#(= main_~c~0 0)} assume !!(~d~0 < 6); {1141#(= main_~c~0 0)} is VALID [2022-04-15 13:29:06,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {1141#(= main_~c~0 0)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {1141#(= main_~c~0 0)} is VALID [2022-04-15 13:29:06,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {1141#(= main_~c~0 0)} assume !(~d~0 < 6); {1141#(= main_~c~0 0)} is VALID [2022-04-15 13:29:06,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {1141#(= main_~c~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1142#(<= main_~c~0 1)} is VALID [2022-04-15 13:29:06,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {1142#(<= main_~c~0 1)} assume !(~c~0 < 6); {1137#false} is VALID [2022-04-15 13:29:06,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {1137#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1137#false} is VALID [2022-04-15 13:29:06,312 INFO L290 TraceCheckUtils]: 17: Hoare triple {1137#false} assume !(~b~0 < 6); {1137#false} is VALID [2022-04-15 13:29:06,312 INFO L290 TraceCheckUtils]: 18: Hoare triple {1137#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1137#false} is VALID [2022-04-15 13:29:06,312 INFO L290 TraceCheckUtils]: 19: Hoare triple {1137#false} assume !(~a~0 < 6); {1137#false} is VALID [2022-04-15 13:29:06,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {1137#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {1137#false} is VALID [2022-04-15 13:29:06,312 INFO L290 TraceCheckUtils]: 21: Hoare triple {1137#false} assume !false; {1137#false} is VALID [2022-04-15 13:29:06,312 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 13:29:06,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:29:06,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273382931] [2022-04-15 13:29:06,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273382931] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:29:06,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351462960] [2022-04-15 13:29:06,312 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:29:06,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:29:06,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:29:06,315 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-15 13:29:06,355 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:29:06,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:29:06,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:29:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:29:06,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:29:06,365 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-15 13:29:06,428 INFO L272 TraceCheckUtils]: 0: Hoare triple {1136#true} call ULTIMATE.init(); {1136#true} is VALID [2022-04-15 13:29:06,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {1136#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); {1136#true} is VALID [2022-04-15 13:29:06,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {1136#true} assume true; {1136#true} is VALID [2022-04-15 13:29:06,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1136#true} {1136#true} #68#return; {1136#true} is VALID [2022-04-15 13:29:06,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {1136#true} call #t~ret8 := main(); {1136#true} is VALID [2022-04-15 13:29:06,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {1136#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {1136#true} is VALID [2022-04-15 13:29:06,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {1136#true} assume !!(~a~0 < 6);~b~0 := 0; {1136#true} is VALID [2022-04-15 13:29:06,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {1136#true} assume !!(~b~0 < 6);~c~0 := 0; {1136#true} is VALID [2022-04-15 13:29:06,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {1136#true} assume !!(~c~0 < 6);~d~0 := 0; {1171#(<= main_~d~0 0)} is VALID [2022-04-15 13:29:06,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {1171#(<= main_~d~0 0)} assume !!(~d~0 < 6); {1171#(<= main_~d~0 0)} is VALID [2022-04-15 13:29:06,430 INFO L290 TraceCheckUtils]: 10: Hoare triple {1171#(<= main_~d~0 0)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {1178#(<= main_~d~0 1)} is VALID [2022-04-15 13:29:06,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {1178#(<= main_~d~0 1)} assume !!(~d~0 < 6); {1178#(<= main_~d~0 1)} is VALID [2022-04-15 13:29:06,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {1178#(<= main_~d~0 1)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {1185#(<= main_~d~0 2)} is VALID [2022-04-15 13:29:06,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {1185#(<= main_~d~0 2)} assume !(~d~0 < 6); {1137#false} is VALID [2022-04-15 13:29:06,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {1137#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1137#false} is VALID [2022-04-15 13:29:06,432 INFO L290 TraceCheckUtils]: 15: Hoare triple {1137#false} assume !(~c~0 < 6); {1137#false} is VALID [2022-04-15 13:29:06,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {1137#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1137#false} is VALID [2022-04-15 13:29:06,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {1137#false} assume !(~b~0 < 6); {1137#false} is VALID [2022-04-15 13:29:06,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {1137#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1137#false} is VALID [2022-04-15 13:29:06,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {1137#false} assume !(~a~0 < 6); {1137#false} is VALID [2022-04-15 13:29:06,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {1137#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {1137#false} is VALID [2022-04-15 13:29:06,432 INFO L290 TraceCheckUtils]: 21: Hoare triple {1137#false} assume !false; {1137#false} is VALID [2022-04-15 13:29:06,433 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:29:06,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:29:06,510 INFO L290 TraceCheckUtils]: 21: Hoare triple {1137#false} assume !false; {1137#false} is VALID [2022-04-15 13:29:06,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {1137#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {1137#false} is VALID [2022-04-15 13:29:06,510 INFO L290 TraceCheckUtils]: 19: Hoare triple {1137#false} assume !(~a~0 < 6); {1137#false} is VALID [2022-04-15 13:29:06,510 INFO L290 TraceCheckUtils]: 18: Hoare triple {1137#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1137#false} is VALID [2022-04-15 13:29:06,510 INFO L290 TraceCheckUtils]: 17: Hoare triple {1137#false} assume !(~b~0 < 6); {1137#false} is VALID [2022-04-15 13:29:06,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {1137#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1137#false} is VALID [2022-04-15 13:29:06,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {1137#false} assume !(~c~0 < 6); {1137#false} is VALID [2022-04-15 13:29:06,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {1137#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1137#false} is VALID [2022-04-15 13:29:06,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {1237#(< main_~d~0 6)} assume !(~d~0 < 6); {1137#false} is VALID [2022-04-15 13:29:06,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {1241#(< main_~d~0 5)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {1237#(< main_~d~0 6)} is VALID [2022-04-15 13:29:06,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {1241#(< main_~d~0 5)} assume !!(~d~0 < 6); {1241#(< main_~d~0 5)} is VALID [2022-04-15 13:29:06,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {1248#(< main_~d~0 4)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {1241#(< main_~d~0 5)} is VALID [2022-04-15 13:29:06,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {1248#(< main_~d~0 4)} assume !!(~d~0 < 6); {1248#(< main_~d~0 4)} is VALID [2022-04-15 13:29:06,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {1136#true} assume !!(~c~0 < 6);~d~0 := 0; {1248#(< main_~d~0 4)} is VALID [2022-04-15 13:29:06,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {1136#true} assume !!(~b~0 < 6);~c~0 := 0; {1136#true} is VALID [2022-04-15 13:29:06,522 INFO L290 TraceCheckUtils]: 6: Hoare triple {1136#true} assume !!(~a~0 < 6);~b~0 := 0; {1136#true} is VALID [2022-04-15 13:29:06,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {1136#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {1136#true} is VALID [2022-04-15 13:29:06,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {1136#true} call #t~ret8 := main(); {1136#true} is VALID [2022-04-15 13:29:06,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1136#true} {1136#true} #68#return; {1136#true} is VALID [2022-04-15 13:29:06,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {1136#true} assume true; {1136#true} is VALID [2022-04-15 13:29:06,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {1136#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); {1136#true} is VALID [2022-04-15 13:29:06,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {1136#true} call ULTIMATE.init(); {1136#true} is VALID [2022-04-15 13:29:06,523 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:29:06,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351462960] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:29:06,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:29:06,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-04-15 13:29:06,523 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:29:06,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [495810502] [2022-04-15 13:29:06,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [495810502] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:29:06,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:29:06,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:29:06,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820370560] [2022-04-15 13:29:06,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:29:06,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 22 [2022-04-15 13:29:06,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:29:06,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-15 13:29:06,536 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-15 13:29:06,536 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:29:06,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:29:06,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:29:06,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-15 13:29:06,536 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-15 13:29:06,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:29:06,607 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-04-15 13:29:06,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:29:06,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 22 [2022-04-15 13:29:06,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:29:06,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-15 13:29:06,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-15 13:29:06,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-15 13:29:06,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-15 13:29:06,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2022-04-15 13:29:06,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:29:06,638 INFO L225 Difference]: With dead ends: 52 [2022-04-15 13:29:06,638 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 13:29:06,639 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-04-15 13:29:06,639 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 31 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 25 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-15 13:29:06,639 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 25 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:29:06,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 13:29:06,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2022-04-15 13:29:06,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:29:06,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 30 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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-15 13:29:06,648 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 30 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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-15 13:29:06,648 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 30 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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-15 13:29:06,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:29:06,649 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-15 13:29:06,649 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-15 13:29:06,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:29:06,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:29:06,650 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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 36 states. [2022-04-15 13:29:06,650 INFO L87 Difference]: Start difference. First operand has 30 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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 36 states. [2022-04-15 13:29:06,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:29:06,651 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-15 13:29:06,651 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-15 13:29:06,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:29:06,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:29:06,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:29:06,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:29:06,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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-15 13:29:06,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-04-15 13:29:06,652 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2022-04-15 13:29:06,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:29:06,652 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-04-15 13:29:06,652 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-15 13:29:06,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 34 transitions. [2022-04-15 13:29:06,675 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-15 13:29:06,675 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-04-15 13:29:06,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 13:29:06,675 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:29:06,675 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:29:06,695 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-15 13:29:06,887 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10,SelfDestructingSolverStorable9 [2022-04-15 13:29:06,887 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:29:06,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:29:06,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1867081809, now seen corresponding path program 5 times [2022-04-15 13:29:06,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:29:06,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [686621362] [2022-04-15 13:29:07,321 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:29:07,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1740113091, now seen corresponding path program 1 times [2022-04-15 13:29:07,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:29:07,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460980184] [2022-04-15 13:29:07,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:29:07,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:29:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:29:07,326 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:29:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:29:07,335 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:29:07,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1867081809, now seen corresponding path program 6 times [2022-04-15 13:29:07,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:29:07,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872220635] [2022-04-15 13:29:07,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:29:07,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:29:07,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:29:07,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:29:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:29:07,375 INFO L290 TraceCheckUtils]: 0: Hoare triple {1528#(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); {1521#true} is VALID [2022-04-15 13:29:07,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-15 13:29:07,375 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1521#true} {1521#true} #68#return; {1521#true} is VALID [2022-04-15 13:29:07,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {1521#true} call ULTIMATE.init(); {1528#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:29:07,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {1528#(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); {1521#true} is VALID [2022-04-15 13:29:07,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-15 13:29:07,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1521#true} {1521#true} #68#return; {1521#true} is VALID [2022-04-15 13:29:07,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {1521#true} call #t~ret8 := main(); {1521#true} is VALID [2022-04-15 13:29:07,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {1521#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {1521#true} is VALID [2022-04-15 13:29:07,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {1521#true} assume !!(~a~0 < 6);~b~0 := 0; {1526#(= main_~b~0 0)} is VALID [2022-04-15 13:29:07,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {1526#(= main_~b~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {1526#(= main_~b~0 0)} is VALID [2022-04-15 13:29:07,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {1526#(= main_~b~0 0)} assume !!(~c~0 < 6);~d~0 := 0; {1526#(= main_~b~0 0)} is VALID [2022-04-15 13:29:07,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {1526#(= main_~b~0 0)} assume !!(~d~0 < 6); {1526#(= main_~b~0 0)} is VALID [2022-04-15 13:29:07,378 INFO L290 TraceCheckUtils]: 10: Hoare triple {1526#(= main_~b~0 0)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {1526#(= main_~b~0 0)} is VALID [2022-04-15 13:29:07,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {1526#(= main_~b~0 0)} assume !!(~d~0 < 6); {1526#(= main_~b~0 0)} is VALID [2022-04-15 13:29:07,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {1526#(= main_~b~0 0)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {1526#(= main_~b~0 0)} is VALID [2022-04-15 13:29:07,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {1526#(= main_~b~0 0)} assume !(~d~0 < 6); {1526#(= main_~b~0 0)} is VALID [2022-04-15 13:29:07,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {1526#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1526#(= main_~b~0 0)} is VALID [2022-04-15 13:29:07,379 INFO L290 TraceCheckUtils]: 15: Hoare triple {1526#(= main_~b~0 0)} assume !!(~c~0 < 6);~d~0 := 0; {1526#(= main_~b~0 0)} is VALID [2022-04-15 13:29:07,379 INFO L290 TraceCheckUtils]: 16: Hoare triple {1526#(= main_~b~0 0)} assume !!(~d~0 < 6); {1526#(= main_~b~0 0)} is VALID [2022-04-15 13:29:07,379 INFO L290 TraceCheckUtils]: 17: Hoare triple {1526#(= main_~b~0 0)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {1526#(= main_~b~0 0)} is VALID [2022-04-15 13:29:07,380 INFO L290 TraceCheckUtils]: 18: Hoare triple {1526#(= main_~b~0 0)} assume !!(~d~0 < 6); {1526#(= main_~b~0 0)} is VALID [2022-04-15 13:29:07,380 INFO L290 TraceCheckUtils]: 19: Hoare triple {1526#(= main_~b~0 0)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {1526#(= main_~b~0 0)} is VALID [2022-04-15 13:29:07,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {1526#(= main_~b~0 0)} assume !(~d~0 < 6); {1526#(= main_~b~0 0)} is VALID [2022-04-15 13:29:07,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {1526#(= main_~b~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1526#(= main_~b~0 0)} is VALID [2022-04-15 13:29:07,381 INFO L290 TraceCheckUtils]: 22: Hoare triple {1526#(= main_~b~0 0)} assume !(~c~0 < 6); {1526#(= main_~b~0 0)} is VALID [2022-04-15 13:29:07,381 INFO L290 TraceCheckUtils]: 23: Hoare triple {1526#(= main_~b~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1527#(<= main_~b~0 1)} is VALID [2022-04-15 13:29:07,381 INFO L290 TraceCheckUtils]: 24: Hoare triple {1527#(<= main_~b~0 1)} assume !(~b~0 < 6); {1522#false} is VALID [2022-04-15 13:29:07,381 INFO L290 TraceCheckUtils]: 25: Hoare triple {1522#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1522#false} is VALID [2022-04-15 13:29:07,381 INFO L290 TraceCheckUtils]: 26: Hoare triple {1522#false} assume !(~a~0 < 6); {1522#false} is VALID [2022-04-15 13:29:07,381 INFO L290 TraceCheckUtils]: 27: Hoare triple {1522#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {1522#false} is VALID [2022-04-15 13:29:07,381 INFO L290 TraceCheckUtils]: 28: Hoare triple {1522#false} assume !false; {1522#false} is VALID [2022-04-15 13:29:07,382 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 13:29:07,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:29:07,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872220635] [2022-04-15 13:29:07,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872220635] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:29:07,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256879088] [2022-04-15 13:29:07,382 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:29:07,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:29:07,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:29:07,383 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-15 13:29:07,384 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-15 13:29:07,412 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 13:29:07,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:29:07,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 13:29:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:29:07,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:29:07,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {1521#true} call ULTIMATE.init(); {1521#true} is VALID [2022-04-15 13:29:07,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {1521#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); {1521#true} is VALID [2022-04-15 13:29:07,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-15 13:29:07,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1521#true} {1521#true} #68#return; {1521#true} is VALID [2022-04-15 13:29:07,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {1521#true} call #t~ret8 := main(); {1521#true} is VALID [2022-04-15 13:29:07,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {1521#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {1547#(<= main_~a~0 0)} is VALID [2022-04-15 13:29:07,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {1547#(<= main_~a~0 0)} assume !!(~a~0 < 6);~b~0 := 0; {1547#(<= main_~a~0 0)} is VALID [2022-04-15 13:29:07,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {1547#(<= main_~a~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {1547#(<= main_~a~0 0)} is VALID [2022-04-15 13:29:07,518 INFO L290 TraceCheckUtils]: 8: Hoare triple {1547#(<= main_~a~0 0)} assume !!(~c~0 < 6);~d~0 := 0; {1547#(<= main_~a~0 0)} is VALID [2022-04-15 13:29:07,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {1547#(<= main_~a~0 0)} assume !!(~d~0 < 6); {1547#(<= main_~a~0 0)} is VALID [2022-04-15 13:29:07,521 INFO L290 TraceCheckUtils]: 10: Hoare triple {1547#(<= main_~a~0 0)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {1547#(<= main_~a~0 0)} is VALID [2022-04-15 13:29:07,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {1547#(<= main_~a~0 0)} assume !!(~d~0 < 6); {1547#(<= main_~a~0 0)} is VALID [2022-04-15 13:29:07,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {1547#(<= main_~a~0 0)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {1547#(<= main_~a~0 0)} is VALID [2022-04-15 13:29:07,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {1547#(<= main_~a~0 0)} assume !(~d~0 < 6); {1547#(<= main_~a~0 0)} is VALID [2022-04-15 13:29:07,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {1547#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1547#(<= main_~a~0 0)} is VALID [2022-04-15 13:29:07,525 INFO L290 TraceCheckUtils]: 15: Hoare triple {1547#(<= main_~a~0 0)} assume !!(~c~0 < 6);~d~0 := 0; {1547#(<= main_~a~0 0)} is VALID [2022-04-15 13:29:07,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {1547#(<= main_~a~0 0)} assume !!(~d~0 < 6); {1547#(<= main_~a~0 0)} is VALID [2022-04-15 13:29:07,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {1547#(<= main_~a~0 0)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {1547#(<= main_~a~0 0)} is VALID [2022-04-15 13:29:07,526 INFO L290 TraceCheckUtils]: 18: Hoare triple {1547#(<= main_~a~0 0)} assume !!(~d~0 < 6); {1547#(<= main_~a~0 0)} is VALID [2022-04-15 13:29:07,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {1547#(<= main_~a~0 0)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {1547#(<= main_~a~0 0)} is VALID [2022-04-15 13:29:07,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {1547#(<= main_~a~0 0)} assume !(~d~0 < 6); {1547#(<= main_~a~0 0)} is VALID [2022-04-15 13:29:07,526 INFO L290 TraceCheckUtils]: 21: Hoare triple {1547#(<= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1547#(<= main_~a~0 0)} is VALID [2022-04-15 13:29:07,527 INFO L290 TraceCheckUtils]: 22: Hoare triple {1547#(<= main_~a~0 0)} assume !(~c~0 < 6); {1547#(<= main_~a~0 0)} is VALID [2022-04-15 13:29:07,527 INFO L290 TraceCheckUtils]: 23: Hoare triple {1547#(<= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1547#(<= main_~a~0 0)} is VALID [2022-04-15 13:29:07,527 INFO L290 TraceCheckUtils]: 24: Hoare triple {1547#(<= main_~a~0 0)} assume !(~b~0 < 6); {1547#(<= main_~a~0 0)} is VALID [2022-04-15 13:29:07,528 INFO L290 TraceCheckUtils]: 25: Hoare triple {1547#(<= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1608#(<= main_~a~0 1)} is VALID [2022-04-15 13:29:07,528 INFO L290 TraceCheckUtils]: 26: Hoare triple {1608#(<= main_~a~0 1)} assume !(~a~0 < 6); {1522#false} is VALID [2022-04-15 13:29:07,528 INFO L290 TraceCheckUtils]: 27: Hoare triple {1522#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {1522#false} is VALID [2022-04-15 13:29:07,528 INFO L290 TraceCheckUtils]: 28: Hoare triple {1522#false} assume !false; {1522#false} is VALID [2022-04-15 13:29:07,528 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-15 13:29:07,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:29:07,625 INFO L290 TraceCheckUtils]: 28: Hoare triple {1522#false} assume !false; {1522#false} is VALID [2022-04-15 13:29:07,625 INFO L290 TraceCheckUtils]: 27: Hoare triple {1522#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {1522#false} is VALID [2022-04-15 13:29:07,625 INFO L290 TraceCheckUtils]: 26: Hoare triple {1624#(< main_~a~0 6)} assume !(~a~0 < 6); {1522#false} is VALID [2022-04-15 13:29:07,626 INFO L290 TraceCheckUtils]: 25: Hoare triple {1628#(< main_~a~0 5)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {1624#(< main_~a~0 6)} is VALID [2022-04-15 13:29:07,626 INFO L290 TraceCheckUtils]: 24: Hoare triple {1628#(< main_~a~0 5)} assume !(~b~0 < 6); {1628#(< main_~a~0 5)} is VALID [2022-04-15 13:29:07,626 INFO L290 TraceCheckUtils]: 23: Hoare triple {1628#(< main_~a~0 5)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {1628#(< main_~a~0 5)} is VALID [2022-04-15 13:29:07,626 INFO L290 TraceCheckUtils]: 22: Hoare triple {1628#(< main_~a~0 5)} assume !(~c~0 < 6); {1628#(< main_~a~0 5)} is VALID [2022-04-15 13:29:07,627 INFO L290 TraceCheckUtils]: 21: Hoare triple {1628#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1628#(< main_~a~0 5)} is VALID [2022-04-15 13:29:07,627 INFO L290 TraceCheckUtils]: 20: Hoare triple {1628#(< main_~a~0 5)} assume !(~d~0 < 6); {1628#(< main_~a~0 5)} is VALID [2022-04-15 13:29:07,627 INFO L290 TraceCheckUtils]: 19: Hoare triple {1628#(< main_~a~0 5)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {1628#(< main_~a~0 5)} is VALID [2022-04-15 13:29:07,627 INFO L290 TraceCheckUtils]: 18: Hoare triple {1628#(< main_~a~0 5)} assume !!(~d~0 < 6); {1628#(< main_~a~0 5)} is VALID [2022-04-15 13:29:07,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {1628#(< main_~a~0 5)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {1628#(< main_~a~0 5)} is VALID [2022-04-15 13:29:07,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {1628#(< main_~a~0 5)} assume !!(~d~0 < 6); {1628#(< main_~a~0 5)} is VALID [2022-04-15 13:29:07,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {1628#(< main_~a~0 5)} assume !!(~c~0 < 6);~d~0 := 0; {1628#(< main_~a~0 5)} is VALID [2022-04-15 13:29:07,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {1628#(< main_~a~0 5)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {1628#(< main_~a~0 5)} is VALID [2022-04-15 13:29:07,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {1628#(< main_~a~0 5)} assume !(~d~0 < 6); {1628#(< main_~a~0 5)} is VALID [2022-04-15 13:29:07,629 INFO L290 TraceCheckUtils]: 12: Hoare triple {1628#(< main_~a~0 5)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {1628#(< main_~a~0 5)} is VALID [2022-04-15 13:29:07,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {1628#(< main_~a~0 5)} assume !!(~d~0 < 6); {1628#(< main_~a~0 5)} is VALID [2022-04-15 13:29:07,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {1628#(< main_~a~0 5)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {1628#(< main_~a~0 5)} is VALID [2022-04-15 13:29:07,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {1628#(< main_~a~0 5)} assume !!(~d~0 < 6); {1628#(< main_~a~0 5)} is VALID [2022-04-15 13:29:07,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {1628#(< main_~a~0 5)} assume !!(~c~0 < 6);~d~0 := 0; {1628#(< main_~a~0 5)} is VALID [2022-04-15 13:29:07,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {1628#(< main_~a~0 5)} assume !!(~b~0 < 6);~c~0 := 0; {1628#(< main_~a~0 5)} is VALID [2022-04-15 13:29:07,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {1628#(< main_~a~0 5)} assume !!(~a~0 < 6);~b~0 := 0; {1628#(< main_~a~0 5)} is VALID [2022-04-15 13:29:07,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {1521#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {1628#(< main_~a~0 5)} is VALID [2022-04-15 13:29:07,631 INFO L272 TraceCheckUtils]: 4: Hoare triple {1521#true} call #t~ret8 := main(); {1521#true} is VALID [2022-04-15 13:29:07,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1521#true} {1521#true} #68#return; {1521#true} is VALID [2022-04-15 13:29:07,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {1521#true} assume true; {1521#true} is VALID [2022-04-15 13:29:07,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {1521#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); {1521#true} is VALID [2022-04-15 13:29:07,631 INFO L272 TraceCheckUtils]: 0: Hoare triple {1521#true} call ULTIMATE.init(); {1521#true} is VALID [2022-04-15 13:29:07,631 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-15 13:29:07,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256879088] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:29:07,632 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:29:07,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-04-15 13:29:07,632 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:29:07,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [686621362] [2022-04-15 13:29:07,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [686621362] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:29:07,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:29:07,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:29:07,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845219915] [2022-04-15 13:29:07,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:29:07,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 29 [2022-04-15 13:29:07,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:29:07,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-15 13:29:07,647 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-15 13:29:07,647 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:29:07,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:29:07,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:29:07,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-15 13:29:07,647 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-15 13:29:07,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:29:07,750 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2022-04-15 13:29:07,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:29:07,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 29 [2022-04-15 13:29:07,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:29:07,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-15 13:29:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-15 13:29:07,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-15 13:29:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-15 13:29:07,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-04-15 13:29:07,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:29:07,787 INFO L225 Difference]: With dead ends: 86 [2022-04-15 13:29:07,787 INFO L226 Difference]: Without dead ends: 63 [2022-04-15 13:29:07,787 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-04-15 13:29:07,788 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 43 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 25 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-15 13:29:07,788 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 25 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:29:07,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-15 13:29:07,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 47. [2022-04-15 13:29:07,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:29:07,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 47 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 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-15 13:29:07,819 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 47 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 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-15 13:29:07,820 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 47 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 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-15 13:29:07,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:29:07,822 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-15 13:29:07,822 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-15 13:29:07,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:29:07,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:29:07,823 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 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 63 states. [2022-04-15 13:29:07,823 INFO L87 Difference]: Start difference. First operand has 47 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 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 63 states. [2022-04-15 13:29:07,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:29:07,825 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-15 13:29:07,825 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-15 13:29:07,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:29:07,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:29:07,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:29:07,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:29:07,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 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-15 13:29:07,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2022-04-15 13:29:07,827 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 29 [2022-04-15 13:29:07,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:29:07,827 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2022-04-15 13:29:07,827 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-15 13:29:07,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 54 transitions. [2022-04-15 13:29:07,868 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-15 13:29:07,868 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2022-04-15 13:29:07,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 13:29:07,869 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:29:07,869 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:29:07,886 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-15 13:29:08,083 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:29:08,083 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:29:08,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:29:08,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1800571710, now seen corresponding path program 7 times [2022-04-15 13:29:08,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:29:08,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [477080804] [2022-04-15 13:29:08,937 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:29:08,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1740174595, now seen corresponding path program 1 times [2022-04-15 13:29:08,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:29:08,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149569492] [2022-04-15 13:29:08,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:29:08,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:29:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:29:08,943 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:29:08,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:29:08,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:29:08,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1800571710, now seen corresponding path program 8 times [2022-04-15 13:29:08,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:29:08,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096637467] [2022-04-15 13:29:08,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:29:08,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:29:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:29:08,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:29:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:29:09,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {2109#(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); {2102#true} is VALID [2022-04-15 13:29:09,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {2102#true} assume true; {2102#true} is VALID [2022-04-15 13:29:09,002 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2102#true} {2102#true} #68#return; {2102#true} is VALID [2022-04-15 13:29:09,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {2102#true} call ULTIMATE.init(); {2109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:29:09,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {2109#(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); {2102#true} is VALID [2022-04-15 13:29:09,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {2102#true} assume true; {2102#true} is VALID [2022-04-15 13:29:09,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2102#true} {2102#true} #68#return; {2102#true} is VALID [2022-04-15 13:29:09,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {2102#true} call #t~ret8 := main(); {2102#true} is VALID [2022-04-15 13:29:09,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {2102#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {2107#(= main_~a~0 0)} is VALID [2022-04-15 13:29:09,003 INFO L290 TraceCheckUtils]: 6: Hoare triple {2107#(= main_~a~0 0)} assume !!(~a~0 < 6);~b~0 := 0; {2107#(= main_~a~0 0)} is VALID [2022-04-15 13:29:09,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {2107#(= main_~a~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {2107#(= main_~a~0 0)} is VALID [2022-04-15 13:29:09,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {2107#(= main_~a~0 0)} assume !!(~c~0 < 6);~d~0 := 0; {2107#(= main_~a~0 0)} is VALID [2022-04-15 13:29:09,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {2107#(= main_~a~0 0)} assume !!(~d~0 < 6); {2107#(= main_~a~0 0)} is VALID [2022-04-15 13:29:09,004 INFO L290 TraceCheckUtils]: 10: Hoare triple {2107#(= main_~a~0 0)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {2107#(= main_~a~0 0)} is VALID [2022-04-15 13:29:09,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {2107#(= main_~a~0 0)} assume !!(~d~0 < 6); {2107#(= main_~a~0 0)} is VALID [2022-04-15 13:29:09,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {2107#(= main_~a~0 0)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {2107#(= main_~a~0 0)} is VALID [2022-04-15 13:29:09,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {2107#(= main_~a~0 0)} assume !(~d~0 < 6); {2107#(= main_~a~0 0)} is VALID [2022-04-15 13:29:09,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {2107#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2107#(= main_~a~0 0)} is VALID [2022-04-15 13:29:09,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {2107#(= main_~a~0 0)} assume !!(~c~0 < 6);~d~0 := 0; {2107#(= main_~a~0 0)} is VALID [2022-04-15 13:29:09,005 INFO L290 TraceCheckUtils]: 16: Hoare triple {2107#(= main_~a~0 0)} assume !!(~d~0 < 6); {2107#(= main_~a~0 0)} is VALID [2022-04-15 13:29:09,005 INFO L290 TraceCheckUtils]: 17: Hoare triple {2107#(= main_~a~0 0)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {2107#(= main_~a~0 0)} is VALID [2022-04-15 13:29:09,005 INFO L290 TraceCheckUtils]: 18: Hoare triple {2107#(= main_~a~0 0)} assume !!(~d~0 < 6); {2107#(= main_~a~0 0)} is VALID [2022-04-15 13:29:09,006 INFO L290 TraceCheckUtils]: 19: Hoare triple {2107#(= main_~a~0 0)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {2107#(= main_~a~0 0)} is VALID [2022-04-15 13:29:09,006 INFO L290 TraceCheckUtils]: 20: Hoare triple {2107#(= main_~a~0 0)} assume !(~d~0 < 6); {2107#(= main_~a~0 0)} is VALID [2022-04-15 13:29:09,006 INFO L290 TraceCheckUtils]: 21: Hoare triple {2107#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2107#(= main_~a~0 0)} is VALID [2022-04-15 13:29:09,006 INFO L290 TraceCheckUtils]: 22: Hoare triple {2107#(= main_~a~0 0)} assume !(~c~0 < 6); {2107#(= main_~a~0 0)} is VALID [2022-04-15 13:29:09,007 INFO L290 TraceCheckUtils]: 23: Hoare triple {2107#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2107#(= main_~a~0 0)} is VALID [2022-04-15 13:29:09,007 INFO L290 TraceCheckUtils]: 24: Hoare triple {2107#(= main_~a~0 0)} assume !!(~b~0 < 6);~c~0 := 0; {2107#(= main_~a~0 0)} is VALID [2022-04-15 13:29:09,007 INFO L290 TraceCheckUtils]: 25: Hoare triple {2107#(= main_~a~0 0)} assume !!(~c~0 < 6);~d~0 := 0; {2107#(= main_~a~0 0)} is VALID [2022-04-15 13:29:09,007 INFO L290 TraceCheckUtils]: 26: Hoare triple {2107#(= main_~a~0 0)} assume !!(~d~0 < 6); {2107#(= main_~a~0 0)} is VALID [2022-04-15 13:29:09,007 INFO L290 TraceCheckUtils]: 27: Hoare triple {2107#(= main_~a~0 0)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {2107#(= main_~a~0 0)} is VALID [2022-04-15 13:29:09,008 INFO L290 TraceCheckUtils]: 28: Hoare triple {2107#(= main_~a~0 0)} assume !!(~d~0 < 6); {2107#(= main_~a~0 0)} is VALID [2022-04-15 13:29:09,008 INFO L290 TraceCheckUtils]: 29: Hoare triple {2107#(= main_~a~0 0)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {2107#(= main_~a~0 0)} is VALID [2022-04-15 13:29:09,008 INFO L290 TraceCheckUtils]: 30: Hoare triple {2107#(= main_~a~0 0)} assume !(~d~0 < 6); {2107#(= main_~a~0 0)} is VALID [2022-04-15 13:29:09,008 INFO L290 TraceCheckUtils]: 31: Hoare triple {2107#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2107#(= main_~a~0 0)} is VALID [2022-04-15 13:29:09,009 INFO L290 TraceCheckUtils]: 32: Hoare triple {2107#(= main_~a~0 0)} assume !!(~c~0 < 6);~d~0 := 0; {2107#(= main_~a~0 0)} is VALID [2022-04-15 13:29:09,009 INFO L290 TraceCheckUtils]: 33: Hoare triple {2107#(= main_~a~0 0)} assume !!(~d~0 < 6); {2107#(= main_~a~0 0)} is VALID [2022-04-15 13:29:09,009 INFO L290 TraceCheckUtils]: 34: Hoare triple {2107#(= main_~a~0 0)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {2107#(= main_~a~0 0)} is VALID [2022-04-15 13:29:09,009 INFO L290 TraceCheckUtils]: 35: Hoare triple {2107#(= main_~a~0 0)} assume !!(~d~0 < 6); {2107#(= main_~a~0 0)} is VALID [2022-04-15 13:29:09,009 INFO L290 TraceCheckUtils]: 36: Hoare triple {2107#(= main_~a~0 0)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {2107#(= main_~a~0 0)} is VALID [2022-04-15 13:29:09,010 INFO L290 TraceCheckUtils]: 37: Hoare triple {2107#(= main_~a~0 0)} assume !(~d~0 < 6); {2107#(= main_~a~0 0)} is VALID [2022-04-15 13:29:09,010 INFO L290 TraceCheckUtils]: 38: Hoare triple {2107#(= main_~a~0 0)} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2107#(= main_~a~0 0)} is VALID [2022-04-15 13:29:09,010 INFO L290 TraceCheckUtils]: 39: Hoare triple {2107#(= main_~a~0 0)} assume !(~c~0 < 6); {2107#(= main_~a~0 0)} is VALID [2022-04-15 13:29:09,010 INFO L290 TraceCheckUtils]: 40: Hoare triple {2107#(= main_~a~0 0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2107#(= main_~a~0 0)} is VALID [2022-04-15 13:29:09,011 INFO L290 TraceCheckUtils]: 41: Hoare triple {2107#(= main_~a~0 0)} assume !(~b~0 < 6); {2107#(= main_~a~0 0)} is VALID [2022-04-15 13:29:09,011 INFO L290 TraceCheckUtils]: 42: Hoare triple {2107#(= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {2108#(<= main_~a~0 1)} is VALID [2022-04-15 13:29:09,011 INFO L290 TraceCheckUtils]: 43: Hoare triple {2108#(<= main_~a~0 1)} assume !(~a~0 < 6); {2103#false} is VALID [2022-04-15 13:29:09,011 INFO L290 TraceCheckUtils]: 44: Hoare triple {2103#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {2103#false} is VALID [2022-04-15 13:29:09,011 INFO L290 TraceCheckUtils]: 45: Hoare triple {2103#false} assume !false; {2103#false} is VALID [2022-04-15 13:29:09,012 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-04-15 13:29:09,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:29:09,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096637467] [2022-04-15 13:29:09,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096637467] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:29:09,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132445706] [2022-04-15 13:29:09,012 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:29:09,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:29:09,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:29:09,031 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-15 13:29:09,033 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-15 13:29:09,068 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:29:09,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:29:09,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:29:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:29:09,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:29:09,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {2102#true} call ULTIMATE.init(); {2102#true} is VALID [2022-04-15 13:29:09,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {2102#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); {2102#true} is VALID [2022-04-15 13:29:09,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {2102#true} assume true; {2102#true} is VALID [2022-04-15 13:29:09,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2102#true} {2102#true} #68#return; {2102#true} is VALID [2022-04-15 13:29:09,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {2102#true} call #t~ret8 := main(); {2102#true} is VALID [2022-04-15 13:29:09,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {2102#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {2102#true} is VALID [2022-04-15 13:29:09,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {2102#true} assume !!(~a~0 < 6);~b~0 := 0; {2102#true} is VALID [2022-04-15 13:29:09,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {2102#true} assume !!(~b~0 < 6);~c~0 := 0; {2102#true} is VALID [2022-04-15 13:29:09,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {2102#true} assume !!(~c~0 < 6);~d~0 := 0; {2137#(<= main_~d~0 0)} is VALID [2022-04-15 13:29:09,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {2137#(<= main_~d~0 0)} assume !!(~d~0 < 6); {2137#(<= main_~d~0 0)} is VALID [2022-04-15 13:29:09,159 INFO L290 TraceCheckUtils]: 10: Hoare triple {2137#(<= main_~d~0 0)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {2144#(<= main_~d~0 1)} is VALID [2022-04-15 13:29:09,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {2144#(<= main_~d~0 1)} assume !!(~d~0 < 6); {2144#(<= main_~d~0 1)} is VALID [2022-04-15 13:29:09,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {2144#(<= main_~d~0 1)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {2151#(<= main_~d~0 2)} is VALID [2022-04-15 13:29:09,160 INFO L290 TraceCheckUtils]: 13: Hoare triple {2151#(<= main_~d~0 2)} assume !(~d~0 < 6); {2103#false} is VALID [2022-04-15 13:29:09,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {2103#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2103#false} is VALID [2022-04-15 13:29:09,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {2103#false} assume !!(~c~0 < 6);~d~0 := 0; {2103#false} is VALID [2022-04-15 13:29:09,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {2103#false} assume !!(~d~0 < 6); {2103#false} is VALID [2022-04-15 13:29:09,161 INFO L290 TraceCheckUtils]: 17: Hoare triple {2103#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {2103#false} is VALID [2022-04-15 13:29:09,161 INFO L290 TraceCheckUtils]: 18: Hoare triple {2103#false} assume !!(~d~0 < 6); {2103#false} is VALID [2022-04-15 13:29:09,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {2103#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {2103#false} is VALID [2022-04-15 13:29:09,161 INFO L290 TraceCheckUtils]: 20: Hoare triple {2103#false} assume !(~d~0 < 6); {2103#false} is VALID [2022-04-15 13:29:09,161 INFO L290 TraceCheckUtils]: 21: Hoare triple {2103#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2103#false} is VALID [2022-04-15 13:29:09,161 INFO L290 TraceCheckUtils]: 22: Hoare triple {2103#false} assume !(~c~0 < 6); {2103#false} is VALID [2022-04-15 13:29:09,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {2103#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2103#false} is VALID [2022-04-15 13:29:09,161 INFO L290 TraceCheckUtils]: 24: Hoare triple {2103#false} assume !!(~b~0 < 6);~c~0 := 0; {2103#false} is VALID [2022-04-15 13:29:09,161 INFO L290 TraceCheckUtils]: 25: Hoare triple {2103#false} assume !!(~c~0 < 6);~d~0 := 0; {2103#false} is VALID [2022-04-15 13:29:09,161 INFO L290 TraceCheckUtils]: 26: Hoare triple {2103#false} assume !!(~d~0 < 6); {2103#false} is VALID [2022-04-15 13:29:09,161 INFO L290 TraceCheckUtils]: 27: Hoare triple {2103#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {2103#false} is VALID [2022-04-15 13:29:09,164 INFO L290 TraceCheckUtils]: 28: Hoare triple {2103#false} assume !!(~d~0 < 6); {2103#false} is VALID [2022-04-15 13:29:09,166 INFO L290 TraceCheckUtils]: 29: Hoare triple {2103#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {2103#false} is VALID [2022-04-15 13:29:09,170 INFO L290 TraceCheckUtils]: 30: Hoare triple {2103#false} assume !(~d~0 < 6); {2103#false} is VALID [2022-04-15 13:29:09,170 INFO L290 TraceCheckUtils]: 31: Hoare triple {2103#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2103#false} is VALID [2022-04-15 13:29:09,170 INFO L290 TraceCheckUtils]: 32: Hoare triple {2103#false} assume !!(~c~0 < 6);~d~0 := 0; {2103#false} is VALID [2022-04-15 13:29:09,170 INFO L290 TraceCheckUtils]: 33: Hoare triple {2103#false} assume !!(~d~0 < 6); {2103#false} is VALID [2022-04-15 13:29:09,170 INFO L290 TraceCheckUtils]: 34: Hoare triple {2103#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {2103#false} is VALID [2022-04-15 13:29:09,170 INFO L290 TraceCheckUtils]: 35: Hoare triple {2103#false} assume !!(~d~0 < 6); {2103#false} is VALID [2022-04-15 13:29:09,170 INFO L290 TraceCheckUtils]: 36: Hoare triple {2103#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {2103#false} is VALID [2022-04-15 13:29:09,170 INFO L290 TraceCheckUtils]: 37: Hoare triple {2103#false} assume !(~d~0 < 6); {2103#false} is VALID [2022-04-15 13:29:09,171 INFO L290 TraceCheckUtils]: 38: Hoare triple {2103#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2103#false} is VALID [2022-04-15 13:29:09,171 INFO L290 TraceCheckUtils]: 39: Hoare triple {2103#false} assume !(~c~0 < 6); {2103#false} is VALID [2022-04-15 13:29:09,171 INFO L290 TraceCheckUtils]: 40: Hoare triple {2103#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2103#false} is VALID [2022-04-15 13:29:09,171 INFO L290 TraceCheckUtils]: 41: Hoare triple {2103#false} assume !(~b~0 < 6); {2103#false} is VALID [2022-04-15 13:29:09,171 INFO L290 TraceCheckUtils]: 42: Hoare triple {2103#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {2103#false} is VALID [2022-04-15 13:29:09,171 INFO L290 TraceCheckUtils]: 43: Hoare triple {2103#false} assume !(~a~0 < 6); {2103#false} is VALID [2022-04-15 13:29:09,171 INFO L290 TraceCheckUtils]: 44: Hoare triple {2103#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {2103#false} is VALID [2022-04-15 13:29:09,171 INFO L290 TraceCheckUtils]: 45: Hoare triple {2103#false} assume !false; {2103#false} is VALID [2022-04-15 13:29:09,171 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 47 proven. 4 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-15 13:29:09,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:29:09,276 INFO L290 TraceCheckUtils]: 45: Hoare triple {2103#false} assume !false; {2103#false} is VALID [2022-04-15 13:29:09,276 INFO L290 TraceCheckUtils]: 44: Hoare triple {2103#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {2103#false} is VALID [2022-04-15 13:29:09,276 INFO L290 TraceCheckUtils]: 43: Hoare triple {2103#false} assume !(~a~0 < 6); {2103#false} is VALID [2022-04-15 13:29:09,276 INFO L290 TraceCheckUtils]: 42: Hoare triple {2103#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {2103#false} is VALID [2022-04-15 13:29:09,276 INFO L290 TraceCheckUtils]: 41: Hoare triple {2103#false} assume !(~b~0 < 6); {2103#false} is VALID [2022-04-15 13:29:09,276 INFO L290 TraceCheckUtils]: 40: Hoare triple {2103#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2103#false} is VALID [2022-04-15 13:29:09,276 INFO L290 TraceCheckUtils]: 39: Hoare triple {2103#false} assume !(~c~0 < 6); {2103#false} is VALID [2022-04-15 13:29:09,276 INFO L290 TraceCheckUtils]: 38: Hoare triple {2103#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2103#false} is VALID [2022-04-15 13:29:09,276 INFO L290 TraceCheckUtils]: 37: Hoare triple {2103#false} assume !(~d~0 < 6); {2103#false} is VALID [2022-04-15 13:29:09,276 INFO L290 TraceCheckUtils]: 36: Hoare triple {2103#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {2103#false} is VALID [2022-04-15 13:29:09,276 INFO L290 TraceCheckUtils]: 35: Hoare triple {2103#false} assume !!(~d~0 < 6); {2103#false} is VALID [2022-04-15 13:29:09,276 INFO L290 TraceCheckUtils]: 34: Hoare triple {2103#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {2103#false} is VALID [2022-04-15 13:29:09,277 INFO L290 TraceCheckUtils]: 33: Hoare triple {2103#false} assume !!(~d~0 < 6); {2103#false} is VALID [2022-04-15 13:29:09,277 INFO L290 TraceCheckUtils]: 32: Hoare triple {2103#false} assume !!(~c~0 < 6);~d~0 := 0; {2103#false} is VALID [2022-04-15 13:29:09,277 INFO L290 TraceCheckUtils]: 31: Hoare triple {2103#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2103#false} is VALID [2022-04-15 13:29:09,277 INFO L290 TraceCheckUtils]: 30: Hoare triple {2103#false} assume !(~d~0 < 6); {2103#false} is VALID [2022-04-15 13:29:09,277 INFO L290 TraceCheckUtils]: 29: Hoare triple {2103#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {2103#false} is VALID [2022-04-15 13:29:09,277 INFO L290 TraceCheckUtils]: 28: Hoare triple {2103#false} assume !!(~d~0 < 6); {2103#false} is VALID [2022-04-15 13:29:09,277 INFO L290 TraceCheckUtils]: 27: Hoare triple {2103#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {2103#false} is VALID [2022-04-15 13:29:09,277 INFO L290 TraceCheckUtils]: 26: Hoare triple {2103#false} assume !!(~d~0 < 6); {2103#false} is VALID [2022-04-15 13:29:09,277 INFO L290 TraceCheckUtils]: 25: Hoare triple {2103#false} assume !!(~c~0 < 6);~d~0 := 0; {2103#false} is VALID [2022-04-15 13:29:09,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {2103#false} assume !!(~b~0 < 6);~c~0 := 0; {2103#false} is VALID [2022-04-15 13:29:09,277 INFO L290 TraceCheckUtils]: 23: Hoare triple {2103#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {2103#false} is VALID [2022-04-15 13:29:09,277 INFO L290 TraceCheckUtils]: 22: Hoare triple {2103#false} assume !(~c~0 < 6); {2103#false} is VALID [2022-04-15 13:29:09,277 INFO L290 TraceCheckUtils]: 21: Hoare triple {2103#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2103#false} is VALID [2022-04-15 13:29:09,277 INFO L290 TraceCheckUtils]: 20: Hoare triple {2103#false} assume !(~d~0 < 6); {2103#false} is VALID [2022-04-15 13:29:09,277 INFO L290 TraceCheckUtils]: 19: Hoare triple {2103#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {2103#false} is VALID [2022-04-15 13:29:09,277 INFO L290 TraceCheckUtils]: 18: Hoare triple {2103#false} assume !!(~d~0 < 6); {2103#false} is VALID [2022-04-15 13:29:09,278 INFO L290 TraceCheckUtils]: 17: Hoare triple {2103#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {2103#false} is VALID [2022-04-15 13:29:09,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {2103#false} assume !!(~d~0 < 6); {2103#false} is VALID [2022-04-15 13:29:09,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {2103#false} assume !!(~c~0 < 6);~d~0 := 0; {2103#false} is VALID [2022-04-15 13:29:09,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {2103#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {2103#false} is VALID [2022-04-15 13:29:09,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {2347#(< main_~d~0 6)} assume !(~d~0 < 6); {2103#false} is VALID [2022-04-15 13:29:09,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {2351#(< main_~d~0 5)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {2347#(< main_~d~0 6)} is VALID [2022-04-15 13:29:09,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {2351#(< main_~d~0 5)} assume !!(~d~0 < 6); {2351#(< main_~d~0 5)} is VALID [2022-04-15 13:29:09,283 INFO L290 TraceCheckUtils]: 10: Hoare triple {2358#(< main_~d~0 4)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {2351#(< main_~d~0 5)} is VALID [2022-04-15 13:29:09,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {2358#(< main_~d~0 4)} assume !!(~d~0 < 6); {2358#(< main_~d~0 4)} is VALID [2022-04-15 13:29:09,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {2102#true} assume !!(~c~0 < 6);~d~0 := 0; {2358#(< main_~d~0 4)} is VALID [2022-04-15 13:29:09,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {2102#true} assume !!(~b~0 < 6);~c~0 := 0; {2102#true} is VALID [2022-04-15 13:29:09,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {2102#true} assume !!(~a~0 < 6);~b~0 := 0; {2102#true} is VALID [2022-04-15 13:29:09,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {2102#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {2102#true} is VALID [2022-04-15 13:29:09,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {2102#true} call #t~ret8 := main(); {2102#true} is VALID [2022-04-15 13:29:09,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2102#true} {2102#true} #68#return; {2102#true} is VALID [2022-04-15 13:29:09,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {2102#true} assume true; {2102#true} is VALID [2022-04-15 13:29:09,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {2102#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); {2102#true} is VALID [2022-04-15 13:29:09,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {2102#true} call ULTIMATE.init(); {2102#true} is VALID [2022-04-15 13:29:09,285 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 47 proven. 4 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-15 13:29:09,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132445706] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:29:09,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:29:09,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-04-15 13:29:09,285 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:29:09,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [477080804] [2022-04-15 13:29:09,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [477080804] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:29:09,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:29:09,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:29:09,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697520221] [2022-04-15 13:29:09,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:29:09,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 46 [2022-04-15 13:29:09,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:29:09,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-15 13:29:09,304 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-15 13:29:09,304 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:29:09,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:29:09,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:29:09,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-15 13:29:09,305 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-15 13:29:09,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:29:09,464 INFO L93 Difference]: Finished difference Result 123 states and 144 transitions. [2022-04-15 13:29:09,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:29:09,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 46 [2022-04-15 13:29:09,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:29:09,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-15 13:29:09,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-15 13:29:09,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-15 13:29:09,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-15 13:29:09,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2022-04-15 13:29:09,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:29:09,498 INFO L225 Difference]: With dead ends: 123 [2022-04-15 13:29:09,498 INFO L226 Difference]: Without dead ends: 120 [2022-04-15 13:29:09,498 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-04-15 13:29:09,499 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 55 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:29:09,499 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 25 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:29:09,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-15 13:29:09,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 84. [2022-04-15 13:29:09,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:29:09,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 84 states, 80 states have (on average 1.1875) internal successors, (95), 80 states have internal predecessors, (95), 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-15 13:29:09,568 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 84 states, 80 states have (on average 1.1875) internal successors, (95), 80 states have internal predecessors, (95), 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-15 13:29:09,568 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 84 states, 80 states have (on average 1.1875) internal successors, (95), 80 states have internal predecessors, (95), 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-15 13:29:09,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:29:09,570 INFO L93 Difference]: Finished difference Result 120 states and 141 transitions. [2022-04-15 13:29:09,570 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 141 transitions. [2022-04-15 13:29:09,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:29:09,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:29:09,571 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 80 states have (on average 1.1875) internal successors, (95), 80 states have internal predecessors, (95), 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 120 states. [2022-04-15 13:29:09,571 INFO L87 Difference]: Start difference. First operand has 84 states, 80 states have (on average 1.1875) internal successors, (95), 80 states have internal predecessors, (95), 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 120 states. [2022-04-15 13:29:09,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:29:09,573 INFO L93 Difference]: Finished difference Result 120 states and 141 transitions. [2022-04-15 13:29:09,573 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 141 transitions. [2022-04-15 13:29:09,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:29:09,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:29:09,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:29:09,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:29:09,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 80 states have (on average 1.1875) internal successors, (95), 80 states have internal predecessors, (95), 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-15 13:29:09,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2022-04-15 13:29:09,575 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 46 [2022-04-15 13:29:09,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:29:09,575 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2022-04-15 13:29:09,575 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-15 13:29:09,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 98 transitions. [2022-04-15 13:29:09,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:29:09,665 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2022-04-15 13:29:09,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-15 13:29:09,666 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:29:09,666 INFO L499 BasicCegarLoop]: trace histogram [16, 16, 8, 8, 8, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:29:09,683 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-15 13:29:09,871 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-15 13:29:09,871 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:29:09,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:29:09,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1094491381, now seen corresponding path program 9 times [2022-04-15 13:29:09,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:29:09,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1628891651] [2022-04-15 13:29:11,840 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:29:11,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1740236099, now seen corresponding path program 1 times [2022-04-15 13:29:11,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:29:11,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582489568] [2022-04-15 13:29:11,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:29:11,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:29:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:29:11,845 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:29:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:29:11,848 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:29:11,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1094491381, now seen corresponding path program 10 times [2022-04-15 13:29:11,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:29:11,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062764136] [2022-04-15 13:29:11,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:29:11,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:29:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:29:11,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:29:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:29:11,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {3057#(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); {3049#true} is VALID [2022-04-15 13:29:11,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {3049#true} assume true; {3049#true} is VALID [2022-04-15 13:29:11,904 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3049#true} {3049#true} #68#return; {3049#true} is VALID [2022-04-15 13:29:11,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {3049#true} call ULTIMATE.init(); {3057#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:29:11,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {3057#(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); {3049#true} is VALID [2022-04-15 13:29:11,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {3049#true} assume true; {3049#true} is VALID [2022-04-15 13:29:11,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3049#true} {3049#true} #68#return; {3049#true} is VALID [2022-04-15 13:29:11,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {3049#true} call #t~ret8 := main(); {3049#true} is VALID [2022-04-15 13:29:11,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {3049#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {3049#true} is VALID [2022-04-15 13:29:11,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {3049#true} assume !!(~a~0 < 6);~b~0 := 0; {3049#true} is VALID [2022-04-15 13:29:11,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {3049#true} assume !!(~b~0 < 6);~c~0 := 0; {3049#true} is VALID [2022-04-15 13:29:11,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {3049#true} assume !!(~c~0 < 6);~d~0 := 0; {3054#(= main_~d~0 0)} is VALID [2022-04-15 13:29:11,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {3054#(= main_~d~0 0)} assume !!(~d~0 < 6); {3054#(= main_~d~0 0)} is VALID [2022-04-15 13:29:11,906 INFO L290 TraceCheckUtils]: 10: Hoare triple {3054#(= main_~d~0 0)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3055#(<= main_~d~0 1)} is VALID [2022-04-15 13:29:11,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {3055#(<= main_~d~0 1)} assume !!(~d~0 < 6); {3055#(<= main_~d~0 1)} is VALID [2022-04-15 13:29:11,906 INFO L290 TraceCheckUtils]: 12: Hoare triple {3055#(<= main_~d~0 1)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3056#(<= main_~d~0 2)} is VALID [2022-04-15 13:29:11,907 INFO L290 TraceCheckUtils]: 13: Hoare triple {3056#(<= main_~d~0 2)} assume !(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:11,907 INFO L290 TraceCheckUtils]: 14: Hoare triple {3050#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3050#false} is VALID [2022-04-15 13:29:11,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {3050#false} assume !!(~c~0 < 6);~d~0 := 0; {3050#false} is VALID [2022-04-15 13:29:11,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:11,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:11,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:11,907 INFO L290 TraceCheckUtils]: 19: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:11,907 INFO L290 TraceCheckUtils]: 20: Hoare triple {3050#false} assume !(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:11,907 INFO L290 TraceCheckUtils]: 21: Hoare triple {3050#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3050#false} is VALID [2022-04-15 13:29:11,907 INFO L290 TraceCheckUtils]: 22: Hoare triple {3050#false} assume !(~c~0 < 6); {3050#false} is VALID [2022-04-15 13:29:11,907 INFO L290 TraceCheckUtils]: 23: Hoare triple {3050#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3050#false} is VALID [2022-04-15 13:29:11,907 INFO L290 TraceCheckUtils]: 24: Hoare triple {3050#false} assume !!(~b~0 < 6);~c~0 := 0; {3050#false} is VALID [2022-04-15 13:29:11,907 INFO L290 TraceCheckUtils]: 25: Hoare triple {3050#false} assume !!(~c~0 < 6);~d~0 := 0; {3050#false} is VALID [2022-04-15 13:29:11,908 INFO L290 TraceCheckUtils]: 26: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:11,908 INFO L290 TraceCheckUtils]: 27: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:11,908 INFO L290 TraceCheckUtils]: 28: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:11,908 INFO L290 TraceCheckUtils]: 29: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:11,908 INFO L290 TraceCheckUtils]: 30: Hoare triple {3050#false} assume !(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:11,908 INFO L290 TraceCheckUtils]: 31: Hoare triple {3050#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3050#false} is VALID [2022-04-15 13:29:11,908 INFO L290 TraceCheckUtils]: 32: Hoare triple {3050#false} assume !!(~c~0 < 6);~d~0 := 0; {3050#false} is VALID [2022-04-15 13:29:11,908 INFO L290 TraceCheckUtils]: 33: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:11,908 INFO L290 TraceCheckUtils]: 34: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:11,908 INFO L290 TraceCheckUtils]: 35: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:11,908 INFO L290 TraceCheckUtils]: 36: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:11,908 INFO L290 TraceCheckUtils]: 37: Hoare triple {3050#false} assume !(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:11,908 INFO L290 TraceCheckUtils]: 38: Hoare triple {3050#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3050#false} is VALID [2022-04-15 13:29:11,908 INFO L290 TraceCheckUtils]: 39: Hoare triple {3050#false} assume !(~c~0 < 6); {3050#false} is VALID [2022-04-15 13:29:11,908 INFO L290 TraceCheckUtils]: 40: Hoare triple {3050#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3050#false} is VALID [2022-04-15 13:29:11,908 INFO L290 TraceCheckUtils]: 41: Hoare triple {3050#false} assume !(~b~0 < 6); {3050#false} is VALID [2022-04-15 13:29:11,908 INFO L290 TraceCheckUtils]: 42: Hoare triple {3050#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {3050#false} is VALID [2022-04-15 13:29:11,909 INFO L290 TraceCheckUtils]: 43: Hoare triple {3050#false} assume !!(~a~0 < 6);~b~0 := 0; {3050#false} is VALID [2022-04-15 13:29:11,909 INFO L290 TraceCheckUtils]: 44: Hoare triple {3050#false} assume !!(~b~0 < 6);~c~0 := 0; {3050#false} is VALID [2022-04-15 13:29:11,909 INFO L290 TraceCheckUtils]: 45: Hoare triple {3050#false} assume !!(~c~0 < 6);~d~0 := 0; {3050#false} is VALID [2022-04-15 13:29:11,909 INFO L290 TraceCheckUtils]: 46: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:11,909 INFO L290 TraceCheckUtils]: 47: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:11,909 INFO L290 TraceCheckUtils]: 48: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:11,909 INFO L290 TraceCheckUtils]: 49: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:11,909 INFO L290 TraceCheckUtils]: 50: Hoare triple {3050#false} assume !(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:11,909 INFO L290 TraceCheckUtils]: 51: Hoare triple {3050#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3050#false} is VALID [2022-04-15 13:29:11,909 INFO L290 TraceCheckUtils]: 52: Hoare triple {3050#false} assume !!(~c~0 < 6);~d~0 := 0; {3050#false} is VALID [2022-04-15 13:29:11,909 INFO L290 TraceCheckUtils]: 53: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:11,909 INFO L290 TraceCheckUtils]: 54: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:11,909 INFO L290 TraceCheckUtils]: 55: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:11,909 INFO L290 TraceCheckUtils]: 56: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:11,909 INFO L290 TraceCheckUtils]: 57: Hoare triple {3050#false} assume !(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:11,909 INFO L290 TraceCheckUtils]: 58: Hoare triple {3050#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3050#false} is VALID [2022-04-15 13:29:11,909 INFO L290 TraceCheckUtils]: 59: Hoare triple {3050#false} assume !(~c~0 < 6); {3050#false} is VALID [2022-04-15 13:29:11,910 INFO L290 TraceCheckUtils]: 60: Hoare triple {3050#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3050#false} is VALID [2022-04-15 13:29:11,910 INFO L290 TraceCheckUtils]: 61: Hoare triple {3050#false} assume !!(~b~0 < 6);~c~0 := 0; {3050#false} is VALID [2022-04-15 13:29:11,910 INFO L290 TraceCheckUtils]: 62: Hoare triple {3050#false} assume !!(~c~0 < 6);~d~0 := 0; {3050#false} is VALID [2022-04-15 13:29:11,910 INFO L290 TraceCheckUtils]: 63: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:11,910 INFO L290 TraceCheckUtils]: 64: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:11,910 INFO L290 TraceCheckUtils]: 65: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:11,910 INFO L290 TraceCheckUtils]: 66: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:11,910 INFO L290 TraceCheckUtils]: 67: Hoare triple {3050#false} assume !(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:11,910 INFO L290 TraceCheckUtils]: 68: Hoare triple {3050#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3050#false} is VALID [2022-04-15 13:29:11,910 INFO L290 TraceCheckUtils]: 69: Hoare triple {3050#false} assume !!(~c~0 < 6);~d~0 := 0; {3050#false} is VALID [2022-04-15 13:29:11,910 INFO L290 TraceCheckUtils]: 70: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:11,910 INFO L290 TraceCheckUtils]: 71: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:11,910 INFO L290 TraceCheckUtils]: 72: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:11,910 INFO L290 TraceCheckUtils]: 73: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:11,910 INFO L290 TraceCheckUtils]: 74: Hoare triple {3050#false} assume !(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:11,910 INFO L290 TraceCheckUtils]: 75: Hoare triple {3050#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3050#false} is VALID [2022-04-15 13:29:11,910 INFO L290 TraceCheckUtils]: 76: Hoare triple {3050#false} assume !(~c~0 < 6); {3050#false} is VALID [2022-04-15 13:29:11,910 INFO L290 TraceCheckUtils]: 77: Hoare triple {3050#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3050#false} is VALID [2022-04-15 13:29:11,911 INFO L290 TraceCheckUtils]: 78: Hoare triple {3050#false} assume !(~b~0 < 6); {3050#false} is VALID [2022-04-15 13:29:11,911 INFO L290 TraceCheckUtils]: 79: Hoare triple {3050#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {3050#false} is VALID [2022-04-15 13:29:11,911 INFO L290 TraceCheckUtils]: 80: Hoare triple {3050#false} assume !(~a~0 < 6); {3050#false} is VALID [2022-04-15 13:29:11,911 INFO L290 TraceCheckUtils]: 81: Hoare triple {3050#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {3050#false} is VALID [2022-04-15 13:29:11,911 INFO L290 TraceCheckUtils]: 82: Hoare triple {3050#false} assume !false; {3050#false} is VALID [2022-04-15 13:29:11,911 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 109 proven. 4 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2022-04-15 13:29:11,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:29:11,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062764136] [2022-04-15 13:29:11,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062764136] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:29:11,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104535046] [2022-04-15 13:29:11,911 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:29:11,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:29:11,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:29:11,912 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-15 13:29:11,913 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-15 13:29:11,966 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:29:11,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:29:11,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:29:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:29:11,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:29:12,110 INFO L272 TraceCheckUtils]: 0: Hoare triple {3049#true} call ULTIMATE.init(); {3049#true} is VALID [2022-04-15 13:29:12,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {3049#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); {3049#true} is VALID [2022-04-15 13:29:12,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {3049#true} assume true; {3049#true} is VALID [2022-04-15 13:29:12,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3049#true} {3049#true} #68#return; {3049#true} is VALID [2022-04-15 13:29:12,112 INFO L272 TraceCheckUtils]: 4: Hoare triple {3049#true} call #t~ret8 := main(); {3049#true} is VALID [2022-04-15 13:29:12,112 INFO L290 TraceCheckUtils]: 5: Hoare triple {3049#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {3049#true} is VALID [2022-04-15 13:29:12,112 INFO L290 TraceCheckUtils]: 6: Hoare triple {3049#true} assume !!(~a~0 < 6);~b~0 := 0; {3049#true} is VALID [2022-04-15 13:29:12,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {3049#true} assume !!(~b~0 < 6);~c~0 := 0; {3049#true} is VALID [2022-04-15 13:29:12,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {3049#true} assume !!(~c~0 < 6);~d~0 := 0; {3085#(<= main_~d~0 0)} is VALID [2022-04-15 13:29:12,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {3085#(<= main_~d~0 0)} assume !!(~d~0 < 6); {3085#(<= main_~d~0 0)} is VALID [2022-04-15 13:29:12,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {3085#(<= main_~d~0 0)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3055#(<= main_~d~0 1)} is VALID [2022-04-15 13:29:12,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {3055#(<= main_~d~0 1)} assume !!(~d~0 < 6); {3055#(<= main_~d~0 1)} is VALID [2022-04-15 13:29:12,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {3055#(<= main_~d~0 1)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3056#(<= main_~d~0 2)} is VALID [2022-04-15 13:29:12,115 INFO L290 TraceCheckUtils]: 13: Hoare triple {3056#(<= main_~d~0 2)} assume !(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,115 INFO L290 TraceCheckUtils]: 14: Hoare triple {3050#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3050#false} is VALID [2022-04-15 13:29:12,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {3050#false} assume !!(~c~0 < 6);~d~0 := 0; {3050#false} is VALID [2022-04-15 13:29:12,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:12,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,115 INFO L290 TraceCheckUtils]: 19: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:12,115 INFO L290 TraceCheckUtils]: 20: Hoare triple {3050#false} assume !(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,115 INFO L290 TraceCheckUtils]: 21: Hoare triple {3050#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3050#false} is VALID [2022-04-15 13:29:12,115 INFO L290 TraceCheckUtils]: 22: Hoare triple {3050#false} assume !(~c~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,115 INFO L290 TraceCheckUtils]: 23: Hoare triple {3050#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3050#false} is VALID [2022-04-15 13:29:12,115 INFO L290 TraceCheckUtils]: 24: Hoare triple {3050#false} assume !!(~b~0 < 6);~c~0 := 0; {3050#false} is VALID [2022-04-15 13:29:12,115 INFO L290 TraceCheckUtils]: 25: Hoare triple {3050#false} assume !!(~c~0 < 6);~d~0 := 0; {3050#false} is VALID [2022-04-15 13:29:12,116 INFO L290 TraceCheckUtils]: 26: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,116 INFO L290 TraceCheckUtils]: 27: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:12,116 INFO L290 TraceCheckUtils]: 28: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,116 INFO L290 TraceCheckUtils]: 29: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:12,116 INFO L290 TraceCheckUtils]: 30: Hoare triple {3050#false} assume !(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,116 INFO L290 TraceCheckUtils]: 31: Hoare triple {3050#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3050#false} is VALID [2022-04-15 13:29:12,116 INFO L290 TraceCheckUtils]: 32: Hoare triple {3050#false} assume !!(~c~0 < 6);~d~0 := 0; {3050#false} is VALID [2022-04-15 13:29:12,116 INFO L290 TraceCheckUtils]: 33: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,116 INFO L290 TraceCheckUtils]: 34: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:12,116 INFO L290 TraceCheckUtils]: 35: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,116 INFO L290 TraceCheckUtils]: 36: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:12,116 INFO L290 TraceCheckUtils]: 37: Hoare triple {3050#false} assume !(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,116 INFO L290 TraceCheckUtils]: 38: Hoare triple {3050#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3050#false} is VALID [2022-04-15 13:29:12,116 INFO L290 TraceCheckUtils]: 39: Hoare triple {3050#false} assume !(~c~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,116 INFO L290 TraceCheckUtils]: 40: Hoare triple {3050#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3050#false} is VALID [2022-04-15 13:29:12,116 INFO L290 TraceCheckUtils]: 41: Hoare triple {3050#false} assume !(~b~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,116 INFO L290 TraceCheckUtils]: 42: Hoare triple {3050#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {3050#false} is VALID [2022-04-15 13:29:12,117 INFO L290 TraceCheckUtils]: 43: Hoare triple {3050#false} assume !!(~a~0 < 6);~b~0 := 0; {3050#false} is VALID [2022-04-15 13:29:12,117 INFO L290 TraceCheckUtils]: 44: Hoare triple {3050#false} assume !!(~b~0 < 6);~c~0 := 0; {3050#false} is VALID [2022-04-15 13:29:12,117 INFO L290 TraceCheckUtils]: 45: Hoare triple {3050#false} assume !!(~c~0 < 6);~d~0 := 0; {3050#false} is VALID [2022-04-15 13:29:12,117 INFO L290 TraceCheckUtils]: 46: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,117 INFO L290 TraceCheckUtils]: 47: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:12,117 INFO L290 TraceCheckUtils]: 48: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,117 INFO L290 TraceCheckUtils]: 49: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:12,117 INFO L290 TraceCheckUtils]: 50: Hoare triple {3050#false} assume !(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,117 INFO L290 TraceCheckUtils]: 51: Hoare triple {3050#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3050#false} is VALID [2022-04-15 13:29:12,117 INFO L290 TraceCheckUtils]: 52: Hoare triple {3050#false} assume !!(~c~0 < 6);~d~0 := 0; {3050#false} is VALID [2022-04-15 13:29:12,117 INFO L290 TraceCheckUtils]: 53: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,117 INFO L290 TraceCheckUtils]: 54: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:12,117 INFO L290 TraceCheckUtils]: 55: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,117 INFO L290 TraceCheckUtils]: 56: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:12,117 INFO L290 TraceCheckUtils]: 57: Hoare triple {3050#false} assume !(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,117 INFO L290 TraceCheckUtils]: 58: Hoare triple {3050#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3050#false} is VALID [2022-04-15 13:29:12,117 INFO L290 TraceCheckUtils]: 59: Hoare triple {3050#false} assume !(~c~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,118 INFO L290 TraceCheckUtils]: 60: Hoare triple {3050#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3050#false} is VALID [2022-04-15 13:29:12,118 INFO L290 TraceCheckUtils]: 61: Hoare triple {3050#false} assume !!(~b~0 < 6);~c~0 := 0; {3050#false} is VALID [2022-04-15 13:29:12,118 INFO L290 TraceCheckUtils]: 62: Hoare triple {3050#false} assume !!(~c~0 < 6);~d~0 := 0; {3050#false} is VALID [2022-04-15 13:29:12,118 INFO L290 TraceCheckUtils]: 63: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,118 INFO L290 TraceCheckUtils]: 64: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:12,118 INFO L290 TraceCheckUtils]: 65: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,118 INFO L290 TraceCheckUtils]: 66: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:12,118 INFO L290 TraceCheckUtils]: 67: Hoare triple {3050#false} assume !(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,118 INFO L290 TraceCheckUtils]: 68: Hoare triple {3050#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3050#false} is VALID [2022-04-15 13:29:12,118 INFO L290 TraceCheckUtils]: 69: Hoare triple {3050#false} assume !!(~c~0 < 6);~d~0 := 0; {3050#false} is VALID [2022-04-15 13:29:12,118 INFO L290 TraceCheckUtils]: 70: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,118 INFO L290 TraceCheckUtils]: 71: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:12,118 INFO L290 TraceCheckUtils]: 72: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,118 INFO L290 TraceCheckUtils]: 73: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:12,118 INFO L290 TraceCheckUtils]: 74: Hoare triple {3050#false} assume !(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,118 INFO L290 TraceCheckUtils]: 75: Hoare triple {3050#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3050#false} is VALID [2022-04-15 13:29:12,118 INFO L290 TraceCheckUtils]: 76: Hoare triple {3050#false} assume !(~c~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,118 INFO L290 TraceCheckUtils]: 77: Hoare triple {3050#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3050#false} is VALID [2022-04-15 13:29:12,119 INFO L290 TraceCheckUtils]: 78: Hoare triple {3050#false} assume !(~b~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,119 INFO L290 TraceCheckUtils]: 79: Hoare triple {3050#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {3050#false} is VALID [2022-04-15 13:29:12,119 INFO L290 TraceCheckUtils]: 80: Hoare triple {3050#false} assume !(~a~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,119 INFO L290 TraceCheckUtils]: 81: Hoare triple {3050#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {3050#false} is VALID [2022-04-15 13:29:12,119 INFO L290 TraceCheckUtils]: 82: Hoare triple {3050#false} assume !false; {3050#false} is VALID [2022-04-15 13:29:12,120 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 109 proven. 4 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2022-04-15 13:29:12,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:29:12,281 INFO L290 TraceCheckUtils]: 82: Hoare triple {3050#false} assume !false; {3050#false} is VALID [2022-04-15 13:29:12,281 INFO L290 TraceCheckUtils]: 81: Hoare triple {3050#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {3050#false} is VALID [2022-04-15 13:29:12,281 INFO L290 TraceCheckUtils]: 80: Hoare triple {3050#false} assume !(~a~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,281 INFO L290 TraceCheckUtils]: 79: Hoare triple {3050#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {3050#false} is VALID [2022-04-15 13:29:12,281 INFO L290 TraceCheckUtils]: 78: Hoare triple {3050#false} assume !(~b~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,281 INFO L290 TraceCheckUtils]: 77: Hoare triple {3050#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3050#false} is VALID [2022-04-15 13:29:12,281 INFO L290 TraceCheckUtils]: 76: Hoare triple {3050#false} assume !(~c~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,281 INFO L290 TraceCheckUtils]: 75: Hoare triple {3050#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3050#false} is VALID [2022-04-15 13:29:12,281 INFO L290 TraceCheckUtils]: 74: Hoare triple {3050#false} assume !(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,281 INFO L290 TraceCheckUtils]: 73: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:12,282 INFO L290 TraceCheckUtils]: 72: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,282 INFO L290 TraceCheckUtils]: 71: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:12,282 INFO L290 TraceCheckUtils]: 70: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,282 INFO L290 TraceCheckUtils]: 69: Hoare triple {3050#false} assume !!(~c~0 < 6);~d~0 := 0; {3050#false} is VALID [2022-04-15 13:29:12,282 INFO L290 TraceCheckUtils]: 68: Hoare triple {3050#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3050#false} is VALID [2022-04-15 13:29:12,282 INFO L290 TraceCheckUtils]: 67: Hoare triple {3050#false} assume !(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,282 INFO L290 TraceCheckUtils]: 66: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:12,282 INFO L290 TraceCheckUtils]: 65: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,282 INFO L290 TraceCheckUtils]: 64: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:12,282 INFO L290 TraceCheckUtils]: 63: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,282 INFO L290 TraceCheckUtils]: 62: Hoare triple {3050#false} assume !!(~c~0 < 6);~d~0 := 0; {3050#false} is VALID [2022-04-15 13:29:12,282 INFO L290 TraceCheckUtils]: 61: Hoare triple {3050#false} assume !!(~b~0 < 6);~c~0 := 0; {3050#false} is VALID [2022-04-15 13:29:12,282 INFO L290 TraceCheckUtils]: 60: Hoare triple {3050#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3050#false} is VALID [2022-04-15 13:29:12,282 INFO L290 TraceCheckUtils]: 59: Hoare triple {3050#false} assume !(~c~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,282 INFO L290 TraceCheckUtils]: 58: Hoare triple {3050#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3050#false} is VALID [2022-04-15 13:29:12,282 INFO L290 TraceCheckUtils]: 57: Hoare triple {3050#false} assume !(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,282 INFO L290 TraceCheckUtils]: 56: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:12,283 INFO L290 TraceCheckUtils]: 55: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,283 INFO L290 TraceCheckUtils]: 54: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:12,283 INFO L290 TraceCheckUtils]: 53: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,283 INFO L290 TraceCheckUtils]: 52: Hoare triple {3050#false} assume !!(~c~0 < 6);~d~0 := 0; {3050#false} is VALID [2022-04-15 13:29:12,283 INFO L290 TraceCheckUtils]: 51: Hoare triple {3050#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3050#false} is VALID [2022-04-15 13:29:12,283 INFO L290 TraceCheckUtils]: 50: Hoare triple {3050#false} assume !(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,283 INFO L290 TraceCheckUtils]: 49: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:12,283 INFO L290 TraceCheckUtils]: 48: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,283 INFO L290 TraceCheckUtils]: 47: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:12,283 INFO L290 TraceCheckUtils]: 46: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,283 INFO L290 TraceCheckUtils]: 45: Hoare triple {3050#false} assume !!(~c~0 < 6);~d~0 := 0; {3050#false} is VALID [2022-04-15 13:29:12,283 INFO L290 TraceCheckUtils]: 44: Hoare triple {3050#false} assume !!(~b~0 < 6);~c~0 := 0; {3050#false} is VALID [2022-04-15 13:29:12,283 INFO L290 TraceCheckUtils]: 43: Hoare triple {3050#false} assume !!(~a~0 < 6);~b~0 := 0; {3050#false} is VALID [2022-04-15 13:29:12,283 INFO L290 TraceCheckUtils]: 42: Hoare triple {3050#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {3050#false} is VALID [2022-04-15 13:29:12,283 INFO L290 TraceCheckUtils]: 41: Hoare triple {3050#false} assume !(~b~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,283 INFO L290 TraceCheckUtils]: 40: Hoare triple {3050#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3050#false} is VALID [2022-04-15 13:29:12,284 INFO L290 TraceCheckUtils]: 39: Hoare triple {3050#false} assume !(~c~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,284 INFO L290 TraceCheckUtils]: 38: Hoare triple {3050#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3050#false} is VALID [2022-04-15 13:29:12,284 INFO L290 TraceCheckUtils]: 37: Hoare triple {3050#false} assume !(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,284 INFO L290 TraceCheckUtils]: 36: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:12,284 INFO L290 TraceCheckUtils]: 35: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,284 INFO L290 TraceCheckUtils]: 34: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:12,284 INFO L290 TraceCheckUtils]: 33: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,284 INFO L290 TraceCheckUtils]: 32: Hoare triple {3050#false} assume !!(~c~0 < 6);~d~0 := 0; {3050#false} is VALID [2022-04-15 13:29:12,284 INFO L290 TraceCheckUtils]: 31: Hoare triple {3050#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3050#false} is VALID [2022-04-15 13:29:12,284 INFO L290 TraceCheckUtils]: 30: Hoare triple {3050#false} assume !(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,284 INFO L290 TraceCheckUtils]: 29: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:12,284 INFO L290 TraceCheckUtils]: 28: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,284 INFO L290 TraceCheckUtils]: 27: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:12,284 INFO L290 TraceCheckUtils]: 26: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,284 INFO L290 TraceCheckUtils]: 25: Hoare triple {3050#false} assume !!(~c~0 < 6);~d~0 := 0; {3050#false} is VALID [2022-04-15 13:29:12,284 INFO L290 TraceCheckUtils]: 24: Hoare triple {3050#false} assume !!(~b~0 < 6);~c~0 := 0; {3050#false} is VALID [2022-04-15 13:29:12,284 INFO L290 TraceCheckUtils]: 23: Hoare triple {3050#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {3050#false} is VALID [2022-04-15 13:29:12,285 INFO L290 TraceCheckUtils]: 22: Hoare triple {3050#false} assume !(~c~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,285 INFO L290 TraceCheckUtils]: 21: Hoare triple {3050#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3050#false} is VALID [2022-04-15 13:29:12,285 INFO L290 TraceCheckUtils]: 20: Hoare triple {3050#false} assume !(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,285 INFO L290 TraceCheckUtils]: 19: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:12,285 INFO L290 TraceCheckUtils]: 18: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,285 INFO L290 TraceCheckUtils]: 17: Hoare triple {3050#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3050#false} is VALID [2022-04-15 13:29:12,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {3050#false} assume !!(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,285 INFO L290 TraceCheckUtils]: 15: Hoare triple {3050#false} assume !!(~c~0 < 6);~d~0 := 0; {3050#false} is VALID [2022-04-15 13:29:12,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {3050#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {3050#false} is VALID [2022-04-15 13:29:12,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {3515#(< main_~d~0 6)} assume !(~d~0 < 6); {3050#false} is VALID [2022-04-15 13:29:12,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {3519#(< main_~d~0 5)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3515#(< main_~d~0 6)} is VALID [2022-04-15 13:29:12,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {3519#(< main_~d~0 5)} assume !!(~d~0 < 6); {3519#(< main_~d~0 5)} is VALID [2022-04-15 13:29:12,286 INFO L290 TraceCheckUtils]: 10: Hoare triple {3526#(< main_~d~0 4)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {3519#(< main_~d~0 5)} is VALID [2022-04-15 13:29:12,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {3526#(< main_~d~0 4)} assume !!(~d~0 < 6); {3526#(< main_~d~0 4)} is VALID [2022-04-15 13:29:12,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {3049#true} assume !!(~c~0 < 6);~d~0 := 0; {3526#(< main_~d~0 4)} is VALID [2022-04-15 13:29:12,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {3049#true} assume !!(~b~0 < 6);~c~0 := 0; {3049#true} is VALID [2022-04-15 13:29:12,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {3049#true} assume !!(~a~0 < 6);~b~0 := 0; {3049#true} is VALID [2022-04-15 13:29:12,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {3049#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {3049#true} is VALID [2022-04-15 13:29:12,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {3049#true} call #t~ret8 := main(); {3049#true} is VALID [2022-04-15 13:29:12,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3049#true} {3049#true} #68#return; {3049#true} is VALID [2022-04-15 13:29:12,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {3049#true} assume true; {3049#true} is VALID [2022-04-15 13:29:12,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {3049#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); {3049#true} is VALID [2022-04-15 13:29:12,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {3049#true} call ULTIMATE.init(); {3049#true} is VALID [2022-04-15 13:29:12,288 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 109 proven. 4 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2022-04-15 13:29:12,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104535046] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:29:12,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:29:12,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-15 13:29:12,288 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:29:12,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1628891651] [2022-04-15 13:29:12,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1628891651] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:29:12,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:29:12,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:29:12,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129096955] [2022-04-15 13:29:12,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:29:12,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 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 83 [2022-04-15 13:29:12,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:29:12,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 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-15 13:29:12,305 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-15 13:29:12,305 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 13:29:12,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:29:12,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 13:29:12,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:29:12,306 INFO L87 Difference]: Start difference. First operand 84 states and 98 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 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-15 13:29:12,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:29:12,471 INFO L93 Difference]: Finished difference Result 178 states and 213 transitions. [2022-04-15 13:29:12,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 13:29:12,471 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 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 83 [2022-04-15 13:29:12,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:29:12,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 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-15 13:29:12,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-15 13:29:12,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 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-15 13:29:12,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-15 13:29:12,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-04-15 13:29:12,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:29:12,498 INFO L225 Difference]: With dead ends: 178 [2022-04-15 13:29:12,499 INFO L226 Difference]: Without dead ends: 108 [2022-04-15 13:29:12,499 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 164 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-15 13:29:12,499 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 21 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:29:12,500 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 35 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:29:12,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-15 13:29:12,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 100. [2022-04-15 13:29:12,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:29:12,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 100 states, 96 states have (on average 1.15625) internal successors, (111), 96 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-15 13:29:12,570 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 100 states, 96 states have (on average 1.15625) internal successors, (111), 96 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-15 13:29:12,571 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 100 states, 96 states have (on average 1.15625) internal successors, (111), 96 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-15 13:29:12,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:29:12,573 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2022-04-15 13:29:12,573 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2022-04-15 13:29:12,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:29:12,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:29:12,574 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 96 states have (on average 1.15625) internal successors, (111), 96 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 108 states. [2022-04-15 13:29:12,574 INFO L87 Difference]: Start difference. First operand has 100 states, 96 states have (on average 1.15625) internal successors, (111), 96 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 108 states. [2022-04-15 13:29:12,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:29:12,576 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2022-04-15 13:29:12,576 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2022-04-15 13:29:12,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:29:12,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:29:12,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:29:12,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:29:12,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 96 states have (on average 1.15625) internal successors, (111), 96 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-15 13:29:12,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2022-04-15 13:29:12,579 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 83 [2022-04-15 13:29:12,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:29:12,579 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2022-04-15 13:29:12,579 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 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-15 13:29:12,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 114 transitions. [2022-04-15 13:29:12,686 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-15 13:29:12,686 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2022-04-15 13:29:12,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-15 13:29:12,687 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:29:12,687 INFO L499 BasicCegarLoop]: trace histogram [24, 24, 8, 8, 8, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:29:12,702 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-15 13:29:12,887 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16 [2022-04-15 13:29:12,887 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:29:12,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:29:12,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1810799115, now seen corresponding path program 11 times [2022-04-15 13:29:12,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:29:12,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [239348060] [2022-04-15 13:29:14,941 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:29:14,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1740297603, now seen corresponding path program 1 times [2022-04-15 13:29:14,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:29:14,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840516173] [2022-04-15 13:29:14,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:29:14,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:29:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:29:14,954 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:29:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:29:14,960 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:29:14,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1810799115, now seen corresponding path program 12 times [2022-04-15 13:29:14,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:29:14,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508356479] [2022-04-15 13:29:14,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:29:14,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:29:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:29:15,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:29:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:29:15,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {4346#(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); {4337#true} is VALID [2022-04-15 13:29:15,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {4337#true} assume true; {4337#true} is VALID [2022-04-15 13:29:15,019 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4337#true} {4337#true} #68#return; {4337#true} is VALID [2022-04-15 13:29:15,019 INFO L272 TraceCheckUtils]: 0: Hoare triple {4337#true} call ULTIMATE.init(); {4346#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:29:15,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {4346#(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); {4337#true} is VALID [2022-04-15 13:29:15,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {4337#true} assume true; {4337#true} is VALID [2022-04-15 13:29:15,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4337#true} {4337#true} #68#return; {4337#true} is VALID [2022-04-15 13:29:15,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {4337#true} call #t~ret8 := main(); {4337#true} is VALID [2022-04-15 13:29:15,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {4337#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {4337#true} is VALID [2022-04-15 13:29:15,020 INFO L290 TraceCheckUtils]: 6: Hoare triple {4337#true} assume !!(~a~0 < 6);~b~0 := 0; {4337#true} is VALID [2022-04-15 13:29:15,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {4337#true} assume !!(~b~0 < 6);~c~0 := 0; {4337#true} is VALID [2022-04-15 13:29:15,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {4337#true} assume !!(~c~0 < 6);~d~0 := 0; {4342#(= main_~d~0 0)} is VALID [2022-04-15 13:29:15,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {4342#(= main_~d~0 0)} assume !!(~d~0 < 6); {4342#(= main_~d~0 0)} is VALID [2022-04-15 13:29:15,021 INFO L290 TraceCheckUtils]: 10: Hoare triple {4342#(= main_~d~0 0)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4343#(<= main_~d~0 1)} is VALID [2022-04-15 13:29:15,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {4343#(<= main_~d~0 1)} assume !!(~d~0 < 6); {4343#(<= main_~d~0 1)} is VALID [2022-04-15 13:29:15,021 INFO L290 TraceCheckUtils]: 12: Hoare triple {4343#(<= main_~d~0 1)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4344#(<= main_~d~0 2)} is VALID [2022-04-15 13:29:15,022 INFO L290 TraceCheckUtils]: 13: Hoare triple {4344#(<= main_~d~0 2)} assume !!(~d~0 < 6); {4344#(<= main_~d~0 2)} is VALID [2022-04-15 13:29:15,022 INFO L290 TraceCheckUtils]: 14: Hoare triple {4344#(<= main_~d~0 2)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4345#(<= main_~d~0 3)} is VALID [2022-04-15 13:29:15,022 INFO L290 TraceCheckUtils]: 15: Hoare triple {4345#(<= main_~d~0 3)} assume !(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,023 INFO L290 TraceCheckUtils]: 16: Hoare triple {4338#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4338#false} is VALID [2022-04-15 13:29:15,023 INFO L290 TraceCheckUtils]: 17: Hoare triple {4338#false} assume !!(~c~0 < 6);~d~0 := 0; {4338#false} is VALID [2022-04-15 13:29:15,023 INFO L290 TraceCheckUtils]: 18: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,023 INFO L290 TraceCheckUtils]: 19: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,023 INFO L290 TraceCheckUtils]: 20: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,023 INFO L290 TraceCheckUtils]: 21: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,023 INFO L290 TraceCheckUtils]: 22: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,023 INFO L290 TraceCheckUtils]: 23: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,023 INFO L290 TraceCheckUtils]: 24: Hoare triple {4338#false} assume !(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,023 INFO L290 TraceCheckUtils]: 25: Hoare triple {4338#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4338#false} is VALID [2022-04-15 13:29:15,023 INFO L290 TraceCheckUtils]: 26: Hoare triple {4338#false} assume !(~c~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,023 INFO L290 TraceCheckUtils]: 27: Hoare triple {4338#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4338#false} is VALID [2022-04-15 13:29:15,023 INFO L290 TraceCheckUtils]: 28: Hoare triple {4338#false} assume !!(~b~0 < 6);~c~0 := 0; {4338#false} is VALID [2022-04-15 13:29:15,023 INFO L290 TraceCheckUtils]: 29: Hoare triple {4338#false} assume !!(~c~0 < 6);~d~0 := 0; {4338#false} is VALID [2022-04-15 13:29:15,023 INFO L290 TraceCheckUtils]: 30: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,023 INFO L290 TraceCheckUtils]: 31: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,023 INFO L290 TraceCheckUtils]: 32: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,024 INFO L290 TraceCheckUtils]: 33: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,024 INFO L290 TraceCheckUtils]: 34: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,024 INFO L290 TraceCheckUtils]: 35: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,024 INFO L290 TraceCheckUtils]: 36: Hoare triple {4338#false} assume !(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,024 INFO L290 TraceCheckUtils]: 37: Hoare triple {4338#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4338#false} is VALID [2022-04-15 13:29:15,024 INFO L290 TraceCheckUtils]: 38: Hoare triple {4338#false} assume !!(~c~0 < 6);~d~0 := 0; {4338#false} is VALID [2022-04-15 13:29:15,024 INFO L290 TraceCheckUtils]: 39: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,024 INFO L290 TraceCheckUtils]: 40: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,024 INFO L290 TraceCheckUtils]: 41: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,024 INFO L290 TraceCheckUtils]: 42: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,024 INFO L290 TraceCheckUtils]: 43: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,024 INFO L290 TraceCheckUtils]: 44: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,024 INFO L290 TraceCheckUtils]: 45: Hoare triple {4338#false} assume !(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,024 INFO L290 TraceCheckUtils]: 46: Hoare triple {4338#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4338#false} is VALID [2022-04-15 13:29:15,024 INFO L290 TraceCheckUtils]: 47: Hoare triple {4338#false} assume !(~c~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,024 INFO L290 TraceCheckUtils]: 48: Hoare triple {4338#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4338#false} is VALID [2022-04-15 13:29:15,024 INFO L290 TraceCheckUtils]: 49: Hoare triple {4338#false} assume !(~b~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,024 INFO L290 TraceCheckUtils]: 50: Hoare triple {4338#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4338#false} is VALID [2022-04-15 13:29:15,025 INFO L290 TraceCheckUtils]: 51: Hoare triple {4338#false} assume !!(~a~0 < 6);~b~0 := 0; {4338#false} is VALID [2022-04-15 13:29:15,025 INFO L290 TraceCheckUtils]: 52: Hoare triple {4338#false} assume !!(~b~0 < 6);~c~0 := 0; {4338#false} is VALID [2022-04-15 13:29:15,025 INFO L290 TraceCheckUtils]: 53: Hoare triple {4338#false} assume !!(~c~0 < 6);~d~0 := 0; {4338#false} is VALID [2022-04-15 13:29:15,025 INFO L290 TraceCheckUtils]: 54: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,025 INFO L290 TraceCheckUtils]: 55: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,025 INFO L290 TraceCheckUtils]: 56: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,025 INFO L290 TraceCheckUtils]: 57: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,025 INFO L290 TraceCheckUtils]: 58: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,025 INFO L290 TraceCheckUtils]: 59: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,025 INFO L290 TraceCheckUtils]: 60: Hoare triple {4338#false} assume !(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,025 INFO L290 TraceCheckUtils]: 61: Hoare triple {4338#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4338#false} is VALID [2022-04-15 13:29:15,025 INFO L290 TraceCheckUtils]: 62: Hoare triple {4338#false} assume !!(~c~0 < 6);~d~0 := 0; {4338#false} is VALID [2022-04-15 13:29:15,025 INFO L290 TraceCheckUtils]: 63: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,025 INFO L290 TraceCheckUtils]: 64: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,025 INFO L290 TraceCheckUtils]: 65: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,025 INFO L290 TraceCheckUtils]: 66: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,025 INFO L290 TraceCheckUtils]: 67: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,026 INFO L290 TraceCheckUtils]: 68: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,026 INFO L290 TraceCheckUtils]: 69: Hoare triple {4338#false} assume !(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,026 INFO L290 TraceCheckUtils]: 70: Hoare triple {4338#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4338#false} is VALID [2022-04-15 13:29:15,026 INFO L290 TraceCheckUtils]: 71: Hoare triple {4338#false} assume !(~c~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,026 INFO L290 TraceCheckUtils]: 72: Hoare triple {4338#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4338#false} is VALID [2022-04-15 13:29:15,026 INFO L290 TraceCheckUtils]: 73: Hoare triple {4338#false} assume !!(~b~0 < 6);~c~0 := 0; {4338#false} is VALID [2022-04-15 13:29:15,026 INFO L290 TraceCheckUtils]: 74: Hoare triple {4338#false} assume !!(~c~0 < 6);~d~0 := 0; {4338#false} is VALID [2022-04-15 13:29:15,026 INFO L290 TraceCheckUtils]: 75: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,026 INFO L290 TraceCheckUtils]: 76: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,026 INFO L290 TraceCheckUtils]: 77: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,026 INFO L290 TraceCheckUtils]: 78: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,026 INFO L290 TraceCheckUtils]: 79: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,026 INFO L290 TraceCheckUtils]: 80: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,026 INFO L290 TraceCheckUtils]: 81: Hoare triple {4338#false} assume !(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,026 INFO L290 TraceCheckUtils]: 82: Hoare triple {4338#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4338#false} is VALID [2022-04-15 13:29:15,026 INFO L290 TraceCheckUtils]: 83: Hoare triple {4338#false} assume !!(~c~0 < 6);~d~0 := 0; {4338#false} is VALID [2022-04-15 13:29:15,026 INFO L290 TraceCheckUtils]: 84: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,026 INFO L290 TraceCheckUtils]: 85: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,027 INFO L290 TraceCheckUtils]: 86: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,027 INFO L290 TraceCheckUtils]: 87: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,027 INFO L290 TraceCheckUtils]: 88: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,027 INFO L290 TraceCheckUtils]: 89: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,027 INFO L290 TraceCheckUtils]: 90: Hoare triple {4338#false} assume !(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,027 INFO L290 TraceCheckUtils]: 91: Hoare triple {4338#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4338#false} is VALID [2022-04-15 13:29:15,027 INFO L290 TraceCheckUtils]: 92: Hoare triple {4338#false} assume !(~c~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,027 INFO L290 TraceCheckUtils]: 93: Hoare triple {4338#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4338#false} is VALID [2022-04-15 13:29:15,027 INFO L290 TraceCheckUtils]: 94: Hoare triple {4338#false} assume !(~b~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,027 INFO L290 TraceCheckUtils]: 95: Hoare triple {4338#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4338#false} is VALID [2022-04-15 13:29:15,027 INFO L290 TraceCheckUtils]: 96: Hoare triple {4338#false} assume !(~a~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,027 INFO L290 TraceCheckUtils]: 97: Hoare triple {4338#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {4338#false} is VALID [2022-04-15 13:29:15,027 INFO L290 TraceCheckUtils]: 98: Hoare triple {4338#false} assume !false; {4338#false} is VALID [2022-04-15 13:29:15,028 INFO L134 CoverageAnalysis]: Checked inductivity of 891 backedges. 193 proven. 9 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-04-15 13:29:15,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:29:15,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508356479] [2022-04-15 13:29:15,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508356479] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:29:15,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937203359] [2022-04-15 13:29:15,028 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:29:15,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:29:15,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:29:15,029 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-15 13:29:15,030 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-15 13:29:15,075 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-15 13:29:15,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:29:15,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 13:29:15,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:29:15,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:29:15,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {4337#true} call ULTIMATE.init(); {4337#true} is VALID [2022-04-15 13:29:15,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {4337#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); {4337#true} is VALID [2022-04-15 13:29:15,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {4337#true} assume true; {4337#true} is VALID [2022-04-15 13:29:15,250 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4337#true} {4337#true} #68#return; {4337#true} is VALID [2022-04-15 13:29:15,250 INFO L272 TraceCheckUtils]: 4: Hoare triple {4337#true} call #t~ret8 := main(); {4337#true} is VALID [2022-04-15 13:29:15,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {4337#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {4337#true} is VALID [2022-04-15 13:29:15,250 INFO L290 TraceCheckUtils]: 6: Hoare triple {4337#true} assume !!(~a~0 < 6);~b~0 := 0; {4337#true} is VALID [2022-04-15 13:29:15,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {4337#true} assume !!(~b~0 < 6);~c~0 := 0; {4337#true} is VALID [2022-04-15 13:29:15,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {4337#true} assume !!(~c~0 < 6);~d~0 := 0; {4337#true} is VALID [2022-04-15 13:29:15,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {4337#true} assume !!(~d~0 < 6); {4337#true} is VALID [2022-04-15 13:29:15,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {4337#true} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4337#true} is VALID [2022-04-15 13:29:15,251 INFO L290 TraceCheckUtils]: 11: Hoare triple {4337#true} assume !!(~d~0 < 6); {4337#true} is VALID [2022-04-15 13:29:15,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {4337#true} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4337#true} is VALID [2022-04-15 13:29:15,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {4337#true} assume !!(~d~0 < 6); {4337#true} is VALID [2022-04-15 13:29:15,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {4337#true} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4337#true} is VALID [2022-04-15 13:29:15,251 INFO L290 TraceCheckUtils]: 15: Hoare triple {4337#true} assume !(~d~0 < 6); {4337#true} is VALID [2022-04-15 13:29:15,251 INFO L290 TraceCheckUtils]: 16: Hoare triple {4337#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4337#true} is VALID [2022-04-15 13:29:15,251 INFO L290 TraceCheckUtils]: 17: Hoare triple {4337#true} assume !!(~c~0 < 6);~d~0 := 0; {4337#true} is VALID [2022-04-15 13:29:15,251 INFO L290 TraceCheckUtils]: 18: Hoare triple {4337#true} assume !!(~d~0 < 6); {4337#true} is VALID [2022-04-15 13:29:15,251 INFO L290 TraceCheckUtils]: 19: Hoare triple {4337#true} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4337#true} is VALID [2022-04-15 13:29:15,251 INFO L290 TraceCheckUtils]: 20: Hoare triple {4337#true} assume !!(~d~0 < 6); {4337#true} is VALID [2022-04-15 13:29:15,251 INFO L290 TraceCheckUtils]: 21: Hoare triple {4337#true} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4337#true} is VALID [2022-04-15 13:29:15,251 INFO L290 TraceCheckUtils]: 22: Hoare triple {4337#true} assume !!(~d~0 < 6); {4337#true} is VALID [2022-04-15 13:29:15,251 INFO L290 TraceCheckUtils]: 23: Hoare triple {4337#true} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4337#true} is VALID [2022-04-15 13:29:15,251 INFO L290 TraceCheckUtils]: 24: Hoare triple {4337#true} assume !(~d~0 < 6); {4337#true} is VALID [2022-04-15 13:29:15,251 INFO L290 TraceCheckUtils]: 25: Hoare triple {4337#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4337#true} is VALID [2022-04-15 13:29:15,251 INFO L290 TraceCheckUtils]: 26: Hoare triple {4337#true} assume !(~c~0 < 6); {4337#true} is VALID [2022-04-15 13:29:15,252 INFO L290 TraceCheckUtils]: 27: Hoare triple {4337#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4337#true} is VALID [2022-04-15 13:29:15,252 INFO L290 TraceCheckUtils]: 28: Hoare triple {4337#true} assume !!(~b~0 < 6);~c~0 := 0; {4337#true} is VALID [2022-04-15 13:29:15,252 INFO L290 TraceCheckUtils]: 29: Hoare triple {4337#true} assume !!(~c~0 < 6);~d~0 := 0; {4437#(<= main_~d~0 0)} is VALID [2022-04-15 13:29:15,252 INFO L290 TraceCheckUtils]: 30: Hoare triple {4437#(<= main_~d~0 0)} assume !!(~d~0 < 6); {4437#(<= main_~d~0 0)} is VALID [2022-04-15 13:29:15,253 INFO L290 TraceCheckUtils]: 31: Hoare triple {4437#(<= main_~d~0 0)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4343#(<= main_~d~0 1)} is VALID [2022-04-15 13:29:15,253 INFO L290 TraceCheckUtils]: 32: Hoare triple {4343#(<= main_~d~0 1)} assume !!(~d~0 < 6); {4343#(<= main_~d~0 1)} is VALID [2022-04-15 13:29:15,254 INFO L290 TraceCheckUtils]: 33: Hoare triple {4343#(<= main_~d~0 1)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4344#(<= main_~d~0 2)} is VALID [2022-04-15 13:29:15,254 INFO L290 TraceCheckUtils]: 34: Hoare triple {4344#(<= main_~d~0 2)} assume !!(~d~0 < 6); {4344#(<= main_~d~0 2)} is VALID [2022-04-15 13:29:15,254 INFO L290 TraceCheckUtils]: 35: Hoare triple {4344#(<= main_~d~0 2)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4345#(<= main_~d~0 3)} is VALID [2022-04-15 13:29:15,254 INFO L290 TraceCheckUtils]: 36: Hoare triple {4345#(<= main_~d~0 3)} assume !(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,255 INFO L290 TraceCheckUtils]: 37: Hoare triple {4338#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4338#false} is VALID [2022-04-15 13:29:15,255 INFO L290 TraceCheckUtils]: 38: Hoare triple {4338#false} assume !!(~c~0 < 6);~d~0 := 0; {4338#false} is VALID [2022-04-15 13:29:15,255 INFO L290 TraceCheckUtils]: 39: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,255 INFO L290 TraceCheckUtils]: 40: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,255 INFO L290 TraceCheckUtils]: 41: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,255 INFO L290 TraceCheckUtils]: 42: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,255 INFO L290 TraceCheckUtils]: 43: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,255 INFO L290 TraceCheckUtils]: 44: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,255 INFO L290 TraceCheckUtils]: 45: Hoare triple {4338#false} assume !(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,255 INFO L290 TraceCheckUtils]: 46: Hoare triple {4338#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4338#false} is VALID [2022-04-15 13:29:15,255 INFO L290 TraceCheckUtils]: 47: Hoare triple {4338#false} assume !(~c~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,255 INFO L290 TraceCheckUtils]: 48: Hoare triple {4338#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4338#false} is VALID [2022-04-15 13:29:15,255 INFO L290 TraceCheckUtils]: 49: Hoare triple {4338#false} assume !(~b~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,256 INFO L290 TraceCheckUtils]: 50: Hoare triple {4338#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4338#false} is VALID [2022-04-15 13:29:15,256 INFO L290 TraceCheckUtils]: 51: Hoare triple {4338#false} assume !!(~a~0 < 6);~b~0 := 0; {4338#false} is VALID [2022-04-15 13:29:15,256 INFO L290 TraceCheckUtils]: 52: Hoare triple {4338#false} assume !!(~b~0 < 6);~c~0 := 0; {4338#false} is VALID [2022-04-15 13:29:15,256 INFO L290 TraceCheckUtils]: 53: Hoare triple {4338#false} assume !!(~c~0 < 6);~d~0 := 0; {4338#false} is VALID [2022-04-15 13:29:15,256 INFO L290 TraceCheckUtils]: 54: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,256 INFO L290 TraceCheckUtils]: 55: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,256 INFO L290 TraceCheckUtils]: 56: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,256 INFO L290 TraceCheckUtils]: 57: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,256 INFO L290 TraceCheckUtils]: 58: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,256 INFO L290 TraceCheckUtils]: 59: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,256 INFO L290 TraceCheckUtils]: 60: Hoare triple {4338#false} assume !(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,256 INFO L290 TraceCheckUtils]: 61: Hoare triple {4338#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4338#false} is VALID [2022-04-15 13:29:15,256 INFO L290 TraceCheckUtils]: 62: Hoare triple {4338#false} assume !!(~c~0 < 6);~d~0 := 0; {4338#false} is VALID [2022-04-15 13:29:15,256 INFO L290 TraceCheckUtils]: 63: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,256 INFO L290 TraceCheckUtils]: 64: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,257 INFO L290 TraceCheckUtils]: 65: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,257 INFO L290 TraceCheckUtils]: 66: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,259 INFO L290 TraceCheckUtils]: 67: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,259 INFO L290 TraceCheckUtils]: 68: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,261 INFO L290 TraceCheckUtils]: 69: Hoare triple {4338#false} assume !(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,261 INFO L290 TraceCheckUtils]: 70: Hoare triple {4338#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4338#false} is VALID [2022-04-15 13:29:15,261 INFO L290 TraceCheckUtils]: 71: Hoare triple {4338#false} assume !(~c~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,261 INFO L290 TraceCheckUtils]: 72: Hoare triple {4338#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4338#false} is VALID [2022-04-15 13:29:15,261 INFO L290 TraceCheckUtils]: 73: Hoare triple {4338#false} assume !!(~b~0 < 6);~c~0 := 0; {4338#false} is VALID [2022-04-15 13:29:15,261 INFO L290 TraceCheckUtils]: 74: Hoare triple {4338#false} assume !!(~c~0 < 6);~d~0 := 0; {4338#false} is VALID [2022-04-15 13:29:15,262 INFO L290 TraceCheckUtils]: 75: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,262 INFO L290 TraceCheckUtils]: 76: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,262 INFO L290 TraceCheckUtils]: 77: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,262 INFO L290 TraceCheckUtils]: 78: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,262 INFO L290 TraceCheckUtils]: 79: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,262 INFO L290 TraceCheckUtils]: 80: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,262 INFO L290 TraceCheckUtils]: 81: Hoare triple {4338#false} assume !(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,262 INFO L290 TraceCheckUtils]: 82: Hoare triple {4338#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4338#false} is VALID [2022-04-15 13:29:15,262 INFO L290 TraceCheckUtils]: 83: Hoare triple {4338#false} assume !!(~c~0 < 6);~d~0 := 0; {4338#false} is VALID [2022-04-15 13:29:15,262 INFO L290 TraceCheckUtils]: 84: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,262 INFO L290 TraceCheckUtils]: 85: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,262 INFO L290 TraceCheckUtils]: 86: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,262 INFO L290 TraceCheckUtils]: 87: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,262 INFO L290 TraceCheckUtils]: 88: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,262 INFO L290 TraceCheckUtils]: 89: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,262 INFO L290 TraceCheckUtils]: 90: Hoare triple {4338#false} assume !(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,262 INFO L290 TraceCheckUtils]: 91: Hoare triple {4338#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4338#false} is VALID [2022-04-15 13:29:15,263 INFO L290 TraceCheckUtils]: 92: Hoare triple {4338#false} assume !(~c~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,263 INFO L290 TraceCheckUtils]: 93: Hoare triple {4338#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4338#false} is VALID [2022-04-15 13:29:15,263 INFO L290 TraceCheckUtils]: 94: Hoare triple {4338#false} assume !(~b~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,263 INFO L290 TraceCheckUtils]: 95: Hoare triple {4338#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4338#false} is VALID [2022-04-15 13:29:15,263 INFO L290 TraceCheckUtils]: 96: Hoare triple {4338#false} assume !(~a~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,263 INFO L290 TraceCheckUtils]: 97: Hoare triple {4338#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {4338#false} is VALID [2022-04-15 13:29:15,263 INFO L290 TraceCheckUtils]: 98: Hoare triple {4338#false} assume !false; {4338#false} is VALID [2022-04-15 13:29:15,263 INFO L134 CoverageAnalysis]: Checked inductivity of 891 backedges. 482 proven. 9 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2022-04-15 13:29:15,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:29:15,461 INFO L290 TraceCheckUtils]: 98: Hoare triple {4338#false} assume !false; {4338#false} is VALID [2022-04-15 13:29:15,461 INFO L290 TraceCheckUtils]: 97: Hoare triple {4338#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {4338#false} is VALID [2022-04-15 13:29:15,462 INFO L290 TraceCheckUtils]: 96: Hoare triple {4338#false} assume !(~a~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,462 INFO L290 TraceCheckUtils]: 95: Hoare triple {4338#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4338#false} is VALID [2022-04-15 13:29:15,462 INFO L290 TraceCheckUtils]: 94: Hoare triple {4338#false} assume !(~b~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,462 INFO L290 TraceCheckUtils]: 93: Hoare triple {4338#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4338#false} is VALID [2022-04-15 13:29:15,462 INFO L290 TraceCheckUtils]: 92: Hoare triple {4338#false} assume !(~c~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,462 INFO L290 TraceCheckUtils]: 91: Hoare triple {4338#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4338#false} is VALID [2022-04-15 13:29:15,462 INFO L290 TraceCheckUtils]: 90: Hoare triple {4338#false} assume !(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,462 INFO L290 TraceCheckUtils]: 89: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,462 INFO L290 TraceCheckUtils]: 88: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,462 INFO L290 TraceCheckUtils]: 87: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,462 INFO L290 TraceCheckUtils]: 86: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,462 INFO L290 TraceCheckUtils]: 85: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,462 INFO L290 TraceCheckUtils]: 84: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,462 INFO L290 TraceCheckUtils]: 83: Hoare triple {4338#false} assume !!(~c~0 < 6);~d~0 := 0; {4338#false} is VALID [2022-04-15 13:29:15,462 INFO L290 TraceCheckUtils]: 82: Hoare triple {4338#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4338#false} is VALID [2022-04-15 13:29:15,462 INFO L290 TraceCheckUtils]: 81: Hoare triple {4338#false} assume !(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,462 INFO L290 TraceCheckUtils]: 80: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,462 INFO L290 TraceCheckUtils]: 79: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,463 INFO L290 TraceCheckUtils]: 78: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,463 INFO L290 TraceCheckUtils]: 77: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,463 INFO L290 TraceCheckUtils]: 76: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,463 INFO L290 TraceCheckUtils]: 75: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,463 INFO L290 TraceCheckUtils]: 74: Hoare triple {4338#false} assume !!(~c~0 < 6);~d~0 := 0; {4338#false} is VALID [2022-04-15 13:29:15,463 INFO L290 TraceCheckUtils]: 73: Hoare triple {4338#false} assume !!(~b~0 < 6);~c~0 := 0; {4338#false} is VALID [2022-04-15 13:29:15,463 INFO L290 TraceCheckUtils]: 72: Hoare triple {4338#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4338#false} is VALID [2022-04-15 13:29:15,463 INFO L290 TraceCheckUtils]: 71: Hoare triple {4338#false} assume !(~c~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,463 INFO L290 TraceCheckUtils]: 70: Hoare triple {4338#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4338#false} is VALID [2022-04-15 13:29:15,463 INFO L290 TraceCheckUtils]: 69: Hoare triple {4338#false} assume !(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,463 INFO L290 TraceCheckUtils]: 68: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,463 INFO L290 TraceCheckUtils]: 67: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,463 INFO L290 TraceCheckUtils]: 66: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,463 INFO L290 TraceCheckUtils]: 65: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,463 INFO L290 TraceCheckUtils]: 64: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,463 INFO L290 TraceCheckUtils]: 63: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,463 INFO L290 TraceCheckUtils]: 62: Hoare triple {4338#false} assume !!(~c~0 < 6);~d~0 := 0; {4338#false} is VALID [2022-04-15 13:29:15,463 INFO L290 TraceCheckUtils]: 61: Hoare triple {4338#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4338#false} is VALID [2022-04-15 13:29:15,464 INFO L290 TraceCheckUtils]: 60: Hoare triple {4338#false} assume !(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,464 INFO L290 TraceCheckUtils]: 59: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,464 INFO L290 TraceCheckUtils]: 58: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,464 INFO L290 TraceCheckUtils]: 57: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,464 INFO L290 TraceCheckUtils]: 56: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,464 INFO L290 TraceCheckUtils]: 55: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,464 INFO L290 TraceCheckUtils]: 54: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,464 INFO L290 TraceCheckUtils]: 53: Hoare triple {4338#false} assume !!(~c~0 < 6);~d~0 := 0; {4338#false} is VALID [2022-04-15 13:29:15,464 INFO L290 TraceCheckUtils]: 52: Hoare triple {4338#false} assume !!(~b~0 < 6);~c~0 := 0; {4338#false} is VALID [2022-04-15 13:29:15,464 INFO L290 TraceCheckUtils]: 51: Hoare triple {4338#false} assume !!(~a~0 < 6);~b~0 := 0; {4338#false} is VALID [2022-04-15 13:29:15,464 INFO L290 TraceCheckUtils]: 50: Hoare triple {4338#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {4338#false} is VALID [2022-04-15 13:29:15,464 INFO L290 TraceCheckUtils]: 49: Hoare triple {4338#false} assume !(~b~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,464 INFO L290 TraceCheckUtils]: 48: Hoare triple {4338#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4338#false} is VALID [2022-04-15 13:29:15,464 INFO L290 TraceCheckUtils]: 47: Hoare triple {4338#false} assume !(~c~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,464 INFO L290 TraceCheckUtils]: 46: Hoare triple {4338#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4338#false} is VALID [2022-04-15 13:29:15,464 INFO L290 TraceCheckUtils]: 45: Hoare triple {4338#false} assume !(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,464 INFO L290 TraceCheckUtils]: 44: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,465 INFO L290 TraceCheckUtils]: 43: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,465 INFO L290 TraceCheckUtils]: 42: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,465 INFO L290 TraceCheckUtils]: 41: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,465 INFO L290 TraceCheckUtils]: 40: Hoare triple {4338#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4338#false} is VALID [2022-04-15 13:29:15,465 INFO L290 TraceCheckUtils]: 39: Hoare triple {4338#false} assume !!(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,465 INFO L290 TraceCheckUtils]: 38: Hoare triple {4338#false} assume !!(~c~0 < 6);~d~0 := 0; {4338#false} is VALID [2022-04-15 13:29:15,465 INFO L290 TraceCheckUtils]: 37: Hoare triple {4338#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4338#false} is VALID [2022-04-15 13:29:15,472 INFO L290 TraceCheckUtils]: 36: Hoare triple {4831#(< main_~d~0 6)} assume !(~d~0 < 6); {4338#false} is VALID [2022-04-15 13:29:15,472 INFO L290 TraceCheckUtils]: 35: Hoare triple {4835#(< main_~d~0 5)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4831#(< main_~d~0 6)} is VALID [2022-04-15 13:29:15,473 INFO L290 TraceCheckUtils]: 34: Hoare triple {4835#(< main_~d~0 5)} assume !!(~d~0 < 6); {4835#(< main_~d~0 5)} is VALID [2022-04-15 13:29:15,473 INFO L290 TraceCheckUtils]: 33: Hoare triple {4345#(<= main_~d~0 3)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4835#(< main_~d~0 5)} is VALID [2022-04-15 13:29:15,473 INFO L290 TraceCheckUtils]: 32: Hoare triple {4345#(<= main_~d~0 3)} assume !!(~d~0 < 6); {4345#(<= main_~d~0 3)} is VALID [2022-04-15 13:29:15,474 INFO L290 TraceCheckUtils]: 31: Hoare triple {4344#(<= main_~d~0 2)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4345#(<= main_~d~0 3)} is VALID [2022-04-15 13:29:15,474 INFO L290 TraceCheckUtils]: 30: Hoare triple {4344#(<= main_~d~0 2)} assume !!(~d~0 < 6); {4344#(<= main_~d~0 2)} is VALID [2022-04-15 13:29:15,474 INFO L290 TraceCheckUtils]: 29: Hoare triple {4337#true} assume !!(~c~0 < 6);~d~0 := 0; {4344#(<= main_~d~0 2)} is VALID [2022-04-15 13:29:15,474 INFO L290 TraceCheckUtils]: 28: Hoare triple {4337#true} assume !!(~b~0 < 6);~c~0 := 0; {4337#true} is VALID [2022-04-15 13:29:15,474 INFO L290 TraceCheckUtils]: 27: Hoare triple {4337#true} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {4337#true} is VALID [2022-04-15 13:29:15,474 INFO L290 TraceCheckUtils]: 26: Hoare triple {4337#true} assume !(~c~0 < 6); {4337#true} is VALID [2022-04-15 13:29:15,474 INFO L290 TraceCheckUtils]: 25: Hoare triple {4337#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4337#true} is VALID [2022-04-15 13:29:15,474 INFO L290 TraceCheckUtils]: 24: Hoare triple {4337#true} assume !(~d~0 < 6); {4337#true} is VALID [2022-04-15 13:29:15,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {4337#true} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4337#true} is VALID [2022-04-15 13:29:15,475 INFO L290 TraceCheckUtils]: 22: Hoare triple {4337#true} assume !!(~d~0 < 6); {4337#true} is VALID [2022-04-15 13:29:15,475 INFO L290 TraceCheckUtils]: 21: Hoare triple {4337#true} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4337#true} is VALID [2022-04-15 13:29:15,475 INFO L290 TraceCheckUtils]: 20: Hoare triple {4337#true} assume !!(~d~0 < 6); {4337#true} is VALID [2022-04-15 13:29:15,475 INFO L290 TraceCheckUtils]: 19: Hoare triple {4337#true} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4337#true} is VALID [2022-04-15 13:29:15,475 INFO L290 TraceCheckUtils]: 18: Hoare triple {4337#true} assume !!(~d~0 < 6); {4337#true} is VALID [2022-04-15 13:29:15,475 INFO L290 TraceCheckUtils]: 17: Hoare triple {4337#true} assume !!(~c~0 < 6);~d~0 := 0; {4337#true} is VALID [2022-04-15 13:29:15,475 INFO L290 TraceCheckUtils]: 16: Hoare triple {4337#true} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {4337#true} is VALID [2022-04-15 13:29:15,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {4337#true} assume !(~d~0 < 6); {4337#true} is VALID [2022-04-15 13:29:15,475 INFO L290 TraceCheckUtils]: 14: Hoare triple {4337#true} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4337#true} is VALID [2022-04-15 13:29:15,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {4337#true} assume !!(~d~0 < 6); {4337#true} is VALID [2022-04-15 13:29:15,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {4337#true} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4337#true} is VALID [2022-04-15 13:29:15,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {4337#true} assume !!(~d~0 < 6); {4337#true} is VALID [2022-04-15 13:29:15,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {4337#true} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {4337#true} is VALID [2022-04-15 13:29:15,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {4337#true} assume !!(~d~0 < 6); {4337#true} is VALID [2022-04-15 13:29:15,475 INFO L290 TraceCheckUtils]: 8: Hoare triple {4337#true} assume !!(~c~0 < 6);~d~0 := 0; {4337#true} is VALID [2022-04-15 13:29:15,475 INFO L290 TraceCheckUtils]: 7: Hoare triple {4337#true} assume !!(~b~0 < 6);~c~0 := 0; {4337#true} is VALID [2022-04-15 13:29:15,475 INFO L290 TraceCheckUtils]: 6: Hoare triple {4337#true} assume !!(~a~0 < 6);~b~0 := 0; {4337#true} is VALID [2022-04-15 13:29:15,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {4337#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {4337#true} is VALID [2022-04-15 13:29:15,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {4337#true} call #t~ret8 := main(); {4337#true} is VALID [2022-04-15 13:29:15,477 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4337#true} {4337#true} #68#return; {4337#true} is VALID [2022-04-15 13:29:15,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {4337#true} assume true; {4337#true} is VALID [2022-04-15 13:29:15,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {4337#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); {4337#true} is VALID [2022-04-15 13:29:15,478 INFO L272 TraceCheckUtils]: 0: Hoare triple {4337#true} call ULTIMATE.init(); {4337#true} is VALID [2022-04-15 13:29:15,478 INFO L134 CoverageAnalysis]: Checked inductivity of 891 backedges. 482 proven. 9 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2022-04-15 13:29:15,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937203359] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:29:15,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:29:15,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-04-15 13:29:15,478 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:29:15,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [239348060] [2022-04-15 13:29:15,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [239348060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:29:15,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:29:15,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 13:29:15,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351638868] [2022-04-15 13:29:15,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:29:15,479 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 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 99 [2022-04-15 13:29:15,479 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:29:15,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 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-15 13:29:15,511 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-15 13:29:15,511 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 13:29:15,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:29:15,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 13:29:15,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:29:15,511 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 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-15 13:29:15,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:29:15,754 INFO L93 Difference]: Finished difference Result 208 states and 243 transitions. [2022-04-15 13:29:15,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 13:29:15,754 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 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 99 [2022-04-15 13:29:15,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:29:15,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 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-15 13:29:15,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-04-15 13:29:15,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 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-15 13:29:15,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-04-15 13:29:15,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 43 transitions. [2022-04-15 13:29:15,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:29:15,788 INFO L225 Difference]: With dead ends: 208 [2022-04-15 13:29:15,788 INFO L226 Difference]: Without dead ends: 124 [2022-04-15 13:29:15,788 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=107, Unknown=0, NotChecked=0, Total=182 [2022-04-15 13:29:15,788 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:29:15,789 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 35 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:29:15,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-15 13:29:15,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 116. [2022-04-15 13:29:15,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:29:15,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 116 states, 112 states have (on average 1.1339285714285714) internal successors, (127), 112 states have internal predecessors, (127), 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-15 13:29:15,900 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 116 states, 112 states have (on average 1.1339285714285714) internal successors, (127), 112 states have internal predecessors, (127), 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-15 13:29:15,900 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 116 states, 112 states have (on average 1.1339285714285714) internal successors, (127), 112 states have internal predecessors, (127), 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-15 13:29:15,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:29:15,905 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2022-04-15 13:29:15,905 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 138 transitions. [2022-04-15 13:29:15,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:29:15,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:29:15,905 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 112 states have (on average 1.1339285714285714) internal successors, (127), 112 states have internal predecessors, (127), 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 124 states. [2022-04-15 13:29:15,906 INFO L87 Difference]: Start difference. First operand has 116 states, 112 states have (on average 1.1339285714285714) internal successors, (127), 112 states have internal predecessors, (127), 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 124 states. [2022-04-15 13:29:15,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:29:15,907 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2022-04-15 13:29:15,907 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 138 transitions. [2022-04-15 13:29:15,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:29:15,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:29:15,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:29:15,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:29:15,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 112 states have (on average 1.1339285714285714) internal successors, (127), 112 states have internal predecessors, (127), 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-15 13:29:15,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 130 transitions. [2022-04-15 13:29:15,909 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 130 transitions. Word has length 99 [2022-04-15 13:29:15,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:29:15,909 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 130 transitions. [2022-04-15 13:29:15,909 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 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-15 13:29:15,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 116 states and 130 transitions. [2022-04-15 13:29:16,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:29:16,039 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 130 transitions. [2022-04-15 13:29:16,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-15 13:29:16,039 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:29:16,039 INFO L499 BasicCegarLoop]: trace histogram [32, 32, 8, 8, 8, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:29:16,055 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-15 13:29:16,243 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-15 13:29:16,243 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:29:16,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:29:16,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1755066101, now seen corresponding path program 13 times [2022-04-15 13:29:16,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:29:16,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [391315247] [2022-04-15 13:29:18,245 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:29:18,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1740359107, now seen corresponding path program 1 times [2022-04-15 13:29:18,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:29:18,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367231220] [2022-04-15 13:29:18,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:29:18,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:29:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:29:18,250 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:29:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:29:18,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:29:18,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1755066101, now seen corresponding path program 14 times [2022-04-15 13:29:18,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:29:18,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112577096] [2022-04-15 13:29:18,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:29:18,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:29:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:29:18,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:29:18,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:29:18,339 INFO L290 TraceCheckUtils]: 0: Hoare triple {5857#(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); {5847#true} is VALID [2022-04-15 13:29:18,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {5847#true} assume true; {5847#true} is VALID [2022-04-15 13:29:18,340 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5847#true} {5847#true} #68#return; {5847#true} is VALID [2022-04-15 13:29:18,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {5847#true} call ULTIMATE.init(); {5857#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:29:18,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {5857#(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); {5847#true} is VALID [2022-04-15 13:29:18,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {5847#true} assume true; {5847#true} is VALID [2022-04-15 13:29:18,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5847#true} {5847#true} #68#return; {5847#true} is VALID [2022-04-15 13:29:18,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {5847#true} call #t~ret8 := main(); {5847#true} is VALID [2022-04-15 13:29:18,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {5847#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {5847#true} is VALID [2022-04-15 13:29:18,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {5847#true} assume !!(~a~0 < 6);~b~0 := 0; {5847#true} is VALID [2022-04-15 13:29:18,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {5847#true} assume !!(~b~0 < 6);~c~0 := 0; {5847#true} is VALID [2022-04-15 13:29:18,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {5847#true} assume !!(~c~0 < 6);~d~0 := 0; {5852#(= main_~d~0 0)} is VALID [2022-04-15 13:29:18,341 INFO L290 TraceCheckUtils]: 9: Hoare triple {5852#(= main_~d~0 0)} assume !!(~d~0 < 6); {5852#(= main_~d~0 0)} is VALID [2022-04-15 13:29:18,341 INFO L290 TraceCheckUtils]: 10: Hoare triple {5852#(= main_~d~0 0)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5853#(<= main_~d~0 1)} is VALID [2022-04-15 13:29:18,341 INFO L290 TraceCheckUtils]: 11: Hoare triple {5853#(<= main_~d~0 1)} assume !!(~d~0 < 6); {5853#(<= main_~d~0 1)} is VALID [2022-04-15 13:29:18,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {5853#(<= main_~d~0 1)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5854#(<= main_~d~0 2)} is VALID [2022-04-15 13:29:18,342 INFO L290 TraceCheckUtils]: 13: Hoare triple {5854#(<= main_~d~0 2)} assume !!(~d~0 < 6); {5854#(<= main_~d~0 2)} is VALID [2022-04-15 13:29:18,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {5854#(<= main_~d~0 2)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5855#(<= main_~d~0 3)} is VALID [2022-04-15 13:29:18,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {5855#(<= main_~d~0 3)} assume !!(~d~0 < 6); {5855#(<= main_~d~0 3)} is VALID [2022-04-15 13:29:18,343 INFO L290 TraceCheckUtils]: 16: Hoare triple {5855#(<= main_~d~0 3)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5856#(<= main_~d~0 4)} is VALID [2022-04-15 13:29:18,343 INFO L290 TraceCheckUtils]: 17: Hoare triple {5856#(<= main_~d~0 4)} assume !(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,343 INFO L290 TraceCheckUtils]: 18: Hoare triple {5848#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5848#false} is VALID [2022-04-15 13:29:18,344 INFO L290 TraceCheckUtils]: 19: Hoare triple {5848#false} assume !!(~c~0 < 6);~d~0 := 0; {5848#false} is VALID [2022-04-15 13:29:18,344 INFO L290 TraceCheckUtils]: 20: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,344 INFO L290 TraceCheckUtils]: 21: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,344 INFO L290 TraceCheckUtils]: 22: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,344 INFO L290 TraceCheckUtils]: 23: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,344 INFO L290 TraceCheckUtils]: 24: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,344 INFO L290 TraceCheckUtils]: 25: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,344 INFO L290 TraceCheckUtils]: 26: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,344 INFO L290 TraceCheckUtils]: 27: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,344 INFO L290 TraceCheckUtils]: 28: Hoare triple {5848#false} assume !(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,344 INFO L290 TraceCheckUtils]: 29: Hoare triple {5848#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5848#false} is VALID [2022-04-15 13:29:18,344 INFO L290 TraceCheckUtils]: 30: Hoare triple {5848#false} assume !(~c~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,344 INFO L290 TraceCheckUtils]: 31: Hoare triple {5848#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {5848#false} is VALID [2022-04-15 13:29:18,344 INFO L290 TraceCheckUtils]: 32: Hoare triple {5848#false} assume !!(~b~0 < 6);~c~0 := 0; {5848#false} is VALID [2022-04-15 13:29:18,344 INFO L290 TraceCheckUtils]: 33: Hoare triple {5848#false} assume !!(~c~0 < 6);~d~0 := 0; {5848#false} is VALID [2022-04-15 13:29:18,344 INFO L290 TraceCheckUtils]: 34: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,344 INFO L290 TraceCheckUtils]: 35: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,344 INFO L290 TraceCheckUtils]: 36: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,345 INFO L290 TraceCheckUtils]: 37: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,345 INFO L290 TraceCheckUtils]: 38: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,345 INFO L290 TraceCheckUtils]: 39: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,345 INFO L290 TraceCheckUtils]: 40: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,345 INFO L290 TraceCheckUtils]: 41: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,345 INFO L290 TraceCheckUtils]: 42: Hoare triple {5848#false} assume !(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,345 INFO L290 TraceCheckUtils]: 43: Hoare triple {5848#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5848#false} is VALID [2022-04-15 13:29:18,345 INFO L290 TraceCheckUtils]: 44: Hoare triple {5848#false} assume !!(~c~0 < 6);~d~0 := 0; {5848#false} is VALID [2022-04-15 13:29:18,345 INFO L290 TraceCheckUtils]: 45: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,345 INFO L290 TraceCheckUtils]: 46: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,345 INFO L290 TraceCheckUtils]: 47: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,345 INFO L290 TraceCheckUtils]: 48: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,345 INFO L290 TraceCheckUtils]: 49: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,345 INFO L290 TraceCheckUtils]: 50: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,345 INFO L290 TraceCheckUtils]: 51: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,345 INFO L290 TraceCheckUtils]: 52: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,345 INFO L290 TraceCheckUtils]: 53: Hoare triple {5848#false} assume !(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,345 INFO L290 TraceCheckUtils]: 54: Hoare triple {5848#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5848#false} is VALID [2022-04-15 13:29:18,346 INFO L290 TraceCheckUtils]: 55: Hoare triple {5848#false} assume !(~c~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,346 INFO L290 TraceCheckUtils]: 56: Hoare triple {5848#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {5848#false} is VALID [2022-04-15 13:29:18,346 INFO L290 TraceCheckUtils]: 57: Hoare triple {5848#false} assume !(~b~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,346 INFO L290 TraceCheckUtils]: 58: Hoare triple {5848#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {5848#false} is VALID [2022-04-15 13:29:18,346 INFO L290 TraceCheckUtils]: 59: Hoare triple {5848#false} assume !!(~a~0 < 6);~b~0 := 0; {5848#false} is VALID [2022-04-15 13:29:18,346 INFO L290 TraceCheckUtils]: 60: Hoare triple {5848#false} assume !!(~b~0 < 6);~c~0 := 0; {5848#false} is VALID [2022-04-15 13:29:18,346 INFO L290 TraceCheckUtils]: 61: Hoare triple {5848#false} assume !!(~c~0 < 6);~d~0 := 0; {5848#false} is VALID [2022-04-15 13:29:18,346 INFO L290 TraceCheckUtils]: 62: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,346 INFO L290 TraceCheckUtils]: 63: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,346 INFO L290 TraceCheckUtils]: 64: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,346 INFO L290 TraceCheckUtils]: 65: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,346 INFO L290 TraceCheckUtils]: 66: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,346 INFO L290 TraceCheckUtils]: 67: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,346 INFO L290 TraceCheckUtils]: 68: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,346 INFO L290 TraceCheckUtils]: 69: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,346 INFO L290 TraceCheckUtils]: 70: Hoare triple {5848#false} assume !(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,346 INFO L290 TraceCheckUtils]: 71: Hoare triple {5848#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5848#false} is VALID [2022-04-15 13:29:18,346 INFO L290 TraceCheckUtils]: 72: Hoare triple {5848#false} assume !!(~c~0 < 6);~d~0 := 0; {5848#false} is VALID [2022-04-15 13:29:18,347 INFO L290 TraceCheckUtils]: 73: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,347 INFO L290 TraceCheckUtils]: 74: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,347 INFO L290 TraceCheckUtils]: 75: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,347 INFO L290 TraceCheckUtils]: 76: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,347 INFO L290 TraceCheckUtils]: 77: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,347 INFO L290 TraceCheckUtils]: 78: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,347 INFO L290 TraceCheckUtils]: 79: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,347 INFO L290 TraceCheckUtils]: 80: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,347 INFO L290 TraceCheckUtils]: 81: Hoare triple {5848#false} assume !(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,347 INFO L290 TraceCheckUtils]: 82: Hoare triple {5848#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5848#false} is VALID [2022-04-15 13:29:18,347 INFO L290 TraceCheckUtils]: 83: Hoare triple {5848#false} assume !(~c~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,347 INFO L290 TraceCheckUtils]: 84: Hoare triple {5848#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {5848#false} is VALID [2022-04-15 13:29:18,347 INFO L290 TraceCheckUtils]: 85: Hoare triple {5848#false} assume !!(~b~0 < 6);~c~0 := 0; {5848#false} is VALID [2022-04-15 13:29:18,347 INFO L290 TraceCheckUtils]: 86: Hoare triple {5848#false} assume !!(~c~0 < 6);~d~0 := 0; {5848#false} is VALID [2022-04-15 13:29:18,347 INFO L290 TraceCheckUtils]: 87: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,347 INFO L290 TraceCheckUtils]: 88: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,347 INFO L290 TraceCheckUtils]: 89: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,347 INFO L290 TraceCheckUtils]: 90: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,347 INFO L290 TraceCheckUtils]: 91: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,348 INFO L290 TraceCheckUtils]: 92: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,348 INFO L290 TraceCheckUtils]: 93: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,348 INFO L290 TraceCheckUtils]: 94: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,348 INFO L290 TraceCheckUtils]: 95: Hoare triple {5848#false} assume !(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,348 INFO L290 TraceCheckUtils]: 96: Hoare triple {5848#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5848#false} is VALID [2022-04-15 13:29:18,348 INFO L290 TraceCheckUtils]: 97: Hoare triple {5848#false} assume !!(~c~0 < 6);~d~0 := 0; {5848#false} is VALID [2022-04-15 13:29:18,348 INFO L290 TraceCheckUtils]: 98: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,348 INFO L290 TraceCheckUtils]: 99: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,348 INFO L290 TraceCheckUtils]: 100: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,348 INFO L290 TraceCheckUtils]: 101: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,348 INFO L290 TraceCheckUtils]: 102: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,349 INFO L290 TraceCheckUtils]: 103: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,349 INFO L290 TraceCheckUtils]: 104: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,349 INFO L290 TraceCheckUtils]: 105: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,349 INFO L290 TraceCheckUtils]: 106: Hoare triple {5848#false} assume !(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,349 INFO L290 TraceCheckUtils]: 107: Hoare triple {5848#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5848#false} is VALID [2022-04-15 13:29:18,349 INFO L290 TraceCheckUtils]: 108: Hoare triple {5848#false} assume !(~c~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,349 INFO L290 TraceCheckUtils]: 109: Hoare triple {5848#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {5848#false} is VALID [2022-04-15 13:29:18,349 INFO L290 TraceCheckUtils]: 110: Hoare triple {5848#false} assume !(~b~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,349 INFO L290 TraceCheckUtils]: 111: Hoare triple {5848#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {5848#false} is VALID [2022-04-15 13:29:18,349 INFO L290 TraceCheckUtils]: 112: Hoare triple {5848#false} assume !(~a~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,349 INFO L290 TraceCheckUtils]: 113: Hoare triple {5848#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {5848#false} is VALID [2022-04-15 13:29:18,349 INFO L290 TraceCheckUtils]: 114: Hoare triple {5848#false} assume !false; {5848#false} is VALID [2022-04-15 13:29:18,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 305 proven. 16 refuted. 0 times theorem prover too weak. 1074 trivial. 0 not checked. [2022-04-15 13:29:18,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:29:18,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112577096] [2022-04-15 13:29:18,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112577096] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:29:18,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77279994] [2022-04-15 13:29:18,350 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:29:18,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:29:18,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:29:18,351 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-15 13:29:18,351 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-15 13:29:18,405 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:29:18,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:29:18,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 13:29:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:29:18,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:29:18,621 INFO L272 TraceCheckUtils]: 0: Hoare triple {5847#true} call ULTIMATE.init(); {5847#true} is VALID [2022-04-15 13:29:18,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {5847#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); {5847#true} is VALID [2022-04-15 13:29:18,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {5847#true} assume true; {5847#true} is VALID [2022-04-15 13:29:18,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5847#true} {5847#true} #68#return; {5847#true} is VALID [2022-04-15 13:29:18,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {5847#true} call #t~ret8 := main(); {5847#true} is VALID [2022-04-15 13:29:18,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {5847#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {5847#true} is VALID [2022-04-15 13:29:18,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {5847#true} assume !!(~a~0 < 6);~b~0 := 0; {5847#true} is VALID [2022-04-15 13:29:18,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {5847#true} assume !!(~b~0 < 6);~c~0 := 0; {5847#true} is VALID [2022-04-15 13:29:18,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {5847#true} assume !!(~c~0 < 6);~d~0 := 0; {5885#(<= main_~d~0 0)} is VALID [2022-04-15 13:29:18,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {5885#(<= main_~d~0 0)} assume !!(~d~0 < 6); {5885#(<= main_~d~0 0)} is VALID [2022-04-15 13:29:18,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {5885#(<= main_~d~0 0)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5853#(<= main_~d~0 1)} is VALID [2022-04-15 13:29:18,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {5853#(<= main_~d~0 1)} assume !!(~d~0 < 6); {5853#(<= main_~d~0 1)} is VALID [2022-04-15 13:29:18,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {5853#(<= main_~d~0 1)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5854#(<= main_~d~0 2)} is VALID [2022-04-15 13:29:18,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {5854#(<= main_~d~0 2)} assume !!(~d~0 < 6); {5854#(<= main_~d~0 2)} is VALID [2022-04-15 13:29:18,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {5854#(<= main_~d~0 2)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5855#(<= main_~d~0 3)} is VALID [2022-04-15 13:29:18,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {5855#(<= main_~d~0 3)} assume !!(~d~0 < 6); {5855#(<= main_~d~0 3)} is VALID [2022-04-15 13:29:18,624 INFO L290 TraceCheckUtils]: 16: Hoare triple {5855#(<= main_~d~0 3)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5856#(<= main_~d~0 4)} is VALID [2022-04-15 13:29:18,624 INFO L290 TraceCheckUtils]: 17: Hoare triple {5856#(<= main_~d~0 4)} assume !(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,625 INFO L290 TraceCheckUtils]: 18: Hoare triple {5848#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5848#false} is VALID [2022-04-15 13:29:18,625 INFO L290 TraceCheckUtils]: 19: Hoare triple {5848#false} assume !!(~c~0 < 6);~d~0 := 0; {5848#false} is VALID [2022-04-15 13:29:18,625 INFO L290 TraceCheckUtils]: 20: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,625 INFO L290 TraceCheckUtils]: 21: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,625 INFO L290 TraceCheckUtils]: 22: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,625 INFO L290 TraceCheckUtils]: 23: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,625 INFO L290 TraceCheckUtils]: 24: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,625 INFO L290 TraceCheckUtils]: 25: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,635 INFO L290 TraceCheckUtils]: 26: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,635 INFO L290 TraceCheckUtils]: 27: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,635 INFO L290 TraceCheckUtils]: 28: Hoare triple {5848#false} assume !(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,635 INFO L290 TraceCheckUtils]: 29: Hoare triple {5848#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5848#false} is VALID [2022-04-15 13:29:18,635 INFO L290 TraceCheckUtils]: 30: Hoare triple {5848#false} assume !(~c~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,635 INFO L290 TraceCheckUtils]: 31: Hoare triple {5848#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {5848#false} is VALID [2022-04-15 13:29:18,635 INFO L290 TraceCheckUtils]: 32: Hoare triple {5848#false} assume !!(~b~0 < 6);~c~0 := 0; {5848#false} is VALID [2022-04-15 13:29:18,635 INFO L290 TraceCheckUtils]: 33: Hoare triple {5848#false} assume !!(~c~0 < 6);~d~0 := 0; {5848#false} is VALID [2022-04-15 13:29:18,635 INFO L290 TraceCheckUtils]: 34: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,635 INFO L290 TraceCheckUtils]: 35: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,636 INFO L290 TraceCheckUtils]: 36: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,636 INFO L290 TraceCheckUtils]: 37: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,636 INFO L290 TraceCheckUtils]: 38: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,636 INFO L290 TraceCheckUtils]: 39: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,636 INFO L290 TraceCheckUtils]: 40: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,636 INFO L290 TraceCheckUtils]: 41: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,636 INFO L290 TraceCheckUtils]: 42: Hoare triple {5848#false} assume !(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,636 INFO L290 TraceCheckUtils]: 43: Hoare triple {5848#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5848#false} is VALID [2022-04-15 13:29:18,636 INFO L290 TraceCheckUtils]: 44: Hoare triple {5848#false} assume !!(~c~0 < 6);~d~0 := 0; {5848#false} is VALID [2022-04-15 13:29:18,636 INFO L290 TraceCheckUtils]: 45: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,636 INFO L290 TraceCheckUtils]: 46: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,636 INFO L290 TraceCheckUtils]: 47: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,636 INFO L290 TraceCheckUtils]: 48: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,636 INFO L290 TraceCheckUtils]: 49: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,636 INFO L290 TraceCheckUtils]: 50: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,636 INFO L290 TraceCheckUtils]: 51: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,636 INFO L290 TraceCheckUtils]: 52: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,637 INFO L290 TraceCheckUtils]: 53: Hoare triple {5848#false} assume !(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,637 INFO L290 TraceCheckUtils]: 54: Hoare triple {5848#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5848#false} is VALID [2022-04-15 13:29:18,637 INFO L290 TraceCheckUtils]: 55: Hoare triple {5848#false} assume !(~c~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,637 INFO L290 TraceCheckUtils]: 56: Hoare triple {5848#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {5848#false} is VALID [2022-04-15 13:29:18,637 INFO L290 TraceCheckUtils]: 57: Hoare triple {5848#false} assume !(~b~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,637 INFO L290 TraceCheckUtils]: 58: Hoare triple {5848#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {5848#false} is VALID [2022-04-15 13:29:18,637 INFO L290 TraceCheckUtils]: 59: Hoare triple {5848#false} assume !!(~a~0 < 6);~b~0 := 0; {5848#false} is VALID [2022-04-15 13:29:18,637 INFO L290 TraceCheckUtils]: 60: Hoare triple {5848#false} assume !!(~b~0 < 6);~c~0 := 0; {5848#false} is VALID [2022-04-15 13:29:18,637 INFO L290 TraceCheckUtils]: 61: Hoare triple {5848#false} assume !!(~c~0 < 6);~d~0 := 0; {5848#false} is VALID [2022-04-15 13:29:18,637 INFO L290 TraceCheckUtils]: 62: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,637 INFO L290 TraceCheckUtils]: 63: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,637 INFO L290 TraceCheckUtils]: 64: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,637 INFO L290 TraceCheckUtils]: 65: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,637 INFO L290 TraceCheckUtils]: 66: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,637 INFO L290 TraceCheckUtils]: 67: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,637 INFO L290 TraceCheckUtils]: 68: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,637 INFO L290 TraceCheckUtils]: 69: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,638 INFO L290 TraceCheckUtils]: 70: Hoare triple {5848#false} assume !(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,638 INFO L290 TraceCheckUtils]: 71: Hoare triple {5848#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5848#false} is VALID [2022-04-15 13:29:18,638 INFO L290 TraceCheckUtils]: 72: Hoare triple {5848#false} assume !!(~c~0 < 6);~d~0 := 0; {5848#false} is VALID [2022-04-15 13:29:18,638 INFO L290 TraceCheckUtils]: 73: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,638 INFO L290 TraceCheckUtils]: 74: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,638 INFO L290 TraceCheckUtils]: 75: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,638 INFO L290 TraceCheckUtils]: 76: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,638 INFO L290 TraceCheckUtils]: 77: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,638 INFO L290 TraceCheckUtils]: 78: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,638 INFO L290 TraceCheckUtils]: 79: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,638 INFO L290 TraceCheckUtils]: 80: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,638 INFO L290 TraceCheckUtils]: 81: Hoare triple {5848#false} assume !(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,638 INFO L290 TraceCheckUtils]: 82: Hoare triple {5848#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5848#false} is VALID [2022-04-15 13:29:18,638 INFO L290 TraceCheckUtils]: 83: Hoare triple {5848#false} assume !(~c~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,638 INFO L290 TraceCheckUtils]: 84: Hoare triple {5848#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {5848#false} is VALID [2022-04-15 13:29:18,638 INFO L290 TraceCheckUtils]: 85: Hoare triple {5848#false} assume !!(~b~0 < 6);~c~0 := 0; {5848#false} is VALID [2022-04-15 13:29:18,638 INFO L290 TraceCheckUtils]: 86: Hoare triple {5848#false} assume !!(~c~0 < 6);~d~0 := 0; {5848#false} is VALID [2022-04-15 13:29:18,638 INFO L290 TraceCheckUtils]: 87: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,639 INFO L290 TraceCheckUtils]: 88: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,639 INFO L290 TraceCheckUtils]: 89: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,639 INFO L290 TraceCheckUtils]: 90: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,639 INFO L290 TraceCheckUtils]: 91: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,639 INFO L290 TraceCheckUtils]: 92: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,639 INFO L290 TraceCheckUtils]: 93: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,639 INFO L290 TraceCheckUtils]: 94: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,639 INFO L290 TraceCheckUtils]: 95: Hoare triple {5848#false} assume !(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,639 INFO L290 TraceCheckUtils]: 96: Hoare triple {5848#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5848#false} is VALID [2022-04-15 13:29:18,639 INFO L290 TraceCheckUtils]: 97: Hoare triple {5848#false} assume !!(~c~0 < 6);~d~0 := 0; {5848#false} is VALID [2022-04-15 13:29:18,639 INFO L290 TraceCheckUtils]: 98: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,639 INFO L290 TraceCheckUtils]: 99: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,639 INFO L290 TraceCheckUtils]: 100: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,639 INFO L290 TraceCheckUtils]: 101: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,639 INFO L290 TraceCheckUtils]: 102: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,639 INFO L290 TraceCheckUtils]: 103: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,639 INFO L290 TraceCheckUtils]: 104: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,640 INFO L290 TraceCheckUtils]: 105: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,640 INFO L290 TraceCheckUtils]: 106: Hoare triple {5848#false} assume !(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,640 INFO L290 TraceCheckUtils]: 107: Hoare triple {5848#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5848#false} is VALID [2022-04-15 13:29:18,640 INFO L290 TraceCheckUtils]: 108: Hoare triple {5848#false} assume !(~c~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,640 INFO L290 TraceCheckUtils]: 109: Hoare triple {5848#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {5848#false} is VALID [2022-04-15 13:29:18,640 INFO L290 TraceCheckUtils]: 110: Hoare triple {5848#false} assume !(~b~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,640 INFO L290 TraceCheckUtils]: 111: Hoare triple {5848#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {5848#false} is VALID [2022-04-15 13:29:18,640 INFO L290 TraceCheckUtils]: 112: Hoare triple {5848#false} assume !(~a~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,640 INFO L290 TraceCheckUtils]: 113: Hoare triple {5848#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {5848#false} is VALID [2022-04-15 13:29:18,640 INFO L290 TraceCheckUtils]: 114: Hoare triple {5848#false} assume !false; {5848#false} is VALID [2022-04-15 13:29:18,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 305 proven. 16 refuted. 0 times theorem prover too weak. 1074 trivial. 0 not checked. [2022-04-15 13:29:18,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:29:18,888 INFO L290 TraceCheckUtils]: 114: Hoare triple {5848#false} assume !false; {5848#false} is VALID [2022-04-15 13:29:18,888 INFO L290 TraceCheckUtils]: 113: Hoare triple {5848#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {5848#false} is VALID [2022-04-15 13:29:18,888 INFO L290 TraceCheckUtils]: 112: Hoare triple {5848#false} assume !(~a~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,888 INFO L290 TraceCheckUtils]: 111: Hoare triple {5848#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {5848#false} is VALID [2022-04-15 13:29:18,888 INFO L290 TraceCheckUtils]: 110: Hoare triple {5848#false} assume !(~b~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,888 INFO L290 TraceCheckUtils]: 109: Hoare triple {5848#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {5848#false} is VALID [2022-04-15 13:29:18,888 INFO L290 TraceCheckUtils]: 108: Hoare triple {5848#false} assume !(~c~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,888 INFO L290 TraceCheckUtils]: 107: Hoare triple {5848#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5848#false} is VALID [2022-04-15 13:29:18,888 INFO L290 TraceCheckUtils]: 106: Hoare triple {5848#false} assume !(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,889 INFO L290 TraceCheckUtils]: 105: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,889 INFO L290 TraceCheckUtils]: 104: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,889 INFO L290 TraceCheckUtils]: 103: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,889 INFO L290 TraceCheckUtils]: 102: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,889 INFO L290 TraceCheckUtils]: 101: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,889 INFO L290 TraceCheckUtils]: 100: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,889 INFO L290 TraceCheckUtils]: 99: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,889 INFO L290 TraceCheckUtils]: 98: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,889 INFO L290 TraceCheckUtils]: 97: Hoare triple {5848#false} assume !!(~c~0 < 6);~d~0 := 0; {5848#false} is VALID [2022-04-15 13:29:18,889 INFO L290 TraceCheckUtils]: 96: Hoare triple {5848#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5848#false} is VALID [2022-04-15 13:29:18,889 INFO L290 TraceCheckUtils]: 95: Hoare triple {5848#false} assume !(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,889 INFO L290 TraceCheckUtils]: 94: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,889 INFO L290 TraceCheckUtils]: 93: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,889 INFO L290 TraceCheckUtils]: 92: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,889 INFO L290 TraceCheckUtils]: 91: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,889 INFO L290 TraceCheckUtils]: 90: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,889 INFO L290 TraceCheckUtils]: 89: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,889 INFO L290 TraceCheckUtils]: 88: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,890 INFO L290 TraceCheckUtils]: 87: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,890 INFO L290 TraceCheckUtils]: 86: Hoare triple {5848#false} assume !!(~c~0 < 6);~d~0 := 0; {5848#false} is VALID [2022-04-15 13:29:18,890 INFO L290 TraceCheckUtils]: 85: Hoare triple {5848#false} assume !!(~b~0 < 6);~c~0 := 0; {5848#false} is VALID [2022-04-15 13:29:18,890 INFO L290 TraceCheckUtils]: 84: Hoare triple {5848#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {5848#false} is VALID [2022-04-15 13:29:18,890 INFO L290 TraceCheckUtils]: 83: Hoare triple {5848#false} assume !(~c~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,890 INFO L290 TraceCheckUtils]: 82: Hoare triple {5848#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5848#false} is VALID [2022-04-15 13:29:18,890 INFO L290 TraceCheckUtils]: 81: Hoare triple {5848#false} assume !(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,890 INFO L290 TraceCheckUtils]: 80: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,890 INFO L290 TraceCheckUtils]: 79: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,890 INFO L290 TraceCheckUtils]: 78: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,890 INFO L290 TraceCheckUtils]: 77: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,890 INFO L290 TraceCheckUtils]: 76: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,890 INFO L290 TraceCheckUtils]: 75: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,890 INFO L290 TraceCheckUtils]: 74: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,890 INFO L290 TraceCheckUtils]: 73: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,890 INFO L290 TraceCheckUtils]: 72: Hoare triple {5848#false} assume !!(~c~0 < 6);~d~0 := 0; {5848#false} is VALID [2022-04-15 13:29:18,890 INFO L290 TraceCheckUtils]: 71: Hoare triple {5848#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5848#false} is VALID [2022-04-15 13:29:18,890 INFO L290 TraceCheckUtils]: 70: Hoare triple {5848#false} assume !(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,891 INFO L290 TraceCheckUtils]: 69: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,891 INFO L290 TraceCheckUtils]: 68: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,891 INFO L290 TraceCheckUtils]: 67: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,891 INFO L290 TraceCheckUtils]: 66: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,891 INFO L290 TraceCheckUtils]: 65: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,891 INFO L290 TraceCheckUtils]: 64: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,891 INFO L290 TraceCheckUtils]: 63: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,891 INFO L290 TraceCheckUtils]: 62: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,891 INFO L290 TraceCheckUtils]: 61: Hoare triple {5848#false} assume !!(~c~0 < 6);~d~0 := 0; {5848#false} is VALID [2022-04-15 13:29:18,891 INFO L290 TraceCheckUtils]: 60: Hoare triple {5848#false} assume !!(~b~0 < 6);~c~0 := 0; {5848#false} is VALID [2022-04-15 13:29:18,891 INFO L290 TraceCheckUtils]: 59: Hoare triple {5848#false} assume !!(~a~0 < 6);~b~0 := 0; {5848#false} is VALID [2022-04-15 13:29:18,891 INFO L290 TraceCheckUtils]: 58: Hoare triple {5848#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {5848#false} is VALID [2022-04-15 13:29:18,891 INFO L290 TraceCheckUtils]: 57: Hoare triple {5848#false} assume !(~b~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,891 INFO L290 TraceCheckUtils]: 56: Hoare triple {5848#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {5848#false} is VALID [2022-04-15 13:29:18,891 INFO L290 TraceCheckUtils]: 55: Hoare triple {5848#false} assume !(~c~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,891 INFO L290 TraceCheckUtils]: 54: Hoare triple {5848#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5848#false} is VALID [2022-04-15 13:29:18,891 INFO L290 TraceCheckUtils]: 53: Hoare triple {5848#false} assume !(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,891 INFO L290 TraceCheckUtils]: 52: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,892 INFO L290 TraceCheckUtils]: 51: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,892 INFO L290 TraceCheckUtils]: 50: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,892 INFO L290 TraceCheckUtils]: 49: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,892 INFO L290 TraceCheckUtils]: 48: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,892 INFO L290 TraceCheckUtils]: 47: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,892 INFO L290 TraceCheckUtils]: 46: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,892 INFO L290 TraceCheckUtils]: 45: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,892 INFO L290 TraceCheckUtils]: 44: Hoare triple {5848#false} assume !!(~c~0 < 6);~d~0 := 0; {5848#false} is VALID [2022-04-15 13:29:18,892 INFO L290 TraceCheckUtils]: 43: Hoare triple {5848#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5848#false} is VALID [2022-04-15 13:29:18,892 INFO L290 TraceCheckUtils]: 42: Hoare triple {5848#false} assume !(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,892 INFO L290 TraceCheckUtils]: 41: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,892 INFO L290 TraceCheckUtils]: 40: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,892 INFO L290 TraceCheckUtils]: 39: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,892 INFO L290 TraceCheckUtils]: 38: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,892 INFO L290 TraceCheckUtils]: 37: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,892 INFO L290 TraceCheckUtils]: 36: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,892 INFO L290 TraceCheckUtils]: 35: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,892 INFO L290 TraceCheckUtils]: 34: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,893 INFO L290 TraceCheckUtils]: 33: Hoare triple {5848#false} assume !!(~c~0 < 6);~d~0 := 0; {5848#false} is VALID [2022-04-15 13:29:18,893 INFO L290 TraceCheckUtils]: 32: Hoare triple {5848#false} assume !!(~b~0 < 6);~c~0 := 0; {5848#false} is VALID [2022-04-15 13:29:18,893 INFO L290 TraceCheckUtils]: 31: Hoare triple {5848#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {5848#false} is VALID [2022-04-15 13:29:18,893 INFO L290 TraceCheckUtils]: 30: Hoare triple {5848#false} assume !(~c~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,893 INFO L290 TraceCheckUtils]: 29: Hoare triple {5848#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5848#false} is VALID [2022-04-15 13:29:18,893 INFO L290 TraceCheckUtils]: 28: Hoare triple {5848#false} assume !(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,893 INFO L290 TraceCheckUtils]: 27: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,893 INFO L290 TraceCheckUtils]: 26: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,893 INFO L290 TraceCheckUtils]: 25: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,893 INFO L290 TraceCheckUtils]: 24: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,893 INFO L290 TraceCheckUtils]: 23: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,893 INFO L290 TraceCheckUtils]: 22: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {5848#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5848#false} is VALID [2022-04-15 13:29:18,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {5848#false} assume !!(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {5848#false} assume !!(~c~0 < 6);~d~0 := 0; {5848#false} is VALID [2022-04-15 13:29:18,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {5848#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {5848#false} is VALID [2022-04-15 13:29:18,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {6495#(< main_~d~0 6)} assume !(~d~0 < 6); {5848#false} is VALID [2022-04-15 13:29:18,896 INFO L290 TraceCheckUtils]: 16: Hoare triple {5856#(<= main_~d~0 4)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {6495#(< main_~d~0 6)} is VALID [2022-04-15 13:29:18,896 INFO L290 TraceCheckUtils]: 15: Hoare triple {5856#(<= main_~d~0 4)} assume !!(~d~0 < 6); {5856#(<= main_~d~0 4)} is VALID [2022-04-15 13:29:18,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {5855#(<= main_~d~0 3)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5856#(<= main_~d~0 4)} is VALID [2022-04-15 13:29:18,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {5855#(<= main_~d~0 3)} assume !!(~d~0 < 6); {5855#(<= main_~d~0 3)} is VALID [2022-04-15 13:29:18,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {5854#(<= main_~d~0 2)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5855#(<= main_~d~0 3)} is VALID [2022-04-15 13:29:18,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {5854#(<= main_~d~0 2)} assume !!(~d~0 < 6); {5854#(<= main_~d~0 2)} is VALID [2022-04-15 13:29:18,898 INFO L290 TraceCheckUtils]: 10: Hoare triple {5853#(<= main_~d~0 1)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {5854#(<= main_~d~0 2)} is VALID [2022-04-15 13:29:18,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {5853#(<= main_~d~0 1)} assume !!(~d~0 < 6); {5853#(<= main_~d~0 1)} is VALID [2022-04-15 13:29:18,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {5847#true} assume !!(~c~0 < 6);~d~0 := 0; {5853#(<= main_~d~0 1)} is VALID [2022-04-15 13:29:18,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {5847#true} assume !!(~b~0 < 6);~c~0 := 0; {5847#true} is VALID [2022-04-15 13:29:18,899 INFO L290 TraceCheckUtils]: 6: Hoare triple {5847#true} assume !!(~a~0 < 6);~b~0 := 0; {5847#true} is VALID [2022-04-15 13:29:18,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {5847#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {5847#true} is VALID [2022-04-15 13:29:18,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {5847#true} call #t~ret8 := main(); {5847#true} is VALID [2022-04-15 13:29:18,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5847#true} {5847#true} #68#return; {5847#true} is VALID [2022-04-15 13:29:18,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {5847#true} assume true; {5847#true} is VALID [2022-04-15 13:29:18,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {5847#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); {5847#true} is VALID [2022-04-15 13:29:18,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {5847#true} call ULTIMATE.init(); {5847#true} is VALID [2022-04-15 13:29:18,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 305 proven. 16 refuted. 0 times theorem prover too weak. 1074 trivial. 0 not checked. [2022-04-15 13:29:18,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77279994] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:29:18,900 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:29:18,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2022-04-15 13:29:18,900 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:29:18,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [391315247] [2022-04-15 13:29:18,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [391315247] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:29:18,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:29:18,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 13:29:18,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015197869] [2022-04-15 13:29:18,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:29:18,900 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 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 115 [2022-04-15 13:29:18,901 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:29:18,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 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-15 13:29:18,918 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-15 13:29:18,919 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 13:29:18,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:29:18,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 13:29:18,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:29:18,919 INFO L87 Difference]: Start difference. First operand 116 states and 130 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 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-15 13:29:19,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:29:19,159 INFO L93 Difference]: Finished difference Result 238 states and 273 transitions. [2022-04-15 13:29:19,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 13:29:19,160 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 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 115 [2022-04-15 13:29:19,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:29:19,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 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-15 13:29:19,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-04-15 13:29:19,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 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-15 13:29:19,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-04-15 13:29:19,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 45 transitions. [2022-04-15 13:29:19,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:29:19,190 INFO L225 Difference]: With dead ends: 238 [2022-04-15 13:29:19,190 INFO L226 Difference]: Without dead ends: 140 [2022-04-15 13:29:19,191 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 229 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-15 13:29:19,191 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 25 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:29:19,191 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 30 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:29:19,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-15 13:29:19,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 132. [2022-04-15 13:29:19,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:29:19,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 132 states, 128 states have (on average 1.1171875) internal successors, (143), 128 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-15 13:29:19,315 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 132 states, 128 states have (on average 1.1171875) internal successors, (143), 128 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-15 13:29:19,315 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 132 states, 128 states have (on average 1.1171875) internal successors, (143), 128 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-15 13:29:19,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:29:19,316 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2022-04-15 13:29:19,317 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2022-04-15 13:29:19,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:29:19,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:29:19,317 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 128 states have (on average 1.1171875) internal successors, (143), 128 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 140 states. [2022-04-15 13:29:19,317 INFO L87 Difference]: Start difference. First operand has 132 states, 128 states have (on average 1.1171875) internal successors, (143), 128 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 140 states. [2022-04-15 13:29:19,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:29:19,319 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2022-04-15 13:29:19,319 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2022-04-15 13:29:19,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:29:19,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:29:19,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:29:19,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:29:19,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 128 states have (on average 1.1171875) internal successors, (143), 128 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-15 13:29:19,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 146 transitions. [2022-04-15 13:29:19,321 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 146 transitions. Word has length 115 [2022-04-15 13:29:19,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:29:19,321 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 146 transitions. [2022-04-15 13:29:19,321 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 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-15 13:29:19,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 146 transitions. [2022-04-15 13:29:19,455 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-15 13:29:19,455 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 146 transitions. [2022-04-15 13:29:19,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-15 13:29:19,460 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:29:19,460 INFO L499 BasicCegarLoop]: trace histogram [40, 40, 8, 8, 8, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:29:19,476 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-15 13:29:19,660 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:29:19,662 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:29:19,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:29:19,662 INFO L85 PathProgramCache]: Analyzing trace with hash 429066251, now seen corresponding path program 15 times [2022-04-15 13:29:19,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:29:19,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2040975743] [2022-04-15 13:29:21,757 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:29:21,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1740420611, now seen corresponding path program 1 times [2022-04-15 13:29:21,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:29:21,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739050457] [2022-04-15 13:29:21,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:29:21,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:29:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:29:21,761 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:29:21,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:29:21,764 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:29:21,764 INFO L85 PathProgramCache]: Analyzing trace with hash 429066251, now seen corresponding path program 16 times [2022-04-15 13:29:21,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:29:21,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379203405] [2022-04-15 13:29:21,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:29:21,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:29:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:29:21,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:29:21,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:29:21,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {7590#(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); {7579#true} is VALID [2022-04-15 13:29:21,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {7579#true} assume true; {7579#true} is VALID [2022-04-15 13:29:21,859 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7579#true} {7579#true} #68#return; {7579#true} is VALID [2022-04-15 13:29:21,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {7579#true} call ULTIMATE.init(); {7590#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:29:21,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {7590#(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); {7579#true} is VALID [2022-04-15 13:29:21,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {7579#true} assume true; {7579#true} is VALID [2022-04-15 13:29:21,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7579#true} {7579#true} #68#return; {7579#true} is VALID [2022-04-15 13:29:21,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {7579#true} call #t~ret8 := main(); {7579#true} is VALID [2022-04-15 13:29:21,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {7579#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {7579#true} is VALID [2022-04-15 13:29:21,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {7579#true} assume !!(~a~0 < 6);~b~0 := 0; {7579#true} is VALID [2022-04-15 13:29:21,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {7579#true} assume !!(~b~0 < 6);~c~0 := 0; {7579#true} is VALID [2022-04-15 13:29:21,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {7579#true} assume !!(~c~0 < 6);~d~0 := 0; {7584#(= main_~d~0 0)} is VALID [2022-04-15 13:29:21,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {7584#(= main_~d~0 0)} assume !!(~d~0 < 6); {7584#(= main_~d~0 0)} is VALID [2022-04-15 13:29:21,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {7584#(= main_~d~0 0)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7585#(<= main_~d~0 1)} is VALID [2022-04-15 13:29:21,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {7585#(<= main_~d~0 1)} assume !!(~d~0 < 6); {7585#(<= main_~d~0 1)} is VALID [2022-04-15 13:29:21,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {7585#(<= main_~d~0 1)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7586#(<= main_~d~0 2)} is VALID [2022-04-15 13:29:21,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {7586#(<= main_~d~0 2)} assume !!(~d~0 < 6); {7586#(<= main_~d~0 2)} is VALID [2022-04-15 13:29:21,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {7586#(<= main_~d~0 2)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7587#(<= main_~d~0 3)} is VALID [2022-04-15 13:29:21,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {7587#(<= main_~d~0 3)} assume !!(~d~0 < 6); {7587#(<= main_~d~0 3)} is VALID [2022-04-15 13:29:21,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {7587#(<= main_~d~0 3)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7588#(<= main_~d~0 4)} is VALID [2022-04-15 13:29:21,862 INFO L290 TraceCheckUtils]: 17: Hoare triple {7588#(<= main_~d~0 4)} assume !!(~d~0 < 6); {7588#(<= main_~d~0 4)} is VALID [2022-04-15 13:29:21,863 INFO L290 TraceCheckUtils]: 18: Hoare triple {7588#(<= main_~d~0 4)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7589#(<= main_~d~0 5)} is VALID [2022-04-15 13:29:21,863 INFO L290 TraceCheckUtils]: 19: Hoare triple {7589#(<= main_~d~0 5)} assume !(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {7580#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7580#false} is VALID [2022-04-15 13:29:21,863 INFO L290 TraceCheckUtils]: 21: Hoare triple {7580#false} assume !!(~c~0 < 6);~d~0 := 0; {7580#false} is VALID [2022-04-15 13:29:21,863 INFO L290 TraceCheckUtils]: 22: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:21,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,863 INFO L290 TraceCheckUtils]: 25: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:21,864 INFO L290 TraceCheckUtils]: 26: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,864 INFO L290 TraceCheckUtils]: 27: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:21,864 INFO L290 TraceCheckUtils]: 28: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,864 INFO L290 TraceCheckUtils]: 29: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:21,864 INFO L290 TraceCheckUtils]: 30: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,864 INFO L290 TraceCheckUtils]: 31: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:21,864 INFO L290 TraceCheckUtils]: 32: Hoare triple {7580#false} assume !(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,864 INFO L290 TraceCheckUtils]: 33: Hoare triple {7580#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7580#false} is VALID [2022-04-15 13:29:21,864 INFO L290 TraceCheckUtils]: 34: Hoare triple {7580#false} assume !(~c~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,864 INFO L290 TraceCheckUtils]: 35: Hoare triple {7580#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7580#false} is VALID [2022-04-15 13:29:21,864 INFO L290 TraceCheckUtils]: 36: Hoare triple {7580#false} assume !!(~b~0 < 6);~c~0 := 0; {7580#false} is VALID [2022-04-15 13:29:21,864 INFO L290 TraceCheckUtils]: 37: Hoare triple {7580#false} assume !!(~c~0 < 6);~d~0 := 0; {7580#false} is VALID [2022-04-15 13:29:21,864 INFO L290 TraceCheckUtils]: 38: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,864 INFO L290 TraceCheckUtils]: 39: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:21,864 INFO L290 TraceCheckUtils]: 40: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,864 INFO L290 TraceCheckUtils]: 41: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:21,864 INFO L290 TraceCheckUtils]: 42: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,864 INFO L290 TraceCheckUtils]: 43: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:21,864 INFO L290 TraceCheckUtils]: 44: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,865 INFO L290 TraceCheckUtils]: 45: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:21,865 INFO L290 TraceCheckUtils]: 46: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,865 INFO L290 TraceCheckUtils]: 47: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:21,865 INFO L290 TraceCheckUtils]: 48: Hoare triple {7580#false} assume !(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,865 INFO L290 TraceCheckUtils]: 49: Hoare triple {7580#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7580#false} is VALID [2022-04-15 13:29:21,865 INFO L290 TraceCheckUtils]: 50: Hoare triple {7580#false} assume !!(~c~0 < 6);~d~0 := 0; {7580#false} is VALID [2022-04-15 13:29:21,865 INFO L290 TraceCheckUtils]: 51: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,865 INFO L290 TraceCheckUtils]: 52: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:21,865 INFO L290 TraceCheckUtils]: 53: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,865 INFO L290 TraceCheckUtils]: 54: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:21,865 INFO L290 TraceCheckUtils]: 55: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,865 INFO L290 TraceCheckUtils]: 56: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:21,865 INFO L290 TraceCheckUtils]: 57: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,865 INFO L290 TraceCheckUtils]: 58: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:21,865 INFO L290 TraceCheckUtils]: 59: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,865 INFO L290 TraceCheckUtils]: 60: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:21,865 INFO L290 TraceCheckUtils]: 61: Hoare triple {7580#false} assume !(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,865 INFO L290 TraceCheckUtils]: 62: Hoare triple {7580#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7580#false} is VALID [2022-04-15 13:29:21,866 INFO L290 TraceCheckUtils]: 63: Hoare triple {7580#false} assume !(~c~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,866 INFO L290 TraceCheckUtils]: 64: Hoare triple {7580#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7580#false} is VALID [2022-04-15 13:29:21,866 INFO L290 TraceCheckUtils]: 65: Hoare triple {7580#false} assume !(~b~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,866 INFO L290 TraceCheckUtils]: 66: Hoare triple {7580#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {7580#false} is VALID [2022-04-15 13:29:21,866 INFO L290 TraceCheckUtils]: 67: Hoare triple {7580#false} assume !!(~a~0 < 6);~b~0 := 0; {7580#false} is VALID [2022-04-15 13:29:21,866 INFO L290 TraceCheckUtils]: 68: Hoare triple {7580#false} assume !!(~b~0 < 6);~c~0 := 0; {7580#false} is VALID [2022-04-15 13:29:21,866 INFO L290 TraceCheckUtils]: 69: Hoare triple {7580#false} assume !!(~c~0 < 6);~d~0 := 0; {7580#false} is VALID [2022-04-15 13:29:21,866 INFO L290 TraceCheckUtils]: 70: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,866 INFO L290 TraceCheckUtils]: 71: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:21,866 INFO L290 TraceCheckUtils]: 72: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,866 INFO L290 TraceCheckUtils]: 73: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:21,866 INFO L290 TraceCheckUtils]: 74: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,866 INFO L290 TraceCheckUtils]: 75: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:21,866 INFO L290 TraceCheckUtils]: 76: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,866 INFO L290 TraceCheckUtils]: 77: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:21,866 INFO L290 TraceCheckUtils]: 78: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,866 INFO L290 TraceCheckUtils]: 79: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:21,866 INFO L290 TraceCheckUtils]: 80: Hoare triple {7580#false} assume !(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,866 INFO L290 TraceCheckUtils]: 81: Hoare triple {7580#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7580#false} is VALID [2022-04-15 13:29:21,867 INFO L290 TraceCheckUtils]: 82: Hoare triple {7580#false} assume !!(~c~0 < 6);~d~0 := 0; {7580#false} is VALID [2022-04-15 13:29:21,867 INFO L290 TraceCheckUtils]: 83: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,867 INFO L290 TraceCheckUtils]: 84: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:21,867 INFO L290 TraceCheckUtils]: 85: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,867 INFO L290 TraceCheckUtils]: 86: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:21,867 INFO L290 TraceCheckUtils]: 87: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,867 INFO L290 TraceCheckUtils]: 88: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:21,867 INFO L290 TraceCheckUtils]: 89: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,867 INFO L290 TraceCheckUtils]: 90: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:21,867 INFO L290 TraceCheckUtils]: 91: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,867 INFO L290 TraceCheckUtils]: 92: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:21,867 INFO L290 TraceCheckUtils]: 93: Hoare triple {7580#false} assume !(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,867 INFO L290 TraceCheckUtils]: 94: Hoare triple {7580#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7580#false} is VALID [2022-04-15 13:29:21,867 INFO L290 TraceCheckUtils]: 95: Hoare triple {7580#false} assume !(~c~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,867 INFO L290 TraceCheckUtils]: 96: Hoare triple {7580#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7580#false} is VALID [2022-04-15 13:29:21,867 INFO L290 TraceCheckUtils]: 97: Hoare triple {7580#false} assume !!(~b~0 < 6);~c~0 := 0; {7580#false} is VALID [2022-04-15 13:29:21,867 INFO L290 TraceCheckUtils]: 98: Hoare triple {7580#false} assume !!(~c~0 < 6);~d~0 := 0; {7580#false} is VALID [2022-04-15 13:29:21,867 INFO L290 TraceCheckUtils]: 99: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,867 INFO L290 TraceCheckUtils]: 100: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:21,868 INFO L290 TraceCheckUtils]: 101: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,868 INFO L290 TraceCheckUtils]: 102: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:21,868 INFO L290 TraceCheckUtils]: 103: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,868 INFO L290 TraceCheckUtils]: 104: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:21,868 INFO L290 TraceCheckUtils]: 105: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,868 INFO L290 TraceCheckUtils]: 106: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:21,868 INFO L290 TraceCheckUtils]: 107: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,868 INFO L290 TraceCheckUtils]: 108: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:21,868 INFO L290 TraceCheckUtils]: 109: Hoare triple {7580#false} assume !(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,868 INFO L290 TraceCheckUtils]: 110: Hoare triple {7580#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7580#false} is VALID [2022-04-15 13:29:21,868 INFO L290 TraceCheckUtils]: 111: Hoare triple {7580#false} assume !!(~c~0 < 6);~d~0 := 0; {7580#false} is VALID [2022-04-15 13:29:21,868 INFO L290 TraceCheckUtils]: 112: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,868 INFO L290 TraceCheckUtils]: 113: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:21,868 INFO L290 TraceCheckUtils]: 114: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,868 INFO L290 TraceCheckUtils]: 115: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:21,868 INFO L290 TraceCheckUtils]: 116: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,868 INFO L290 TraceCheckUtils]: 117: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:21,868 INFO L290 TraceCheckUtils]: 118: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,868 INFO L290 TraceCheckUtils]: 119: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:21,869 INFO L290 TraceCheckUtils]: 120: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,869 INFO L290 TraceCheckUtils]: 121: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:21,869 INFO L290 TraceCheckUtils]: 122: Hoare triple {7580#false} assume !(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,869 INFO L290 TraceCheckUtils]: 123: Hoare triple {7580#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7580#false} is VALID [2022-04-15 13:29:21,869 INFO L290 TraceCheckUtils]: 124: Hoare triple {7580#false} assume !(~c~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,869 INFO L290 TraceCheckUtils]: 125: Hoare triple {7580#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7580#false} is VALID [2022-04-15 13:29:21,869 INFO L290 TraceCheckUtils]: 126: Hoare triple {7580#false} assume !(~b~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,869 INFO L290 TraceCheckUtils]: 127: Hoare triple {7580#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {7580#false} is VALID [2022-04-15 13:29:21,869 INFO L290 TraceCheckUtils]: 128: Hoare triple {7580#false} assume !(~a~0 < 6); {7580#false} is VALID [2022-04-15 13:29:21,869 INFO L290 TraceCheckUtils]: 129: Hoare triple {7580#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {7580#false} is VALID [2022-04-15 13:29:21,869 INFO L290 TraceCheckUtils]: 130: Hoare triple {7580#false} assume !false; {7580#false} is VALID [2022-04-15 13:29:21,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2027 backedges. 445 proven. 25 refuted. 0 times theorem prover too weak. 1557 trivial. 0 not checked. [2022-04-15 13:29:21,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:29:21,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379203405] [2022-04-15 13:29:21,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379203405] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:29:21,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644661409] [2022-04-15 13:29:21,870 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:29:21,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:29:21,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:29:21,871 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-15 13:29:21,876 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-15 13:29:21,941 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:29:21,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:29:21,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 13:29:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:29:21,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:29:22,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {7579#true} call ULTIMATE.init(); {7579#true} is VALID [2022-04-15 13:29:22,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {7579#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); {7579#true} is VALID [2022-04-15 13:29:22,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {7579#true} assume true; {7579#true} is VALID [2022-04-15 13:29:22,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7579#true} {7579#true} #68#return; {7579#true} is VALID [2022-04-15 13:29:22,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {7579#true} call #t~ret8 := main(); {7579#true} is VALID [2022-04-15 13:29:22,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {7579#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {7579#true} is VALID [2022-04-15 13:29:22,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {7579#true} assume !!(~a~0 < 6);~b~0 := 0; {7579#true} is VALID [2022-04-15 13:29:22,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {7579#true} assume !!(~b~0 < 6);~c~0 := 0; {7579#true} is VALID [2022-04-15 13:29:22,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {7579#true} assume !!(~c~0 < 6);~d~0 := 0; {7618#(<= main_~d~0 0)} is VALID [2022-04-15 13:29:22,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {7618#(<= main_~d~0 0)} assume !!(~d~0 < 6); {7618#(<= main_~d~0 0)} is VALID [2022-04-15 13:29:22,162 INFO L290 TraceCheckUtils]: 10: Hoare triple {7618#(<= main_~d~0 0)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7585#(<= main_~d~0 1)} is VALID [2022-04-15 13:29:22,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {7585#(<= main_~d~0 1)} assume !!(~d~0 < 6); {7585#(<= main_~d~0 1)} is VALID [2022-04-15 13:29:22,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {7585#(<= main_~d~0 1)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7586#(<= main_~d~0 2)} is VALID [2022-04-15 13:29:22,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {7586#(<= main_~d~0 2)} assume !!(~d~0 < 6); {7586#(<= main_~d~0 2)} is VALID [2022-04-15 13:29:22,164 INFO L290 TraceCheckUtils]: 14: Hoare triple {7586#(<= main_~d~0 2)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7587#(<= main_~d~0 3)} is VALID [2022-04-15 13:29:22,164 INFO L290 TraceCheckUtils]: 15: Hoare triple {7587#(<= main_~d~0 3)} assume !!(~d~0 < 6); {7587#(<= main_~d~0 3)} is VALID [2022-04-15 13:29:22,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {7587#(<= main_~d~0 3)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7588#(<= main_~d~0 4)} is VALID [2022-04-15 13:29:22,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {7588#(<= main_~d~0 4)} assume !!(~d~0 < 6); {7588#(<= main_~d~0 4)} is VALID [2022-04-15 13:29:22,165 INFO L290 TraceCheckUtils]: 18: Hoare triple {7588#(<= main_~d~0 4)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7589#(<= main_~d~0 5)} is VALID [2022-04-15 13:29:22,165 INFO L290 TraceCheckUtils]: 19: Hoare triple {7589#(<= main_~d~0 5)} assume !(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,165 INFO L290 TraceCheckUtils]: 20: Hoare triple {7580#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7580#false} is VALID [2022-04-15 13:29:22,165 INFO L290 TraceCheckUtils]: 21: Hoare triple {7580#false} assume !!(~c~0 < 6);~d~0 := 0; {7580#false} is VALID [2022-04-15 13:29:22,165 INFO L290 TraceCheckUtils]: 22: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,165 INFO L290 TraceCheckUtils]: 23: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,165 INFO L290 TraceCheckUtils]: 24: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,165 INFO L290 TraceCheckUtils]: 25: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,165 INFO L290 TraceCheckUtils]: 26: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,166 INFO L290 TraceCheckUtils]: 27: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,166 INFO L290 TraceCheckUtils]: 28: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,166 INFO L290 TraceCheckUtils]: 29: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,166 INFO L290 TraceCheckUtils]: 30: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,166 INFO L290 TraceCheckUtils]: 31: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,166 INFO L290 TraceCheckUtils]: 32: Hoare triple {7580#false} assume !(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,166 INFO L290 TraceCheckUtils]: 33: Hoare triple {7580#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7580#false} is VALID [2022-04-15 13:29:22,166 INFO L290 TraceCheckUtils]: 34: Hoare triple {7580#false} assume !(~c~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,166 INFO L290 TraceCheckUtils]: 35: Hoare triple {7580#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7580#false} is VALID [2022-04-15 13:29:22,166 INFO L290 TraceCheckUtils]: 36: Hoare triple {7580#false} assume !!(~b~0 < 6);~c~0 := 0; {7580#false} is VALID [2022-04-15 13:29:22,166 INFO L290 TraceCheckUtils]: 37: Hoare triple {7580#false} assume !!(~c~0 < 6);~d~0 := 0; {7580#false} is VALID [2022-04-15 13:29:22,166 INFO L290 TraceCheckUtils]: 38: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,166 INFO L290 TraceCheckUtils]: 39: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,166 INFO L290 TraceCheckUtils]: 40: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,166 INFO L290 TraceCheckUtils]: 41: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,166 INFO L290 TraceCheckUtils]: 42: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,166 INFO L290 TraceCheckUtils]: 43: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,167 INFO L290 TraceCheckUtils]: 44: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,167 INFO L290 TraceCheckUtils]: 45: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,167 INFO L290 TraceCheckUtils]: 46: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,167 INFO L290 TraceCheckUtils]: 47: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,167 INFO L290 TraceCheckUtils]: 48: Hoare triple {7580#false} assume !(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,167 INFO L290 TraceCheckUtils]: 49: Hoare triple {7580#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7580#false} is VALID [2022-04-15 13:29:22,167 INFO L290 TraceCheckUtils]: 50: Hoare triple {7580#false} assume !!(~c~0 < 6);~d~0 := 0; {7580#false} is VALID [2022-04-15 13:29:22,167 INFO L290 TraceCheckUtils]: 51: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,167 INFO L290 TraceCheckUtils]: 52: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,167 INFO L290 TraceCheckUtils]: 53: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,167 INFO L290 TraceCheckUtils]: 54: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,167 INFO L290 TraceCheckUtils]: 55: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,167 INFO L290 TraceCheckUtils]: 56: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,167 INFO L290 TraceCheckUtils]: 57: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,167 INFO L290 TraceCheckUtils]: 58: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,167 INFO L290 TraceCheckUtils]: 59: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,167 INFO L290 TraceCheckUtils]: 60: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,167 INFO L290 TraceCheckUtils]: 61: Hoare triple {7580#false} assume !(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,168 INFO L290 TraceCheckUtils]: 62: Hoare triple {7580#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7580#false} is VALID [2022-04-15 13:29:22,168 INFO L290 TraceCheckUtils]: 63: Hoare triple {7580#false} assume !(~c~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,168 INFO L290 TraceCheckUtils]: 64: Hoare triple {7580#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7580#false} is VALID [2022-04-15 13:29:22,168 INFO L290 TraceCheckUtils]: 65: Hoare triple {7580#false} assume !(~b~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,168 INFO L290 TraceCheckUtils]: 66: Hoare triple {7580#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {7580#false} is VALID [2022-04-15 13:29:22,168 INFO L290 TraceCheckUtils]: 67: Hoare triple {7580#false} assume !!(~a~0 < 6);~b~0 := 0; {7580#false} is VALID [2022-04-15 13:29:22,168 INFO L290 TraceCheckUtils]: 68: Hoare triple {7580#false} assume !!(~b~0 < 6);~c~0 := 0; {7580#false} is VALID [2022-04-15 13:29:22,168 INFO L290 TraceCheckUtils]: 69: Hoare triple {7580#false} assume !!(~c~0 < 6);~d~0 := 0; {7580#false} is VALID [2022-04-15 13:29:22,168 INFO L290 TraceCheckUtils]: 70: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,168 INFO L290 TraceCheckUtils]: 71: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,168 INFO L290 TraceCheckUtils]: 72: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,168 INFO L290 TraceCheckUtils]: 73: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,168 INFO L290 TraceCheckUtils]: 74: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,168 INFO L290 TraceCheckUtils]: 75: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,168 INFO L290 TraceCheckUtils]: 76: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,168 INFO L290 TraceCheckUtils]: 77: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,168 INFO L290 TraceCheckUtils]: 78: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,168 INFO L290 TraceCheckUtils]: 79: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,169 INFO L290 TraceCheckUtils]: 80: Hoare triple {7580#false} assume !(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,169 INFO L290 TraceCheckUtils]: 81: Hoare triple {7580#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7580#false} is VALID [2022-04-15 13:29:22,169 INFO L290 TraceCheckUtils]: 82: Hoare triple {7580#false} assume !!(~c~0 < 6);~d~0 := 0; {7580#false} is VALID [2022-04-15 13:29:22,169 INFO L290 TraceCheckUtils]: 83: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,169 INFO L290 TraceCheckUtils]: 84: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,169 INFO L290 TraceCheckUtils]: 85: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,169 INFO L290 TraceCheckUtils]: 86: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,169 INFO L290 TraceCheckUtils]: 87: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,169 INFO L290 TraceCheckUtils]: 88: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,169 INFO L290 TraceCheckUtils]: 89: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,169 INFO L290 TraceCheckUtils]: 90: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,169 INFO L290 TraceCheckUtils]: 91: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,169 INFO L290 TraceCheckUtils]: 92: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,169 INFO L290 TraceCheckUtils]: 93: Hoare triple {7580#false} assume !(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,169 INFO L290 TraceCheckUtils]: 94: Hoare triple {7580#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7580#false} is VALID [2022-04-15 13:29:22,169 INFO L290 TraceCheckUtils]: 95: Hoare triple {7580#false} assume !(~c~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,169 INFO L290 TraceCheckUtils]: 96: Hoare triple {7580#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7580#false} is VALID [2022-04-15 13:29:22,169 INFO L290 TraceCheckUtils]: 97: Hoare triple {7580#false} assume !!(~b~0 < 6);~c~0 := 0; {7580#false} is VALID [2022-04-15 13:29:22,170 INFO L290 TraceCheckUtils]: 98: Hoare triple {7580#false} assume !!(~c~0 < 6);~d~0 := 0; {7580#false} is VALID [2022-04-15 13:29:22,170 INFO L290 TraceCheckUtils]: 99: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,170 INFO L290 TraceCheckUtils]: 100: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,170 INFO L290 TraceCheckUtils]: 101: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,170 INFO L290 TraceCheckUtils]: 102: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,170 INFO L290 TraceCheckUtils]: 103: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,170 INFO L290 TraceCheckUtils]: 104: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,170 INFO L290 TraceCheckUtils]: 105: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,170 INFO L290 TraceCheckUtils]: 106: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,170 INFO L290 TraceCheckUtils]: 107: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,170 INFO L290 TraceCheckUtils]: 108: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,170 INFO L290 TraceCheckUtils]: 109: Hoare triple {7580#false} assume !(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,170 INFO L290 TraceCheckUtils]: 110: Hoare triple {7580#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7580#false} is VALID [2022-04-15 13:29:22,170 INFO L290 TraceCheckUtils]: 111: Hoare triple {7580#false} assume !!(~c~0 < 6);~d~0 := 0; {7580#false} is VALID [2022-04-15 13:29:22,170 INFO L290 TraceCheckUtils]: 112: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,170 INFO L290 TraceCheckUtils]: 113: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,170 INFO L290 TraceCheckUtils]: 114: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,170 INFO L290 TraceCheckUtils]: 115: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,171 INFO L290 TraceCheckUtils]: 116: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,171 INFO L290 TraceCheckUtils]: 117: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,171 INFO L290 TraceCheckUtils]: 118: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,171 INFO L290 TraceCheckUtils]: 119: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,171 INFO L290 TraceCheckUtils]: 120: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,171 INFO L290 TraceCheckUtils]: 121: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,171 INFO L290 TraceCheckUtils]: 122: Hoare triple {7580#false} assume !(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,171 INFO L290 TraceCheckUtils]: 123: Hoare triple {7580#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7580#false} is VALID [2022-04-15 13:29:22,171 INFO L290 TraceCheckUtils]: 124: Hoare triple {7580#false} assume !(~c~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,171 INFO L290 TraceCheckUtils]: 125: Hoare triple {7580#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7580#false} is VALID [2022-04-15 13:29:22,171 INFO L290 TraceCheckUtils]: 126: Hoare triple {7580#false} assume !(~b~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,171 INFO L290 TraceCheckUtils]: 127: Hoare triple {7580#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {7580#false} is VALID [2022-04-15 13:29:22,171 INFO L290 TraceCheckUtils]: 128: Hoare triple {7580#false} assume !(~a~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,171 INFO L290 TraceCheckUtils]: 129: Hoare triple {7580#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {7580#false} is VALID [2022-04-15 13:29:22,171 INFO L290 TraceCheckUtils]: 130: Hoare triple {7580#false} assume !false; {7580#false} is VALID [2022-04-15 13:29:22,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2027 backedges. 445 proven. 25 refuted. 0 times theorem prover too weak. 1557 trivial. 0 not checked. [2022-04-15 13:29:22,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:29:22,439 INFO L290 TraceCheckUtils]: 130: Hoare triple {7580#false} assume !false; {7580#false} is VALID [2022-04-15 13:29:22,440 INFO L290 TraceCheckUtils]: 129: Hoare triple {7580#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {7580#false} is VALID [2022-04-15 13:29:22,440 INFO L290 TraceCheckUtils]: 128: Hoare triple {7580#false} assume !(~a~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,440 INFO L290 TraceCheckUtils]: 127: Hoare triple {7580#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {7580#false} is VALID [2022-04-15 13:29:22,440 INFO L290 TraceCheckUtils]: 126: Hoare triple {7580#false} assume !(~b~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,440 INFO L290 TraceCheckUtils]: 125: Hoare triple {7580#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7580#false} is VALID [2022-04-15 13:29:22,440 INFO L290 TraceCheckUtils]: 124: Hoare triple {7580#false} assume !(~c~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,440 INFO L290 TraceCheckUtils]: 123: Hoare triple {7580#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7580#false} is VALID [2022-04-15 13:29:22,440 INFO L290 TraceCheckUtils]: 122: Hoare triple {7580#false} assume !(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,440 INFO L290 TraceCheckUtils]: 121: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,440 INFO L290 TraceCheckUtils]: 120: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,440 INFO L290 TraceCheckUtils]: 119: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,440 INFO L290 TraceCheckUtils]: 118: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,440 INFO L290 TraceCheckUtils]: 117: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,440 INFO L290 TraceCheckUtils]: 116: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,441 INFO L290 TraceCheckUtils]: 115: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,441 INFO L290 TraceCheckUtils]: 114: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,441 INFO L290 TraceCheckUtils]: 113: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,441 INFO L290 TraceCheckUtils]: 112: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,441 INFO L290 TraceCheckUtils]: 111: Hoare triple {7580#false} assume !!(~c~0 < 6);~d~0 := 0; {7580#false} is VALID [2022-04-15 13:29:22,441 INFO L290 TraceCheckUtils]: 110: Hoare triple {7580#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7580#false} is VALID [2022-04-15 13:29:22,441 INFO L290 TraceCheckUtils]: 109: Hoare triple {7580#false} assume !(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,441 INFO L290 TraceCheckUtils]: 108: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,441 INFO L290 TraceCheckUtils]: 107: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,441 INFO L290 TraceCheckUtils]: 106: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,441 INFO L290 TraceCheckUtils]: 105: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,441 INFO L290 TraceCheckUtils]: 104: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,441 INFO L290 TraceCheckUtils]: 103: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,441 INFO L290 TraceCheckUtils]: 102: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,441 INFO L290 TraceCheckUtils]: 101: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,441 INFO L290 TraceCheckUtils]: 100: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,441 INFO L290 TraceCheckUtils]: 99: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,442 INFO L290 TraceCheckUtils]: 98: Hoare triple {7580#false} assume !!(~c~0 < 6);~d~0 := 0; {7580#false} is VALID [2022-04-15 13:29:22,442 INFO L290 TraceCheckUtils]: 97: Hoare triple {7580#false} assume !!(~b~0 < 6);~c~0 := 0; {7580#false} is VALID [2022-04-15 13:29:22,442 INFO L290 TraceCheckUtils]: 96: Hoare triple {7580#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7580#false} is VALID [2022-04-15 13:29:22,442 INFO L290 TraceCheckUtils]: 95: Hoare triple {7580#false} assume !(~c~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,442 INFO L290 TraceCheckUtils]: 94: Hoare triple {7580#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7580#false} is VALID [2022-04-15 13:29:22,442 INFO L290 TraceCheckUtils]: 93: Hoare triple {7580#false} assume !(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,442 INFO L290 TraceCheckUtils]: 92: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,442 INFO L290 TraceCheckUtils]: 91: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,442 INFO L290 TraceCheckUtils]: 90: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,442 INFO L290 TraceCheckUtils]: 89: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,442 INFO L290 TraceCheckUtils]: 88: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,442 INFO L290 TraceCheckUtils]: 87: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,442 INFO L290 TraceCheckUtils]: 86: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,442 INFO L290 TraceCheckUtils]: 85: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,442 INFO L290 TraceCheckUtils]: 84: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,442 INFO L290 TraceCheckUtils]: 83: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,442 INFO L290 TraceCheckUtils]: 82: Hoare triple {7580#false} assume !!(~c~0 < 6);~d~0 := 0; {7580#false} is VALID [2022-04-15 13:29:22,443 INFO L290 TraceCheckUtils]: 81: Hoare triple {7580#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7580#false} is VALID [2022-04-15 13:29:22,443 INFO L290 TraceCheckUtils]: 80: Hoare triple {7580#false} assume !(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,443 INFO L290 TraceCheckUtils]: 79: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,443 INFO L290 TraceCheckUtils]: 78: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,443 INFO L290 TraceCheckUtils]: 77: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,443 INFO L290 TraceCheckUtils]: 76: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,443 INFO L290 TraceCheckUtils]: 75: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,443 INFO L290 TraceCheckUtils]: 74: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,443 INFO L290 TraceCheckUtils]: 73: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,443 INFO L290 TraceCheckUtils]: 72: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,443 INFO L290 TraceCheckUtils]: 71: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,443 INFO L290 TraceCheckUtils]: 70: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,443 INFO L290 TraceCheckUtils]: 69: Hoare triple {7580#false} assume !!(~c~0 < 6);~d~0 := 0; {7580#false} is VALID [2022-04-15 13:29:22,443 INFO L290 TraceCheckUtils]: 68: Hoare triple {7580#false} assume !!(~b~0 < 6);~c~0 := 0; {7580#false} is VALID [2022-04-15 13:29:22,443 INFO L290 TraceCheckUtils]: 67: Hoare triple {7580#false} assume !!(~a~0 < 6);~b~0 := 0; {7580#false} is VALID [2022-04-15 13:29:22,443 INFO L290 TraceCheckUtils]: 66: Hoare triple {7580#false} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {7580#false} is VALID [2022-04-15 13:29:22,443 INFO L290 TraceCheckUtils]: 65: Hoare triple {7580#false} assume !(~b~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,444 INFO L290 TraceCheckUtils]: 64: Hoare triple {7580#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7580#false} is VALID [2022-04-15 13:29:22,444 INFO L290 TraceCheckUtils]: 63: Hoare triple {7580#false} assume !(~c~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,444 INFO L290 TraceCheckUtils]: 62: Hoare triple {7580#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7580#false} is VALID [2022-04-15 13:29:22,444 INFO L290 TraceCheckUtils]: 61: Hoare triple {7580#false} assume !(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,444 INFO L290 TraceCheckUtils]: 60: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,444 INFO L290 TraceCheckUtils]: 59: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,444 INFO L290 TraceCheckUtils]: 58: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,444 INFO L290 TraceCheckUtils]: 57: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,444 INFO L290 TraceCheckUtils]: 56: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,444 INFO L290 TraceCheckUtils]: 55: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,444 INFO L290 TraceCheckUtils]: 54: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,444 INFO L290 TraceCheckUtils]: 53: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,444 INFO L290 TraceCheckUtils]: 52: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,444 INFO L290 TraceCheckUtils]: 51: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,444 INFO L290 TraceCheckUtils]: 50: Hoare triple {7580#false} assume !!(~c~0 < 6);~d~0 := 0; {7580#false} is VALID [2022-04-15 13:29:22,444 INFO L290 TraceCheckUtils]: 49: Hoare triple {7580#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7580#false} is VALID [2022-04-15 13:29:22,444 INFO L290 TraceCheckUtils]: 48: Hoare triple {7580#false} assume !(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,444 INFO L290 TraceCheckUtils]: 47: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,445 INFO L290 TraceCheckUtils]: 46: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,445 INFO L290 TraceCheckUtils]: 45: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,445 INFO L290 TraceCheckUtils]: 44: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,445 INFO L290 TraceCheckUtils]: 43: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,445 INFO L290 TraceCheckUtils]: 42: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,445 INFO L290 TraceCheckUtils]: 41: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,445 INFO L290 TraceCheckUtils]: 40: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,445 INFO L290 TraceCheckUtils]: 39: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,445 INFO L290 TraceCheckUtils]: 38: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,445 INFO L290 TraceCheckUtils]: 37: Hoare triple {7580#false} assume !!(~c~0 < 6);~d~0 := 0; {7580#false} is VALID [2022-04-15 13:29:22,445 INFO L290 TraceCheckUtils]: 36: Hoare triple {7580#false} assume !!(~b~0 < 6);~c~0 := 0; {7580#false} is VALID [2022-04-15 13:29:22,445 INFO L290 TraceCheckUtils]: 35: Hoare triple {7580#false} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {7580#false} is VALID [2022-04-15 13:29:22,445 INFO L290 TraceCheckUtils]: 34: Hoare triple {7580#false} assume !(~c~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,445 INFO L290 TraceCheckUtils]: 33: Hoare triple {7580#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7580#false} is VALID [2022-04-15 13:29:22,445 INFO L290 TraceCheckUtils]: 32: Hoare triple {7580#false} assume !(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,445 INFO L290 TraceCheckUtils]: 31: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,445 INFO L290 TraceCheckUtils]: 30: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,445 INFO L290 TraceCheckUtils]: 29: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,446 INFO L290 TraceCheckUtils]: 28: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,446 INFO L290 TraceCheckUtils]: 27: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,446 INFO L290 TraceCheckUtils]: 26: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,446 INFO L290 TraceCheckUtils]: 25: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,446 INFO L290 TraceCheckUtils]: 24: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,446 INFO L290 TraceCheckUtils]: 23: Hoare triple {7580#false} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7580#false} is VALID [2022-04-15 13:29:22,446 INFO L290 TraceCheckUtils]: 22: Hoare triple {7580#false} assume !!(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,446 INFO L290 TraceCheckUtils]: 21: Hoare triple {7580#false} assume !!(~c~0 < 6);~d~0 := 0; {7580#false} is VALID [2022-04-15 13:29:22,446 INFO L290 TraceCheckUtils]: 20: Hoare triple {7580#false} #t~pre6 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre6; {7580#false} is VALID [2022-04-15 13:29:22,446 INFO L290 TraceCheckUtils]: 19: Hoare triple {7589#(<= main_~d~0 5)} assume !(~d~0 < 6); {7580#false} is VALID [2022-04-15 13:29:22,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {7588#(<= main_~d~0 4)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7589#(<= main_~d~0 5)} is VALID [2022-04-15 13:29:22,447 INFO L290 TraceCheckUtils]: 17: Hoare triple {7588#(<= main_~d~0 4)} assume !!(~d~0 < 6); {7588#(<= main_~d~0 4)} is VALID [2022-04-15 13:29:22,447 INFO L290 TraceCheckUtils]: 16: Hoare triple {7587#(<= main_~d~0 3)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7588#(<= main_~d~0 4)} is VALID [2022-04-15 13:29:22,448 INFO L290 TraceCheckUtils]: 15: Hoare triple {7587#(<= main_~d~0 3)} assume !!(~d~0 < 6); {7587#(<= main_~d~0 3)} is VALID [2022-04-15 13:29:22,448 INFO L290 TraceCheckUtils]: 14: Hoare triple {7586#(<= main_~d~0 2)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7587#(<= main_~d~0 3)} is VALID [2022-04-15 13:29:22,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {7586#(<= main_~d~0 2)} assume !!(~d~0 < 6); {7586#(<= main_~d~0 2)} is VALID [2022-04-15 13:29:22,449 INFO L290 TraceCheckUtils]: 12: Hoare triple {7585#(<= main_~d~0 1)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7586#(<= main_~d~0 2)} is VALID [2022-04-15 13:29:22,449 INFO L290 TraceCheckUtils]: 11: Hoare triple {7585#(<= main_~d~0 1)} assume !!(~d~0 < 6); {7585#(<= main_~d~0 1)} is VALID [2022-04-15 13:29:22,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {7618#(<= main_~d~0 0)} #t~pre7 := 1 + ~d~0;~d~0 := 1 + ~d~0;havoc #t~pre7; {7585#(<= main_~d~0 1)} is VALID [2022-04-15 13:29:22,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {7618#(<= main_~d~0 0)} assume !!(~d~0 < 6); {7618#(<= main_~d~0 0)} is VALID [2022-04-15 13:29:22,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {7579#true} assume !!(~c~0 < 6);~d~0 := 0; {7618#(<= main_~d~0 0)} is VALID [2022-04-15 13:29:22,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {7579#true} assume !!(~b~0 < 6);~c~0 := 0; {7579#true} is VALID [2022-04-15 13:29:22,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {7579#true} assume !!(~a~0 < 6);~b~0 := 0; {7579#true} is VALID [2022-04-15 13:29:22,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {7579#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {7579#true} is VALID [2022-04-15 13:29:22,450 INFO L272 TraceCheckUtils]: 4: Hoare triple {7579#true} call #t~ret8 := main(); {7579#true} is VALID [2022-04-15 13:29:22,450 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7579#true} {7579#true} #68#return; {7579#true} is VALID [2022-04-15 13:29:22,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {7579#true} assume true; {7579#true} is VALID [2022-04-15 13:29:22,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {7579#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); {7579#true} is VALID [2022-04-15 13:29:22,450 INFO L272 TraceCheckUtils]: 0: Hoare triple {7579#true} call ULTIMATE.init(); {7579#true} is VALID [2022-04-15 13:29:22,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2027 backedges. 445 proven. 25 refuted. 0 times theorem prover too weak. 1557 trivial. 0 not checked. [2022-04-15 13:29:22,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644661409] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:29:22,451 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:29:22,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 10 [2022-04-15 13:29:22,451 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:29:22,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2040975743] [2022-04-15 13:29:22,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2040975743] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:29:22,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:29:22,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 13:29:22,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029276955] [2022-04-15 13:29:22,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:29:22,452 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 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 131 [2022-04-15 13:29:22,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:29:22,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 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-15 13:29:22,470 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-15 13:29:22,470 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 13:29:22,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:29:22,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 13:29:22,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:29:22,470 INFO L87 Difference]: Start difference. First operand 132 states and 146 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 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-15 13:29:22,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:29:22,731 INFO L93 Difference]: Finished difference Result 260 states and 295 transitions. [2022-04-15 13:29:22,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 13:29:22,731 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 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 131 [2022-04-15 13:29:22,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:29:22,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 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-15 13:29:22,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2022-04-15 13:29:22,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 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-15 13:29:22,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2022-04-15 13:29:22,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 46 transitions. [2022-04-15 13:29:22,769 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-15 13:29:22,771 INFO L225 Difference]: With dead ends: 260 [2022-04-15 13:29:22,771 INFO L226 Difference]: Without dead ends: 148 [2022-04-15 13:29:22,772 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 262 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-15 13:29:22,772 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 26 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:29:22,772 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 30 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:29:22,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-04-15 13:29:22,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-04-15 13:29:22,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:29:22,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand has 148 states, 144 states have (on average 1.1041666666666667) internal successors, (159), 144 states have internal predecessors, (159), 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-15 13:29:22,921 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand has 148 states, 144 states have (on average 1.1041666666666667) internal successors, (159), 144 states have internal predecessors, (159), 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-15 13:29:22,921 INFO L87 Difference]: Start difference. First operand 148 states. Second operand has 148 states, 144 states have (on average 1.1041666666666667) internal successors, (159), 144 states have internal predecessors, (159), 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-15 13:29:22,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:29:22,924 INFO L93 Difference]: Finished difference Result 148 states and 162 transitions. [2022-04-15 13:29:22,924 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 162 transitions. [2022-04-15 13:29:22,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:29:22,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:29:22,924 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 144 states have (on average 1.1041666666666667) internal successors, (159), 144 states have internal predecessors, (159), 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 148 states. [2022-04-15 13:29:22,925 INFO L87 Difference]: Start difference. First operand has 148 states, 144 states have (on average 1.1041666666666667) internal successors, (159), 144 states have internal predecessors, (159), 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 148 states. [2022-04-15 13:29:22,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:29:22,926 INFO L93 Difference]: Finished difference Result 148 states and 162 transitions. [2022-04-15 13:29:22,926 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 162 transitions. [2022-04-15 13:29:22,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:29:22,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:29:22,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:29:22,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:29:22,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 144 states have (on average 1.1041666666666667) internal successors, (159), 144 states have internal predecessors, (159), 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-15 13:29:22,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 162 transitions. [2022-04-15 13:29:22,929 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 162 transitions. Word has length 131 [2022-04-15 13:29:22,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:29:22,929 INFO L478 AbstractCegarLoop]: Abstraction has 148 states and 162 transitions. [2022-04-15 13:29:22,929 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 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-15 13:29:22,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 162 transitions. [2022-04-15 13:29:23,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:29:23,091 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 162 transitions. [2022-04-15 13:29:23,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-04-15 13:29:23,092 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:29:23,093 INFO L499 BasicCegarLoop]: trace histogram [48, 48, 8, 8, 8, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:29:23,108 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-15 13:29:23,293 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22 [2022-04-15 13:29:23,293 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:29:23,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:29:23,294 INFO L85 PathProgramCache]: Analyzing trace with hash -2064892149, now seen corresponding path program 17 times [2022-04-15 13:29:23,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:29:23,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1920380753]